",
Short: "Build doc related commands",
}
- //mc.PersistentFlags().StringVar(&logicEndpoint, "endpoint", "localhost:5880", "endpoint of logic service")
+ // mc.PersistentFlags().StringVar(&logicEndpoint, "endpoint", "localhost:5880", "endpoint of logic service")
mc.AddCommand(
newBuildREADME(),
newBuildChapterTwo(),
@@ -84,7 +85,7 @@ func buildREADME() {
lpa m.LeetCodeProblemAll
info m.UserInfo
)
- // 请求所有题目信息
+ // Request all subject information
body := getProblemAllList()
problemsMap, optimizingIds := map[int]m.StatStatusPairs{}, []int{}
err := json.Unmarshal(body, &lpa)
@@ -92,9 +93,9 @@ func buildREADME() {
fmt.Println(err)
return
}
- //writeFile("leetcode_problem.json", body)
+ // writeFile("leetcode_problem.json", body)
- // 拼凑 README 需要渲染的数据
+ // Piece together the data that the README needs to render
problems = lpa.StatStatusPairs
info = m.ConvertUserInfoModel(lpa)
for _, v := range problems {
@@ -108,7 +109,7 @@ func buildREADME() {
omdrows := m.ConvertMdModelFromIds(problemsMap, optimizingIds)
sort.Sort(m.SortByQuestionID(omdrows))
- // 按照模板渲染 README
+ // Render the README according to the template
res, err := renderReadme("./template/template.markdown", len(solutionIds), try, m.Mdrows{Mdrows: mdrows}, m.Mdrows{Mdrows: omdrows}, info)
if err != nil {
fmt.Println(err)
@@ -116,7 +117,7 @@ func buildREADME() {
}
util.WriteFile("../README.md", res)
fmt.Println("write file successful")
- //makeReadmeFile(mds)
+ // makeReadmeFile(mds)
}
func renderReadme(filePath string, total, try int, mdrows, omdrows m.Mdrows, user m.UserInfo) ([]byte, error) {
@@ -142,7 +143,7 @@ func renderReadme(filePath string, total, try int, mdrows, omdrows m.Mdrows, use
output = append(output, []byte("\n")...)
} else if ok, _ := regexp.Match("{{.TotalNum}}", line); ok {
reg := regexp.MustCompile("{{.TotalNum}}")
- newByte := reg.ReplaceAll(line, []byte(fmt.Sprintf("以下已经收录了 %v 道题的题解，还有 %v 道题在尝试优化到 beats 100%%", total, try)))
+ newByte := reg.ReplaceAll(line, []byte(fmt.Sprintf("The solutions of %v questions have been collected below, and there are still %v questions trying to optimize to beats 100%%", total, try)))
output = append(output, newByte...)
output = append(output, []byte("\n")...)
} else if ok, _ := regexp.Match("{{.PersonalData}}", line); ok {
@@ -152,7 +153,7 @@ func renderReadme(filePath string, total, try int, mdrows, omdrows m.Mdrows, use
output = append(output, []byte("\n")...)
} else if ok, _ := regexp.Match("{{.OptimizingTable}}", line); ok {
reg := regexp.MustCompile("{{.OptimizingTable}}")
- newByte := reg.ReplaceAll(line, []byte(fmt.Sprintf("以下 %v 道题还需要优化到 100%% 的题目列表\n\n%v", (user.OptimizingEasy+user.OptimizingMedium+user.OptimizingHard), omdrows.AvailableTable())))
+ newByte := reg.ReplaceAll(line, []byte(fmt.Sprintf("The following %v questions still need to be optimized to 100%% of the list of questions\\n\\n%v", (user.OptimizingEasy+user.OptimizingMedium+user.OptimizingHard), omdrows.AvailableTable())))
output = append(output, newByte...)
output = append(output, []byte("\n")...)
} else {
@@ -162,9 +163,9 @@ func renderReadme(filePath string, total, try int, mdrows, omdrows m.Mdrows, use
}
}
-// internal: true 渲染的链接都是 hugo 内部链接，用户生成 hugo web
+// internal: true The rendered links are Hugo internal links, user generated hugo web
//
-// false 渲染的链接是外部 HTTPS 链接，用于生成 PDF
+// false The rendered link is an external HTTPS link, used to generate the PDF
func buildChapterTwo(internal bool) {
var (
gr m.GraphQLResp
@@ -188,8 +189,8 @@ func buildChapterTwo(internal bool) {
fmt.Printf("err = %v\n", err)
}
tls := m.GenerateTagMdRows(solutionIds, tl, mdrows, internal)
- //fmt.Printf("tls = %v\n", tls)
- // 按照模板渲染 README
+ // fmt.Printf("tls = %v\n", tls)
+ // Render the README according to the template
res, err := renderChapterTwo(fmt.Sprintf("./template/%v.md", chapterTwoFileName[index]), m.TagLists{TagLists: tls})
if err != nil {
fmt.Println(err)
@@ -224,7 +225,7 @@ func loadMetaData(filePath string) (map[int]m.TagList, error) {
}
s := strings.Split(string(line), "|")
v, _ := strconv.Atoi(strings.Split(s[1], ".")[0])
- // v[0] 是题号，s[4] time, s[5] space, s[6] favorite
+ // v[0] is the question number, s[4] time, s[5] space, s[6] favorite
metaMap[v] = m.TagList{
FrontendQuestionID: int32(v),
Acceptance: "",
@@ -266,7 +267,7 @@ func renderChapterTwo(filePath string, tls m.TagLists) ([]byte, error) {
func buildBookMenu() {
copyLackFile()
- // 按照模板重新渲染 Menu
+ // Re-render the Menu according to the template
res, err := renderBookMenu("./template/menu.md")
if err != nil {
fmt.Println(err)
@@ -276,7 +277,7 @@ func buildBookMenu() {
fmt.Println("generate Menu successful")
}
-// 拷贝 leetcode 目录下的题解 README 文件至第四章对应文件夹中
+// Copy the solution README file in the leetcode directory to the corresponding folder in Chapter 4
func copyLackFile() {
solutionIds, soName, _ := util.LoadSolutionsDir()
_, ch4Ids := util.LoadChapterFourDir()
@@ -288,7 +289,7 @@ func copyLackFile() {
}
}
if len(needCopy) > 0 {
- fmt.Printf("有 %v 道题需要拷贝到第四章中\n", len(needCopy))
+ fmt.Printf("There are %v questions that need to be copied to Chapter 4\n", len(needCopy))
for i := 0; i < len(needCopy); i++ {
if needCopy[i][4] == '.' {
tmp, err := strconv.Atoi(needCopy[i][:4])
@@ -304,7 +305,7 @@ func copyLackFile() {
}
}
} else {
- fmt.Printf("【第四章没有需要添加的题解，已经完整了】\n")
+ fmt.Printf(" [Chapter 4 has no problem solutions that need to be added, it is already complete] \n")
}
}
diff --git a/ctl/request.go b/ctl/request.go
index 8222a1fc0..e87937410 100644
--- a/ctl/request.go
+++ b/ctl/request.go
@@ -5,10 +5,13 @@ import (
"fmt"
"io/ioutil"
"net/http"
+ "os"
"github.com/mozillazg/request"
)
+var debug = true
+
const (
// AllProblemURL define
AllProblemURL = "https://leetcode.com/api/problems/all/"
@@ -75,7 +78,13 @@ type Variables struct {
slug string
}
-func getQraphql(payload string) []byte {
+func getQraphql(payload, tag string) []byte {
+ data, err := os.ReadFile(fmt.Sprintf("../tmp/%s-graphql.json", tag))
+ // if our program was unable to read the file
+ // print out the reason why it can't
+ if err == nil {
+ return data
+ }
req := newReq()
resp, err := req.PostForm(QraphqlURL, bytes.NewBuffer([]byte(payload)))
if err != nil {
@@ -92,6 +101,10 @@ func getQraphql(payload string) []byte {
if resp.StatusCode == 200 {
fmt.Println("Get problem Success!")
}
+
+ if err := os.WriteFile(fmt.Sprintf("../tmp/%s-graphql.json", tag), body, 0666); err != nil {
+ fmt.Printf("getRaw: Write to temp Error: " + err.Error())
+ }
return body
}
@@ -106,5 +119,5 @@ func getTopicTag(variable string) string {
}
func getTagProblemList(tag string) []byte {
- return getQraphql(getTopicTag(tag))
+ return getQraphql(getTopicTag(tag), tag)
}
diff --git a/ctl/template/Backtracking.md b/ctl/template/Backtracking.md
index fe1a54e6b..ba9755093 100644
--- a/ctl/template/Backtracking.md
+++ b/ctl/template/Backtracking.md
@@ -8,16 +8,16 @@ weight: 8
-- 排列问题 Permutations。第 46 题，第 47 题。第 60 题，第 526 题，第 996 题。
-- 组合问题 Combination。第 39 题，第 40 题，第 77 题，第 216 题。
-- 排列和组合杂交问题。第 1079 题。
-- N 皇后终极解法(二进制解法)。第 51 题，第 52 题。
-- 数独问题。第 37 题。
-- 四个方向搜索。第 79 题，第 212 题，第 980 题。
-- 子集合问题。第 78 题，第 90 题。
-- Trie。第 208 题，第 211 题。
-- BFS 优化。第 126 题，第 127 题。
-- DFS 模板。(只是一个例子，不对应任何题)
+- Permutations of permutation questions. Question 46, question 47. Question 60, Question 526, Question 996.
+- Combination question Combination. Question 39, Question 40, Question 77, Question 216.
+- Permutation and combination hybridization problems. Question 1079.
+- N queens ultimate solution (binary solution). Question 51, question 52.
+- Sudoku problems. Question 37.
+- Search in four directions. Question 79, Question 212, Question 980.
+- Subcollection issues. Question 78, question 90.
+- Trie. Question 208, question 211.
+- BFS optimization. Question 126, question 127.
+- DFS templates. (just an example, does not correspond to any question)
```go
func combinationSum2(candidates []int, target int) [][]int {
@@ -38,7 +38,7 @@ func findcombinationSum2(nums []int, target, index int, c []int, res *[][]int) {
return
}
for i := index; i < len(nums); i++ {
- if i > index && nums[i] == nums[i-1] { // 这里是去重的关键逻辑
+ if i > index && nums[i] == nums[i-1] { //Here is the key logic for deduplication
continue
}
if target >= nums[i] {
@@ -49,7 +49,7 @@ func findcombinationSum2(nums []int, target, index int, c []int, res *[][]int) {
}
}
```
-- BFS 模板。(只是一个例子，不对应任何题)
+- BFS template. (just an example, does not correspond to any question)
```go
func updateMatrix_BFS(matrix [][]int) [][]int {
diff --git a/ctl/template/Binary_Search.md b/ctl/template/Binary_Search.md
index e7a5de3de..af2a6c9df 100644
--- a/ctl/template/Binary_Search.md
+++ b/ctl/template/Binary_Search.md
@@ -6,10 +6,10 @@ weight: 11
# Binary Search
-- 二分搜索的经典写法。需要注意的三点：
- 1. 循环退出条件，注意是 low <= high，而不是 low < high。
- 2. mid 的取值，mid := low + (high-low)>>1
- 3. low 和 high 的更新。low = mid + 1，high = mid - 1。
+- The classic way of writing binary search. Three points to note:
+1. Loop exit condition, note that low <= high, not low < high.
+2. The value of mid, mid := low + (high-low)>>1
+3. Update of low and high. low = mid + 1, high = mid -1.
```go
func binarySearchMatrix(nums []int, target int) int {
@@ -28,14 +28,14 @@ func binarySearchMatrix(nums []int, target int) int {
}
```
-- 二分搜索的变种写法。有 4 个基本变种:
- 1. 查找第一个与 target 相等的元素，时间复杂度 O(logn)
- 2. 查找最后一个与 target 相等的元素，时间复杂度 O(logn)
- 3. 查找第一个大于等于 target 的元素，时间复杂度 O(logn)
- 4. 查找最后一个小于等于 target 的元素，时间复杂度 O(logn)
+- A variant of binary search. There are 4 basic variants:
+1. Find the first element equal to target, time complexity O(logn)
+2. Find the last element equal to target, time complexity O(logn)
+3. Find the first element greater than or equal to target, time complexity O(logn)
+4. Find the last element less than or equal to target, time complexity O(logn)
```go
-// 二分查找第一个与 target 相等的元素，时间复杂度 O(logn)
+// Binary search for the first element equal to target, time complexity O(logn)
func searchFirstEqualElement(nums []int, target int) int {
low, high := 0, len(nums)-1
for low <= high {
@@ -45,7 +45,7 @@ func searchFirstEqualElement(nums []int, target int) int {
} else if nums[mid] < target {
low = mid + 1
} else {
- if (mid == 0) || (nums[mid-1] != target) { // 找到第一个与 target 相等的元素
+ if (mid == 0) || (nums[mid-1] != target) { //Find the first element equal to target
return mid
}
high = mid - 1
@@ -54,7 +54,7 @@ func searchFirstEqualElement(nums []int, target int) int {
return -1
}
-// 二分查找最后一个与 target 相等的元素，时间复杂度 O(logn)
+// Binary search for the last element equal to target, time complexity O(logn)
func searchLastEqualElement(nums []int, target int) int {
low, high := 0, len(nums)-1
for low <= high {
@@ -64,7 +64,7 @@ func searchLastEqualElement(nums []int, target int) int {
} else if nums[mid] < target {
low = mid + 1
} else {
- if (mid == len(nums)-1) || (nums[mid+1] != target) { // 找到最后一个与 target 相等的元素
+ if (mid == len(nums)-1) || (nums[mid+1] != target) { // finds the last element equal to target
return mid
}
low = mid + 1
@@ -73,13 +73,13 @@ func searchLastEqualElement(nums []int, target int) int {
return -1
}
-// 二分查找第一个大于等于 target 的元素，时间复杂度 O(logn)
+// Binary search for the first element greater than or equal to target, time complexity O(logn)
func searchFirstGreaterElement(nums []int, target int) int {
low, high := 0, len(nums)-1
for low <= high {
mid := low + ((high - low) >> 1)
if nums[mid] >= target {
- if (mid == 0) || (nums[mid-1] < target) { // 找到第一个大于等于 target 的元素
+ if (mid == 0) || (nums[mid-1] < target) { // finds the first element greater than or equal to target
return mid
}
high = mid - 1
@@ -90,13 +90,13 @@ func searchFirstGreaterElement(nums []int, target int) int {
return -1
}
-// 二分查找最后一个小于等于 target 的元素，时间复杂度 O(logn)
+// Binary search for the last element less than or equal to target, time complexity O(logn)
func searchLastLessElement(nums []int, target int) int {
low, high := 0, len(nums)-1
for low <= high {
mid := low + ((high - low) >> 1)
if nums[mid] <= target {
- if (mid == len(nums)-1) || (nums[mid+1] > target) { // 找到最后一个小于等于 target 的元素
+ if (mid == len(nums)-1) || (nums[mid+1] > target) { // finds the last element less than or equal to target
return mid
}
low = mid + 1
@@ -108,14 +108,14 @@ func searchLastLessElement(nums []int, target int) int {
}
```
-- 在基本有序的数组中用二分搜索。经典解法可以解，变种写法也可以写，常见的题型，在山峰数组中找山峰，在旋转有序数组中找分界点。第 33 题，第 81 题，第 153 题，第 154 题，第 162 题，第 852 题
+- Use binary search in basically sorted arrays. The classic solution can be solved, and the variant writing method can also be written. The common question type is to find the peak in the peak array and find the dividing point in the rotated ordered array. Question 33, Question 81, Question 153, Question 154, Question 162, Question 852
```go
func peakIndexInMountainArray(A []int) int {
low, high := 0, len(A)-1
for low < high {
mid := low + (high-low)>>1
- // 如果 mid 较大，则左侧存在峰值，high = m，如果 mid + 1 较大，则右侧存在峰值，low = mid + 1
+ // If mid is large, there is a peak on the left, high = m, if mid + 1 is large, there is a peak on the right, low = mid + 1
if A[mid] > A[mid+1] {
high = mid
} else {
@@ -126,7 +126,7 @@ func peakIndexInMountainArray(A []int) int {
}
```
-- max-min 最大值最小化问题。求在最小满足条件的情况下的最大值。第 410 题，第 875 题，第 1011 题，第 1283 题。
+- max-min Maximum minimization problem. Find the maximum value if the minimum condition is met. Question 410, Question 875, Question 1011, Question 1283.
{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Bit_Manipulation.md b/ctl/template/Bit_Manipulation.md
index 6c643994a..3e2b1fc44 100644
--- a/ctl/template/Bit_Manipulation.md
+++ b/ctl/template/Bit_Manipulation.md
@@ -8,35 +8,34 @@ weight: 15
-- 异或的特性。第 136 题，第 268 题，第 389 题，第 421 题，
+-XOR property. Question 136, Question 268, Question 389, Question 421,
```go
x ^ 0 = x
x ^ 11111……1111 = ~x
x ^ (~x) = 11111……1111
x ^ x = 0
-a ^ b = c => a ^ c = b => b ^ c = a (交换律)
-a ^ b ^ c = a ^ (b ^ c) = (a ^ b）^ c (结合律)
+a ^ b = c => a ^ c = b => b ^ c = a (commutative law)
+a ^ b ^ c = a ^ (b ^ c) = (a ^ b）^ c (associative law)
```
-- 构造特殊 Mask，将特殊位置放 0 或 1。
+-Construct a special Mask, put 0 or 1 in the special position.
```go
-将 x 最右边的 n 位清零， x & ( ~0 << n )
-获取 x 的第 n 位值(0 或者 1)，(x >> n) & 1
-获取 x 的第 n 位的幂值，x & (1 << (n - 1))
-仅将第 n 位置为 1，x | (1 << n)
-仅将第 n 位置为 0，x & (~(1 << n))
-将 x 最高位至第 n 位(含)清零，x & ((1 << n) - 1)
-将第 n 位至第 0 位(含)清零，x & (~((1 << (n + 1)) - 1)）
+Clear the rightmost n bits of x to zero, x & ( ~0 << n )
+Get the nth bit value of x (0 or 1)，(x >> n) & 1
+Get the power of the nth bit of x, x & (1 << (n -1))
+Set only the nth position to 1, x | (1 << n)
+Set only the nth position to 0, x & (~(1 << n))
+Clear the most significant bit of x to the nth bit (inclusive), x & ((1 << n) -1)
+Clear bits n through 0, inclusive, x & (~((1 << (n + 1)) -1))
```
-
-- 有特殊意义的 & 位操作运算。第 260 题，第 201 题，第 318 题，第 371 题，第 397 题，第 461 题，第 693 题，
+- The & bitwise operation has a special meaning. Question 260, Question 201, Question 318, Question 371, Question 397, Question 461, Question 693,
```go
-X & 1 == 1 判断是否是奇数(偶数)
-X & = (X - 1) 将最低位(LSB)的 1 清零
-X & -X 得到最低位(LSB)的 1
+X & 1 == 1 to determine whether it is an odd number (even number)
+X & = (X -1) clears the least significant bit (LSB) of 1
+X & -X get the least significant bit (LSB) of 1
X & ~X = 0
```
diff --git a/ctl/template/Linked_List.md b/ctl/template/Linked_List.md
index b8673cc39..3f607d263 100644
--- a/ctl/template/Linked_List.md
+++ b/ctl/template/Linked_List.md
@@ -8,17 +8,13 @@ weight: 4
-
-- 巧妙的构造虚拟头结点。可以使遍历处理逻辑更加统一。
-- 灵活使用递归。构造递归条件，使用递归可以巧妙的解题。不过需要注意有些题目不能使用递归，因为递归深度太深会导致超时和栈溢出。
-- 链表区间逆序。第 92 题。
-- 链表寻找中间节点。第 876 题。链表寻找倒数第 n 个节点。第 19 题。只需要一次遍历就可以得到答案。
-- 合并 K 个有序链表。第 21 题，第 23 题。
-- 链表归类。第 86 题，第 328 题。
-- 链表排序，时间复杂度要求 O(n * log n)，空间复杂度 O(1)。只有一种做法，归并排序，至顶向下归并。第 148 题。
-- 判断链表是否存在环，如果有环，输出环的交叉点的下标；判断 2 个链表是否有交叉点，如果有交叉点，输出交叉点。第 141 题，第 142 题，第 160 题。
-
-
-
-
-{{.AvailableTagTable}}
\ No newline at end of file
+- Clever construction of virtual head nodes. The traversal processing logic can be made more unified.
+- Flexible use of recursion. Construct recursive conditions, and use recursion to solve problems cleverly. However, it should be noted that some topics cannot use recursion, because too deep recursion will cause timeout and stack overflow.
+- The reverse order of the range of the linked list. Question 92.
+- The linked list finds the middle node. Question 876. The linked list finds the nth last node. Question 19. It only takes one traversal to get the answer.
+- Merge K ordered linked lists. Question 21, question 23.
+- Linked list sorting. Question 86, question 328.
+- Linked list sorting requires O(n \*log n) time complexity and O(1) space complexity. There is only one method, merge sort, and merge from top to bottom. Question 148.
+- Judging whether there is a ring in the linked list, if there is a ring, output the subscript of the intersection point of the ring; judge whether there is an intersection point in the two linked lists, and output the intersection point if there is an intersection point. Question 141, question 142, question 160.
+
+{{.AvailableTagTable}}
diff --git a/ctl/template/Segment_Tree.md b/ctl/template/Segment_Tree.md
index 220ac679e..86afcc71d 100644
--- a/ctl/template/Segment_Tree.md
+++ b/ctl/template/Segment_Tree.md
@@ -7,32 +7,29 @@ weight: 18
# Segment Tree
-
-- 线段树的经典数组实现写法。将合并两个节点 pushUp 逻辑抽象出来了，可以实现任意操作(常见的操作有：加法，取 max，min 等等)。第 218 题，第 303 题，第 307 题，第 699 题。
-- 计数线段树的经典写法。第 315 题，第 327 题，第 493 题。
-- 线段树的树的实现写法。第 715 题，第 732 题。
-- 区间懒惰更新。第 218 题，第 699 题。
-- 离散化。离散化需要注意一个特殊情况：假如三个区间为 [1,10] [1,4] [6,10]，离散化后 x[1]=1,x[2]=4,x[3]=6,x[4]=10。第一个区间为 [1,4]，第二个区间为 [1,2]，第三个区间为 [3,4]，这样一来，区间一 = 区间二 + 区间三，这和离散前的模型不符，离散前，很明显，区间一 > 区间二 + 区间三。正确的做法是：在相差大于 1 的数间加一个数，例如在上面 1 4 6 10 中间加 5，即可 x[1]=1,x[2]=4,x[3]=5,x[4]=6,x[5]=10。这样处理之后，区间一是 1-5 ，区间二是 1-2 ，区间三是 4-5 。
-- 灵活构建线段树。线段树节点可以存储多条信息，合并两个节点的 pushUp 操作也可以是多样的。第 850 题，第 1157 题。
-
-
-线段树[题型](https://blog.csdn.net/xuechelingxiao/article/details/38313105)从简单到困难:
-
-1. 单点更新:
- [HDU 1166 敌兵布阵](http://acm.hdu.edu.cn/showproblem.php?pid=1166) update:单点增减 query:区间求和
- [HDU 1754 I Hate It](http://acm.hdu.edu.cn/showproblem.php?pid=1754) update:单点替换 query:区间最值
- [HDU 1394 Minimum Inversion Number](http://acm.hdu.edu.cn/showproblem.php?pid=1394) update:单点增减 query:区间求和
- [HDU 2795 Billboard](http://acm.hdu.edu.cn/showproblem.php?pid=2795) query:区间求最大值的位子(直接把update的操作在query里做了)
-2. 区间更新:
- [HDU 1698 Just a Hook](http://acm.hdu.edu.cn/showproblem.php?pid=1698) update:成段替换 (由于只query一次总区间,所以可以直接输出 1 结点的信息)
- [POJ 3468 A Simple Problem with Integers](http://poj.org/problem?id=3468) update:成段增减 query:区间求和
- [POJ 2528 Mayor’s posters](http://poj.org/problem?id=2528) 离散化 + update:成段替换 query:简单hash
- [POJ 3225 Help with Intervals](http://poj.org/problem?id=3225) update:成段替换,区间异或 query:简单hash
-3. 区间合并(这类题目会询问区间中满足条件的连续最长区间,所以PushUp的时候需要对左右儿子的区间进行合并):
- [POJ 3667 Hotel](http://poj.org/problem?id=3667) update:区间替换 query:询问满足条件的最左端点
-4. 扫描线(这类题目需要将一些操作排序,然后从左到右用一根扫描线扫过去最典型的就是矩形面积并,周长并等题):
- [HDU 1542 Atlantis](http://acm.hdu.edu.cn/showproblem.php?pid=1542) update:区间增减 query:直接取根节点的值
- [HDU 1828 Picture](http://acm.hdu.edu.cn/showproblem.php?pid=1828) update:区间增减 query:直接取根节点的值
-
-
+- The classic array implementation of the line segment tree. The pushUp logic of merging two nodes is abstracted, and any operation can be realized (common operations include: addition, max, min, etc.). Question 218, Question 303, Question 307, Question 699.
+- The classic way of counting line segment trees. Question 315, Question 327, Question 493.
+- The implementation of the tree of the line segment tree. Question 715, question 732.
+- Range lazy update. Question 218, question 699.
+- Discretization. Discretization needs to pay attention to a special case: if the three intervals are [1,10] [1,4] [6,10], after discretization x[1]=1,x[2]=4,x[3] =6,x[4]=10. The first interval is [1,4], the second interval is [1,2], and the third interval is [3,4]. In this way, interval one = interval two + interval three, which is the same as before discrete The model does not match. Before the discretization, it is obvious that interval 1 > interval 2 + interval 3. The correct way is: add a number between numbers with a difference greater than 1, for example, add 5 in the middle of 1 4 6 10 above, then x[1]=1, x[2]=4, x[3]=5, x[4]=6,x[5]=10. After this processing, interval one is 1-5, interval two is 1-2, and interval three is 4-5.
+- Flexible construction of segment trees. Line segment tree nodes can store multiple pieces of information, and the pushUp operation for merging two nodes can also be varied. Question 850, question 1157.
+
+
+Line segment tree [question type] (https://blog.csdn.net/xuechelingxiao/article/details/38313105) from simple to difficult:
+
+1. Single point update:
+[HDU 1166 Enemy Soldier Arrangement](http://acm.hdu.edu.cn/showproblem.php?pid=1166) update: single-point increase and decrease query: interval summation
+[HDU 1754 I Hate It](http://acm.hdu.edu.cn/showproblem.php?pid=1754) update: single point replacement query: maximum value of interval
+[HDU 1394 Minimum Inversion Number](http://acm.hdu.edu.cn/showproblem.php?pid=1394) update: single-point increase and decrease query: interval summation
+[HDU 2795 Billboard](http://acm.hdu.edu.cn/showproblem.php?pid=2795) query: find the position of the maximum value in the interval (directly do the update operation in the query)
+2. Interval update:
+[HDU 1698 Just a Hook](http://acm.hdu.edu.cn/showproblem.php?pid=1698) update: segment replacement (since the total interval is only queried once, the information of 1 node can be output directly )
+[POJ 3468 A Simple Problem with Integers](http://poj.org/problem?id=3468) update: Segment increase and decrease query: Interval summation
+[POJ 2528 Mayor’s posters](http://poj.org/problem?id=2528) discretization + update: segment replacement query: simple hash
+[POJ 3225 Help with Intervals](http://poj.org/problem?id=3225) update: segment replacement, interval XOR query: simple hash
+3. Interval merging (this type of question will ask the longest continuous interval that meets the conditions in the interval, so when PushUp needs to merge the intervals of the left and right sons):
+[POJ 3667 Hotel](http://poj.org/problem?id=3667) update: interval replacement query: query the leftmost endpoint that meets the condition
+4. Scanning line (this kind of question needs to sort some operations, and then use a scanning line to scan from left to right. The most typical one is rectangular area union, perimeter length union and other questions):
+[HDU 1542 Atlantis](http://acm.hdu.edu.cn/showproblem.php?pid=1542) update: Interval increase and decrease query: Take the value of the root node directly
+[HDU 1828 Picture](http://acm.hdu.edu.cn/showproblem.php?pid=1828) update: interval increase and decrease query: take the value of the root node directly
{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Sliding_Window.md b/ctl/template/Sliding_Window.md
index 117e50223..ff302cc27 100644
--- a/ctl/template/Sliding_Window.md
+++ b/ctl/template/Sliding_Window.md
@@ -8,7 +8,7 @@ weight: 17
-- 双指针滑动窗口的经典写法。右指针不断往右移，移动到不能往右移动为止(具体条件根据题目而定)。当右指针到最右边以后，开始挪动左指针，释放窗口左边界。第 3 题，第 76 题，第 209 题，第 424 题，第 438 题，第 567 题，第 713 题，第 763 题，第 845 题，第 881 题，第 904 题，第 978 题，第 992 题，第 1004 题，第 1040 题，第 1052 题。
+- The classic way of writing a two-pointer sliding window. The right pointer keeps moving to the right until it cannot move to the right (the specific conditions depend on the topic). When the right pointer reaches the far right, start to move the left pointer to release the left boundary of the window. Question 3, Question 76, Question 209, Question 424, Question 438, Question 567, Question 713, Question 763, Question 845, Question 881, Question 904, Question 978, Question 992 Question 1004, Question 1040, Question 1052.
```c
left, right := 0, -1
@@ -24,7 +24,7 @@ weight: 17
result = max(result, right-left+1)
}
```
-- 滑动窗口经典题。第 239 题，第 480 题。
+- Sliding window classic questions. Question 239, question 480.
{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Sorting.md b/ctl/template/Sorting.md
index 5038c03cf..2289f2763 100644
--- a/ctl/template/Sorting.md
+++ b/ctl/template/Sorting.md
@@ -8,12 +8,11 @@ weight: 14
-- 深刻的理解多路快排。第 75 题。
-- 链表的排序，插入排序(第 147 题)和归并排序(第 148 题)
-- 桶排序和基数排序。第 164 题。
-- "摆动排序"。第 324 题。
-- 两两不相邻的排序。第 767 题，第 1054 题。
-- "饼子排序"。第 969 题。
-
+- Deep understanding of multi-way quick sort. Question 75.
+- Sorting of linked lists, insertion sort (question 147) and merge sort (question 148)
+- Bucket sort and radix sort. Question 164.
+- "Swing Sort". Question 324.
+- Sorting that is not adjacent to each other. Question 767, question 1054.
+- "Sorting pancakes". Question 969.
{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Stack.md b/ctl/template/Stack.md
index 0cc1f39b6..58e37130e 100644
--- a/ctl/template/Stack.md
+++ b/ctl/template/Stack.md
@@ -8,10 +8,10 @@ weight: 5
-- 括号匹配问题及类似问题。第 20 题，第 921 题，第 1021 题。
-- 栈的基本 pop 和 push 操作。第 71 题，第 150 题，第 155 题，第 224 题，第 225 题，第 232 题，第 946 题，第 1047 题。
-- 利用栈进行编码问题。第 394 题，第 682 题，第 856 题，第 880 题。
-- **单调栈**。**利用栈维护一个单调递增或者递减的下标数组**。第 84 题，第 456 题，第 496 题，第 503 题，第 739 题，第 901 题，第 907 题，第 1019 题。
+- Bracket matching issues and similar. Question 20, question 921, question 1021.
+- Basic pop and push operations on the stack. Question 71, Question 150, Question 155, Question 224, Question 225, Question 232, Question 946, Question 1047.
+- Coding problems using the stack. Question 394, Question 682, Question 856, Question 880.
+- **Monotonic stack**. **Use the stack to maintain a monotonically increasing or decreasing subscript array**. Question 84, Question 456, Question 496, Question 503, Question 739, Question 901, Question 907, Question 1019.
diff --git a/ctl/template/Two_Pointers.md b/ctl/template/Two_Pointers.md
index e25406e0c..3b740c671 100644
--- a/ctl/template/Two_Pointers.md
+++ b/ctl/template/Two_Pointers.md
@@ -8,7 +8,7 @@ weight: 3
-- 双指针滑动窗口的经典写法。右指针不断往右移，移动到不能往右移动为止(具体条件根据题目而定)。当右指针到最右边以后，开始挪动左指针，释放窗口左边界。第 3 题，第 76 题，第 209 题，第 424 题，第 438 题，第 567 题，第 713 题，第 763 题，第 845 题，第 881 题，第 904 题，第 978 题，第 992 题，第 1004 题，第 1040 题，第 1052 题。
+- The classic way of writing a two-pointer sliding window. The right pointer keeps moving to the right until it cannot move to the right (the specific conditions depend on the topic). When the right pointer reaches the far right, start to move the left pointer to release the left boundary of the window. Question 3, Question 76, Question 209, Question 424, Question 438, Question 567, Question 713, Question 763, Question 845, Question 881, Question 904, Question 978, Question 992 Question 1004, Question 1040, Question 1052.
```c
left, right := 0, -1
@@ -25,9 +25,9 @@ weight: 3
}
```
-- 快慢指针可以查找重复数字，时间复杂度 O(n)，第 287 题。
-- 替换字母以后，相同字母能出现连续最长的长度。第 424 题。
-- SUM 问题集。第 1 题，第 15 题，第 16 题，第 18 题，第 167 题，第 923 题，第 1074 题。
+- Fast and slow pointers can find repeated numbers, time complexity O(n), question 287.
+- After replacing letters, the same letter can appear for the longest length in a row. Question 424.
+- SUM problem sets. Question 1, Question 15, Question 16, Question 18, Question 167, Question 923, Question 1074.
{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/Union_Find.md b/ctl/template/Union_Find.md
index 0b23116ff..8ddaa5479 100644
--- a/ctl/template/Union_Find.md
+++ b/ctl/template/Union_Find.md
@@ -7,14 +7,12 @@ weight: 16
# Union Find
-
-- 灵活使用并查集的思想，熟练掌握并查集的[模板]({{< relref "/ChapterThree/UnionFind.md" >}})，模板中有两种并查集的实现方式，一种是路径压缩 + 秩优化的版本，另外一种是计算每个集合中元素的个数 + 最大集合元素个数的版本，这两种版本都有各自使用的地方。能使用第一类并查集模板的题目有：第 128 题，第 130 题，第 547 题，第 684 题，第 721 题，第 765 题，第 778 题，第 839 题，第 924 题，第 928 题，第 947 题，第 952 题，第 959 题，第 990 题。能使用第二类并查集模板的题目有：第 803 题，第 952 题。第 803 题秩优化和统计集合个数这些地方会卡时间，如果不优化，会 TLE。
-- 并查集是一种思想，有些题需要灵活使用这种思想，而不是死套模板，如第 399 题，这一题是 stringUnionFind，利用并查集思想实现的。这里每个节点是基于字符串和 map 的，而不是单纯的用 int 节点编号实现的。
-- 有些题死套模板反而做不出来，比如第 685 题，这一题不能路径压缩和秩优化，因为题目中涉及到有向图，需要知道节点的前驱节点，如果路径压缩了，这一题就没法做了。这一题不需要路径压缩和秩优化。
-- 灵活的抽象题目给的信息，将给定的信息合理的编号，使用并查集解题，并用 map 降低时间复杂度，如第 721 题，第 959 题。
-- 关于地图，砖块，网格的题目，可以新建一个特殊节点，将四周边缘的砖块或者网格都 union() 到这个特殊节点上。第 130 题，第 803 题。
-- 能用并查集的题目，一般也可以用 DFS 和 BFS 解答，只不过时间复杂度会高一点。
-
+- Use the idea of union search flexibly, master the [template]({{< relref "/ChapterThree/UnionFind.md" >}}) of union search, there are two ways to realize union search in the template, one It is the version of path compression + rank optimization, and the other is the version of calculating the number of elements in each set + the maximum number of elements in the set. These two versions have their respective uses. The questions that can use the first type of union search template are: question 128, question 130, question 547, question 684, question 721, question 765, question 778, question 839, question 924, question Question 928, Question 947, Question 952, Question 959, Question 990. The questions that can use the second type of union search template are: question 803 and question 952. Question 803 Rank optimization and the number of statistical collections will be time-consuming. If not optimized, it will be TLE.
+- Union search is an idea, some questions need to use this idea flexibly, instead of a dead set template, such as question 399, this question is stringUnionFind, which is realized by using the idea of union search. Each node here is based on strings and maps, rather than simply using int node numbers.
+- Some questions can’t be done with a dead set template, such as question 685. This question cannot be path compressed and rank optimized, because the question involves a directed graph, and it is necessary to know the predecessor node of the node. If the path is compressed, this question There is no way to do it. This question does not require path compression and rank optimization.
+- The information given by the flexible abstract topic, number the given information reasonably, use and search to solve the problem, and use map to reduce the time complexity, such as the 721st question and the 959th question.
+- Regarding the topic of maps, bricks, and grids, you can create a special node, and union() the bricks or grids around the edges to this special node. Question 130, question 803.
+- Questions that can be used for union search can generally be solved with DFS and BFS, but the time complexity will be higher.
{{.AvailableTagTable}}
\ No newline at end of file
diff --git a/ctl/template/template.markdown b/ctl/template/template.markdown
index c0b24343e..195ed5eb3 100644
--- a/ctl/template/template.markdown
+++ b/ctl/template/template.markdown
@@ -1,7 +1,23 @@
+# LeetCode in Go - English
-# LeetCode in Go
-[LeetCode Online Judge](https://leetcode.com/) is a website containing many **algorithm questions**. Most of them are real interview questions of **Google, Facebook, LinkedIn, Apple**, etc. and it always help to sharp our algorithm Skills. Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. This repo shows my solutions in Go with the code style strictly follows the [Google Golang Style Guide](https://github.com/golang/go/wiki/CodeReviewComments). Please feel free to reference and **STAR** to support this repo, thank you!
+### This repository is english version of [Leetcode-go](https://github.com/halfrost/LeetCode-Go).
+Thanks to original creator @halfrost for all the hard work and dedication.
+- Milestone
+ - [x] Translate english of main page
+ - [ ] Check and validate all internal pages with pdf generation
+ - [ ] Validate all links
+ - [ ] Multi-language support in single repository for PDF
+ - [ ] Adding more questions along with diagrams & pictures
+___
+
+
+[LeetCode Online Judge](https://leetcode.com/) is a website containing many **algorithm questions**. Most of them are
+real interview questions of **Google, Facebook, LinkedIn, Apple**, etc. and it always help to sharp our algorithm
+Skills. Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get
+prepared for your next interview. This repo shows my solutions in Go with the code style strictly follows
+the [Google Golang Style Guide](https://github.com/golang/go/wiki/CodeReviewComments). Please feel free to reference
+and **STAR** to support this repo, thank you!
@@ -35,20 +51,21 @@
-支持 Progressive Web Apps 和 Dark Mode 的题解电子书《LeetCode Cookbook》 Online Reading
+E-books that support Progressive Web Apps and Dark Mode《LeetCode Cookbook》 Online Reading
-离线版本的电子书《LeetCode Cookbook》PDF Download here
+Offline version of the e-book "LeetCode Cookbook" PDF
+Download here
-通过 iOS / Android 浏览器安装 PWA 版《LeetCode Cookbook》至设备桌面随时学习
+Install the PWA version of "LeetCode Cookbook" to the desktop of the device through the iOS /Android browser to learn at any time
@@ -56,110 +73,110 @@
-
## Data Structures
-> 标识了 ✅ 的专题是完成所有题目了的，没有标识的是还没有做完所有题目的
+> The topics marked with ✅ have completed all the topics, and those without the mark have not completed all the topics
-* [Array](#array)
-* [String](#string)
-* [✅ Two Pointers](#two-pointers)
-* [✅ Linked List](#linked-list)
-* [✅ Stack](#stack)
-* [Tree](#tree)
-* [Dynamic programming](#dynamic-programming)
-* [✅ Backtracking](#backtracking)
-* [Depth First Search](#depth-first-search)
-* [Breadth First Search](#breadth-first-search)
-* [Binary Search](#binary-search)
-* [Math](#math)
-* [Hash Table](#hash-table)
-* [✅ Sort](#sort)
-* [✅ Bit Manipulation](#bit-manipulation)
-* [✅ Union Find](#union-find)
-* [✅ Sliding Window](#sliding-window)
-* [✅ Segment Tree](#segment-tree)
-* [✅ Binary Indexed Tree](#binary-indexed-tree)
+- [LeetCode in Go - English](#leetcode-in-go---english)
+ - [This repository is english version of Leetcode-go.](#this-repository-is-english-version-of-leetcode-go)
+ - [Data Structures](#data-structures)
+ - [Algorithm](#algorithm)
+ - [LeetCode Problems](#leetcode-problems)
+ - [1. Personal data](#1-personal-data)
+ - [2. Directory](#2-directory)
+ - [3. Classification](#3-classification)
+ - [Array](#array)
+ - [String](#string)
+ - [Two Pointers](#two-pointers)
+ - [Linked List](#linked-list)
+ - [Stack](#stack)
+ - [Tree](#tree)
+ - [Dynamic Programming](#dynamic-programming)
+ - [Backtracking](#backtracking)
+ - [Depth First Search](#depth-first-search)
+ - [Breadth First Search](#breadth-first-search)
+ - [Binary Search](#binary-search)
+ - [Math](#math)
+ - [Hash Table](#hash-table)
+ - [Sort](#sort)
+ - [Bit Manipulation](#bit-manipulation)
+ - [Union Find](#union-find)
+ - [Sliding Window](#sliding-window)
+ - [Segment Tree](#segment-tree)
+ - [Binary Indexed Tree](#binary-indexed-tree)
+ - [♥️ Thanks](#️-thanks)
-| 数据结构 | 变种 | 相关题目 | 讲解文章 |
-|:-------:|:-------|:------|:------|
-|顺序线性表：向量||||
-|单链表|1. 双向链表
2. 静态链表
3. 对称矩阵
4. 稀疏矩阵|||
-|哈希表|1. 散列函数
2. 解决碰撞/填充因子
|||
-|栈和队列|1. 广义栈
2. 双端队列
|||
-|队列|1. 链表实现
2. 循环数组实现
3. 双端队列|||
-|字符串|1. KMP算法
2. 有限状态自动机
3. 模式匹配有限状态自动机
4. BM 模式匹配算法
5. BM-KMP 算法
6. BF 算法|||
-|树|1. 二叉树
2. 并查集
3. Huffman 树|||
-|数组实现的堆|1. 极大堆和极小堆
2. 极大极小堆
3. 双端堆
4. d 叉堆|||
-|树实现的堆|1. 左堆
2. 扁堆
3. 二项式堆
4. 斐波那契堆
5. 配对堆|||
-|查找|1. 哈希表
2. 跳跃表
3. 排序二叉树
4. AVL 树
5. B 树 / B+ 树 / B* 树
6. AA 树
7. 红黑树
8. 排序二叉堆
9. Splay 树
10. 双链树
11. Trie 树
12. R 树|||
-|--------------------------------------------|--------------------------------------------------------------------------------------------|---------------------------|-----------------------------------|
-
+| data structure | variant | related topics | Explanatory article |
+| :-------------------------------: | :---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | :------------- | :------------------ |
+| Sequential Linear Tables: Vectors | | | |
+| Single list | 1. Doubly linked list
2. Static linked list
3. Symmetric matrix
4. Sparse matrix | | |
+| hash table | 1. Hash functions
2. Solve collision/fill factor
| | |
+| Stack and Queue | 1. Generalized stack
2. Double-ended queue
| | |
+| Queue | 1. Linked list implementation
2. Circular array implementation
3. Double-ended queue | | |
+| String | 1. KMP Algorithm
2. Finite State Automata
3. Pattern Matching Finite State Automata
4. BM Pattern Matching Algorithm
5. BM-KMP Algorithm
6 .BF Algorithm | | |
+| Tree | 1. Binary tree
2. Union search
3. Huffman tree | | |
+| Array implemented heap | 1. Max heap and min heap
2. Max and min heap
3. Double-ended heap
4. d fork heap | | |
+| Heap implemented by tree | 1. Left heap
2. Flat heap
3. Binomial heap
4. Fibonacci heap
5. Pairing heap | | |
+| Lookup | 1. Hash table
2. Jump table
3. Sorted binary tree
4. AVL tree
5. B tree/B+ tree/B\*tree
6. AA tree
7. Red-black tree
8. Sorted binary heap
9. Splay tree
10. Double chain tree
11. Trie tree
12. R tree |
## Algorithm
-
-| 算法 | 具体类型 | 相关题目 | 讲解文章 |
-|:-------:|:-------|:------|:------|
-|排序算法|1. 冒泡排序
2. 插入排序
3. 选择排序
4. 希尔 Shell 排序
5. 快速排序
6. 归并排序
7. 堆排序
8. 线性排序算法
9. 自省排序
10. 间接排序
11. 计数排序
12. 基数排序
13. 桶排序
14. 外部排序 - k 路归并败者树
15. 外部排序 - 最佳归并树|||
-|递归与分治||1. 二分搜索/查找
2. 大整数的乘法
3. Strassen 矩阵乘法
4. 棋盘覆盖
5. 合并排序
6. 快速排序
7. 线性时间选择
8. 最接近点对问题
9. 循环赛日程表
||
-|动态规划||1. 矩阵连乘问题
2. 最长公共子序列
3. 最大子段和
4. 凸多边形最优三角剖分
5. 多边形游戏
6. 图像压缩
7. 电路布线
8. 流水作业调度
9. 0-1 背包问题/背包九讲
10. 最优二叉搜索树
11. 动态规划加速原理
12. 树型 DP
||
-|贪心||1. 活动安排问题
2. 最优装载
3. 哈夫曼编码
4. 单源最短路径
5. 最小生成树
6. 多机调度问题
||
-|回溯法||1. 装载问题
2. 批处理作业调度
3. 符号三角形问题
4. n 后问题
5. 0-1 背包问题
6. 最大团问题
7. 图的 m 着色问题
8. 旅行售货员问题
9. 圆排列问题
10. 电路板排列问题
11. 连续邮资问题
||
-|搜索|1. 枚举
2. DFS
3. BFS
4. 启发式搜索
|||
-|随机化|1. 随机数
2. 数值随机化算法
3. Sherwood 舍伍德算法
4. Las Vegas 拉斯维加斯算法
5. Monte Carlo 蒙特卡罗算法
|1. 计算 π 值
2. 计算定积分
3. 解非线性方程组
4. 线性时间选择算法
5. 跳跃表
6. n 后问题
7. 整数因子分解
8. 主元素问题
9. 素数测试
||
-|图论|1. 遍历 DFS / BFS
2. AOV / AOE 网络
3. Kruskal 算法(最小生成树)
4. Prim 算法(最小生成树)
5. Boruvka 算法(最小生成树)
6. Dijkstra 算法(单源最短路径)
7. Bellman-Ford 算法(单源最短路径)
8. SPFA 算法(单源最短路径)
9. Floyd 算法(多源最短路径)
10. Johnson 算法(多源最短路径)
11. Fleury 算法(欧拉回路)
12. Ford-Fulkerson 算法(最大网络流增广路)
13. Edmonds-Karp 算法(最大网络流)
14. Dinic 算法(最大网络流)
15. 一般预流推进算法
16. 最高标号预流推进 HLPP 算法
17. Primal-Dual 原始对偶算法(最小费用流)18. Kosaraju 算法(有向图强连通分量)
19. Tarjan 算法(有向图强连通分量)
20. Gabow 算法(有向图强连通分量)
21. 匈牙利算法(二分图匹配)
22. Hopcroft－Karp 算法(二分图匹配)
23. kuhn munkras 算法(二分图最佳匹配)
24. Edmonds’ Blossom-Contraction 算法(一般图匹配)
|1. 图遍历
2. 有向图和无向图的强弱连通性
3. 割点/割边
3. AOV 网络和拓扑排序
4. AOE 网络和关键路径
5. 最小代价生成树/次小生成树
6. 最短路径问题/第 K 短路问题
7. 最大网络流问题
8. 最小费用流问题
9. 图着色问题
10. 差分约束系统
11. 欧拉回路
12. 中国邮递员问题
13. 汉密尔顿回路
14. 最佳边割集/最佳点割集/最小边割集/最小点割集/最小路径覆盖/最小点集覆盖
15. 边覆盖集
16. 二分图完美匹配和最大匹配问题
17. 仙人掌图
18. 弦图
19. 稳定婚姻问题
20. 最大团问题
||
-|数论||1. 最大公约数
2. 最小公倍数
3. 分解质因数
4. 素数判定
5. 进制转换
6. 高精度计算
7. 整除问题
8. 同余问题
9. 欧拉函数
10. 扩展欧几里得
11. 置换群
12. 母函数
13. 离散变换
14. 康托展开
15. 矩阵
16. 向量
17. 线性方程组
18. 线性规划
||
-|几何||1. 凸包 - Gift wrapping
2. 凸包 - Graham scan
3. 线段问题
4. 多边形和多面体相关问题
||
-|NP 完全|1. 计算模型
2. P 类与 NP 类问题
3. NP 完全问题
4. NP 完全问题的近似算法
|1. 随机存取机 RAM
2. 随机存取存储程序机 RASP
3. 图灵机
4. 非确定性图灵机
5. P 类与 NP 类语言
6. 多项式时间验证
7. 多项式时间变换
8. Cook定理
9. 合取范式的可满足性问题 CNF-SAT
10. 3 元合取范式的可满足性问题 3-SAT
11. 团问题 CLIQUE
12. 顶点覆盖问题 VERTEX-COVER
13. 子集和问题 SUBSET-SUM
14. 哈密顿回路问题 HAM-CYCLE
15. 旅行售货员问题 TSP
16. 顶点覆盖问题的近似算法
17. 旅行售货员问题近似算法
18. 具有三角不等式性质的旅行售货员问题
19. 一般的旅行售货员问题
20. 集合覆盖问题的近似算法
21. 子集和问题的近似算法
22. 子集和问题的指数时间算法
23. 子集和问题的多项式时间近似格式
||
-|------------|------------------------------------------------------------------|-----------------------------------------------------------------|--------------------|
-
+| Algorithms | Concrete Types | Related Topics | Explained Articles |
+| :------------------------------: | :------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | :-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | :------------------- |
+| Sorting Algorithms | 1. Bubble sort
2. Insertion sort
3. Selection sort
4. Shell sort
5. Quick sort
6. Merge sort
7 . Heap sort
8. Linear sorting algorithm
9. Introspective sorting
10. Indirect sorting
11. Counting sorting
12. Radix sorting
13. Bucket sorting
14 . External sorting -k-way merge loser tree
15. External sorting -best merge tree | | |
+| Recursion and divide and conquer | | 1. Binary Search/Find
2. Multiplication of Large Integers
3. Strassen Matrix Multiplication
4. Chessboard Covering
5. Merge Sort
6. Quick Sort
7. Linear Time Selection
8. Closest Point Pair Problem
9. Round Robin Schedule
| |
+| Dynamic Programming | | 1. Matrix multiplication problem
2. Longest common subsequence
3. Maximum subsegment sum
4. Optimal triangulation of convex polygons
5. Polygon games
6. Image Compression
7. Circuit Routing
8. Pipeline Job Scheduling
9. 0-1 Knapsack Problem/Knapsack Nine Lectures
10. Optimal Binary Search Tree
11. Dynamic Programming Acceleration Principle
12. Tree DP
| |
+| greedy | 1. Activity scheduling problem
2. Optimal loading
3. Huffman coding
4. Single-source shortest path
5. Minimum spanning tree
6. Multi-machine scheduling problem
| |
+| Backtracking | 1. Loading Problem
2. Batch Job Scheduling
3. Signed Triangle Problem
4. Post n Problem
5. 0-1 Knapsack Problem
6. Maximum Clique Problem
>7. The m-coloring problem of graphs
8. The traveling salesman problem
9. The circle permutation problem
10. The circuit board permutation problem
11. The continuous postage problem
| |
+| Search | 1. Enumeration
2. DFS
3. BFS
4. Heuristic Search
| | |
+| Randomization | 1. Random Number
2. Numerical Randomization Algorithm
3. Sherwood Algorithm
4. Las Vegas Algorithm
5. Monte Carlo Algorithm
| 1. Calculate the value of π
2. Calculate the definite integral
3. Solve Systems of nonlinear equations
4. Linear time selection algorithms
5. Skip lists
6. Post n problems
7. Integer factorization
8. Principal element problems
9. Prime numbers test
| |
+| |
+| Graph Theory | 1. Traverse DFS /BFS
2. AOV /AOE Network
3. Kruskal Algorithm (Minimum Spanning Tree)
4. Prim Algorithm (Minimum Spanning Tree)
5. Boruvka Algorithm ( Minimum spanning tree)
6. Dijkstra's algorithm (single-source shortest path)
7. Bellman-Ford algorithm (single-source shortest path)
8. SPFA algorithm (single-source shortest path)
9. Floyd's algorithm (multi-source shortest path)
10. Johnson's algorithm (multi-source shortest path)
11. Fleury's algorithm (Eulerian circuit)
12. Ford-Fulkerson algorithm (maximum network flow augmentation path)
13. Edmonds-Karp Algorithm (Maximum Network Flow)
14. Dinic Algorithm (Maximum Network Flow)
15. General Preflow Pushing Algorithm
16. Highest Label Preflow Pushing HLPP Algorithm
>17. Primal-Dual algorithm (minimum cost flow)18. Kosaraju algorithm (strongly connected components of directed graph)
19. Tarjan algorithm (strongly connected components of directed graph)
20. Gabow algorithm (with strong connected components to the graph)
21. Hungarian algorithm (bipartite graph matching)
22. Hopcroft－Karp algorithm (bipartite graph matching)
23. kuhn munkras algorithm (bipartite graph matching)
24. Edmonds' Blossom-Contraction Algorithm (General Graph Matching)
| 1. Graph Traversal
2. Strong and Weak Connectivity of Directed and Undirected Graphs
3. Cutting Points/Edges
>3. AOV network and topological sorting
4. AOE network and critical path
5. Minimum cost spanning tree/second smallest spanning tree
6. Shortest path problem/Kth short circuit problem
7. Maximum Network Flow Problem
8. Minimum Cost Flow Problem
9. Graph Coloring Problem
10. Differential Constraint Systems
11. Euler Circuit
12. Chinese Postman Problem
13. Hamiltonian circuit
14. Best edge cut set/best point cut set/minimum edge cut set/minimum point cut set/minimum path cover/minimum point set cover
15. Edge cover set
16. Bipartite Graph Perfect Matching and Maximum Matching Problem
17. Cactus Graph
18. Chord Graph
19. Stable Marriage Problem
20. Maximum Clique Problem
| |
+| Number Theory | 1. Greatest common divisor
2. Least common multiple
3. Decomposition of prime factors
4. Prime number determination
5. Base conversion
6. High precision calculation
7. Divisibility Problems
8. Congruence Problems
9. Euler Functions
10. Extended Euclidean
11. Permutation Groups
12. Generating Functions
13. Discrete Transformations
>14. Cantor Expansion
15. Matrices
16. Vectors
17. Linear Equations
18. Linear Programming
| |
+| Geometry | 1. Convex Hull -Gift wrapping
2. Convex Hull -Graham scan
3. Line Segment Problems
4. Polygon and Polyhedron Related Problems
| |
+| NP-Complete | 1. Computational Models
2. P-type and NP-type Problems
3. NP-Complete Problems
4. Approximation Algorithms for NP-Complete Problems
| 1. Random Access Machine RAM
2. Random Access Stored Program Machine RASP
3. Turing Machine
4. Nondeterministic Turing Machine
5. P and NP Class Languages
6. Polynomial Time Verification
7. Polynomial Time Transformation
8. Cook's Theorem
9. The Satisfiability Problem of Conjunctive Normal Form CNF-SAT
10. The Satisfiability of 3-Variable Conjunctive Normal Form Problem 3-SAT
11. Clique Problem CLIQUE
12. Vertex Cover Problem VERTEX-COVER
13. Subset Sum Problem SUBSET-SUM
14. Hamiltonian Circuit Problem HAM-CYCLE
15. Traveling Salesman Problem TSP
16. Approximate Algorithms for Vertex Covering Problems
17. Approximate Algorithms for Traveling Salesman Problems
18. Traveling Salesman Problems with Triangle Inequality Properties
19. General Traveling Salesman Problems
20. Approximation Algorithms for Set Covering Problems
21. Approximation Algorithms for Subset Sum Problems
22. Exponential Time Algorithms for Subset Sum Problems
23. Polynomial Time Approximation Form for Subset Sum Problems
| |
+| ------------ | ------------------------------------------------------------------ | ----------------------------------------------------------------- | -------------------- |
## LeetCode Problems
-## 一. 个人数据
+## 1. Personal data
{{.PersonalData}}
-## 二. 目录
+## 2. Directory
{{.TotalNum}}
{{.AvailableTable}}
-------------------------------------------------------------------
-
-下面这些是免费的算法题，但是暂时还不能使用 Go 解答的：
+---
-暂无
+The following are free algorithm questions, but they cannot be solved using Go yet:
-------------------------------------------------------------------
+no yet
+---
-## 三.分类
+## 3. Classification
## Array
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Array/)
-
-
## String
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/String/)
-
## Two Pointers
-- 双指针滑动窗口的经典写法。右指针不断往右移，移动到不能往右移动为止(具体条件根据题目而定)。当右指针到最右边以后，开始挪动左指针，释放窗口左边界。第 3 题，第 76 题，第 209 题，第 424 题，第 438 题，第 567 题，第 713 题，第 763 题，第 845 题，第 881 题，第 904 题，第 978 题，第 992 题，第 1004 题，第 1040 题，第 1052 题。
+- The classic way of writing a two-pointer sliding window. The right pointer keeps moving to the right until it cannot move to the right (the specific conditions depend on the topic). When the right pointer reaches the far right, start to move the left pointer to release the left boundary of the window. No. Question 3, Question 76, Question 209, Question 424, Question 438, Question 567, Question 713, Question 763, Question 845, Question 881, Question 904, Question 978, Question Question 992, Question 1004, Question 1040, Question 1052.
```c
left, right := 0, -1
@@ -176,458 +193,432 @@ Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/String/)
}
```
-- 快慢指针可以查找重复数字，时间复杂度 O(n)，第 287 题。
-- 替换字母以后，相同字母能出现连续最长的长度。第 424 题。
-- SUM 问题集。第 1 题，第 15 题，第 16 题，第 18 题，第 167 题，第 923 题，第 1074 题。
-
+- Fast and slow pointers can find repeated numbers, time complexity O(n), question 287.
+- After replacing letters, the same letter can appear for the longest length in a row. Question 424.
+- SUM problem sets. Question 1, Question 15, Question 16, Question 18, Question 167, Question 923, Question 1074.
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Two_Pointers/)
-
## Linked List
-
-- 巧妙的构造虚拟头结点。可以使遍历处理逻辑更加统一。
-- 灵活使用递归。构造递归条件，使用递归可以巧妙的解题。不过需要注意有些题目不能使用递归，因为递归深度太深会导致超时和栈溢出。
-- 链表区间逆序。第 92 题。
-- 链表寻找中间节点。第 876 题。链表寻找倒数第 n 个节点。第 19 题。只需要一次遍历就可以得到答案。
-- 合并 K 个有序链表。第 21 题，第 23 题。
-- 链表归类。第 86 题，第 328 题。
-- 链表排序，时间复杂度要求 O(n * log n)，空间复杂度 O(1)。只有一种做法，归并排序，至顶向下归并。第 148 题。
-- 判断链表是否存在环，如果有环，输出环的交叉点的下标；判断 2 个链表是否有交叉点，如果有交叉点，输出交叉点。第 141 题，第 142 题，第 160 题。
-
+- Clever construction of virtual head nodes. The traversal processing logic can be made more unified.
+- Flexible use of recursion. Construct recursive conditions, and use recursion to solve problems cleverly. However, it should be noted that some topics cannot use recursion, because too deep recursion will cause timeout and stack overflow.
+- The reverse order of the range of the linked list. Question 92.
+- The linked list finds the middle node. Question 876. The linked list finds the nth last node. Question 19. It only takes one traversal to get the answer.
+- Merge K ordered linked lists. Question 21, question 23.
+- Linked list sorting. Question 86, question 328.
+- Linked list sorting requires O(n \*log n) time complexity and O(1) space complexity. There is only one method, merge sort, and merge from top to bottom. Question 148.
+- Judging whether there is a ring in the linked list, if there is a ring, output the subscript of the intersection point of the ring; judge whether there is an intersection point in the two linked lists, and output the intersection point if there is an intersection point. Question 141, Question 142 question, question 160.
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Linked_List/)
-
-
-
## Stack
-- 括号匹配问题及类似问题。第 20 题，第 921 题，第 1021 题。
-- 栈的基本 pop 和 push 操作。第 71 题，第 150 题，第 155 题，第 224 题，第 225 题，第 232 题，第 946 题，第 1047 题。
-- 利用栈进行编码问题。第 394 题，第 682 题，第 856 题，第 880 题。
-- **单调栈**。**利用栈维护一个单调递增或者递减的下标数组**。第 84 题，第 456 题，第 496 题，第 503 题，第 739 题，第 901 题，第 907 题，第 1019 题。
-
+-Bracket matching issues and similar. Question 20, question 921, question 1021.
+-Basic pop and push operations on the stack. Question 71, Question 150, Question 155, Question 224, Question 225, Question 232, Question 946, Question 1047.
+-Coding problems using the stack. Question 394, Question 682, Question 856, Question 880. -**Monotonic stack**. **Use the stack to maintain a monotonically increasing or decreasing subscript array**. Question 84, Question 456, Question 496, Question 503, Question 739, Question 901, Question
+Question 907, question 1019.
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Stack/)
-
-
## Tree
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Tree/)
-
-
-
-
## Dynamic Programming
-Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Dynamic_Programming/)
-
-
+- Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Dynamic_Programming/)
## Backtracking
-- 排列问题 Permutations。第 46 题，第 47 题。第 60 题，第 526 题，第 996 题。
-- 组合问题 Combination。第 39 题，第 40 题，第 77 题，第 216 题。
-- 排列和组合杂交问题。第 1079 题。
-- N 皇后终极解法(二进制解法)。第 51 题，第 52 题。
-- 数独问题。第 37 题。
-- 四个方向搜索。第 79 题，第 212 题，第 980 题。
-- 子集合问题。第 78 题，第 90 题。
-- Trie。第 208 题，第 211 题。
-- BFS 优化。第 126 题，第 127 题。
-- DFS 模板。(只是一个例子，不对应任何题)
+- Permutations of permutation questions. Question 46, question 47. Question 60, Question 526, Question 996.
+- Combination question Combination. Question 39, Question 40, Question 77, Question 216.
+- Permutation and combination hybridization problems. Question 1079.
+- N queens ultimate solution (binary solution). Question 51, question 52.
+- Sudoku problems. Question 37.
+- Search in four directions. Question 79, Question 212, Question 980.
+- Subcollection issues. Question 78, question 90.
+- Trie. Question 208, question 211.
+- BFS optimization. Question 126, question 127.
+- DFS templates. (just an example, does not correspond to any question)
```go
func combinationSum2(candidates []int, target int) [][]int {
- if len(candidates) == 0 {
- return [][]int{}
- }
- c, res := []int{}, [][]int{}
- sort.Ints(candidates)
- findcombinationSum2(candidates, target, 0, c, &res)
- return res
+if len(candidates) == 0 {
+return [][]int{}
+}
+c, res := []int{}, [][]int{}
+sort.Ints(candidates)
+findcombinationSum2(candidates, target, 0, c, &res)
+return res
}
func findcombinationSum2(nums []int, target, index int, c []int, res *[][]int) {
- if target == 0 {
- b := make([]int, len(c))
- copy(b, c)
- *res = append(*res, b)
- return
- }
- for i := index; i < len(nums); i++ {
- if i > index && nums[i] == nums[i-1] { // 这里是去重的关键逻辑
- continue
- }
- if target >= nums[i] {
- c = append(c, nums[i])
- findcombinationSum2(nums, target-nums[i], i+1, c, res)
- c = c[:len(c)-1]
- }
- }
+if target == 0 {
+b := make([]int, len(c))
+copy(b, c)
+*res = append(*res, b)
+return
+}
+for i := index; i < len(nums); i++ {
+if i > index && nums[i] == nums[i-1] { //Here is the key logic for deduplication
+continue
+}
+if target >= nums[i] {
+c = append(c, nums[i])
+findcombinationSum2(nums, target-nums[i], i+1, c, res)
+c = c[:len(c)-1]
+}
+}
}
```
-- BFS 模板。(只是一个例子，不对应任何题)
+
+- BFS template. (just an example, does not correspond to any question)
```go
+package main
+func main(){
+
+}
func updateMatrix_BFS(matrix [][]int) [][]int {
- res := make([][]int, len(matrix))
- if len(matrix) == 0 || len(matrix[0]) == 0 {
- return res
- }
- queue := make([][]int, 0)
- for i, _ := range matrix {
- res[i] = make([]int, len(matrix[0]))
- for j, _ := range res[i] {
- if matrix[i][j] == 0 {
- res[i][j] = -1
- queue = append(queue, []int{i, j})
- }
- }
- }
- level := 1
- for len(queue) > 0 {
- size := len(queue)
- for size > 0 {
- size -= 1
- node := queue[0]
- queue = queue[1:]
- i, j := node[0], node[1]
- for _, direction := range [][]int{{-1, 0}, {1, 0}, {0, 1}, {0, -1}} {
- x := i + direction[0]
- y := j + direction[1]
- if x < 0 || x >= len(matrix) || y < 0 || y >= len(matrix[0]) || res[x][y] < 0 || res[x][y] > 0 {
- continue
- }
- res[x][y] = level
- queue = append(queue, []int{x, y})
- }
- }
- level++
- }
- for i, row := range res {
- for j, cell := range row {
- if cell == -1 {
- res[i][j] = 0
- }
- }
- }
- return res
+res := make([][]int, len(matrix))
+if len(matrix) == 0 || len(matrix[0]) == 0 {
+return res
+}
+queue := make([][]int, 0)
+for i, _ := range matrix {
+res[i] = make([]int, len(matrix[0]))
+for j, _ := range res[i] {
+if matrix[i][j] == 0 {
+res[i][j] = -1
+queue = append(queue, []int{i, j})
+}
+}
+}
+level := 1
+for len(queue) > 0 {
+size := len(queue)
+for size > 0 {
+size -= 1
+node := queue[0]
+queue = queue[1:]
+i, j := node[0], node[1]
+for _, direction := range [][]int{{-1, 0}, {1, 0}, {0, 1}, {0, -1}} {
+x := i + direction[0]
+y := j + direction[1]
+if x < 0 || x >= len(matrix) || y < 0 || y >= len(matrix[0]) || res[x][y] < 0 || res[x][y] > 0 {
+continue
+}
+res[x][y] = level
+queue = append(queue, []int{x, y})
+}
+}
+level++
+}
+for i, row := range res {
+for j, cell := range row {
+if cell == -1 {
+res[i][j] = 0
+}
+}
+}
+return res
}
```
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Backtracking/)
-
## Depth First Search
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Depth_First_Search/)
-
-
-
## Breadth First Search
-
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Breadth_First_Search/)
-
-
-
-
## Binary Search
![]()
-- 二分搜索的经典写法。需要注意的三点：
- 1. 循环退出条件，注意是 low <= high，而不是 low < high。
- 2. mid 的取值，mid := low + (high-low)>>1
- 3. low 和 high 的更新。low = mid + 1，high = mid - 1。
+-The classic way of writing binary search. Three points to note:
+
+1. Loop exit condition, note that low <= high, not low < high.
+2. The value of mid, mid := low + (high-low)>>1
+3. Update of low and high. low = mid + 1, high = mid -1.
```go
func binarySearchMatrix(nums []int, target int) int {
- low, high := 0, len(nums)-1
- for low <= high {
- mid := low + (high-low)>>1
- if nums[mid] == target {
- return mid
- } else if nums[mid] > target {
- high = mid - 1
- } else {
- low = mid + 1
- }
- }
- return -1
+low, high := 0, len(nums)-1
+for low <= high {
+mid := low + (high-low)>>1
+if nums[mid] == target {
+return mid
+} else if nums[mid] > target {
+high = mid - 1
+} else {
+low = mid + 1
+}
+}
+return -1
}
```
-- 二分搜索的变种写法。有 4 个基本变种:
- 1. 查找第一个与 target 相等的元素，时间复杂度 O(logn)
- 2. 查找最后一个与 target 相等的元素，时间复杂度 O(logn)
- 3. 查找第一个大于等于 target 的元素，时间复杂度 O(logn)
- 4. 查找最后一个小于等于 target 的元素，时间复杂度 O(logn)
+-A variant of binary search. There are 4 basic variants:
+
+1. Find the first element equal to target, time complexity O(logn)
+2. Find the last element equal to target, time complexity O(logn)
+3. Find the first element greater than or equal to target, time complexity O(logn)
+4. Find the last element less than or equal to target, time complexity O(logn)
```go
-// 二分查找第一个与 target 相等的元素，时间复杂度 O(logn)
+//binary search for the first element equal to target, time complexity O(logn)
func searchFirstEqualElement(nums []int, target int) int {
- low, high := 0, len(nums)-1
- for low <= high {
- mid := low + ((high - low) >> 1)
- if nums[mid] > target {
- high = mid - 1
- } else if nums[mid] < target {
- low = mid + 1
- } else {
- if (mid == 0) || (nums[mid-1] != target) { // 找到第一个与 target 相等的元素
- return mid
- }
- high = mid - 1
- }
- }
- return -1
+low, high := 0, len(nums)-1
+for low <= high {
+mid := low + ((high - low) >> 1)
+if nums[mid] > target {
+high = mid - 1
+} else if nums[mid] < target {
+low = mid + 1
+} else {
+if (mid == 0) || (nums[mid-1] != target) { //Find the first element equal to target
+return mid
+}
+high = mid - 1
+}
+}
+return -1
}
-// 二分查找最后一个与 target 相等的元素，时间复杂度 O(logn)
+//binary search for the last element equal to target, time complexity O(logn)
func searchLastEqualElement(nums []int, target int) int {
- low, high := 0, len(nums)-1
- for low <= high {
- mid := low + ((high - low) >> 1)
- if nums[mid] > target {
- high = mid - 1
- } else if nums[mid] < target {
- low = mid + 1
- } else {
- if (mid == len(nums)-1) || (nums[mid+1] != target) { // 找到最后一个与 target 相等的元素
- return mid
- }
- low = mid + 1
- }
- }
- return -1
+low, high := 0, len(nums)-1
+for low <= high {
+mid := low + ((high - low) >> 1)
+if nums[mid] > target {
+high = mid - 1
+} else if nums[mid] < target {
+low = mid + 1
+} else {
+if (mid == len(nums)-1) || (nums[mid+1] != target) { //Find the last element equal to target
+return mid
+}
+low = mid + 1
+}
+}
+return -1
}
-// 二分查找第一个大于等于 target 的元素，时间复杂度 O(logn)
+//binary search for the first element greater than or equal to target, time complexity O(logn)
func searchFirstGreaterElement(nums []int, target int) int {
- low, high := 0, len(nums)-1
- for low <= high {
- mid := low + ((high - low) >> 1)
- if nums[mid] >= target {
- if (mid == 0) || (nums[mid-1] < target) { // 找到第一个大于等于 target 的元素
- return mid
- }
- high = mid - 1
- } else {
- low = mid + 1
- }
- }
- return -1
+low, high := 0, len(nums)-1
+for low <= high {
+mid := low + ((high - low) >> 1)
+if nums[mid] >= target {
+if (mid == 0) || (nums[mid-1] < target) { //Find the first element greater than or equal to target
+return mid
+}
+high = mid - 1
+} else {
+low = mid + 1
+}
+}
+return -1
}
-// 二分查找最后一个小于等于 target 的元素，时间复杂度 O(logn)
+//binary search for the last element less than or equal to target, time complexity O(logn)
func searchLastLessElement(nums []int, target int) int {
- low, high := 0, len(nums)-1
- for low <= high {
- mid := low + ((high - low) >> 1)
- if nums[mid] <= target {
- if (mid == len(nums)-1) || (nums[mid+1] > target) { // 找到最后一个小于等于 target 的元素
- return mid
- }
- low = mid + 1
- } else {
- high = mid - 1
- }
- }
- return -1
+low, high := 0, len(nums)-1
+for low <= high {
+mid := low + ((high - low) >> 1)
+if nums[mid] <= target {
+if (mid == len(nums)-1) || (nums[mid+1] > target) { //Find the last element less than or equal to target
+return mid
+}
+low = mid + 1
+} else {
+high = mid - 1
+}
+}
+return -1
}
```
-- 在基本有序的数组中用二分搜索。经典解法可以解，变种写法也可以写，常见的题型，在山峰数组中找山峰，在旋转有序数组中找分界点。第 33 题，第 81 题，第 153 题，第 154 题，第 162 题，第 852 题
+- Binary search in basically sorted arrays. The classic solution can be solved, and the variant writing method can also be written. The common question type is to find the peak in the peak array and find the dividing point in the rotated ordered array. No.
+ Question 33, Question 81, Question 153, Question 154, Question 162, Question 852
```go
+package main
+
func peakIndexInMountainArray(A []int) int {
- low, high := 0, len(A)-1
- for low < high {
- mid := low + (high-low)>>1
- // 如果 mid 较大，则左侧存在峰值，high = m，如果 mid + 1 较大，则右侧存在峰值，low = mid + 1
- if A[mid] > A[mid+1] {
- high = mid
- } else {
- low = mid + 1
- }
- }
- return low
+low, high := 0, len(A)-1
+for low < high {
+mid := low + (high-low)>>1
+//If mid is large, there is a peak on the left, high = m, if mid + 1 is large, there is a peak on the right, low = mid + 1
+if A[mid] > A[mid+1] {
+high = mid
+} else {
+low = mid + 1
+}
+}
+return low
}
```
-- max-min 最大值最小化问题。求在最小满足条件的情况下的最大值。第 410 题，第 875 题，第 1011 题，第 1283 题。
-
-Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Binary_Search/)
-
-
+- max-min maximum minimization problem. Find the maximum value if the minimum condition is met. Question 410, Question 875, Question 1011, Question 1283.
+ Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Binary_Search/)
## Math
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Math/)
-
-
-
## Hash Table
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Hash_Table/)
-
-
## Sort
-- 深刻的理解多路快排。第 75 题。
-- 链表的排序，插入排序(第 147 题)和归并排序(第 148 题)
-- 桶排序和基数排序。第 164 题。
-- "摆动排序"。第 324 题。
-- 两两不相邻的排序。第 767 题，第 1054 题。
-- "饼子排序"。第 969 题。
+- Deep understanding of multi-way quick sort. Question 75.
+- Sorting of linked lists, insertion sort (question 147) and merge sort (question 148)
+- Bucket sort and radix sort. Question 164.
+- "Swing Sort". Question 324.
+- Sorting that is not adjacent to each other. Question 767, question 1054.
+- "Sorting pancakes". Question 969.
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Sort/)
-
## Bit Manipulation
-- 异或的特性。第 136 题，第 268 题，第 389 题，第 421 题，
+-XOR property. Question 136, Question 268, Question 389, Question 421,
```go
x ^ 0 = x
x ^ 11111……1111 = ~x
x ^ (~x) = 11111……1111
x ^ x = 0
-a ^ b = c => a ^ c = b => b ^ c = a (交换律)
-a ^ b ^ c = a ^ (b ^ c) = (a ^ b）^ c (结合律)
+a ^ b = c = > a ^ c = b = > b ^ c = a (commutative law)
+a ^ b ^ c = a ^ (b ^ c) = (a ^ b）^ c (associative law)
```
-- 构造特殊 Mask，将特殊位置放 0 或 1。
+- Construct a special Mask, put 0 or 1 in the special position.
```go
-将 x 最右边的 n 位清零， x & ( ~0 << n )
-获取 x 的第 n 位值(0 或者 1)，(x >> n) & 1
-获取 x 的第 n 位的幂值，x & (1 << (n - 1))
-仅将第 n 位置为 1，x | (1 << n)
-仅将第 n 位置为 0，x & (~(1 << n))
-将 x 最高位至第 n 位(含)清零，x & ((1 << n) - 1)
-将第 n 位至第 0 位(含)清零，x & (~((1 << (n + 1)) - 1)）
+Clear the rightmost n bits of x , x & ( ~0 << n )
+Get the nth bit value (0 or 1) of x, (x >> n) & 1
+Get the power of the nth bit of x, x & (1 << (n -1))
+Set only the nth position to 1, x | (1 << n)
+Set only the nth position to 0, x & (~(1 << n))
+Clear the most significant bit of x to the nth bit (inclusive), x & ((1 << n) -1)
+Clear bits n through 0, inclusive, x & (~((1 << (n + 1)) -1))
```
-- 有特殊意义的 & 位操作运算。第 260 题，第 201 题，第 318 题，第 371 题，第 397 题，第 461 题，第 693 题，
+- The & bitwise operation has a special meaning. Question 260, Question 201, Question 318, Question 371, Question 397, Question 461, Question 693,
```go
-X & 1 == 1 判断是否是奇数(偶数)
-X & = (X - 1) 将最低位(LSB)的 1 清零
-X & -X 得到最低位(LSB)的 1
+X & 1 == 1 to determine whether it is an odd number (even number)
+X & = (X -1) clears the least significant bit (LSB) of 1
+X & -X get the least significant bit (LSB) of 1
X & ~X = 0
```
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Bit_Manipulation/)
-
## Union Find
-- 灵活使用并查集的思想，熟练掌握并查集的[模板](https://github.com/halfrost/leetcode-go/blob/master/template/UnionFind.go)，模板中有两种并查集的实现方式，一种是路径压缩 + 秩优化的版本，另外一种是计算每个集合中元素的个数 + 最大集合元素个数的版本，这两种版本都有各自使用的地方。能使用第一类并查集模板的题目有：第 128 题，第 130 题，第 547 题，第 684 题，第 721 题，第 765 题，第 778 题，第 839 题，第 924 题，第 928 题，第 947 题，第 952 题，第 959 题，第 990 题。能使用第二类并查集模板的题目有：第 803 题，第 952 题。第 803 题秩优化和统计集合个数这些地方会卡时间，如果不优化，会 TLE。
-- 并查集是一种思想，有些题需要灵活使用这种思想，而不是死套模板，如第 399 题，这一题是 stringUnionFind，利用并查集思想实现的。这里每个节点是基于字符串和 map 的，而不是单纯的用 int 节点编号实现的。
-- 有些题死套模板反而做不出来，比如第 685 题，这一题不能路径压缩和秩优化，因为题目中涉及到有向图，需要知道节点的前驱节点，如果路径压缩了，这一题就没法做了。这一题不需要路径压缩和秩优化。
-- 灵活的抽象题目给的信息，将给定的信息合理的编号，使用并查集解题，并用 map 降低时间复杂度，如第 721 题，第 959 题。
-- 关于地图，砖块，网格的题目，可以新建一个特殊节点，将四周边缘的砖块或者网格都 union() 到这个特殊节点上。第 130 题，第 803 题。
-- 能用并查集的题目，一般也可以用 DFS 和 BFS 解答，只不过时间复杂度会高一点。
-
-
-Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Union_Find/)
-
-
+- Flexibly use the idea of union find, master the [template] of union find (https://github.com/halfrost/leetcode-go/blob/master/template/UnionFind.go)
+ , there are two implementations of union search in the template, one is the version of path compression + rank optimization, and the other is to calculate the number of elements in each set +
+ The version with the maximum number of collection elements, both versions have their respective uses. The questions that can use the first type of union search template are: No. 128, No. 130, No. 547, No.
+ Question 684, Question 721, Question 765, Question 778, Question 839, Question 924, Question 928, Question 947, Question 952, Question 959, Question 990
+ question. The questions that can use the second type of union search template are: question 803 and question 952. Question 803 Rank optimization and the number of statistical collections will be time-consuming. If not optimized, it will be TLE.
+- Union search is a kind of thinking, some questions need to use this kind of thinking flexibly, instead of a dead set template, such as question 399, this question is
+ stringUnionFind, realized by using the idea of union search. Each node here is based on strings and maps, rather than simply using int node numbers.
+- Some questions can’t be done with a dead set template, such as question 685. This question cannot be path compressed and rank optimized, because the question involves a directed graph, and it is necessary to know the predecessor node of the node. If the path is compressed, this question There is no way to do it. This question does not require path compression and rank optimization.
+- The information given by the flexible abstract topic, number the given information reasonably, use and search to solve the problem, and use map to reduce the time complexity, such as the 721st question and the 959th question.
+- Regarding the topic of maps, bricks, and grids, you can create a special node, and union() the bricks or grids around the edges to this special node. Question 130, question 803.
+- Questions that can be used for union search can generally be solved with DFS and BFS, but the time complexity will be higher.
+ Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Union_Find/)
## Sliding Window
-- 双指针滑动窗口的经典写法。右指针不断往右移，移动到不能往右移动为止(具体条件根据题目而定)。当右指针到最右边以后，开始挪动左指针，释放窗口左边界。第 3 题，第 76 题，第 209 题，第 424 题，第 438 题，第 567 题，第 713 题，第 763 题，第 845 题，第 881 题，第 904 题，第 978 题，第 992 题，第 1004 题，第 1040 题，第 1052 题。
+- The classic way of writing a two-pointer sliding window. The right pointer keeps moving to the right until it cannot move to the right (the specific conditions depend on the topic). When the right pointer reaches the far right, start to move the left pointer to release the left boundary of the window. No.
+ Question 3, Question 76, Question 209, Question 424, Question 438, Question 567, Question 713, Question 763, Question 845, Question 881, Question 904, Question 978, Question
+ Question 992, Question 1004, Question 1040, Question 1052.
```c
- left, right := 0, -1
-
- for left < len(s) {
- if right+1 < len(s) && freq[s[right+1]-'a'] == 0 {
- freq[s[right+1]-'a']++
- right++
- } else {
- freq[s[left]-'a']--
- left++
- }
- result = max(result, right-left+1)
- }
+left, right := 0, -1
+
+for left < len(s) {
+if right+1 < len(s) && freq[s[right+1]-'a'] == 0 {
+freq[s[right+1]-'a']++
+right++
+} else {
+freq[s[left]-'a']--
+left++
+}
+result = max(result, right-left+1)
+}
```
-- 滑动窗口经典题。第 239 题，第 480 题。
-Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Sliding_Window/)
+- Sliding window classic questions. Question 239, question 480.
+Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Sliding_Window/)
## Segment Tree
-- 线段树的经典数组实现写法。将合并两个节点 pushUp 逻辑抽象出来了，可以实现任意操作(常见的操作有：加法，取 max，min 等等)。第 218 题，第 303 题，第 307 题，第 699 题。
-- 计数线段树的经典写法。第 315 题，第 327 题，第 493 题。
-- 线段树的树的实现写法。第 715 题，第 732 题。
-- 区间懒惰更新。第 218 题，第 699 题。
-- 离散化。离散化需要注意一个特殊情况：假如三个区间为 [1,10] [1,4] [6,10]，离散化后 x[1]=1,x[2]=4,x[3]=6,x[4]=10。第一个区间为 [1,4]，第二个区间为 [1,2]，第三个区间为 [3,4]，这样一来，区间一 = 区间二 + 区间三，这和离散前的模型不符，离散前，很明显，区间一 > 区间二 + 区间三。正确的做法是：在相差大于 1 的数间加一个数，例如在上面 1 4 6 10 中间加 5，即可 x[1]=1,x[2]=4,x[3]=5,x[4]=6,x[5]=10。这样处理之后，区间一是 1-5 ，区间二是 1-2 ，区间三是 4-5 。
-- 灵活构建线段树。线段树节点可以存储多条信息，合并两个节点的 pushUp 操作也可以是多样的。第 850 题，第 1157 题。
-
-
-线段树[题型](https://blog.csdn.net/xuechelingxiao/article/details/38313105)从简单到困难:
-
-1. 单点更新:
- [HDU 1166 敌兵布阵](http://acm.hdu.edu.cn/showproblem.php?pid=1166) update:单点增减 query:区间求和
- [HDU 1754 I Hate It](http://acm.hdu.edu.cn/showproblem.php?pid=1754) update:单点替换 query:区间最值
- [HDU 1394 Minimum Inversion Number](http://acm.hdu.edu.cn/showproblem.php?pid=1394) update:单点增减 query:区间求和
- [HDU 2795 Billboard](http://acm.hdu.edu.cn/showproblem.php?pid=2795) query:区间求最大值的位子(直接把update的操作在query里做了)
-2. 区间更新:
- [HDU 1698 Just a Hook](http://acm.hdu.edu.cn/showproblem.php?pid=1698) update:成段替换 (由于只query一次总区间,所以可以直接输出 1 结点的信息)
- [POJ 3468 A Simple Problem with Integers](http://poj.org/problem?id=3468) update:成段增减 query:区间求和
- [POJ 2528 Mayor’s posters](http://poj.org/problem?id=2528) 离散化 + update:成段替换 query:简单hash
- [POJ 3225 Help with Intervals](http://poj.org/problem?id=3225) update:成段替换,区间异或 query:简单hash
-3. 区间合并(这类题目会询问区间中满足条件的连续最长区间,所以PushUp的时候需要对左右儿子的区间进行合并):
- [POJ 3667 Hotel](http://poj.org/problem?id=3667) update:区间替换 query:询问满足条件的最左端点
-4. 扫描线(这类题目需要将一些操作排序,然后从左到右用一根扫描线扫过去最典型的就是矩形面积并,周长并等题):
- [HDU 1542 Atlantis](http://acm.hdu.edu.cn/showproblem.php?pid=1542) update:区间增减 query:直接取根节点的值
- [HDU 1828 Picture](http://acm.hdu.edu.cn/showproblem.php?pid=1828) update:区间增减 query:直接取根节点的值
+- The classic array implementation of the line segment tree. The pushUp logic of merging two nodes is abstracted, and any operation can be realized (common operations include: addition, max, min, etc.). No.
+ Question 218, Question 303, Question 307, Question 699.
+- The classic way of counting line segment trees. Question 315, Question 327, Question 493.
+- The implementation of the tree of the line segment tree. Question 715, question 732.
+- Range lazy update. Question 218, question 699.
+- Discretization. Discretization needs to pay attention to a special case: if the three intervals are [1,10] [1,4] [6,10], after discretization x[1]=1,x[2]=4,x[3] =6,x[4]
+ =10. The first interval is [1,4], the second interval is [1,2], and the third interval is [3,4], so that interval one = interval two +
+ Interval three, which is inconsistent with the model before discretization. Before discretization, it is obvious that interval one > interval two + interval three. The correct way is: add a number between the numbers with a difference greater than 1, such as the above
+ 1 4 6 10 Add 5 in the middle, then x[1]=1,x[2]=4,x[3]=5,x[4]=6,x[5]=10. After this processing, interval one is 1-5, interval two is 1-2, and interval three is 4-5.
+- Flexible construction of segment trees. Line segment tree nodes can store multiple pieces of information, and the pushUp operation for merging two nodes can also be diverse. Question 850, question 1157.
+
+Line segment tree [question type] (https://blog.csdn.net/xuechelingxiao/article/details/38313105) from simple to difficult:
+
+1. Single point update:
+ - [HDU 1166 Enemy Soldier Arrangement](http://acm.hdu.edu.cn/showproblem.php?pid=1166) update: single-point increase and decrease query: interval summation
+ - [HDU 1754 I Hate It](http://acm.hdu.edu.cn/showproblem.php?pid=1754) update: single point replacement query: maximum value of interval
+ - [HDU 1394 Minimum Inversion Number](http://acm.hdu.edu.cn/showproblem.php?pid=1394) update: single-point increase and decrease query: interval summation
+ - [HDU 2795 Billboard](http://acm.hdu.edu.cn/showproblem.php?pid=2795) query: Find the maximum value of the interval (
+ Do the update operation directly in the query)
+2. Interval update:
+ - [HDU 1698 Just a Hook](http://acm.hdu.edu.cn/showproblem.php?pid=1698) update: segment replacement (since the total interval is only queried once, it can be output directly
+ 1 node information)
+ - [POJ 3468 A Simple Problem with Integers](http://poj.org/problem?id=3468) update: Segment increase and decrease query: Interval summation
+ - [POJ 2528 Mayor’s posters](http://poj.org/problem?id=2528) discretization + update: segment replacement query: simple hash
+ - [POJ 3225 Help with Intervals](http://poj.org/problem?id=3225) update: segment replacement, interval XOR query: simple hash
+3. Interval merging (this type of question will ask the longest continuous interval that meets the conditions in the interval, so when PushUp needs to merge the intervals of the left and right sons):
+ [POJ 3667 Hotel](http://poj.org/problem?id=3667) update: interval replacement query: query the leftmost endpoint that meets the conditions
+4. Scanning line (this kind of problem needs to sort some operations, and then use a scanning line to scan from left to right. The most typical one is rectangular area union, perimeter length union and other questions):
+ - [HDU 1542 Atlantis](http://acm.hdu.edu.cn/showproblem.php?pid=1542) update: Interval increase and decrease query: Take the value of the root node directly
+ - [HDU 1828 Picture](http://acm.hdu.edu.cn/showproblem.php?pid=1828) update: interval increase and decrease query: take the value of the root node directly
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Segment_Tree/)
-
## Binary Indexed Tree
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Binary_Indexed_Tree/)
-
-----------------------------------------------------------------------------------------
+---
@@ -635,11 +626,8 @@ Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Binary_I
Thank you for reading here. This is bonus. You can download my [《ACM-ICPC Algorithm Template》](https://github.com/halfrost/leetcode-go/releases/tag/Special/)
-
-
## ♥️ Thanks
Thanks for your Star！
[](https://starchart.cc/halfrost/LeetCode-Go)
-
diff --git a/ctl/util/util.go b/ctl/util/util.go
index 4fcf5b025..007448cb8 100644
--- a/ctl/util/util.go
+++ b/ctl/util/util.go
@@ -15,7 +15,7 @@ import (
// LoadSolutionsDir define
func LoadSolutionsDir() ([]int, []string, int) {
solutionIds, soNames, total := loadFile("../leetcode/")
- fmt.Printf("读取了 %v 道题的题解，当前目录下有 %v 个文件(可能包含 .DS_Store)，目录中有 %v 道题在尝试中\n", len(solutionIds), total, total-len(solutionIds))
+ fmt.Printf("Read the solutions of %v questions, there are %v files (may include .DS_Store) in the current directory, and %v questions in the directory are trying\n", len(solutionIds), total, total-len(solutionIds))
return solutionIds, soNames, total - len(solutionIds)
}
@@ -49,10 +49,10 @@ func GetAllFile(pathname string, fileList *[]string) ([]string, error) {
rd, err := ioutil.ReadDir(pathname)
for _, fi := range rd {
if fi.IsDir() {
- //fmt.Printf("[%s]\n", pathname+"\\"+fi.Name())
+ // fmt.Printf("[%s]\n", pathname+"\\"+fi.Name())
GetAllFile(pathname+fi.Name()+"/", fileList)
} else {
- //fmt.Println(fi.Name())
+ // fmt.Println(fi.Name())
*fileList = append(*fileList, fi.Name())
}
}
@@ -74,12 +74,12 @@ func LoadChapterFourDir() ([]string, []int) {
fmt.Println(err)
}
solutionIds = append(solutionIds, tmp)
- // len(f.Name())-3 = 文件名去掉 .md 后缀
+ // len(f.Name())-3 = file name without .md suffix
solutionsMap[tmp] = f[:len(f)-3]
}
}
sort.Ints(solutionIds)
- fmt.Printf("读取了第四章的 %v 道题的题解\n", len(solutionIds))
+ fmt.Printf("Read the solutions of %v questions in Chapter 4\n", len(solutionIds))
for _, v := range solutionIds {
if name, ok := solutionsMap[v]; ok {
solutions = append(solutions, name)
@@ -100,7 +100,7 @@ func WriteFile(fileName string, content []byte) {
if err != nil {
fmt.Println(err)
}
- //fmt.Println("write file successful")
+ // fmt.Println("write file successful")
}
// LoadFile define
diff --git a/go.mod b/go.mod
index 153b8e0df..618cb80be 100644
--- a/go.mod
+++ b/go.mod
@@ -11,20 +11,20 @@ replace github.com/halfrost/LeetCode-Go/ctl/util => ./ctl/util
replace github.com/halfrost/LeetCode-Go/ctl/models => ./ctl/models
require (
- github.com/BurntSushi/toml v1.2.0
- github.com/halfrost/LeetCode-Go/ctl/models v0.0.0-20220910225043-e3bb5aff34d0
- github.com/halfrost/LeetCode-Go/ctl/util v0.0.0-20220910225043-e3bb5aff34d0
- github.com/halfrost/LeetCode-Go/structures v0.0.0-20220910233101-aa0e2c897b18
- github.com/halfrost/LeetCode-Go/template v0.0.0-20220910233504-e2a72e6212ce
+ github.com/BurntSushi/toml v1.2.1
+ github.com/halfrost/LeetCode-Go/ctl/models v0.0.0-20221125083011-ed716f02a412
+ github.com/halfrost/LeetCode-Go/ctl/util v0.0.0-20221125083011-ed716f02a412
+ github.com/halfrost/LeetCode-Go/structures v0.0.0-20221125083011-ed716f02a412
+ github.com/halfrost/LeetCode-Go/template v0.0.0-20221125083011-ed716f02a412
github.com/mozillazg/request v0.8.0
- github.com/spf13/cobra v1.5.0
+ github.com/spf13/cobra v1.6.1
)
require (
github.com/bitly/go-simplejson v0.5.0 // indirect
github.com/bmizerany/assert v0.0.0-20160611221934-b7ed37b82869 // indirect
- github.com/inconshreveable/mousetrap v1.0.0 // indirect
+ github.com/inconshreveable/mousetrap v1.1.0 // indirect
github.com/kr/pretty v0.3.0 // indirect
github.com/spf13/pflag v1.0.5 // indirect
- golang.org/x/net v0.0.0-20220909164309-bea034e7d591 // indirect
+ golang.org/x/net v0.8.0
)
diff --git a/go.sum b/go.sum
index e7b8fefbc..ed6baa09e 100644
--- a/go.sum
+++ b/go.sum
@@ -1,5 +1,7 @@
github.com/BurntSushi/toml v1.2.0 h1:Rt8g24XnyGTyglgET/PRUNlrUeu9F5L+7FilkXfZgs0=
github.com/BurntSushi/toml v1.2.0/go.mod h1:CxXYINrC8qIiEnFrOxCa7Jy5BFHlXnUU2pbicEuybxQ=
+github.com/BurntSushi/toml v1.2.1 h1:9F2/+DoOYIOksmaJFPw1tGFy1eDnIJXg+UHjuD8lTak=
+github.com/BurntSushi/toml v1.2.1/go.mod h1:CxXYINrC8qIiEnFrOxCa7Jy5BFHlXnUU2pbicEuybxQ=
github.com/bitly/go-simplejson v0.5.0 h1:6IH+V8/tVMab511d5bn4M7EwGXZf9Hj6i2xSwkNEM+Y=
github.com/bitly/go-simplejson v0.5.0/go.mod h1:cXHtHw4XUPsvGaxgjIAn8PhEWG9NfngEKAMDJEczWVA=
github.com/bmizerany/assert v0.0.0-20160611221934-b7ed37b82869 h1:DDGfHa7BWjL4YnC6+E63dPcxHo2sUxDIu8g3QgEJdRY=
@@ -9,6 +11,9 @@ github.com/creack/pty v1.1.9/go.mod h1:oKZEueFk5CKHvIhNR5MUki03XCEU+Q6VDXinZuGJ3
github.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c=
github.com/inconshreveable/mousetrap v1.0.0 h1:Z8tu5sraLXCXIcARxBp/8cbvlwVa7Z1NHg9XEKhtSvM=
github.com/inconshreveable/mousetrap v1.0.0/go.mod h1:PxqpIevigyE2G7u3NXJIT2ANytuPF1OarO4DADm73n8=
+github.com/inconshreveable/mousetrap v1.0.1/go.mod h1:vpF70FUmC8bwa3OWnCshd2FqLfsEA9PFc4w1p2J65bw=
+github.com/inconshreveable/mousetrap v1.1.0 h1:wN+x4NVGpMsO7ErUn/mUI3vEoE6Jt13X2s0bqwp9tc8=
+github.com/inconshreveable/mousetrap v1.1.0/go.mod h1:vpF70FUmC8bwa3OWnCshd2FqLfsEA9PFc4w1p2J65bw=
github.com/kr/pretty v0.1.0/go.mod h1:dAy3ld7l9f0ibDNOQOHHMYYIIbhfbHSm3C4ZsoJORNo=
github.com/kr/pretty v0.3.0 h1:WgNl7dwNpEZ6jJ9k1snq4pZsg7DOEN8hP9Xw0Tsjwk0=
github.com/kr/pretty v0.3.0/go.mod h1:640gp4NfQd8pI5XOwp5fnNeVWj67G7CFk/SaSQn7NBk=
@@ -24,13 +29,18 @@ github.com/rogpeppe/go-internal v1.6.1/go.mod h1:xXDCJY+GAPziupqXw64V24skbSoqbTE
github.com/russross/blackfriday/v2 v2.1.0/go.mod h1:+Rmxgy9KzJVeS9/2gXHxylqXiyQDYRxCVz55jmeOWTM=
github.com/spf13/cobra v1.5.0 h1:X+jTBEBqF0bHN+9cSMgmfuvv2VHJ9ezmFNf9Y/XstYU=
github.com/spf13/cobra v1.5.0/go.mod h1:dWXEIy2H428czQCjInthrTRUg7yKbok+2Qi/yBIJoUM=
+github.com/spf13/cobra v1.6.1 h1:o94oiPyS4KD1mPy2fmcYYHHfCxLqYjJOhGsCHFZtEzA=
+github.com/spf13/cobra v1.6.1/go.mod h1:IOw/AERYS7UzyrGinqmz6HLUo219MORXGxhbaJUqzrY=
github.com/spf13/pflag v1.0.5 h1:iy+VFUOCP1a+8yFto/drg2CJ5u0yRoB7fZw3DKv/JXA=
github.com/spf13/pflag v1.0.5/go.mod h1:McXfInJRrz4CZXVZOBLb0bTZqETkiAhM9Iw0y3An2Bg=
github.com/stretchr/testify v1.8.0 h1:pSgiaMZlXftHpm5L7V1+rVB+AZJydKsMxsQBIJw4PKk=
golang.org/x/net v0.0.0-20220909164309-bea034e7d591 h1:D0B/7al0LLrVC8aWF4+oxpv/m8bc7ViFfVS8/gXGdqI=
golang.org/x/net v0.0.0-20220909164309-bea034e7d591/go.mod h1:YDH+HFinaLZZlnHAfSS6ZXJJ9M9t4Dl22yv3iI2vPwk=
+golang.org/x/net v0.8.0 h1:Zrh2ngAOFYneWTAIAPethzeaQLuHwhuBkuV6ZiRnUaQ=
+golang.org/x/net v0.8.0/go.mod h1:QVkue5JL9kW//ek3r6jTKnTFis1tRmNAW2P1shuFdJc=
gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
gopkg.in/check.v1 v1.0.0-20180628173108-788fd7840127/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
gopkg.in/errgo.v2 v2.1.0/go.mod h1:hNsd1EY+bozCKY1Ytp96fpM3vjJbqLJn88ws8XvfDNI=
gopkg.in/yaml.v2 v2.4.0/go.mod h1:RDklbk79AGWmwhnvt/jBztapEOGDOx6ZbXqjP6csGnQ=
gopkg.in/yaml.v3 v3.0.1 h1:fxVm/GzAzEWqLHuvctI91KS9hhNmmWOoWu0XTYJS7CA=
+gopkg.in/yaml.v3 v3.0.1/go.mod h1:K4uyk7z7BCEPqu6E+C64Yfv1cQ7kz7rIZviUmN+EgEM=
diff --git a/leetcode/0167.Two-Sum-II-Input-array-is-sorted/README.md b/leetcode/0167.Two-Sum-II-Input-array-is-sorted/README.md
index ae06a3133..5bfa4e309 100644
--- a/leetcode/0167.Two-Sum-II-Input-array-is-sorted/README.md
+++ b/leetcode/0167.Two-Sum-II-Input-array-is-sorted/README.md
@@ -1,6 +1,6 @@
# [167. Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)
-## 题目
+## topic
Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.
diff --git a/leetcode/0491.Increasing-Subsequences/491. Increasing Subsequences.go b/leetcode/0491.Non-decreasing-Subsequences/491.Non decreasing Subsequences.go
similarity index 100%
rename from leetcode/0491.Increasing-Subsequences/491. Increasing Subsequences.go
rename to leetcode/0491.Non-decreasing-Subsequences/491.Non decreasing Subsequences.go
diff --git a/leetcode/0491.Increasing-Subsequences/491. Increasing Subsequences_test.go b/leetcode/0491.Non-decreasing-Subsequences/491.Non decreasing Subsequences_test.go
similarity index 100%
rename from leetcode/0491.Increasing-Subsequences/491. Increasing Subsequences_test.go
rename to leetcode/0491.Non-decreasing-Subsequences/491.Non decreasing Subsequences_test.go
diff --git a/leetcode/0491.Increasing-Subsequences/README.md b/leetcode/0491.Non-decreasing-Subsequences/README.md
old mode 100755
new mode 100644
similarity index 95%
rename from leetcode/0491.Increasing-Subsequences/README.md
rename to leetcode/0491.Non-decreasing-Subsequences/README.md
index 79063dbc5..75b855a92
--- a/leetcode/0491.Increasing-Subsequences/README.md
+++ b/leetcode/0491.Non-decreasing-Subsequences/README.md
@@ -1,4 +1,4 @@
-# [491. Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences/)
+# [491. Non decreasing Subsequences](https://leetcode.com/problems/increasing-subsequences/)
## 题目
diff --git a/note/grokking_algorithms.md b/note/grokking_algorithms.md
index fcf35269b..de4cc1a3f 100644
--- a/note/grokking_algorithms.md
+++ b/note/grokking_algorithms.md
@@ -1,54 +1,75 @@
-# 《算法图解》笔记
+# "Algorithm Diagram" Notes
-- 仅当列表是有序的时候，二分查找才管用
-- 大 O 表示法指出了算法运行时间的**增速**
-- 算法运行时间是从其增速的角度度量的
-
-> Leigh Caldwell 在 Stack Overflow 上说的一句话，“如果使用循环，程序的性能可能更高；如果使用递归，程序可能更容易理解。如何选择要看什么对你来说更重要。”
->
-
-- 每个递归函数都有两部分，基线条件(base case) 和 递归条件(recursive case)。递归条件指的是函数调用自己，基线条件指的是函数不再调用自己，从而避免形成无限循环。
-- 优化递归的调用栈，有2种方法
- - 重新编写代码，转而使用循环
- - 使用尾递归。这是一个高级的主题，不在本书的讨论范围内，另外，并非所有的语言都支持尾递归。
-- 编写涉及数组的递归函数的时候，基线条件通常是数组为空或只包含一个元素。
-
-
-> Haskell 等函数式编程语言就没有循环，因此你只能使用递归来编写这样的函数。如果你对递归有深入的认识，函数式编程语言学习起来将更加容易。如果你喜欢递归或者想学习一门新语言，可以研究一下 Haskell。
-
-- 散列表要避免冲突，需要有：
- - 较低的装填因子
- - 良好的散列函数
-
-- 有向图中的边为箭头，箭头的方向指定了关系的方向。无向图中的边不带箭头，其中的关系是双向的。
-- 广度优先搜索求最短路径，对于检查过的点，务必不要再去检查，否则会导致无限循环。
-
-- 在无向图中，每条边都是一个环。迪杰斯特拉算法只能用于**有向无环图**(directed acyclic graph, DAG)，如果有负权边，就不能使用迪杰斯特拉算法。
-
-- 在有负权边的图中，要求最短路径，需要用到贝尔曼-福德算法(Bellman-Ford algorithm)
-- 贪心算法的理念：每步都采取最优解。每步都选择局部最优解，最终得到的就是全局最优解。
-- 判断是否是 NP 完全问题
- - 元素较少时算法的运行速度非常快，但随着元素数量的增加，速度会变得非常慢。
- - 涉及“所有组合”的问题通常是 NP 完全问题。
- - 不能将问题分成小问题，必须考虑各种可能的情况。这可能是 NP 完全问题。
- - 如果问题涉及序列，（如旅行商问题中的城市序列）且难以解决，它可能就是 NP 完全问题。
- - 如果问题涉及集合(如广播台集合)，且难以解决，它可能就是 NP 完全问题。
- - 如果问题可转换为集合覆盖问题或旅行商问题，那它肯定是 NP 完全问题。
-
-- 对于 NP 完全问题，还没有找到快速解决方案。
-- 面临 NP 完全问题，最佳的做法是使用近似算法。
-- 仅当每个子问题都是离散的，即不依赖于其他子问题时，动态规划才管用。
-- 每种动态规则解决方案都涉及网格。
-- 没有放之四海皆准的计算动态规划的公式，**动态规划是一门艺术**。
-- git diff 命令指出两个文件的差异，使用的就是动态规划实现的。
-- 布隆过滤器是一个概率型数据结构，它提供的答案有可能不对，但很可能是正确的。**可能出现错报的情况，但是不可能出现漏报的情况**。布隆过滤器非常适合用于不要求答案绝对准确的情况。
-- 面临海量数据且只要求答案八九不离十时，可考虑使用概率型算法。
-- 当前最安全的密码散列函数是 bcrypt，但没有任何东西是万无一失的。
-- SHA 散列函数是局部不敏感的，有一个字符变化，都会导致其散列值截然不同。有时候希望散列函数是局部敏感的。在这种情况下，可使用 Simhash。如果你对字符串做细微的修改，Simhash 生成的散列值也只存在细微的差别。这让你能够通过比较散列值来判断两个字符串的相似程度。需要检查两项内容的相似程序时，Simhash 很有用。
- - Google 使用 Simhash 来判断网页是否已搜集。
- - 老师可以使用 Simhash 来判断学生的论文是否是从网上抄的。
- - Scribd 允许用户上传文档或图书，以便与人分享，但不希望用户上传有版权的内容。这个网站可使用 Simhash 来检查上传的内容是否与出版的小说类似，如果类似，就自动拒绝。
+- binary search only works if the list is sorted
+
+- Big O notation indicates the **increase**in the running time of the algorithm
+
+- Algorithm runtime is measured in terms of its speedup
+ > A quote from Leigh Caldwell on Stack Overflow, "Your program may be more performant if you use loops; it may be easier to understand if you use recursion. How you choose what to look at is more important to you."
+
+- Every recursive function has two parts, the base case and the recursive case. A recursive condition means that the function calls itself, and a baseline condition means that the function does not call itself any more, thus avoiding an infinite loop.
+
+- Optimize the recursive call stack, there are 2 methods
+
+- Rewrite the code to use loops instead
+
+- Use tail recursion. This is an advanced topic beyond the scope of this book, and not all languages support tail recursion.
+
+- When writing recursive functions involving arrays, the baseline condition is usually that the array is empty or contains only one element.
+ > Functional programming languages like Haskell don't have loops, so you can only write such functions using recursion. Functional programming languages are easier to learn if you have a solid understanding of recursion. If you like recursion or want to learn a new language, check out Haskell.
+
+- To avoid conflicts in the hash table, you need to have:
+
+- lower fill factor
+
+- good hash function
+
+- The edges in a directed graph are arrows, and the direction of the arrow specifies the direction of the relationship. Edges in undirected graphs do not have arrows, where relationships are bidirectional.
+
+- Breadth-first search seeks the shortest path. For the checked points, be sure not to check again, otherwise it will lead to an infinite loop.
+
+- In an undirected graph, each edge is a cycle. Dijkstra's algorithm can only be used on **directed acyclic graph**(directed acyclic graph, DAG). If there are negative weight edges, Dijkstra's algorithm cannot be used.
+
+- In a graph with negative weight edges, the shortest path is required, and the Bellman-Ford algorithm (Bellman-Ford algorithm) is required
+
+- The concept of greedy algorithm: take the optimal solution at each step. The local optimal solution is selected at each step, and finally the global optimal solution is obtained.
+ \-Determine whether the problem is NP-complete
+
+- The algorithm runs very fast with fewer elements, but becomes very slow as the number of elements increases.
+
+- Problems involving "all combinations" are usually NP-complete.
+
+- Problems cannot be broken down into sub-problems, every possible situation must be considered. This may be an NP-complete problem.
+
+- If the problem involves sequences, (like the sequence of cities in the traveling salesman problem) and is hard to solve, it is probably NP-complete.
+
+- If the problem involves sets (like the set of radio stations) and is hard to solve, it is probably NP-complete.
+
+- If the problem can be transformed into a set covering problem or a traveling salesman problem, then it must be NP-complete.
+
+- No fast solutions have been found for NP-complete problems.
+
+- Faced with NP-complete problems, the best course of action is to use approximation algorithms.
+
+- Dynamic programming works only if each subproblem is discrete, i.e. does not depend on other subproblems.
+
+- Every dynamic rule solution involves a grid.
+
+- There is no one-size-fits-all formula for calculating dynamic programming, **dynamic programming is an art**.
+
+- The git diff command points out the difference between two files, which is implemented using dynamic programming.
+
+- A Bloom filter is a probabilistic data structure that provides answers that may not be correct, but are likely to be correct. **Misreporting may occur, but false reporting is impossible**. Bloom filters are great for situations where absolutely accurate answers are not required.
+
+- When faced with massive data and only require the answer to be close to ten, you may consider using a probabilistic algorithm.
+
+- Currently the most secure password hashing function is bcrypt, but nothing is foolproof.
+
+- The SHA hash function is insensitive to locality, and a single character change will cause its hash value to be completely different. Sometimes it is desirable for a hash function to be locality sensitive. In this case, Simhash can be used. If you make slight changes to the string, the hash value generated by Simhash will only be slightly different. This allows you to determine how similar two strings are by comparing the hash values. Simhash is useful when you need a similar program to check two things.
+ - Google uses Simhash to determine whether a page has been collected.
+ - Teachers can use Simhash to judge whether a student's paper is copied from the Internet.
+ - Scribd allows users to upload documents or books to share with others, but does not want users to upload copyrighted content. This site can use Simhash to check whether the uploaded content is similar to the published novel, and automatically reject it if it is similar.
diff --git a/note/time_complexity.md b/note/time_complexity.md
index 237e34f1e..7a707b8f0 100644
--- a/note/time_complexity.md
+++ b/note/time_complexity.md
@@ -1,30 +1,28 @@
-# 时间复杂度和空间复杂度
+# time complexity and space complexity
+## 1. Time complexity data scale
-## 一. 时间复杂度数据规模
+The data size that can solve the problem within 1s: 10^6 ~ 10^7
-1s 内能解决问题的数据规模：10^6 ~ 10^7
+- O(n^2) algorithm can handle data scale of 10^4 level (conservative estimate, it is definitely no problem to deal with 1000 level problems)
+- O(n) algorithm can handle data scale of 10^8 level (conservative estimate, it is definitely no problem to deal with 10^7 level problems)
+- O(nlog n) algorithm can handle data scale of 10^7 level (conservative estimate, it is definitely no problem to deal with 10^6 level problems)
-- O(n^2) 算法可以处理 10^4 级别的数据规模(保守估计，处理 1000 级别的问题肯定没问题)
-- O(n) 算法可以处理 10^8 级别的数据规模(保守估计，处理 10^7 级别的问题肯定没问题)
-- O(nlog n) 算法可以处理 10^7 级别的数据规模(保守估计，处理 10^6 级别的问题肯定没问题)
+| | Data size | Time complexity | Algorithm example |
+|:---:|:----------|:----------------|:-----------------------------------------------------------------------------------------|
+| 1 | 10 | O(n!) | permutations |
+| 2 | 20~30 | O(2^n) | combination |
+| 3 | 50 | O(n^4) | DFS search,
DP dynamic programming |
+| 4 | 100 | O(n^3) | The shortest path between any two points,
DP dynamic programming |
+| 5 | 1000 | O(n^2) | Dense graph, DP dynamic programming |
+| 6 | 10^6 | O(nlog n) | sorting,
heap,
recursion and divide and conquer |
+| 7 | 10^7 | O(n) | DP dynamic programming,
graph traversal,
topological sorting,
tree traversal |
+| 8 | 10^9 | O(sqrt(n)) | Sieve prime numbers,
find square root |
+| 9 | 10^10 | O(log n) | Binary Search |
+| 10 | +∞ | O(1) | Mathematics-related algorithms |
+| | | | |
-| | 数据规模|时间复杂度 | 算法举例|
-|:------:|:------:|:------:|:------:|
-|1|10|O(n!)|permutation 排列|
-|2|20~30|O(2^n)|combination 组合|
-|3|50|O(n^4)|DFS 搜索、DP 动态规划|
-|4|100|O(n^3)|任意两点最短路径、DP 动态规划|
-|5|1000|O(n^2)|稠密图、DP 动态规划|
-|6|10^6|O(nlog n)|排序，堆，递归与分治|
-|7|10^7|O(n)|DP 动态规划、图遍历、拓扑排序、树遍历|
-|8|10^9|O(sqrt(n))|筛素数、求平方根|
-|9|10^10|O(log n)|二分搜索|
-|10|+∞|O(1)|数学相关算法|
-|----------------|----------------|------------------------------------------------------------------|--------------------------------|
-
-
-一些具有迷惑性的例子：
+Some deceptive examples:
```c
void hello (int n){
@@ -35,29 +33,27 @@ void hello (int n){
}
```
-上面这段代码的时间复杂度是 O(nlog n) 而不是 O(n^2)
+The time complexity of the above code is O(nlog n) instead of O(n^2)
```c
-bool isPrime (int n){
-
- for( int x = 2 ; x * x <= n ; x ++ )
+bool isPrime(int n){
+for( int x = 2 ; x *x <= n ; x ++ )
if( n % x == 0)
return false;
return true;
}
```
-上面这段代码的时间复杂度是 O(sqrt(n)) 而不是 O(n)。
+The time complexity of the above code is O(sqrt(n)) instead of O(n).
-再举一个例子，有一个字符串数组，将数组中的每一个字符串按照字母序排序，之后再将整个字符串数组按照字典序排序。两步操作的整体时间复杂度是多少呢？
+To give another example, there is an array of strings, sort each string in the array alphabetically, and then sort the entire string array lexicographically. What is the overall time complexity of the two-step operation?
-如果回答是 O(n*nlog n + nlog n) = O(n^2log n)，这个答案是错误的。字符串的长度和数组的长度是没有关系的，所以这两个变量应该单独计算。假设最长的字符串长度为 s，数组中有 n 个字符串。对每个字符串排序的时间复杂度是 O(slog s)，将数组中每个字符串都按照字母序排序的时间复杂度是 O(n * slog s)。
+If the answer is O(n_nlog n + nlog n) = O(n^2log n), the answer is wrong. The length of the string and the length of the array are irrelevant, so these two variables should be calculated separately. Suppose the longest string has length s and there are n strings in the array. The time complexity of sorting each string is O(slog s), and the time complexity of sorting each string in alphabetical order in the array is O(n \_slog s).
+The time complexity of sorting the entire string array lexicographically is O(s \_nlog n). O(nlog n) in the sorting algorithm is the number of comparisons. Since the comparison is an integer number, each comparison is O(1). But strings are compared lexicographically, and the time complexity is O(s). So the time complexity of sorting an array of strings lexicographically is O(s \_nlog n). So the overall complexity is O(n \_slog s) + O(s \_nlog n) = O(n\*slog s + s\*nlogn) = O(n\*s\*(log s + log n) )
-将整个字符串数组按照字典序排序的时间复杂度是 O(s * nlog n)。排序算法中的 O(nlog n) 是比较的次数，由于比较的是整型数字，所以每次比较是 O(1)。但是字符串按照字典序比较，时间复杂度是 O(s)。所以字符串数组按照字典序排序的时间复杂度是 O(s * nlog n)。所以整体复杂度是 O(n * slog s) + O(s * nlog n) = O(n\*slog s + s\*nlogn) = O(n\*s\*(log s + log n))
+## Two. Space complexity
-## 二. 空间复杂度
-
-递归调用是有空间代价的，递归算法需要保存递归栈信息，所以花费的空间复杂度会比非递归算法要高。
+The recursive call has a space cost, and the recursive algorithm needs to save the recursive stack information, so the space complexity spent will be higher than that of the non-recursive algorithm.
```c
int sum( int n ){
@@ -69,59 +65,57 @@ int sum( int n ){
}
```
-上面算法的时间复杂度为 O(n)，空间复杂度 O(1)。
+The time complexity of the above algorithm is O(n), and the space complexity is O(1).
```c
int sum( int n ){
assert( n >= 0 )
if ( n == 0 )
return 0;
- return n + sum( n - 1);
+ return n + sum( n -1);
}
```
-上面算法的时间复杂度为 O(n)，空间复杂度 O(n)。
+The time complexity of the above algorithm is O(n), and the space complexity is O(n).
-## 三. 递归的时间复杂度
+## 3. Time complexity of recursion
-### 只有一次递归调用
+### Only one recursive call
-如果递归函数中，只进行了一次递归调用，且递归深度为 depth，在每个递归函数中，时间复杂度为 T，那么总体的时间复杂度为 O(T * depth)
+If only one recursive call is made in the recursive function, and the recursive depth is depth, and in each recursive function, the time complexity is T, then the overall time complexity is O(T \*depth)
-举个例子：
+for example:
```c
int binarySearch(int arr[], int l, int r, int target){
- if( l > r)
- return -1;
- int mid = l + (r-l)/2;//防溢出
+if( l > r)
+return -1;
+ int mid = l + (r-l)/2;//anti-overflow
if(arr[mid] == target)
return mid;
else if (arr[mid]>target)
return binarySearch(arr,l,mid-1,target);
- eles
- return binarySearch(arr,mid+1,r,target);
+ else
+ return binarySearch(arr, mid+1, r, target);
}
```
-在二分查找的递归实现中，只递归调用了自身。递归深度是 log n ，每次递归里面的复杂度是 O(1) 的，所以二分查找的递归实现的时间复杂度为 O(log n) 的。
-
+In the recursive implementation of binary search, only itself is called recursively. The recursion depth is log n, and the complexity of each recursion is O(1), so the time complexity of the recursive implementation of binary search is O(log n).
-### 只有多次递归调用
+### Only multiple recursive calls
-针对多次递归调用的情况，就需要看它的计算调用的次数了。通常可以画一颗递归树来看。举例：
+For the case of multiple recursive calls, you need to look at the number of times it is calculated and called. Usually you can draw a recursive tree to see. Example:
```c
int f(int n){
assert( n >= 0 );
if( n ==0 )
return 1;
- return f( n - 1 ) + f ( n - 1 );
+ return f( n -1 ) + f ( n -1 );
```
-上述这次递归调用的次数为 2^0^ + 2^1^ + 2^2^ + …… + 2^n^ = 2^n+1^ - 1 = O(2^n)
-
+The number of recursive calls above is 2^0^ + 2^1^ + 2^2^ + ... + 2^n^ = 2^n+1^ -1 = O(2^n)
-> 关于更加复杂的递归的复杂度分析，请参考，主定理。主定理中针对各种复杂情况都给出了正确的结论。
\ No newline at end of file
+> For the complexity analysis of more complex recursion, please refer to, the main theorem. The main theorem gives correct conclusions for various complex situations.
diff --git a/tmp/array-graphql.json b/tmp/array-graphql.json
new file mode 100644
index 000000000..02c5fdf81
--- /dev/null
+++ b/tmp/array-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"Array","translatedName":null,"slug":"array","questions":[{"status":null,"questionId":"1","questionFrontendId":"1","title":"Two Sum","titleSlug":"two-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2M\", \"totalSubmission\": \"18.5M\", \"totalAcceptedRaw\": 9176711, \"totalSubmissionRaw\": 18503038, \"acRate\": \"49.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"4","questionFrontendId":"4","title":"Median of Two Sorted Arrays","titleSlug":"median-of-two-sorted-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.8M\", \"totalSubmission\": \"5.1M\", \"totalAcceptedRaw\": 1826683, \"totalSubmissionRaw\": 5065626, \"acRate\": \"36.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"11","questionFrontendId":"11","title":"Container With Most Water","titleSlug":"container-with-most-water","translatedTitle":null,"stats":"{\"totalAccepted\": \"2M\", \"totalSubmission\": \"3.7M\", \"totalAcceptedRaw\": 2009027, \"totalSubmissionRaw\": 3718468, \"acRate\": \"54.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"15","questionFrontendId":"15","title":"3Sum","titleSlug":"3sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.6M\", \"totalSubmission\": \"7.8M\", \"totalAcceptedRaw\": 2554405, \"totalSubmissionRaw\": 7849967, \"acRate\": \"32.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"16","questionFrontendId":"16","title":"3Sum Closest","titleSlug":"3sum-closest","translatedTitle":null,"stats":"{\"totalAccepted\": \"1M\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 1004216, \"totalSubmissionRaw\": 2192777, \"acRate\": \"45.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"18","questionFrontendId":"18","title":"4Sum","titleSlug":"4sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"715.9K\", \"totalSubmission\": \"2M\", \"totalAcceptedRaw\": 715871, \"totalSubmissionRaw\": 1990148, \"acRate\": \"36.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"26","questionFrontendId":"26","title":"Remove Duplicates from Sorted Array","titleSlug":"remove-duplicates-from-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.8M\", \"totalSubmission\": \"5.5M\", \"totalAcceptedRaw\": 2848548, \"totalSubmissionRaw\": 5536166, \"acRate\": \"51.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"27","questionFrontendId":"27","title":"Remove Element","titleSlug":"remove-element","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.7M\", \"totalSubmission\": \"3.2M\", \"totalAcceptedRaw\": 1706899, \"totalSubmissionRaw\": 3226735, \"acRate\": \"52.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"31","questionFrontendId":"31","title":"Next Permutation","titleSlug":"next-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"1M\", \"totalSubmission\": \"2.7M\", \"totalAcceptedRaw\": 1005065, \"totalSubmissionRaw\": 2681663, \"acRate\": \"37.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"33","questionFrontendId":"33","title":"Search in Rotated Sorted Array","titleSlug":"search-in-rotated-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"2M\", \"totalSubmission\": \"5M\", \"totalAcceptedRaw\": 1957790, \"totalSubmissionRaw\": 5027237, \"acRate\": \"38.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"34","questionFrontendId":"34","title":"Find First and Last Position of Element in Sorted Array","titleSlug":"find-first-and-last-position-of-element-in-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5M\", \"totalSubmission\": \"3.5M\", \"totalAcceptedRaw\": 1479128, \"totalSubmissionRaw\": 3535837, \"acRate\": \"41.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"35","questionFrontendId":"35","title":"Search Insert Position","titleSlug":"search-insert-position","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.1M\", \"totalSubmission\": \"4.8M\", \"totalAcceptedRaw\": 2093941, \"totalSubmissionRaw\": 4836990, \"acRate\": \"43.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"36","questionFrontendId":"36","title":"Valid Sudoku","titleSlug":"valid-sudoku","translatedTitle":null,"stats":"{\"totalAccepted\": \"1M\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 1049236, \"totalSubmissionRaw\": 1808029, \"acRate\": \"58.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"37","questionFrontendId":"37","title":"Sudoku Solver","titleSlug":"sudoku-solver","translatedTitle":null,"stats":"{\"totalAccepted\": \"444.1K\", \"totalSubmission\": \"771.6K\", \"totalAcceptedRaw\": 444094, \"totalSubmissionRaw\": 771588, \"acRate\": \"57.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"39","questionFrontendId":"39","title":"Combination Sum","titleSlug":"combination-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 1417523, \"totalSubmissionRaw\": 2069175, \"acRate\": \"68.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"40","questionFrontendId":"40","title":"Combination Sum II","titleSlug":"combination-sum-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"718.7K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 718708, \"totalSubmissionRaw\": 1345776, \"acRate\": \"53.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"41","questionFrontendId":"41","title":"First Missing Positive","titleSlug":"first-missing-positive","translatedTitle":null,"stats":"{\"totalAccepted\": \"850.3K\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 850288, \"totalSubmissionRaw\": 2318305, \"acRate\": \"36.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"42","questionFrontendId":"42","title":"Trapping Rain Water","titleSlug":"trapping-rain-water","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5M\", \"totalSubmission\": \"2.5M\", \"totalAcceptedRaw\": 1475865, \"totalSubmissionRaw\": 2493706, \"acRate\": \"59.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"45","questionFrontendId":"45","title":"Jump Game II","titleSlug":"jump-game-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"859.9K\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 859881, \"totalSubmissionRaw\": 2160398, \"acRate\": \"39.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"46","questionFrontendId":"46","title":"Permutations","titleSlug":"permutations","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5M\", \"totalSubmission\": \"2M\", \"totalAcceptedRaw\": 1523085, \"totalSubmissionRaw\": 2015200, \"acRate\": \"75.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"47","questionFrontendId":"47","title":"Permutations II","titleSlug":"permutations-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"767.3K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 767320, \"totalSubmissionRaw\": 1339334, \"acRate\": \"57.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"48","questionFrontendId":"48","title":"Rotate Image","titleSlug":"rotate-image","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"1.7M\", \"totalAcceptedRaw\": 1232625, \"totalSubmissionRaw\": 1739071, \"acRate\": \"70.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"49","questionFrontendId":"49","title":"Group Anagrams","titleSlug":"group-anagrams","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.9M\", \"totalSubmission\": \"2.8M\", \"totalAcceptedRaw\": 1881058, \"totalSubmissionRaw\": 2819376, \"acRate\": \"66.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"51","questionFrontendId":"51","title":"N-Queens","titleSlug":"n-queens","translatedTitle":null,"stats":"{\"totalAccepted\": \"523.9K\", \"totalSubmission\": \"817.9K\", \"totalAcceptedRaw\": 523860, \"totalSubmissionRaw\": 817937, \"acRate\": \"64.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"53","questionFrontendId":"53","title":"Maximum Subarray","titleSlug":"maximum-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.1M\", \"totalSubmission\": \"6.1M\", \"totalAcceptedRaw\": 3055862, \"totalSubmissionRaw\": 6092396, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"54","questionFrontendId":"54","title":"Spiral Matrix","titleSlug":"spiral-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"984K\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 983989, \"totalSubmissionRaw\": 2196720, \"acRate\": \"44.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"55","questionFrontendId":"55","title":"Jump Game","titleSlug":"jump-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"3.4M\", \"totalAcceptedRaw\": 1342331, \"totalSubmissionRaw\": 3449858, \"acRate\": \"38.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"56","questionFrontendId":"56","title":"Merge Intervals","titleSlug":"merge-intervals","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.8M\", \"totalSubmission\": \"4M\", \"totalAcceptedRaw\": 1823295, \"totalSubmissionRaw\": 3950102, \"acRate\": \"46.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"57","questionFrontendId":"57","title":"Insert Interval","titleSlug":"insert-interval","translatedTitle":null,"stats":"{\"totalAccepted\": \"737.8K\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 737835, \"totalSubmissionRaw\": 1891578, \"acRate\": \"39.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"59","questionFrontendId":"59","title":"Spiral Matrix II","titleSlug":"spiral-matrix-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"427.4K\", \"totalSubmission\": \"635.2K\", \"totalAcceptedRaw\": 427370, \"totalSubmissionRaw\": 635165, \"acRate\": \"67.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"63","questionFrontendId":"63","title":"Unique Paths II","titleSlug":"unique-paths-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"660.4K\", \"totalSubmission\": \"1.7M\", \"totalAcceptedRaw\": 660407, \"totalSubmissionRaw\": 1677550, \"acRate\": \"39.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"64","questionFrontendId":"64","title":"Minimum Path Sum","titleSlug":"minimum-path-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"858.2K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 858250, \"totalSubmissionRaw\": 1404839, \"acRate\": \"61.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"66","questionFrontendId":"66","title":"Plus One","titleSlug":"plus-one","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6M\", \"totalSubmission\": \"3.7M\", \"totalAcceptedRaw\": 1605878, \"totalSubmissionRaw\": 3679056, \"acRate\": \"43.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"68","questionFrontendId":"68","title":"Text Justification","titleSlug":"text-justification","translatedTitle":null,"stats":"{\"totalAccepted\": \"288K\", \"totalSubmission\": \"771K\", \"totalAcceptedRaw\": 288035, \"totalSubmissionRaw\": 770959, \"acRate\": \"37.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"73","questionFrontendId":"73","title":"Set Matrix Zeroes","titleSlug":"set-matrix-zeroes","translatedTitle":null,"stats":"{\"totalAccepted\": \"945.3K\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 945320, \"totalSubmissionRaw\": 1850835, \"acRate\": \"51.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"74","questionFrontendId":"74","title":"Search a 2D Matrix","titleSlug":"search-a-2d-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"2.4M\", \"totalAcceptedRaw\": 1162197, \"totalSubmissionRaw\": 2441739, \"acRate\": \"47.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"75","questionFrontendId":"75","title":"Sort Colors","titleSlug":"sort-colors","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 1365670, \"totalSubmissionRaw\": 2339162, \"acRate\": \"58.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"78","questionFrontendId":"78","title":"Subsets","titleSlug":"subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 1396111, \"totalSubmissionRaw\": 1866728, \"acRate\": \"74.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"79","questionFrontendId":"79","title":"Word Search","titleSlug":"word-search","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"3.1M\", \"totalAcceptedRaw\": 1243447, \"totalSubmissionRaw\": 3092559, \"acRate\": \"40.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"80","questionFrontendId":"80","title":"Remove Duplicates from Sorted Array II","titleSlug":"remove-duplicates-from-sorted-array-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"492.5K\", \"totalSubmission\": \"943.4K\", \"totalAcceptedRaw\": 492467, \"totalSubmissionRaw\": 943351, \"acRate\": \"52.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"81","questionFrontendId":"81","title":"Search in Rotated Sorted Array II","titleSlug":"search-in-rotated-sorted-array-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"498.6K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 498589, \"totalSubmissionRaw\": 1395704, \"acRate\": \"35.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"84","questionFrontendId":"84","title":"Largest Rectangle in Histogram","titleSlug":"largest-rectangle-in-histogram","translatedTitle":null,"stats":"{\"totalAccepted\": \"646.6K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 646589, \"totalSubmissionRaw\": 1520203, \"acRate\": \"42.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"85","questionFrontendId":"85","title":"Maximal Rectangle","titleSlug":"maximal-rectangle","translatedTitle":null,"stats":"{\"totalAccepted\": \"338K\", \"totalSubmission\": \"756.6K\", \"totalAcceptedRaw\": 337961, \"totalSubmissionRaw\": 756591, \"acRate\": \"44.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"88","questionFrontendId":"88","title":"Merge Sorted Array","titleSlug":"merge-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.9M\", \"totalSubmission\": \"4.1M\", \"totalAcceptedRaw\": 1924442, \"totalSubmissionRaw\": 4139391, \"acRate\": \"46.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"90","questionFrontendId":"90","title":"Subsets II","titleSlug":"subsets-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"675.4K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 675418, \"totalSubmissionRaw\": 1210151, \"acRate\": \"55.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"105","questionFrontendId":"105","title":"Construct Binary Tree from Preorder and Inorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"936.4K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 936442, \"totalSubmissionRaw\": 1524460, \"acRate\": \"61.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"106","questionFrontendId":"106","title":"Construct Binary Tree from Inorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"465K\", \"totalSubmission\": \"800.1K\", \"totalAcceptedRaw\": 465028, \"totalSubmissionRaw\": 800148, \"acRate\": \"58.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"108","questionFrontendId":"108","title":"Convert Sorted Array to Binary Search Tree","titleSlug":"convert-sorted-array-to-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"963.7K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 963738, \"totalSubmissionRaw\": 1381800, \"acRate\": \"69.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"118","questionFrontendId":"118","title":"Pascal's Triangle","titleSlug":"pascals-triangle","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"1.7M\", \"totalAcceptedRaw\": 1169123, \"totalSubmissionRaw\": 1656698, \"acRate\": \"70.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"119","questionFrontendId":"119","title":"Pascal's Triangle II","titleSlug":"pascals-triangle-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"656.6K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 656555, \"totalSubmissionRaw\": 1083035, \"acRate\": \"60.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"120","questionFrontendId":"120","title":"Triangle","titleSlug":"triangle","translatedTitle":null,"stats":"{\"totalAccepted\": \"572.9K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 572885, \"totalSubmissionRaw\": 1053219, \"acRate\": \"54.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"121","questionFrontendId":"121","title":"Best Time to Buy and Sell Stock","titleSlug":"best-time-to-buy-and-sell-stock","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.2M\", \"totalSubmission\": \"5.8M\", \"totalAcceptedRaw\": 3175535, \"totalSubmissionRaw\": 5843512, \"acRate\": \"54.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"122","questionFrontendId":"122","title":"Best Time to Buy and Sell Stock II","titleSlug":"best-time-to-buy-and-sell-stock-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 1395174, \"totalSubmissionRaw\": 2185706, \"acRate\": \"63.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"123","questionFrontendId":"123","title":"Best Time to Buy and Sell Stock III","titleSlug":"best-time-to-buy-and-sell-stock-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"466.5K\", \"totalSubmission\": \"1M\", \"totalAcceptedRaw\": 466531, \"totalSubmissionRaw\": 1027308, \"acRate\": \"45.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"128","questionFrontendId":"128","title":"Longest Consecutive Sequence","titleSlug":"longest-consecutive-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 1061067, \"totalSubmissionRaw\": 2184758, \"acRate\": \"48.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"130","questionFrontendId":"130","title":"Surrounded Regions","titleSlug":"surrounded-regions","translatedTitle":null,"stats":"{\"totalAccepted\": \"517.6K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 517587, \"totalSubmissionRaw\": 1412315, \"acRate\": \"36.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"134","questionFrontendId":"134","title":"Gas Station","titleSlug":"gas-station","translatedTitle":null,"stats":"{\"totalAccepted\": \"573.2K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 573177, \"totalSubmissionRaw\": 1244287, \"acRate\": \"46.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"135","questionFrontendId":"135","title":"Candy","titleSlug":"candy","translatedTitle":null,"stats":"{\"totalAccepted\": \"300.3K\", \"totalSubmission\": \"733K\", \"totalAcceptedRaw\": 300344, \"totalSubmissionRaw\": 732959, \"acRate\": \"41.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"136","questionFrontendId":"136","title":"Single Number","titleSlug":"single-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.1M\", \"totalSubmission\": \"3M\", \"totalAcceptedRaw\": 2091400, \"totalSubmissionRaw\": 2962619, \"acRate\": \"70.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"137","questionFrontendId":"137","title":"Single Number II","titleSlug":"single-number-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"402.5K\", \"totalSubmission\": \"689.3K\", \"totalAcceptedRaw\": 402487, \"totalSubmissionRaw\": 689272, \"acRate\": \"58.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"139","questionFrontendId":"139","title":"Word Break","titleSlug":"word-break","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"2.9M\", \"totalAcceptedRaw\": 1302318, \"totalSubmissionRaw\": 2858470, \"acRate\": \"45.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"140","questionFrontendId":"140","title":"Word Break II","titleSlug":"word-break-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"507.3K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 507264, \"totalSubmissionRaw\": 1122470, \"acRate\": \"45.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"149","questionFrontendId":"149","title":"Max Points on a Line","titleSlug":"max-points-on-a-line","translatedTitle":null,"stats":"{\"totalAccepted\": \"333K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 332985, \"totalSubmissionRaw\": 1328047, \"acRate\": \"25.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"150","questionFrontendId":"150","title":"Evaluate Reverse Polish Notation","titleSlug":"evaluate-reverse-polish-notation","translatedTitle":null,"stats":"{\"totalAccepted\": \"632.6K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 632644, \"totalSubmissionRaw\": 1385846, \"acRate\": \"45.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"152","questionFrontendId":"152","title":"Maximum Product Subarray","titleSlug":"maximum-product-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"967K\", \"totalSubmission\": \"2.8M\", \"totalAcceptedRaw\": 966950, \"totalSubmissionRaw\": 2773061, \"acRate\": \"34.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"153","questionFrontendId":"153","title":"Find Minimum in Rotated Sorted Array","titleSlug":"find-minimum-in-rotated-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"2.5M\", \"totalAcceptedRaw\": 1242104, \"totalSubmissionRaw\": 2544456, \"acRate\": \"48.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"154","questionFrontendId":"154","title":"Find Minimum in Rotated Sorted Array II","titleSlug":"find-minimum-in-rotated-sorted-array-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"377.6K\", \"totalSubmission\": \"868.4K\", \"totalAcceptedRaw\": 377618, \"totalSubmissionRaw\": 868410, \"acRate\": \"43.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"162","questionFrontendId":"162","title":"Find Peak Element","titleSlug":"find-peak-element","translatedTitle":null,"stats":"{\"totalAccepted\": \"983.2K\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 983234, \"totalSubmissionRaw\": 2135700, \"acRate\": \"46.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"163","questionFrontendId":"163","title":"Missing Ranges","titleSlug":"missing-ranges","translatedTitle":null,"stats":"{\"totalAccepted\": \"197.4K\", \"totalSubmission\": \"613.2K\", \"totalAcceptedRaw\": 197395, \"totalSubmissionRaw\": 613190, \"acRate\": \"32.2%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"164","questionFrontendId":"164","title":"Maximum Gap","titleSlug":"maximum-gap","translatedTitle":null,"stats":"{\"totalAccepted\": \"163.9K\", \"totalSubmission\": \"379K\", \"totalAcceptedRaw\": 163928, \"totalSubmissionRaw\": 379019, \"acRate\": \"43.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Bucket Sort","translatedName":null,"slug":"bucket-sort","__typename":"TopicTagNode"},{"name":"Radix Sort","translatedName":null,"slug":"radix-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"167","questionFrontendId":"167","title":"Two Sum II - Input Array Is Sorted","titleSlug":"two-sum-ii-input-array-is-sorted","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 1398154, \"totalSubmissionRaw\": 2329074, \"acRate\": \"60.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"169","questionFrontendId":"169","title":"Majority Element","titleSlug":"majority-element","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6M\", \"totalSubmission\": \"2.6M\", \"totalAcceptedRaw\": 1646153, \"totalSubmissionRaw\": 2575601, \"acRate\": \"63.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"170","questionFrontendId":"170","title":"Two Sum III - Data structure design","titleSlug":"two-sum-iii-data-structure-design","translatedTitle":null,"stats":"{\"totalAccepted\": \"139.9K\", \"totalSubmission\": \"374.1K\", \"totalAcceptedRaw\": 139886, \"totalSubmissionRaw\": 374090, \"acRate\": \"37.4%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"174","questionFrontendId":"174","title":"Dungeon Game","titleSlug":"dungeon-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"195.4K\", \"totalSubmission\": \"521.2K\", \"totalAcceptedRaw\": 195392, \"totalSubmissionRaw\": 521249, \"acRate\": \"37.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"179","questionFrontendId":"179","title":"Largest Number","titleSlug":"largest-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"383.3K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 383285, \"totalSubmissionRaw\": 1111221, \"acRate\": \"34.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"188","questionFrontendId":"188","title":"Best Time to Buy and Sell Stock IV","titleSlug":"best-time-to-buy-and-sell-stock-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"348.9K\", \"totalSubmission\": \"898.9K\", \"totalAcceptedRaw\": 348859, \"totalSubmissionRaw\": 898875, \"acRate\": \"38.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"189","questionFrontendId":"189","title":"Rotate Array","titleSlug":"rotate-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"3.6M\", \"totalAcceptedRaw\": 1436124, \"totalSubmissionRaw\": 3648270, \"acRate\": \"39.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"198","questionFrontendId":"198","title":"House Robber","titleSlug":"house-robber","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6M\", \"totalSubmission\": \"3.2M\", \"totalAcceptedRaw\": 1555677, \"totalSubmissionRaw\": 3150913, \"acRate\": \"49.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"200","questionFrontendId":"200","title":"Number of Islands","titleSlug":"number-of-islands","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.1M\", \"totalSubmission\": \"3.7M\", \"totalAcceptedRaw\": 2091353, \"totalSubmissionRaw\": 3673734, \"acRate\": \"56.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"204","questionFrontendId":"204","title":"Count Primes","titleSlug":"count-primes","translatedTitle":null,"stats":"{\"totalAccepted\": \"714.7K\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 714662, \"totalSubmissionRaw\": 2158912, \"acRate\": \"33.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"209","questionFrontendId":"209","title":"Minimum Size Subarray Sum","titleSlug":"minimum-size-subarray-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"673.1K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 673091, \"totalSubmissionRaw\": 1498174, \"acRate\": \"44.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"212","questionFrontendId":"212","title":"Word Search II","titleSlug":"word-search-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"547.8K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 547761, \"totalSubmissionRaw\": 1501670, \"acRate\": \"36.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"213","questionFrontendId":"213","title":"House Robber II","titleSlug":"house-robber-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"556.2K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 556192, \"totalSubmissionRaw\": 1356795, \"acRate\": \"41.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"215","questionFrontendId":"215","title":"Kth Largest Element in an Array","titleSlug":"kth-largest-element-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.7M\", \"totalSubmission\": \"2.6M\", \"totalAcceptedRaw\": 1694440, \"totalSubmissionRaw\": 2562929, \"acRate\": \"66.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Quickselect","translatedName":null,"slug":"quickselect","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"216","questionFrontendId":"216","title":"Combination Sum III","titleSlug":"combination-sum-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"391.2K\", \"totalSubmission\": \"579.1K\", \"totalAcceptedRaw\": 391236, \"totalSubmissionRaw\": 579069, \"acRate\": \"67.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"217","questionFrontendId":"217","title":"Contains Duplicate","titleSlug":"contains-duplicate","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.6M\", \"totalSubmission\": \"4.2M\", \"totalAcceptedRaw\": 2571766, \"totalSubmissionRaw\": 4187672, \"acRate\": \"61.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"218","questionFrontendId":"218","title":"The Skyline Problem","titleSlug":"the-skyline-problem","translatedTitle":null,"stats":"{\"totalAccepted\": \"261.1K\", \"totalSubmission\": \"624.5K\", \"totalAcceptedRaw\": 261105, \"totalSubmissionRaw\": 624489, \"acRate\": \"41.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Line Sweep","translatedName":null,"slug":"line-sweep","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"219","questionFrontendId":"219","title":"Contains Duplicate II","titleSlug":"contains-duplicate-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"649K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 649014, \"totalSubmissionRaw\": 1526459, \"acRate\": \"42.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"220","questionFrontendId":"220","title":"Contains Duplicate III","titleSlug":"contains-duplicate-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"226.7K\", \"totalSubmission\": \"1M\", \"totalAcceptedRaw\": 226731, \"totalSubmissionRaw\": 1025014, \"acRate\": \"22.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Bucket Sort","translatedName":null,"slug":"bucket-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"221","questionFrontendId":"221","title":"Maximal Square","titleSlug":"maximal-square","translatedTitle":null,"stats":"{\"totalAccepted\": \"570.5K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 570519, \"totalSubmissionRaw\": 1270376, \"acRate\": \"44.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"228","questionFrontendId":"228","title":"Summary Ranges","titleSlug":"summary-ranges","translatedTitle":null,"stats":"{\"totalAccepted\": \"339.2K\", \"totalSubmission\": \"719.3K\", \"totalAcceptedRaw\": 339159, \"totalSubmissionRaw\": 719311, \"acRate\": \"47.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"229","questionFrontendId":"229","title":"Majority Element II","titleSlug":"majority-element-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"385.4K\", \"totalSubmission\": \"857.4K\", \"totalAcceptedRaw\": 385433, \"totalSubmissionRaw\": 857447, \"acRate\": \"45.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"238","questionFrontendId":"238","title":"Product of Array Except Self","titleSlug":"product-of-array-except-self","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6M\", \"totalSubmission\": \"2.4M\", \"totalAcceptedRaw\": 1559088, \"totalSubmissionRaw\": 2397514, \"acRate\": \"65.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"239","questionFrontendId":"239","title":"Sliding Window Maximum","titleSlug":"sliding-window-maximum","translatedTitle":null,"stats":"{\"totalAccepted\": \"734.3K\", \"totalSubmission\": \"1.6M\", \"totalAcceptedRaw\": 734312, \"totalSubmissionRaw\": 1584674, \"acRate\": \"46.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"240","questionFrontendId":"240","title":"Search a 2D Matrix II","titleSlug":"search-a-2d-matrix-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"771.1K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 771112, \"totalSubmissionRaw\": 1512862, \"acRate\": \"51.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"243","questionFrontendId":"243","title":"Shortest Word Distance","titleSlug":"shortest-word-distance","translatedTitle":null,"stats":"{\"totalAccepted\": \"199.1K\", \"totalSubmission\": \"306.4K\", \"totalAcceptedRaw\": 199141, \"totalSubmissionRaw\": 306377, \"acRate\": \"65.0%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"244","questionFrontendId":"244","title":"Shortest Word Distance II","titleSlug":"shortest-word-distance-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"146.1K\", \"totalSubmission\": \"240.2K\", \"totalAcceptedRaw\": 146141, \"totalSubmissionRaw\": 240211, \"acRate\": \"60.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"245","questionFrontendId":"245","title":"Shortest Word Distance III","titleSlug":"shortest-word-distance-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"74K\", \"totalSubmission\": \"128.5K\", \"totalAcceptedRaw\": 73999, \"totalSubmissionRaw\": 128464, \"acRate\": \"57.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"247","questionFrontendId":"247","title":"Strobogrammatic Number II","titleSlug":"strobogrammatic-number-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"128.3K\", \"totalSubmission\": \"248.9K\", \"totalAcceptedRaw\": 128260, \"totalSubmissionRaw\": 248883, \"acRate\": \"51.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"248","questionFrontendId":"248","title":"Strobogrammatic Number III","titleSlug":"strobogrammatic-number-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.3K\", \"totalSubmission\": \"84.2K\", \"totalAcceptedRaw\": 35319, \"totalSubmissionRaw\": 84247, \"acRate\": \"41.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"249","questionFrontendId":"249","title":"Group Shifted Strings","titleSlug":"group-shifted-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"189.4K\", \"totalSubmission\": \"294.5K\", \"totalAcceptedRaw\": 189449, \"totalSubmissionRaw\": 294518, \"acRate\": \"64.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"251","questionFrontendId":"251","title":"Flatten 2D Vector","titleSlug":"flatten-2d-vector","translatedTitle":null,"stats":"{\"totalAccepted\": \"118.5K\", \"totalSubmission\": \"241.2K\", \"totalAcceptedRaw\": 118485, \"totalSubmissionRaw\": 241220, \"acRate\": \"49.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Iterator","translatedName":null,"slug":"iterator","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"252","questionFrontendId":"252","title":"Meeting Rooms","titleSlug":"meeting-rooms","translatedTitle":null,"stats":"{\"totalAccepted\": \"334.5K\", \"totalSubmission\": \"584.4K\", \"totalAcceptedRaw\": 334480, \"totalSubmissionRaw\": 584405, \"acRate\": \"57.2%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"253","questionFrontendId":"253","title":"Meeting Rooms II","titleSlug":"meeting-rooms-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"767K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 767005, \"totalSubmissionRaw\": 1517236, \"acRate\": \"50.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"254","questionFrontendId":"254","title":"Factor Combinations","titleSlug":"factor-combinations","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.4K\", \"totalSubmission\": \"243.4K\", \"totalAcceptedRaw\": 119429, \"totalSubmissionRaw\": 243415, \"acRate\": \"49.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"256","questionFrontendId":"256","title":"Paint House","titleSlug":"paint-house","translatedTitle":null,"stats":"{\"totalAccepted\": \"184.2K\", \"totalSubmission\": \"301.8K\", \"totalAcceptedRaw\": 184156, \"totalSubmissionRaw\": 301759, \"acRate\": \"61.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"259","questionFrontendId":"259","title":"3Sum Smaller","titleSlug":"3sum-smaller","translatedTitle":null,"stats":"{\"totalAccepted\": \"133.4K\", \"totalSubmission\": \"263.2K\", \"totalAcceptedRaw\": 133353, \"totalSubmissionRaw\": 263193, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"260","questionFrontendId":"260","title":"Single Number III","titleSlug":"single-number-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"291.8K\", \"totalSubmission\": \"431.4K\", \"totalAcceptedRaw\": 291819, \"totalSubmissionRaw\": 431415, \"acRate\": \"67.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"265","questionFrontendId":"265","title":"Paint House II","titleSlug":"paint-house-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"108.4K\", \"totalSubmission\": \"205K\", \"totalAcceptedRaw\": 108378, \"totalSubmissionRaw\": 204977, \"acRate\": \"52.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"268","questionFrontendId":"268","title":"Missing Number","titleSlug":"missing-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 1431785, \"totalSubmissionRaw\": 2293208, \"acRate\": \"62.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"269","questionFrontendId":"269","title":"Alien Dictionary","titleSlug":"alien-dictionary","translatedTitle":null,"stats":"{\"totalAccepted\": \"332.5K\", \"totalSubmission\": \"941.2K\", \"totalAcceptedRaw\": 332478, \"totalSubmissionRaw\": 941223, \"acRate\": \"35.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"271","questionFrontendId":"271","title":"Encode and Decode Strings","titleSlug":"encode-and-decode-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"138.4K\", \"totalSubmission\": \"324K\", \"totalAcceptedRaw\": 138357, \"totalSubmissionRaw\": 323996, \"acRate\": \"42.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"274","questionFrontendId":"274","title":"H-Index","titleSlug":"h-index","translatedTitle":null,"stats":"{\"totalAccepted\": \"257.8K\", \"totalSubmission\": \"672.8K\", \"totalAcceptedRaw\": 257819, \"totalSubmissionRaw\": 672847, \"acRate\": \"38.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting Sort","translatedName":null,"slug":"counting-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"275","questionFrontendId":"275","title":"H-Index II","titleSlug":"h-index-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"173.7K\", \"totalSubmission\": \"462.8K\", \"totalAcceptedRaw\": 173658, \"totalSubmissionRaw\": 462820, \"acRate\": \"37.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"280","questionFrontendId":"280","title":"Wiggle Sort","titleSlug":"wiggle-sort","translatedTitle":null,"stats":"{\"totalAccepted\": \"128.2K\", \"totalSubmission\": \"191.3K\", \"totalAcceptedRaw\": 128218, \"totalSubmissionRaw\": 191346, \"acRate\": \"67.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"281","questionFrontendId":"281","title":"Zigzag Iterator","titleSlug":"zigzag-iterator","translatedTitle":null,"stats":"{\"totalAccepted\": \"86.3K\", \"totalSubmission\": \"137.7K\", \"totalAcceptedRaw\": 86339, \"totalSubmissionRaw\": 137694, \"acRate\": \"62.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Iterator","translatedName":null,"slug":"iterator","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"283","questionFrontendId":"283","title":"Move Zeroes","titleSlug":"move-zeroes","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.1M\", \"totalSubmission\": \"3.5M\", \"totalAcceptedRaw\": 2146846, \"totalSubmissionRaw\": 3496472, \"acRate\": \"61.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"284","questionFrontendId":"284","title":"Peeking Iterator","titleSlug":"peeking-iterator","translatedTitle":null,"stats":"{\"totalAccepted\": \"205.3K\", \"totalSubmission\": \"350.3K\", \"totalAcceptedRaw\": 205344, \"totalSubmissionRaw\": 350327, \"acRate\": \"58.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Iterator","translatedName":null,"slug":"iterator","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"286","questionFrontendId":"286","title":"Walls and Gates","titleSlug":"walls-and-gates","translatedTitle":null,"stats":"{\"totalAccepted\": \"265.9K\", \"totalSubmission\": \"440.1K\", \"totalAcceptedRaw\": 265896, \"totalSubmissionRaw\": 440129, \"acRate\": \"60.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"287","questionFrontendId":"287","title":"Find the Duplicate Number","titleSlug":"find-the-duplicate-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 1130742, \"totalSubmissionRaw\": 1913383, \"acRate\": \"59.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"288","questionFrontendId":"288","title":"Unique Word Abbreviation","titleSlug":"unique-word-abbreviation","translatedTitle":null,"stats":"{\"totalAccepted\": \"69.1K\", \"totalSubmission\": \"270.3K\", \"totalAcceptedRaw\": 69088, \"totalSubmissionRaw\": 270277, \"acRate\": \"25.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"289","questionFrontendId":"289","title":"Game of Life","titleSlug":"game-of-life","translatedTitle":null,"stats":"{\"totalAccepted\": \"386.3K\", \"totalSubmission\": \"575.6K\", \"totalAcceptedRaw\": 386284, \"totalSubmissionRaw\": 575559, \"acRate\": \"67.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"296","questionFrontendId":"296","title":"Best Meeting Point","titleSlug":"best-meeting-point","translatedTitle":null,"stats":"{\"totalAccepted\": \"67K\", \"totalSubmission\": \"111.4K\", \"totalAcceptedRaw\": 66964, \"totalSubmissionRaw\": 111420, \"acRate\": \"60.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"300","questionFrontendId":"300","title":"Longest Increasing Subsequence","titleSlug":"longest-increasing-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 1168749, \"totalSubmissionRaw\": 2245126, \"acRate\": \"52.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"302","questionFrontendId":"302","title":"Smallest Rectangle Enclosing Black Pixels","titleSlug":"smallest-rectangle-enclosing-black-pixels","translatedTitle":null,"stats":"{\"totalAccepted\": \"47.2K\", \"totalSubmission\": \"80.8K\", \"totalAcceptedRaw\": 47233, \"totalSubmissionRaw\": 80818, \"acRate\": \"58.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"303","questionFrontendId":"303","title":"Range Sum Query - Immutable","titleSlug":"range-sum-query-immutable","translatedTitle":null,"stats":"{\"totalAccepted\": \"425.4K\", \"totalSubmission\": \"717.1K\", \"totalAcceptedRaw\": 425430, \"totalSubmissionRaw\": 717067, \"acRate\": \"59.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"304","questionFrontendId":"304","title":"Range Sum Query 2D - Immutable","titleSlug":"range-sum-query-2d-immutable","translatedTitle":null,"stats":"{\"totalAccepted\": \"316.4K\", \"totalSubmission\": \"600.1K\", \"totalAcceptedRaw\": 316415, \"totalSubmissionRaw\": 600070, \"acRate\": \"52.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"305","questionFrontendId":"305","title":"Number of Islands II","titleSlug":"number-of-islands-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"129.7K\", \"totalSubmission\": \"327.5K\", \"totalAcceptedRaw\": 129713, \"totalSubmissionRaw\": 327462, \"acRate\": \"39.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"307","questionFrontendId":"307","title":"Range Sum Query - Mutable","titleSlug":"range-sum-query-mutable","translatedTitle":null,"stats":"{\"totalAccepted\": \"243.5K\", \"totalSubmission\": \"598.4K\", \"totalAcceptedRaw\": 243470, \"totalSubmissionRaw\": 598370, \"acRate\": \"40.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"308","questionFrontendId":"308","title":"Range Sum Query 2D - Mutable","titleSlug":"range-sum-query-2d-mutable","translatedTitle":null,"stats":"{\"totalAccepted\": \"71.7K\", \"totalSubmission\": \"167.5K\", \"totalAcceptedRaw\": 71691, \"totalSubmissionRaw\": 167536, \"acRate\": \"42.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"309","questionFrontendId":"309","title":"Best Time to Buy and Sell Stock with Cooldown","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown","translatedTitle":null,"stats":"{\"totalAccepted\": \"393.7K\", \"totalSubmission\": \"700.8K\", \"totalAcceptedRaw\": 393679, \"totalSubmissionRaw\": 700828, \"acRate\": \"56.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"311","questionFrontendId":"311","title":"Sparse Matrix Multiplication","titleSlug":"sparse-matrix-multiplication","translatedTitle":null,"stats":"{\"totalAccepted\": \"170.3K\", \"totalSubmission\": \"252.9K\", \"totalAcceptedRaw\": 170286, \"totalSubmissionRaw\": 252912, \"acRate\": \"67.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"312","questionFrontendId":"312","title":"Burst Balloons","titleSlug":"burst-balloons","translatedTitle":null,"stats":"{\"totalAccepted\": \"222.7K\", \"totalSubmission\": \"390.9K\", \"totalAcceptedRaw\": 222725, \"totalSubmissionRaw\": 390905, \"acRate\": \"57.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"313","questionFrontendId":"313","title":"Super Ugly Number","titleSlug":"super-ugly-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"115.8K\", \"totalSubmission\": \"254.4K\", \"totalAcceptedRaw\": 115792, \"totalSubmissionRaw\": 254382, \"acRate\": \"45.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"315","questionFrontendId":"315","title":"Count of Smaller Numbers After Self","titleSlug":"count-of-smaller-numbers-after-self","translatedTitle":null,"stats":"{\"totalAccepted\": \"288.9K\", \"totalSubmission\": \"678K\", \"totalAcceptedRaw\": 288868, \"totalSubmissionRaw\": 678012, \"acRate\": \"42.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"317","questionFrontendId":"317","title":"Shortest Distance from All Buildings","titleSlug":"shortest-distance-from-all-buildings","translatedTitle":null,"stats":"{\"totalAccepted\": \"152.8K\", \"totalSubmission\": \"358.3K\", \"totalAcceptedRaw\": 152751, \"totalSubmissionRaw\": 358294, \"acRate\": \"42.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"318","questionFrontendId":"318","title":"Maximum Product of Word Lengths","titleSlug":"maximum-product-of-word-lengths","translatedTitle":null,"stats":"{\"totalAccepted\": \"200.2K\", \"totalSubmission\": \"334.4K\", \"totalAcceptedRaw\": 200248, \"totalSubmissionRaw\": 334389, \"acRate\": \"59.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"322","questionFrontendId":"322","title":"Coin Change","titleSlug":"coin-change","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"3.2M\", \"totalAcceptedRaw\": 1340948, \"totalSubmissionRaw\": 3193269, \"acRate\": \"42.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"324","questionFrontendId":"324","title":"Wiggle Sort II","titleSlug":"wiggle-sort-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"139.4K\", \"totalSubmission\": \"419.3K\", \"totalAcceptedRaw\": 139437, \"totalSubmissionRaw\": 419273, \"acRate\": \"33.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Quickselect","translatedName":null,"slug":"quickselect","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"325","questionFrontendId":"325","title":"Maximum Size Subarray Sum Equals k","titleSlug":"maximum-size-subarray-sum-equals-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"171.2K\", \"totalSubmission\": \"347.6K\", \"totalAcceptedRaw\": 171195, \"totalSubmissionRaw\": 347604, \"acRate\": \"49.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"327","questionFrontendId":"327","title":"Count of Range Sum","titleSlug":"count-of-range-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.8K\", \"totalSubmission\": \"188.6K\", \"totalAcceptedRaw\": 67792, \"totalSubmissionRaw\": 188553, \"acRate\": \"36.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"329","questionFrontendId":"329","title":"Longest Increasing Path in a Matrix","titleSlug":"longest-increasing-path-in-a-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"435.8K\", \"totalSubmission\": \"831.3K\", \"totalAcceptedRaw\": 435817, \"totalSubmissionRaw\": 831310, \"acRate\": \"52.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"330","questionFrontendId":"330","title":"Patching Array","titleSlug":"patching-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"61K\", \"totalSubmission\": \"151.6K\", \"totalAcceptedRaw\": 61002, \"totalSubmissionRaw\": 151565, \"acRate\": \"40.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"334","questionFrontendId":"334","title":"Increasing Triplet Subsequence","titleSlug":"increasing-triplet-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"379.2K\", \"totalSubmission\": \"887.6K\", \"totalAcceptedRaw\": 379192, \"totalSubmissionRaw\": 887564, \"acRate\": \"42.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"335","questionFrontendId":"335","title":"Self Crossing","titleSlug":"self-crossing","translatedTitle":null,"stats":"{\"totalAccepted\": \"30K\", \"totalSubmission\": \"102K\", \"totalAcceptedRaw\": 30023, \"totalSubmissionRaw\": 102001, \"acRate\": \"29.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"336","questionFrontendId":"336","title":"Palindrome Pairs","titleSlug":"palindrome-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"191.2K\", \"totalSubmission\": \"545.9K\", \"totalAcceptedRaw\": 191190, \"totalSubmissionRaw\": 545949, \"acRate\": \"35.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"346","questionFrontendId":"346","title":"Moving Average from Data Stream","titleSlug":"moving-average-from-data-stream","translatedTitle":null,"stats":"{\"totalAccepted\": \"305K\", \"totalSubmission\": \"395.6K\", \"totalAcceptedRaw\": 305045, \"totalSubmissionRaw\": 395623, \"acRate\": \"77.1%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"347","questionFrontendId":"347","title":"Top K Frequent Elements","titleSlug":"top-k-frequent-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 1345636, \"totalSubmissionRaw\": 2093537, \"acRate\": \"64.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Bucket Sort","translatedName":null,"slug":"bucket-sort","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Quickselect","translatedName":null,"slug":"quickselect","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"348","questionFrontendId":"348","title":"Design Tic-Tac-Toe","titleSlug":"design-tic-tac-toe","translatedTitle":null,"stats":"{\"totalAccepted\": \"208.5K\", \"totalSubmission\": \"362.3K\", \"totalAcceptedRaw\": 208546, \"totalSubmissionRaw\": 362331, \"acRate\": \"57.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"349","questionFrontendId":"349","title":"Intersection of Two Arrays","titleSlug":"intersection-of-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"824.6K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 824619, \"totalSubmissionRaw\": 1163783, \"acRate\": \"70.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"350","questionFrontendId":"350","title":"Intersection of Two Arrays II","titleSlug":"intersection-of-two-arrays-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"1M\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 1026502, \"totalSubmissionRaw\": 1835394, \"acRate\": \"55.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"353","questionFrontendId":"353","title":"Design Snake Game","titleSlug":"design-snake-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"72.2K\", \"totalSubmission\": \"184.1K\", \"totalAcceptedRaw\": 72155, \"totalSubmissionRaw\": 184085, \"acRate\": \"39.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"354","questionFrontendId":"354","title":"Russian Doll Envelopes","titleSlug":"russian-doll-envelopes","translatedTitle":null,"stats":"{\"totalAccepted\": \"185.7K\", \"totalSubmission\": \"488.6K\", \"totalAcceptedRaw\": 185705, \"totalSubmissionRaw\": 488647, \"acRate\": \"38.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"356","questionFrontendId":"356","title":"Line Reflection","titleSlug":"line-reflection","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.4K\", \"totalSubmission\": \"99K\", \"totalAcceptedRaw\": 34413, \"totalSubmissionRaw\": 98964, \"acRate\": \"34.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"360","questionFrontendId":"360","title":"Sort Transformed Array","titleSlug":"sort-transformed-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"61.6K\", \"totalSubmission\": \"112.1K\", \"totalAcceptedRaw\": 61611, \"totalSubmissionRaw\": 112063, \"acRate\": \"55.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"361","questionFrontendId":"361","title":"Bomb Enemy","titleSlug":"bomb-enemy","translatedTitle":null,"stats":"{\"totalAccepted\": \"73.5K\", \"totalSubmission\": \"143.3K\", \"totalAcceptedRaw\": 73468, \"totalSubmissionRaw\": 143326, \"acRate\": \"51.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"362","questionFrontendId":"362","title":"Design Hit Counter","titleSlug":"design-hit-counter","translatedTitle":null,"stats":"{\"totalAccepted\": \"202K\", \"totalSubmission\": \"295.5K\", \"totalAcceptedRaw\": 202035, \"totalSubmissionRaw\": 295505, \"acRate\": \"68.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"363","questionFrontendId":"363","title":"Max Sum of Rectangle No Larger Than K","titleSlug":"max-sum-of-rectangle-no-larger-than-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"118.1K\", \"totalSubmission\": \"268.2K\", \"totalAcceptedRaw\": 118055, \"totalSubmissionRaw\": 268157, \"acRate\": \"44.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"368","questionFrontendId":"368","title":"Largest Divisible Subset","titleSlug":"largest-divisible-subset","translatedTitle":null,"stats":"{\"totalAccepted\": \"175.4K\", \"totalSubmission\": \"423K\", \"totalAcceptedRaw\": 175431, \"totalSubmissionRaw\": 422970, \"acRate\": \"41.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"370","questionFrontendId":"370","title":"Range Addition","titleSlug":"range-addition","translatedTitle":null,"stats":"{\"totalAccepted\": \"85.9K\", \"totalSubmission\": \"120.7K\", \"totalAcceptedRaw\": 85885, \"totalSubmissionRaw\": 120744, \"acRate\": \"71.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"373","questionFrontendId":"373","title":"Find K Pairs with Smallest Sums","titleSlug":"find-k-pairs-with-smallest-sums","translatedTitle":null,"stats":"{\"totalAccepted\": \"195.2K\", \"totalSubmission\": \"510.3K\", \"totalAcceptedRaw\": 195241, \"totalSubmissionRaw\": 510277, \"acRate\": \"38.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"376","questionFrontendId":"376","title":"Wiggle Subsequence","titleSlug":"wiggle-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"217K\", \"totalSubmission\": \"448.9K\", \"totalAcceptedRaw\": 216988, \"totalSubmissionRaw\": 448950, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"377","questionFrontendId":"377","title":"Combination Sum IV","titleSlug":"combination-sum-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"351.1K\", \"totalSubmission\": \"672.9K\", \"totalAcceptedRaw\": 351053, \"totalSubmissionRaw\": 672865, \"acRate\": \"52.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"378","questionFrontendId":"378","title":"Kth Smallest Element in a Sorted Matrix","titleSlug":"kth-smallest-element-in-a-sorted-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"526.4K\", \"totalSubmission\": \"852.2K\", \"totalAcceptedRaw\": 526380, \"totalSubmissionRaw\": 852230, \"acRate\": \"61.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"379","questionFrontendId":"379","title":"Design Phone Directory","titleSlug":"design-phone-directory","translatedTitle":null,"stats":"{\"totalAccepted\": \"61.2K\", \"totalSubmission\": \"119.7K\", \"totalAcceptedRaw\": 61211, \"totalSubmissionRaw\": 119653, \"acRate\": \"51.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"380","questionFrontendId":"380","title":"Insert Delete GetRandom O(1)","titleSlug":"insert-delete-getrandom-o1","translatedTitle":null,"stats":"{\"totalAccepted\": \"611.5K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 611513, \"totalSubmissionRaw\": 1158158, \"acRate\": \"52.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"381","questionFrontendId":"381","title":"Insert Delete GetRandom O(1) - Duplicates allowed","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed","translatedTitle":null,"stats":"{\"totalAccepted\": \"125.3K\", \"totalSubmission\": \"352.7K\", \"totalAcceptedRaw\": 125334, \"totalSubmissionRaw\": 352713, \"acRate\": \"35.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"384","questionFrontendId":"384","title":"Shuffle an Array","titleSlug":"shuffle-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"300.3K\", \"totalSubmission\": \"519.3K\", \"totalAcceptedRaw\": 300267, \"totalSubmissionRaw\": 519343, \"acRate\": \"57.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"391","questionFrontendId":"391","title":"Perfect Rectangle","titleSlug":"perfect-rectangle","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.8K\", \"totalSubmission\": \"118.3K\", \"totalAcceptedRaw\": 38810, \"totalSubmissionRaw\": 118319, \"acRate\": \"32.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Line Sweep","translatedName":null,"slug":"line-sweep","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"393","questionFrontendId":"393","title":"UTF-8 Validation","titleSlug":"utf-8-validation","translatedTitle":null,"stats":"{\"totalAccepted\": \"116.2K\", \"totalSubmission\": \"257.7K\", \"totalAcceptedRaw\": 116171, \"totalSubmissionRaw\": 257712, \"acRate\": \"45.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"396","questionFrontendId":"396","title":"Rotate Function","titleSlug":"rotate-function","translatedTitle":null,"stats":"{\"totalAccepted\": \"72.4K\", \"totalSubmission\": \"176.4K\", \"totalAcceptedRaw\": 72429, \"totalSubmissionRaw\": 176379, \"acRate\": \"41.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"399","questionFrontendId":"399","title":"Evaluate Division","titleSlug":"evaluate-division","translatedTitle":null,"stats":"{\"totalAccepted\": \"328.8K\", \"totalSubmission\": \"551.3K\", \"totalAcceptedRaw\": 328839, \"totalSubmissionRaw\": 551333, \"acRate\": \"59.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"403","questionFrontendId":"403","title":"Frog Jump","titleSlug":"frog-jump","translatedTitle":null,"stats":"{\"totalAccepted\": \"177.5K\", \"totalSubmission\": \"411.2K\", \"totalAcceptedRaw\": 177458, \"totalSubmissionRaw\": 411245, \"acRate\": \"43.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"406","questionFrontendId":"406","title":"Queue Reconstruction by Height","titleSlug":"queue-reconstruction-by-height","translatedTitle":null,"stats":"{\"totalAccepted\": \"280K\", \"totalSubmission\": \"383.9K\", \"totalAcceptedRaw\": 279970, \"totalSubmissionRaw\": 383924, \"acRate\": \"72.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"407","questionFrontendId":"407","title":"Trapping Rain Water II","titleSlug":"trapping-rain-water-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.1K\", \"totalSubmission\": \"164K\", \"totalAcceptedRaw\": 78078, \"totalSubmissionRaw\": 164017, \"acRate\": \"47.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"410","questionFrontendId":"410","title":"Split Array Largest Sum","titleSlug":"split-array-largest-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"256.7K\", \"totalSubmission\": \"479.7K\", \"totalAcceptedRaw\": 256705, \"totalSubmissionRaw\": 479653, \"acRate\": \"53.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"413","questionFrontendId":"413","title":"Arithmetic Slices","titleSlug":"arithmetic-slices","translatedTitle":null,"stats":"{\"totalAccepted\": \"269.7K\", \"totalSubmission\": \"414.4K\", \"totalAcceptedRaw\": 269668, \"totalSubmissionRaw\": 414391, \"acRate\": \"65.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"414","questionFrontendId":"414","title":"Third Maximum Number","titleSlug":"third-maximum-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"416.1K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 416081, \"totalSubmissionRaw\": 1256516, \"acRate\": \"33.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"416","questionFrontendId":"416","title":"Partition Equal Subset Sum","titleSlug":"partition-equal-subset-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"601.9K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 601881, \"totalSubmissionRaw\": 1299666, \"acRate\": \"46.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"417","questionFrontendId":"417","title":"Pacific Atlantic Water Flow","titleSlug":"pacific-atlantic-water-flow","translatedTitle":null,"stats":"{\"totalAccepted\": \"346.1K\", \"totalSubmission\": \"636.4K\", \"totalAcceptedRaw\": 346108, \"totalSubmissionRaw\": 636373, \"acRate\": \"54.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"419","questionFrontendId":"419","title":"Battleships in a Board","titleSlug":"battleships-in-a-board","translatedTitle":null,"stats":"{\"totalAccepted\": \"178.9K\", \"totalSubmission\": \"239.1K\", \"totalAcceptedRaw\": 178948, \"totalSubmissionRaw\": 239091, \"acRate\": \"74.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"421","questionFrontendId":"421","title":"Maximum XOR of Two Numbers in an Array","titleSlug":"maximum-xor-of-two-numbers-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"138.6K\", \"totalSubmission\": \"256.2K\", \"totalAcceptedRaw\": 138621, \"totalSubmissionRaw\": 256228, \"acRate\": \"54.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"422","questionFrontendId":"422","title":"Valid Word Square","titleSlug":"valid-word-square","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.9K\", \"totalSubmission\": \"122.5K\", \"totalAcceptedRaw\": 48899, \"totalSubmissionRaw\": 122522, \"acRate\": \"39.9%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"425","questionFrontendId":"425","title":"Word Squares","titleSlug":"word-squares","translatedTitle":null,"stats":"{\"totalAccepted\": \"69.2K\", \"totalSubmission\": \"131.1K\", \"totalAcceptedRaw\": 69203, \"totalSubmissionRaw\": 131137, \"acRate\": \"52.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"435","questionFrontendId":"435","title":"Non-overlapping Intervals","titleSlug":"non-overlapping-intervals","translatedTitle":null,"stats":"{\"totalAccepted\": \"348.8K\", \"totalSubmission\": \"694.6K\", \"totalAcceptedRaw\": 348777, \"totalSubmissionRaw\": 694562, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"436","questionFrontendId":"436","title":"Find Right Interval","titleSlug":"find-right-interval","translatedTitle":null,"stats":"{\"totalAccepted\": \"91.8K\", \"totalSubmission\": \"180.9K\", \"totalAcceptedRaw\": 91808, \"totalSubmissionRaw\": 180930, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"442","questionFrontendId":"442","title":"Find All Duplicates in an Array","titleSlug":"find-all-duplicates-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"502.2K\", \"totalSubmission\": \"683.7K\", \"totalAcceptedRaw\": 502199, \"totalSubmissionRaw\": 683736, \"acRate\": \"73.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"444","questionFrontendId":"444","title":"Sequence Reconstruction","titleSlug":"sequence-reconstruction","translatedTitle":null,"stats":"{\"totalAccepted\": \"49.8K\", \"totalSubmission\": \"186.5K\", \"totalAcceptedRaw\": 49772, \"totalSubmissionRaw\": 186492, \"acRate\": \"26.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"446","questionFrontendId":"446","title":"Arithmetic Slices II - Subsequence","titleSlug":"arithmetic-slices-ii-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"73.5K\", \"totalSubmission\": \"157.5K\", \"totalAcceptedRaw\": 73459, \"totalSubmissionRaw\": 157486, \"acRate\": \"46.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"447","questionFrontendId":"447","title":"Number of Boomerangs","titleSlug":"number-of-boomerangs","translatedTitle":null,"stats":"{\"totalAccepted\": \"92.6K\", \"totalSubmission\": \"168.8K\", \"totalAcceptedRaw\": 92629, \"totalSubmissionRaw\": 168788, \"acRate\": \"54.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"448","questionFrontendId":"448","title":"Find All Numbers Disappeared in an Array","titleSlug":"find-all-numbers-disappeared-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"706.5K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 706526, \"totalSubmissionRaw\": 1179227, \"acRate\": \"59.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"452","questionFrontendId":"452","title":"Minimum Number of Arrows to Burst Balloons","titleSlug":"minimum-number-of-arrows-to-burst-balloons","translatedTitle":null,"stats":"{\"totalAccepted\": \"297.1K\", \"totalSubmission\": \"537.4K\", \"totalAcceptedRaw\": 297056, \"totalSubmissionRaw\": 537417, \"acRate\": \"55.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"453","questionFrontendId":"453","title":"Minimum Moves to Equal Array Elements","titleSlug":"minimum-moves-to-equal-array-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"149.6K\", \"totalSubmission\": \"267.3K\", \"totalAcceptedRaw\": 149604, \"totalSubmissionRaw\": 267338, \"acRate\": \"56.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"454","questionFrontendId":"454","title":"4Sum II","titleSlug":"4sum-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"288.5K\", \"totalSubmission\": \"504.2K\", \"totalAcceptedRaw\": 288547, \"totalSubmissionRaw\": 504197, \"acRate\": \"57.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"455","questionFrontendId":"455","title":"Assign Cookies","titleSlug":"assign-cookies","translatedTitle":null,"stats":"{\"totalAccepted\": \"213.8K\", \"totalSubmission\": \"427.6K\", \"totalAcceptedRaw\": 213795, \"totalSubmissionRaw\": 427567, \"acRate\": \"50.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"456","questionFrontendId":"456","title":"132 Pattern","titleSlug":"132-pattern","translatedTitle":null,"stats":"{\"totalAccepted\": \"166.4K\", \"totalSubmission\": \"513.3K\", \"totalAcceptedRaw\": 166379, \"totalSubmissionRaw\": 513300, \"acRate\": \"32.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"457","questionFrontendId":"457","title":"Circular Array Loop","titleSlug":"circular-array-loop","translatedTitle":null,"stats":"{\"totalAccepted\": \"68.6K\", \"totalSubmission\": \"210.5K\", \"totalAcceptedRaw\": 68568, \"totalSubmissionRaw\": 210471, \"acRate\": \"32.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"462","questionFrontendId":"462","title":"Minimum Moves to Equal Array Elements II","titleSlug":"minimum-moves-to-equal-array-elements-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"159K\", \"totalSubmission\": \"264.7K\", \"totalAcceptedRaw\": 158954, \"totalSubmissionRaw\": 264713, \"acRate\": \"60.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"463","questionFrontendId":"463","title":"Island Perimeter","titleSlug":"island-perimeter","translatedTitle":null,"stats":"{\"totalAccepted\": \"424.9K\", \"totalSubmission\": \"609.9K\", \"totalAcceptedRaw\": 424868, \"totalSubmissionRaw\": 609909, \"acRate\": \"69.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"465","questionFrontendId":"465","title":"Optimal Account Balancing","titleSlug":"optimal-account-balancing","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.1K\", \"totalSubmission\": \"158.6K\", \"totalAcceptedRaw\": 78082, \"totalSubmissionRaw\": 158560, \"acRate\": \"49.2%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"472","questionFrontendId":"472","title":"Concatenated Words","titleSlug":"concatenated-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"206K\", \"totalSubmission\": \"411.5K\", \"totalAcceptedRaw\": 206044, \"totalSubmissionRaw\": 411541, \"acRate\": \"50.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"473","questionFrontendId":"473","title":"Matchsticks to Square","titleSlug":"matchsticks-to-square","translatedTitle":null,"stats":"{\"totalAccepted\": \"139K\", \"totalSubmission\": \"345.8K\", \"totalAcceptedRaw\": 139023, \"totalSubmissionRaw\": 345797, \"acRate\": \"40.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"474","questionFrontendId":"474","title":"Ones and Zeroes","titleSlug":"ones-and-zeroes","translatedTitle":null,"stats":"{\"totalAccepted\": \"166.9K\", \"totalSubmission\": \"357K\", \"totalAcceptedRaw\": 166876, \"totalSubmissionRaw\": 356991, \"acRate\": \"46.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"475","questionFrontendId":"475","title":"Heaters","titleSlug":"heaters","translatedTitle":null,"stats":"{\"totalAccepted\": \"100.1K\", \"totalSubmission\": \"274.8K\", \"totalAcceptedRaw\": 100072, \"totalSubmissionRaw\": 274829, \"acRate\": \"36.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"477","questionFrontendId":"477","title":"Total Hamming Distance","titleSlug":"total-hamming-distance","translatedTitle":null,"stats":"{\"totalAccepted\": \"96.7K\", \"totalSubmission\": \"185.4K\", \"totalAcceptedRaw\": 96698, \"totalSubmissionRaw\": 185426, \"acRate\": \"52.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"480","questionFrontendId":"480","title":"Sliding Window Median","titleSlug":"sliding-window-median","translatedTitle":null,"stats":"{\"totalAccepted\": \"125.3K\", \"totalSubmission\": \"303.1K\", \"totalAcceptedRaw\": 125261, \"totalSubmissionRaw\": 303079, \"acRate\": \"41.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"484","questionFrontendId":"484","title":"Find Permutation","titleSlug":"find-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.8K\", \"totalSubmission\": \"53.5K\", \"totalAcceptedRaw\": 35822, \"totalSubmissionRaw\": 53518, \"acRate\": \"66.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"485","questionFrontendId":"485","title":"Max Consecutive Ones","titleSlug":"max-consecutive-ones","translatedTitle":null,"stats":"{\"totalAccepted\": \"834.2K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 834210, \"totalSubmissionRaw\": 1476456, \"acRate\": \"56.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"486","questionFrontendId":"486","title":"Predict the Winner","titleSlug":"predict-the-winner","translatedTitle":null,"stats":"{\"totalAccepted\": \"135.6K\", \"totalSubmission\": \"265.5K\", \"totalAcceptedRaw\": 135618, \"totalSubmissionRaw\": 265549, \"acRate\": \"51.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"487","questionFrontendId":"487","title":"Max Consecutive Ones II","titleSlug":"max-consecutive-ones-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.1K\", \"totalSubmission\": \"240.1K\", \"totalAcceptedRaw\": 119147, \"totalSubmissionRaw\": 240077, \"acRate\": \"49.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"489","questionFrontendId":"1643","title":"Kth Smallest Instructions","titleSlug":"kth-smallest-instructions","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.9K\", \"totalSubmission\": \"21K\", \"totalAcceptedRaw\": 9877, \"totalSubmissionRaw\": 21004, \"acRate\": \"47.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"491","questionFrontendId":"491","title":"Non-decreasing Subsequences","titleSlug":"non-decreasing-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"146.6K\", \"totalSubmission\": \"243.8K\", \"totalAcceptedRaw\": 146564, \"totalSubmissionRaw\": 243806, \"acRate\": \"60.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"493","questionFrontendId":"493","title":"Reverse Pairs","titleSlug":"reverse-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"118.3K\", \"totalSubmission\": \"382.9K\", \"totalAcceptedRaw\": 118322, \"totalSubmissionRaw\": 382860, \"acRate\": \"30.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"494","questionFrontendId":"494","title":"Target Sum","titleSlug":"target-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"445.3K\", \"totalSubmission\": \"975.3K\", \"totalAcceptedRaw\": 445323, \"totalSubmissionRaw\": 975251, \"acRate\": \"45.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"495","questionFrontendId":"495","title":"Teemo Attacking","titleSlug":"teemo-attacking","translatedTitle":null,"stats":"{\"totalAccepted\": \"120.1K\", \"totalSubmission\": \"211.2K\", \"totalAcceptedRaw\": 120131, \"totalSubmissionRaw\": 211217, \"acRate\": \"56.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"496","questionFrontendId":"496","title":"Next Greater Element I","titleSlug":"next-greater-element-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"503.4K\", \"totalSubmission\": \"704.5K\", \"totalAcceptedRaw\": 503374, \"totalSubmissionRaw\": 704509, \"acRate\": \"71.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"498","questionFrontendId":"498","title":"Diagonal Traverse","titleSlug":"diagonal-traverse","translatedTitle":null,"stats":"{\"totalAccepted\": \"239.3K\", \"totalSubmission\": \"410.9K\", \"totalAcceptedRaw\": 239345, \"totalSubmissionRaw\": 410874, \"acRate\": \"58.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"500","questionFrontendId":"500","title":"Keyboard Row","titleSlug":"keyboard-row","translatedTitle":null,"stats":"{\"totalAccepted\": \"181K\", \"totalSubmission\": \"260.4K\", \"totalAcceptedRaw\": 180999, \"totalSubmissionRaw\": 260416, \"acRate\": \"69.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"502","questionFrontendId":"502","title":"IPO","titleSlug":"ipo","translatedTitle":null,"stats":"{\"totalAccepted\": \"90.3K\", \"totalSubmission\": \"181.6K\", \"totalAcceptedRaw\": 90289, \"totalSubmissionRaw\": 181553, \"acRate\": \"49.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"503","questionFrontendId":"503","title":"Next Greater Element II","titleSlug":"next-greater-element-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"293.7K\", \"totalSubmission\": \"464.9K\", \"totalAcceptedRaw\": 293716, \"totalSubmissionRaw\": 464915, \"acRate\": \"63.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"506","questionFrontendId":"506","title":"Relative Ranks","titleSlug":"relative-ranks","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.3K\", \"totalSubmission\": \"197.6K\", \"totalAcceptedRaw\": 119270, \"totalSubmissionRaw\": 197648, \"acRate\": \"60.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"510","questionFrontendId":"2031","title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.8K\", \"totalSubmission\": \"5.5K\", \"totalAcceptedRaw\": 2837, \"totalSubmissionRaw\": 5470, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"512","questionFrontendId":"2036","title":"Maximum Alternating Subarray Sum","titleSlug":"maximum-alternating-subarray-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.1K\", \"totalSubmission\": \"5.2K\", \"totalAcceptedRaw\": 2133, \"totalSubmissionRaw\": 5206, \"acRate\": \"41.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"517","questionFrontendId":"517","title":"Super Washing Machines","titleSlug":"super-washing-machines","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.2K\", \"totalSubmission\": \"62.5K\", \"totalAcceptedRaw\": 25163, \"totalSubmissionRaw\": 62510, \"acRate\": \"40.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"518","questionFrontendId":"518","title":"Coin Change II","titleSlug":"coin-change-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"396.9K\", \"totalSubmission\": \"656.5K\", \"totalAcceptedRaw\": 396919, \"totalSubmissionRaw\": 656522, \"acRate\": \"60.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"519","questionFrontendId":"1983","title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.8K\", \"totalSubmission\": \"3.4K\", \"totalAcceptedRaw\": 1827, \"totalSubmissionRaw\": 3370, \"acRate\": \"54.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"522","questionFrontendId":"522","title":"Longest Uncommon Subsequence II","titleSlug":"longest-uncommon-subsequence-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.8K\", \"totalSubmission\": \"115.7K\", \"totalAcceptedRaw\": 46844, \"totalSubmissionRaw\": 115706, \"acRate\": \"40.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"523","questionFrontendId":"523","title":"Continuous Subarray Sum","titleSlug":"continuous-subarray-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"386.9K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 386950, \"totalSubmissionRaw\": 1357202, \"acRate\": \"28.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"524","questionFrontendId":"524","title":"Longest Word in Dictionary through Deleting","titleSlug":"longest-word-in-dictionary-through-deleting","translatedTitle":null,"stats":"{\"totalAccepted\": \"140K\", \"totalSubmission\": \"274.4K\", \"totalAcceptedRaw\": 140046, \"totalSubmissionRaw\": 274393, \"acRate\": \"51.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"525","questionFrontendId":"525","title":"Contiguous Array","titleSlug":"contiguous-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"292.2K\", \"totalSubmission\": \"623.9K\", \"totalAcceptedRaw\": 292190, \"totalSubmissionRaw\": 623885, \"acRate\": \"46.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"526","questionFrontendId":"526","title":"Beautiful Arrangement","titleSlug":"beautiful-arrangement","translatedTitle":null,"stats":"{\"totalAccepted\": \"149.6K\", \"totalSubmission\": \"232K\", \"totalAcceptedRaw\": 149569, \"totalSubmissionRaw\": 232039, \"acRate\": \"64.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"527","questionFrontendId":"527","title":"Word Abbreviation","titleSlug":"word-abbreviation","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.9K\", \"totalSubmission\": \"42.7K\", \"totalAcceptedRaw\": 25866, \"totalSubmissionRaw\": 42671, \"acRate\": \"60.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"529","questionFrontendId":"529","title":"Minesweeper","titleSlug":"minesweeper","translatedTitle":null,"stats":"{\"totalAccepted\": \"134.5K\", \"totalSubmission\": \"204.6K\", \"totalAcceptedRaw\": 134452, \"totalSubmissionRaw\": 204560, \"acRate\": \"65.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"531","questionFrontendId":"531","title":"Lonely Pixel I","titleSlug":"lonely-pixel-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.8K\", \"totalSubmission\": \"62.4K\", \"totalAcceptedRaw\": 38823, \"totalSubmissionRaw\": 62445, \"acRate\": \"62.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"532","questionFrontendId":"532","title":"K-diff Pairs in an Array","titleSlug":"k-diff-pairs-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"287.7K\", \"totalSubmission\": \"699.9K\", \"totalAcceptedRaw\": 287711, \"totalSubmissionRaw\": 699894, \"acRate\": \"41.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"533","questionFrontendId":"533","title":"Lonely Pixel II","titleSlug":"lonely-pixel-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.7K\", \"totalSubmission\": \"26.2K\", \"totalAcceptedRaw\": 12706, \"totalSubmissionRaw\": 26206, \"acRate\": \"48.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"539","questionFrontendId":"539","title":"Minimum Time Difference","titleSlug":"minimum-time-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"121.4K\", \"totalSubmission\": \"215.4K\", \"totalAcceptedRaw\": 121424, \"totalSubmissionRaw\": 215391, \"acRate\": \"56.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"540","questionFrontendId":"540","title":"Single Element in a Sorted Array","titleSlug":"single-element-in-a-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"457.7K\", \"totalSubmission\": \"774K\", \"totalAcceptedRaw\": 457698, \"totalSubmissionRaw\": 774020, \"acRate\": \"59.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"542","questionFrontendId":"542","title":"01 Matrix","titleSlug":"01-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"364.8K\", \"totalSubmission\": \"816.9K\", \"totalAcceptedRaw\": 364759, \"totalSubmissionRaw\": 816904, \"acRate\": \"44.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"546","questionFrontendId":"546","title":"Remove Boxes","titleSlug":"remove-boxes","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.1K\", \"totalSubmission\": \"81.9K\", \"totalAcceptedRaw\": 39103, \"totalSubmissionRaw\": 81900, \"acRate\": \"47.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"548","questionFrontendId":"548","title":"Split Array with Equal Sum","titleSlug":"split-array-with-equal-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.2K\", \"totalSubmission\": \"46.3K\", \"totalAcceptedRaw\": 23224, \"totalSubmissionRaw\": 46321, \"acRate\": \"50.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"550","questionFrontendId":"1730","title":"Shortest Path to Get Food","titleSlug":"shortest-path-to-get-food","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.6K\", \"totalSubmission\": \"97.2K\", \"totalAcceptedRaw\": 52597, \"totalSubmissionRaw\": 97187, \"acRate\": \"54.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"553","questionFrontendId":"553","title":"Optimal Division","titleSlug":"optimal-division","translatedTitle":null,"stats":"{\"totalAccepted\": \"35K\", \"totalSubmission\": \"58.5K\", \"totalAcceptedRaw\": 35046, \"totalSubmissionRaw\": 58541, \"acRate\": \"59.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"554","questionFrontendId":"554","title":"Brick Wall","titleSlug":"brick-wall","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.3K\", \"totalSubmission\": \"213.7K\", \"totalAcceptedRaw\": 114330, \"totalSubmissionRaw\": 213686, \"acRate\": \"53.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"555","questionFrontendId":"555","title":"Split Concatenated Strings","titleSlug":"split-concatenated-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"14.5K\", \"totalAcceptedRaw\": 6335, \"totalSubmissionRaw\": 14533, \"acRate\": \"43.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"560","questionFrontendId":"560","title":"Subarray Sum Equals K","titleSlug":"subarray-sum-equals-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"944.3K\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 944334, \"totalSubmissionRaw\": 2160003, \"acRate\": \"43.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"561","questionFrontendId":"561","title":"Array Partition","titleSlug":"array-partition","translatedTitle":null,"stats":"{\"totalAccepted\": \"389.2K\", \"totalSubmission\": \"504.6K\", \"totalAcceptedRaw\": 389241, \"totalSubmissionRaw\": 504560, \"acRate\": \"77.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting Sort","translatedName":null,"slug":"counting-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"562","questionFrontendId":"562","title":"Longest Line of Consecutive One in Matrix","titleSlug":"longest-line-of-consecutive-one-in-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"71.7K\", \"totalSubmission\": \"142.8K\", \"totalAcceptedRaw\": 71679, \"totalSubmissionRaw\": 142750, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"565","questionFrontendId":"565","title":"Array Nesting","titleSlug":"array-nesting","translatedTitle":null,"stats":"{\"totalAccepted\": \"121.5K\", \"totalSubmission\": \"215.4K\", \"totalAcceptedRaw\": 121479, \"totalSubmissionRaw\": 215403, \"acRate\": \"56.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"566","questionFrontendId":"566","title":"Reshape the Matrix","titleSlug":"reshape-the-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"333.6K\", \"totalSubmission\": \"530.7K\", \"totalAcceptedRaw\": 333552, \"totalSubmissionRaw\": 530741, \"acRate\": \"62.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"568","questionFrontendId":"568","title":"Maximum Vacation Days","titleSlug":"maximum-vacation-days","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.8K\", \"totalSubmission\": \"79.5K\", \"totalAcceptedRaw\": 35821, \"totalSubmissionRaw\": 79537, \"acRate\": \"45.0%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"573","questionFrontendId":"573","title":"Squirrel Simulation","titleSlug":"squirrel-simulation","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"32.5K\", \"totalAcceptedRaw\": 17923, \"totalSubmissionRaw\": 32548, \"acRate\": \"55.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"575","questionFrontendId":"575","title":"Distribute Candies","titleSlug":"distribute-candies","translatedTitle":null,"stats":"{\"totalAccepted\": \"237.2K\", \"totalSubmission\": \"357.1K\", \"totalAcceptedRaw\": 237170, \"totalSubmissionRaw\": 357053, \"acRate\": \"66.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"581","questionFrontendId":"581","title":"Shortest Unsorted Continuous Subarray","titleSlug":"shortest-unsorted-continuous-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"298.7K\", \"totalSubmission\": \"820.3K\", \"totalAcceptedRaw\": 298714, \"totalSubmissionRaw\": 820281, \"acRate\": \"36.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"582","questionFrontendId":"582","title":"Kill Process","titleSlug":"kill-process","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.4K\", \"totalSubmission\": \"114.1K\", \"totalAcceptedRaw\": 78370, \"totalSubmissionRaw\": 114068, \"acRate\": \"68.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"587","questionFrontendId":"587","title":"Erect the Fence","titleSlug":"erect-the-fence","translatedTitle":null,"stats":"{\"totalAccepted\": \"53.6K\", \"totalSubmission\": \"102.6K\", \"totalAcceptedRaw\": 53612, \"totalSubmissionRaw\": 102635, \"acRate\": \"52.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"594","questionFrontendId":"594","title":"Longest Harmonious Subsequence","titleSlug":"longest-harmonious-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"132.5K\", \"totalSubmission\": \"247.8K\", \"totalAcceptedRaw\": 132474, \"totalSubmissionRaw\": 247770, \"acRate\": \"53.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"598","questionFrontendId":"598","title":"Range Addition II","titleSlug":"range-addition-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"87.9K\", \"totalSubmission\": \"159K\", \"totalAcceptedRaw\": 87920, \"totalSubmissionRaw\": 159045, \"acRate\": \"55.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"599","questionFrontendId":"599","title":"Minimum Index Sum of Two Lists","titleSlug":"minimum-index-sum-of-two-lists","translatedTitle":null,"stats":"{\"totalAccepted\": \"185.2K\", \"totalSubmission\": \"347.5K\", \"totalAcceptedRaw\": 185166, \"totalSubmissionRaw\": 347545, \"acRate\": \"53.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"604","questionFrontendId":"604","title":"Design Compressed String Iterator","titleSlug":"design-compressed-string-iterator","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.3K\", \"totalSubmission\": \"74.2K\", \"totalAcceptedRaw\": 29303, \"totalSubmissionRaw\": 74168, \"acRate\": \"39.5%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Iterator","translatedName":null,"slug":"iterator","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"605","questionFrontendId":"605","title":"Can Place Flowers","titleSlug":"can-place-flowers","translatedTitle":null,"stats":"{\"totalAccepted\": \"348.1K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 348075, \"totalSubmissionRaw\": 1072239, \"acRate\": \"32.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"609","questionFrontendId":"609","title":"Find Duplicate File in System","titleSlug":"find-duplicate-file-in-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"143.6K\", \"totalSubmission\": \"211.9K\", \"totalAcceptedRaw\": 143589, \"totalSubmissionRaw\": 211868, \"acRate\": \"67.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"611","questionFrontendId":"611","title":"Valid Triangle Number","titleSlug":"valid-triangle-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"165.9K\", \"totalSubmission\": \"328.4K\", \"totalAcceptedRaw\": 165878, \"totalSubmissionRaw\": 328376, \"acRate\": \"50.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"616","questionFrontendId":"616","title":"Add Bold Tag in String","titleSlug":"add-bold-tag-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"82.1K\", \"totalSubmission\": \"168.2K\", \"totalAcceptedRaw\": 82101, \"totalSubmissionRaw\": 168183, \"acRate\": \"48.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"621","questionFrontendId":"621","title":"Task Scheduler","titleSlug":"task-scheduler","translatedTitle":null,"stats":"{\"totalAccepted\": \"418.7K\", \"totalSubmission\": \"744K\", \"totalAcceptedRaw\": 418729, \"totalSubmissionRaw\": 743960, \"acRate\": \"56.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"624","questionFrontendId":"624","title":"Maximum Distance in Arrays","titleSlug":"maximum-distance-in-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.9K\", \"totalSubmission\": \"88.1K\", \"totalAcceptedRaw\": 36851, \"totalSubmissionRaw\": 88131, \"acRate\": \"41.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"628","questionFrontendId":"628","title":"Maximum Product of Three Numbers","titleSlug":"maximum-product-of-three-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"256.6K\", \"totalSubmission\": \"558.2K\", \"totalAcceptedRaw\": 256570, \"totalSubmissionRaw\": 558162, \"acRate\": \"46.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"630","questionFrontendId":"630","title":"Course Schedule III","titleSlug":"course-schedule-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"101.1K\", \"totalSubmission\": \"251.6K\", \"totalAcceptedRaw\": 101120, \"totalSubmissionRaw\": 251553, \"acRate\": \"40.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"632","questionFrontendId":"632","title":"Smallest Range Covering Elements from K Lists","titleSlug":"smallest-range-covering-elements-from-k-lists","translatedTitle":null,"stats":"{\"totalAccepted\": \"83.1K\", \"totalSubmission\": \"136.4K\", \"totalAcceptedRaw\": 83143, \"totalSubmissionRaw\": 136412, \"acRate\": \"60.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"636","questionFrontendId":"636","title":"Exclusive Time of Functions","titleSlug":"exclusive-time-of-functions","translatedTitle":null,"stats":"{\"totalAccepted\": \"187.9K\", \"totalSubmission\": \"307.1K\", \"totalAcceptedRaw\": 187859, \"totalSubmissionRaw\": 307128, \"acRate\": \"61.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"638","questionFrontendId":"638","title":"Shopping Offers","titleSlug":"shopping-offers","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.1K\", \"totalSubmission\": \"97.6K\", \"totalAcceptedRaw\": 52064, \"totalSubmissionRaw\": 97609, \"acRate\": \"53.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"643","questionFrontendId":"643","title":"Maximum Average Subarray I","titleSlug":"maximum-average-subarray-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"197.8K\", \"totalSubmission\": \"452.2K\", \"totalAcceptedRaw\": 197763, \"totalSubmissionRaw\": 452168, \"acRate\": \"43.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"644","questionFrontendId":"644","title":"Maximum Average Subarray II","titleSlug":"maximum-average-subarray-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.6K\", \"totalSubmission\": \"51.9K\", \"totalAcceptedRaw\": 18636, \"totalSubmissionRaw\": 51851, \"acRate\": \"35.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"645","questionFrontendId":"645","title":"Set Mismatch","titleSlug":"set-mismatch","translatedTitle":null,"stats":"{\"totalAccepted\": \"262.8K\", \"totalSubmission\": \"614.7K\", \"totalAcceptedRaw\": 262794, \"totalSubmissionRaw\": 614699, \"acRate\": \"42.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"646","questionFrontendId":"646","title":"Maximum Length of Pair Chain","titleSlug":"maximum-length-of-pair-chain","translatedTitle":null,"stats":"{\"totalAccepted\": \"132K\", \"totalSubmission\": \"233.5K\", \"totalAcceptedRaw\": 131968, \"totalSubmissionRaw\": 233467, \"acRate\": \"56.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"648","questionFrontendId":"648","title":"Replace Words","titleSlug":"replace-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"116.5K\", \"totalSubmission\": \"185.8K\", \"totalAcceptedRaw\": 116539, \"totalSubmissionRaw\": 185827, \"acRate\": \"62.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"654","questionFrontendId":"654","title":"Maximum Binary Tree","titleSlug":"maximum-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"249.9K\", \"totalSubmission\": \"295K\", \"totalAcceptedRaw\": 249947, \"totalSubmissionRaw\": 295018, \"acRate\": \"84.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"656","questionFrontendId":"656","title":"Coin Path","titleSlug":"coin-path","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"41.9K\", \"totalAcceptedRaw\": 13314, \"totalSubmissionRaw\": 41910, \"acRate\": \"31.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"658","questionFrontendId":"658","title":"Find K Closest Elements","titleSlug":"find-k-closest-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"421.4K\", \"totalSubmission\": \"900.2K\", \"totalAcceptedRaw\": 421412, \"totalSubmissionRaw\": 900220, \"acRate\": \"46.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"659","questionFrontendId":"659","title":"Split Array into Consecutive Subsequences","titleSlug":"split-array-into-consecutive-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"122.2K\", \"totalSubmission\": \"240.5K\", \"totalAcceptedRaw\": 122188, \"totalSubmissionRaw\": 240480, \"acRate\": \"50.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"661","questionFrontendId":"661","title":"Image Smoother","titleSlug":"image-smoother","translatedTitle":null,"stats":"{\"totalAccepted\": \"71.5K\", \"totalSubmission\": \"129.2K\", \"totalAcceptedRaw\": 71548, \"totalSubmissionRaw\": 129238, \"acRate\": \"55.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"665","questionFrontendId":"665","title":"Non-decreasing Array","titleSlug":"non-decreasing-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"237.9K\", \"totalSubmission\": \"980.4K\", \"totalAcceptedRaw\": 237879, \"totalSubmissionRaw\": 980422, \"acRate\": \"24.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"666","questionFrontendId":"666","title":"Path Sum IV","titleSlug":"path-sum-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.4K\", \"totalSubmission\": \"36K\", \"totalAcceptedRaw\": 21382, \"totalSubmissionRaw\": 35965, \"acRate\": \"59.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"667","questionFrontendId":"667","title":"Beautiful Arrangement II","titleSlug":"beautiful-arrangement-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"50.2K\", \"totalSubmission\": \"84K\", \"totalAcceptedRaw\": 50237, \"totalSubmissionRaw\": 83998, \"acRate\": \"59.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"673","questionFrontendId":"673","title":"Number of Longest Increasing Subsequence","titleSlug":"number-of-longest-increasing-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"140.4K\", \"totalSubmission\": \"328.4K\", \"totalAcceptedRaw\": 140435, \"totalSubmissionRaw\": 328435, \"acRate\": \"42.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"674","questionFrontendId":"674","title":"Longest Continuous Increasing Subsequence","titleSlug":"longest-continuous-increasing-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"222.2K\", \"totalSubmission\": \"451.1K\", \"totalAcceptedRaw\": 222185, \"totalSubmissionRaw\": 451060, \"acRate\": \"49.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"675","questionFrontendId":"675","title":"Cut Off Trees for Golf Event","titleSlug":"cut-off-trees-for-golf-event","translatedTitle":null,"stats":"{\"totalAccepted\": \"61.6K\", \"totalSubmission\": \"180.8K\", \"totalAcceptedRaw\": 61621, \"totalSubmissionRaw\": 180785, \"acRate\": \"34.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"679","questionFrontendId":"679","title":"24 Game","titleSlug":"24-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.5K\", \"totalSubmission\": \"143.4K\", \"totalAcceptedRaw\": 70519, \"totalSubmissionRaw\": 143429, \"acRate\": \"49.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"682","questionFrontendId":"682","title":"Baseball Game","titleSlug":"baseball-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"240.7K\", \"totalSubmission\": \"324.4K\", \"totalAcceptedRaw\": 240718, \"totalSubmissionRaw\": 324366, \"acRate\": \"74.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"683","questionFrontendId":"683","title":"K Empty Slots","titleSlug":"k-empty-slots","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.9K\", \"totalSubmission\": \"159.4K\", \"totalAcceptedRaw\": 58917, \"totalSubmissionRaw\": 159409, \"acRate\": \"37.0%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"689","questionFrontendId":"689","title":"Maximum Sum of 3 Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"66.9K\", \"totalSubmission\": \"136.5K\", \"totalAcceptedRaw\": 66861, \"totalSubmissionRaw\": 136474, \"acRate\": \"49.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"691","questionFrontendId":"691","title":"Stickers to Spell Word","titleSlug":"stickers-to-spell-word","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.2K\", \"totalSubmission\": \"80.4K\", \"totalAcceptedRaw\": 37219, \"totalSubmissionRaw\": 80424, \"acRate\": \"46.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"695","questionFrontendId":"695","title":"Max Area of Island","titleSlug":"max-area-of-island","translatedTitle":null,"stats":"{\"totalAccepted\": \"689.2K\", \"totalSubmission\": \"960.1K\", \"totalAcceptedRaw\": 689163, \"totalSubmissionRaw\": 960101, \"acRate\": \"71.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"697","questionFrontendId":"697","title":"Degree of an Array","titleSlug":"degree-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"177.5K\", \"totalSubmission\": \"317.3K\", \"totalAcceptedRaw\": 177468, \"totalSubmissionRaw\": 317303, \"acRate\": \"55.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"698","questionFrontendId":"698","title":"Partition to K Equal Sum Subsets","titleSlug":"partition-to-k-equal-sum-subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"232.1K\", \"totalSubmission\": \"579K\", \"totalAcceptedRaw\": 232079, \"totalSubmissionRaw\": 578988, \"acRate\": \"40.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"699","questionFrontendId":"699","title":"Falling Squares","titleSlug":"falling-squares","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.7K\", \"totalSubmission\": \"51K\", \"totalAcceptedRaw\": 22695, \"totalSubmissionRaw\": 50967, \"acRate\": \"44.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"713","questionFrontendId":"713","title":"Subarray Product Less Than K","titleSlug":"subarray-product-less-than-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"221K\", \"totalSubmission\": \"484K\", \"totalAcceptedRaw\": 221025, \"totalSubmissionRaw\": 484020, \"acRate\": \"45.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"714","questionFrontendId":"714","title":"Best Time to Buy and Sell Stock with Transaction Fee","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee","translatedTitle":null,"stats":"{\"totalAccepted\": \"219.8K\", \"totalSubmission\": \"337.9K\", \"totalAcceptedRaw\": 219800, \"totalSubmissionRaw\": 337923, \"acRate\": \"65.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"717","questionFrontendId":"717","title":"1-bit and 2-bit Characters","titleSlug":"1-bit-and-2-bit-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"115.8K\", \"totalSubmission\": \"253.2K\", \"totalAcceptedRaw\": 115805, \"totalSubmissionRaw\": 253200, \"acRate\": \"45.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"718","questionFrontendId":"718","title":"Maximum Length of Repeated Subarray","titleSlug":"maximum-length-of-repeated-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"258.8K\", \"totalSubmission\": \"504.6K\", \"totalAcceptedRaw\": 258775, \"totalSubmissionRaw\": 504577, \"acRate\": \"51.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"719","questionFrontendId":"719","title":"Find K-th Smallest Pair Distance","titleSlug":"find-k-th-smallest-pair-distance","translatedTitle":null,"stats":"{\"totalAccepted\": \"74.1K\", \"totalSubmission\": \"201.8K\", \"totalAcceptedRaw\": 74084, \"totalSubmissionRaw\": 201821, \"acRate\": \"36.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"720","questionFrontendId":"720","title":"Longest Word in Dictionary","titleSlug":"longest-word-in-dictionary","translatedTitle":null,"stats":"{\"totalAccepted\": \"134.4K\", \"totalSubmission\": \"258.7K\", \"totalAcceptedRaw\": 134388, \"totalSubmissionRaw\": 258746, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"721","questionFrontendId":"721","title":"Accounts Merge","titleSlug":"accounts-merge","translatedTitle":null,"stats":"{\"totalAccepted\": \"302.4K\", \"totalSubmission\": \"536.7K\", \"totalAcceptedRaw\": 302411, \"totalSubmissionRaw\": 536748, \"acRate\": \"56.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"722","questionFrontendId":"722","title":"Remove Comments","titleSlug":"remove-comments","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.9K\", \"totalSubmission\": \"167.4K\", \"totalAcceptedRaw\": 63933, \"totalSubmissionRaw\": 167372, \"acRate\": \"38.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"723","questionFrontendId":"723","title":"Candy Crush","titleSlug":"candy-crush","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.2K\", \"totalSubmission\": \"82.5K\", \"totalAcceptedRaw\": 63210, \"totalSubmissionRaw\": 82506, \"acRate\": \"76.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"724","questionFrontendId":"724","title":"Find Pivot Index","titleSlug":"find-pivot-index","translatedTitle":null,"stats":"{\"totalAccepted\": \"771.7K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 771746, \"totalSubmissionRaw\": 1415131, \"acRate\": \"54.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"733","questionFrontendId":"733","title":"Flood Fill","titleSlug":"flood-fill","translatedTitle":null,"stats":"{\"totalAccepted\": \"682.9K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 682854, \"totalSubmissionRaw\": 1104613, \"acRate\": \"61.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"734","questionFrontendId":"734","title":"Sentence Similarity","titleSlug":"sentence-similarity","translatedTitle":null,"stats":"{\"totalAccepted\": \"60K\", \"totalSubmission\": \"136.4K\", \"totalAcceptedRaw\": 59975, \"totalSubmissionRaw\": 136387, \"acRate\": \"44.0%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"735","questionFrontendId":"735","title":"Asteroid Collision","titleSlug":"asteroid-collision","translatedTitle":null,"stats":"{\"totalAccepted\": \"260.5K\", \"totalSubmission\": \"586.5K\", \"totalAcceptedRaw\": 260456, \"totalSubmissionRaw\": 586510, \"acRate\": \"44.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"737","questionFrontendId":"737","title":"Sentence Similarity II","titleSlug":"sentence-similarity-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.1K\", \"totalSubmission\": \"132.8K\", \"totalAcceptedRaw\": 65064, \"totalSubmissionRaw\": 132773, \"acRate\": \"49.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"739","questionFrontendId":"739","title":"Daily Temperatures","titleSlug":"daily-temperatures","translatedTitle":null,"stats":"{\"totalAccepted\": \"587K\", \"totalSubmission\": \"885.1K\", \"totalAcceptedRaw\": 586976, \"totalSubmissionRaw\": 885128, \"acRate\": \"66.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"740","questionFrontendId":"740","title":"Delete and Earn","titleSlug":"delete-and-earn","translatedTitle":null,"stats":"{\"totalAccepted\": \"258.9K\", \"totalSubmission\": \"453.5K\", \"totalAcceptedRaw\": 258919, \"totalSubmissionRaw\": 453530, \"acRate\": \"57.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"741","questionFrontendId":"741","title":"Cherry Pickup","titleSlug":"cherry-pickup","translatedTitle":null,"stats":"{\"totalAccepted\": \"64.1K\", \"totalSubmission\": \"176.5K\", \"totalAcceptedRaw\": 64076, \"totalSubmissionRaw\": 176506, \"acRate\": \"36.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"745","questionFrontendId":"744","title":"Find Smallest Letter Greater Than Target","titleSlug":"find-smallest-letter-greater-than-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"282.4K\", \"totalSubmission\": \"618.8K\", \"totalAcceptedRaw\": 282450, \"totalSubmissionRaw\": 618796, \"acRate\": \"45.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"747","questionFrontendId":"746","title":"Min Cost Climbing Stairs","titleSlug":"min-cost-climbing-stairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"773.9K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 773885, \"totalSubmissionRaw\": 1226234, \"acRate\": \"63.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"748","questionFrontendId":"747","title":"Largest Number At Least Twice of Others","titleSlug":"largest-number-at-least-twice-of-others","translatedTitle":null,"stats":"{\"totalAccepted\": \"197.8K\", \"totalSubmission\": \"420.5K\", \"totalAcceptedRaw\": 197796, \"totalSubmissionRaw\": 420511, \"acRate\": \"47.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"749","questionFrontendId":"748","title":"Shortest Completing Word","titleSlug":"shortest-completing-word","translatedTitle":null,"stats":"{\"totalAccepted\": \"59.9K\", \"totalSubmission\": \"101.2K\", \"totalAcceptedRaw\": 59934, \"totalSubmissionRaw\": 101198, \"acRate\": \"59.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"750","questionFrontendId":"749","title":"Contain Virus","titleSlug":"contain-virus","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.2K\", \"totalSubmission\": \"20.1K\", \"totalAcceptedRaw\": 10239, \"totalSubmissionRaw\": 20051, \"acRate\": \"51.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"751","questionFrontendId":"750","title":"Number Of Corner Rectangles","titleSlug":"number-of-corner-rectangles","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.1K\", \"totalSubmission\": \"54.9K\", \"totalAcceptedRaw\": 37100, \"totalSubmissionRaw\": 54937, \"acRate\": \"67.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"753","questionFrontendId":"752","title":"Open the Lock","titleSlug":"open-the-lock","translatedTitle":null,"stats":"{\"totalAccepted\": \"197.6K\", \"totalSubmission\": \"355.3K\", \"totalAcceptedRaw\": 197567, \"totalSubmissionRaw\": 355274, \"acRate\": \"55.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"756","questionFrontendId":"755","title":"Pour Water","titleSlug":"pour-water","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.7K\", \"totalSubmission\": \"74.9K\", \"totalAcceptedRaw\": 34743, \"totalSubmissionRaw\": 74880, \"acRate\": \"46.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"759","questionFrontendId":"757","title":"Set Intersection Size At Least Two","titleSlug":"set-intersection-size-at-least-two","translatedTitle":null,"stats":"{\"totalAccepted\": \"19K\", \"totalSubmission\": \"43.3K\", \"totalAcceptedRaw\": 18957, \"totalSubmissionRaw\": 43287, \"acRate\": \"43.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"760","questionFrontendId":"758","title":"Bold Words in String","titleSlug":"bold-words-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.8K\", \"totalSubmission\": \"35K\", \"totalAcceptedRaw\": 17751, \"totalSubmissionRaw\": 34957, \"acRate\": \"50.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"761","questionFrontendId":"759","title":"Employee Free Time","titleSlug":"employee-free-time","translatedTitle":null,"stats":"{\"totalAccepted\": \"130.5K\", \"totalSubmission\": \"181.7K\", \"totalAcceptedRaw\": 130465, \"totalSubmissionRaw\": 181718, \"acRate\": \"71.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"762","questionFrontendId":"760","title":"Find Anagram Mappings","titleSlug":"find-anagram-mappings","translatedTitle":null,"stats":"{\"totalAccepted\": \"88K\", \"totalSubmission\": \"106K\", \"totalAcceptedRaw\": 87956, \"totalSubmissionRaw\": 106046, \"acRate\": \"82.9%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"769","questionFrontendId":"764","title":"Largest Plus Sign","titleSlug":"largest-plus-sign","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.5K\", \"totalSubmission\": \"108.6K\", \"totalAcceptedRaw\": 52479, \"totalSubmissionRaw\": 108598, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"772","questionFrontendId":"427","title":"Construct Quad Tree","titleSlug":"construct-quad-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"92.6K\", \"totalSubmission\": \"124.3K\", \"totalAcceptedRaw\": 92628, \"totalSubmissionRaw\": 124326, \"acRate\": \"74.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"777","questionFrontendId":"766","title":"Toeplitz Matrix","titleSlug":"toeplitz-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"273K\", \"totalSubmission\": \"397.6K\", \"totalAcceptedRaw\": 272986, \"totalSubmissionRaw\": 397614, \"acRate\": \"68.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"779","questionFrontendId":"768","title":"Max Chunks To Make Sorted II","titleSlug":"max-chunks-to-make-sorted-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.3K\", \"totalSubmission\": \"99.1K\", \"totalAcceptedRaw\": 52309, \"totalSubmissionRaw\": 99052, \"acRate\": \"52.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"780","questionFrontendId":"769","title":"Max Chunks To Make Sorted","titleSlug":"max-chunks-to-make-sorted","translatedTitle":null,"stats":"{\"totalAccepted\": \"88.2K\", \"totalSubmission\": \"151.5K\", \"totalAcceptedRaw\": 88199, \"totalSubmissionRaw\": 151523, \"acRate\": \"58.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"786","questionFrontendId":"702","title":"Search in a Sorted Array of Unknown Size","titleSlug":"search-in-a-sorted-array-of-unknown-size","translatedTitle":null,"stats":"{\"totalAccepted\": \"85.8K\", \"totalSubmission\": \"120K\", \"totalAcceptedRaw\": 85771, \"totalSubmissionRaw\": 119961, \"acRate\": \"71.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"787","questionFrontendId":"773","title":"Sliding Puzzle","titleSlug":"sliding-puzzle","translatedTitle":null,"stats":"{\"totalAccepted\": \"83.6K\", \"totalSubmission\": \"130.5K\", \"totalAcceptedRaw\": 83649, \"totalSubmissionRaw\": 130505, \"acRate\": \"64.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"788","questionFrontendId":"774","title":"Minimize Max Distance to Gas Station","titleSlug":"minimize-max-distance-to-gas-station","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.1K\", \"totalSubmission\": \"54.2K\", \"totalAcceptedRaw\": 28064, \"totalSubmissionRaw\": 54249, \"acRate\": \"51.7%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"790","questionFrontendId":"775","title":"Global and Local Inversions","titleSlug":"global-and-local-inversions","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.6K\", \"totalSubmission\": \"146.7K\", \"totalAcceptedRaw\": 63587, \"totalSubmissionRaw\": 146690, \"acRate\": \"43.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"792","questionFrontendId":"704","title":"Binary Search","titleSlug":"binary-search","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6M\", \"totalSubmission\": \"2.9M\", \"totalAcceptedRaw\": 1608751, \"totalSubmissionRaw\": 2901593, \"acRate\": \"55.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"794","questionFrontendId":"778","title":"Swim in Rising Water","titleSlug":"swim-in-rising-water","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.1K\", \"totalSubmission\": \"190.7K\", \"totalAcceptedRaw\": 114066, \"totalSubmissionRaw\": 190656, \"acRate\": \"59.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"797","questionFrontendId":"781","title":"Rabbits in Forest","titleSlug":"rabbits-in-forest","translatedTitle":null,"stats":"{\"totalAccepted\": \"45K\", \"totalSubmission\": \"82K\", \"totalAcceptedRaw\": 44962, \"totalSubmissionRaw\": 81989, \"acRate\": \"54.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"798","questionFrontendId":"782","title":"Transform to Chessboard","titleSlug":"transform-to-chessboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.8K\", \"totalSubmission\": \"30.6K\", \"totalAcceptedRaw\": 15836, \"totalSubmissionRaw\": 30625, \"acRate\": \"51.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"802","questionFrontendId":"786","title":"K-th Smallest Prime Fraction","titleSlug":"k-th-smallest-prime-fraction","translatedTitle":null,"stats":"{\"totalAccepted\": \"34K\", \"totalSubmission\": \"65.9K\", \"totalAcceptedRaw\": 34000, \"totalSubmissionRaw\": 65946, \"acRate\": \"51.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"805","questionFrontendId":"789","title":"Escape The Ghosts","titleSlug":"escape-the-ghosts","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.7K\", \"totalSubmission\": \"40.6K\", \"totalAcceptedRaw\": 24684, \"totalSubmissionRaw\": 40610, \"acRate\": \"60.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"810","questionFrontendId":"794","title":"Valid Tic-Tac-Toe State","titleSlug":"valid-tic-tac-toe-state","translatedTitle":null,"stats":"{\"totalAccepted\": \"53.7K\", \"totalSubmission\": \"153K\", \"totalAcceptedRaw\": 53653, \"totalSubmissionRaw\": 153047, \"acRate\": \"35.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"811","questionFrontendId":"795","title":"Number of Subarrays with Bounded Maximum","titleSlug":"number-of-subarrays-with-bounded-maximum","translatedTitle":null,"stats":"{\"totalAccepted\": \"60.3K\", \"totalSubmission\": \"114.2K\", \"totalAcceptedRaw\": 60269, \"totalSubmissionRaw\": 114160, \"acRate\": \"52.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"814","questionFrontendId":"798","title":"Smallest Rotation with Highest Score","titleSlug":"smallest-rotation-with-highest-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"23.2K\", \"totalAcceptedRaw\": 11672, \"totalSubmissionRaw\": 23236, \"acRate\": \"50.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"816","questionFrontendId":"705","title":"Design HashSet","titleSlug":"design-hashset","translatedTitle":null,"stats":"{\"totalAccepted\": \"278.3K\", \"totalSubmission\": \"423.8K\", \"totalAcceptedRaw\": 278251, \"totalSubmissionRaw\": 423827, \"acRate\": \"65.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"817","questionFrontendId":"706","title":"Design HashMap","titleSlug":"design-hashmap","translatedTitle":null,"stats":"{\"totalAccepted\": \"401.9K\", \"totalSubmission\": \"620.9K\", \"totalAcceptedRaw\": 401878, \"totalSubmissionRaw\": 620861, \"acRate\": \"64.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"819","questionFrontendId":"801","title":"Minimum Swaps To Make Sequences Increasing","titleSlug":"minimum-swaps-to-make-sequences-increasing","translatedTitle":null,"stats":"{\"totalAccepted\": \"62K\", \"totalSubmission\": \"157.5K\", \"totalAcceptedRaw\": 62015, \"totalSubmissionRaw\": 157543, \"acRate\": \"39.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"821","questionFrontendId":"803","title":"Bricks Falling When Hit","titleSlug":"bricks-falling-when-hit","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.6K\", \"totalSubmission\": \"80.4K\", \"totalAcceptedRaw\": 27606, \"totalSubmissionRaw\": 80382, \"acRate\": \"34.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"822","questionFrontendId":"804","title":"Unique Morse Code Words","titleSlug":"unique-morse-code-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"310.5K\", \"totalSubmission\": \"375.8K\", \"totalAcceptedRaw\": 310457, \"totalSubmissionRaw\": 375758, \"acRate\": \"82.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"823","questionFrontendId":"805","title":"Split Array With Same Average","titleSlug":"split-array-with-same-average","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.9K\", \"totalSubmission\": \"116.5K\", \"totalAcceptedRaw\": 29911, \"totalSubmissionRaw\": 116468, \"acRate\": \"25.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"824","questionFrontendId":"806","title":"Number of Lines To Write String","titleSlug":"number-of-lines-to-write-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.7K\", \"totalSubmission\": \"95.6K\", \"totalAcceptedRaw\": 63669, \"totalSubmissionRaw\": 95597, \"acRate\": \"66.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"825","questionFrontendId":"807","title":"Max Increase to Keep City Skyline","titleSlug":"max-increase-to-keep-city-skyline","translatedTitle":null,"stats":"{\"totalAccepted\": \"143.4K\", \"totalSubmission\": \"166.9K\", \"totalAcceptedRaw\": 143421, \"totalSubmissionRaw\": 166881, \"acRate\": \"85.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"827","questionFrontendId":"809","title":"Expressive Words","titleSlug":"expressive-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"106.8K\", \"totalSubmission\": \"231.1K\", \"totalAcceptedRaw\": 106800, \"totalSubmissionRaw\": 231052, \"acRate\": \"46.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"828","questionFrontendId":"810","title":"Chalkboard XOR Game","titleSlug":"chalkboard-xor-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"8K\", \"totalSubmission\": \"14.3K\", \"totalAcceptedRaw\": 8021, \"totalSubmissionRaw\": 14260, \"acRate\": \"56.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"829","questionFrontendId":"811","title":"Subdomain Visit Count","titleSlug":"subdomain-visit-count","translatedTitle":null,"stats":"{\"totalAccepted\": \"206.8K\", \"totalSubmission\": \"273.9K\", \"totalAcceptedRaw\": 206801, \"totalSubmissionRaw\": 273946, \"acRate\": \"75.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"830","questionFrontendId":"812","title":"Largest Triangle Area","titleSlug":"largest-triangle-area","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.3K\", \"totalSubmission\": \"67.3K\", \"totalAcceptedRaw\": 40344, \"totalSubmissionRaw\": 67320, \"acRate\": \"59.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"831","questionFrontendId":"813","title":"Largest Sum of Averages","titleSlug":"largest-sum-of-averages","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.8K\", \"totalSubmission\": \"86.4K\", \"totalAcceptedRaw\": 45781, \"totalSubmissionRaw\": 86423, \"acRate\": \"53.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"833","questionFrontendId":"815","title":"Bus Routes","titleSlug":"bus-routes","translatedTitle":null,"stats":"{\"totalAccepted\": \"120.9K\", \"totalSubmission\": \"264.9K\", \"totalAcceptedRaw\": 120870, \"totalSubmissionRaw\": 264936, \"acRate\": \"45.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"835","questionFrontendId":"817","title":"Linked List Components","titleSlug":"linked-list-components","translatedTitle":null,"stats":"{\"totalAccepted\": \"79.3K\", \"totalSubmission\": \"137.3K\", \"totalAcceptedRaw\": 79272, \"totalSubmissionRaw\": 137291, \"acRate\": \"57.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"839","questionFrontendId":"820","title":"Short Encoding of Words","titleSlug":"short-encoding-of-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"91.4K\", \"totalSubmission\": \"150.8K\", \"totalAcceptedRaw\": 91354, \"totalSubmissionRaw\": 150755, \"acRate\": \"60.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"841","questionFrontendId":"821","title":"Shortest Distance to a Character","titleSlug":"shortest-distance-to-a-character","translatedTitle":null,"stats":"{\"totalAccepted\": \"155.2K\", \"totalSubmission\": \"217.6K\", \"totalAcceptedRaw\": 155206, \"totalSubmissionRaw\": 217571, \"acRate\": \"71.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"842","questionFrontendId":"822","title":"Card Flipping Game","titleSlug":"card-flipping-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.2K\", \"totalSubmission\": \"33K\", \"totalAcceptedRaw\": 15176, \"totalSubmissionRaw\": 33041, \"acRate\": \"45.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"843","questionFrontendId":"823","title":"Binary Trees With Factors","titleSlug":"binary-trees-with-factors","translatedTitle":null,"stats":"{\"totalAccepted\": \"89.5K\", \"totalSubmission\": \"180K\", \"totalAcceptedRaw\": 89487, \"totalSubmissionRaw\": 180021, \"acRate\": \"49.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"852","questionFrontendId":"825","title":"Friends Of Appropriate Ages","titleSlug":"friends-of-appropriate-ages","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.7K\", \"totalSubmission\": \"152.6K\", \"totalAcceptedRaw\": 70689, \"totalSubmissionRaw\": 152584, \"acRate\": \"46.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"853","questionFrontendId":"826","title":"Most Profit Assigning Work","titleSlug":"most-profit-assigning-work","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.8K\", \"totalSubmission\": \"117.8K\", \"totalAcceptedRaw\": 52810, \"totalSubmissionRaw\": 117798, \"acRate\": \"44.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"854","questionFrontendId":"827","title":"Making A Large Island","titleSlug":"making-a-large-island","translatedTitle":null,"stats":"{\"totalAccepted\": \"127.6K\", \"totalSubmission\": \"284.4K\", \"totalAcceptedRaw\": 127622, \"totalSubmissionRaw\": 284388, \"acRate\": \"44.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"859","questionFrontendId":"641","title":"Design Circular Deque","titleSlug":"design-circular-deque","translatedTitle":null,"stats":"{\"totalAccepted\": \"54.6K\", \"totalSubmission\": \"95.1K\", \"totalAcceptedRaw\": 54578, \"totalSubmissionRaw\": 95094, \"acRate\": \"57.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"860","questionFrontendId":"622","title":"Design Circular Queue","titleSlug":"design-circular-queue","translatedTitle":null,"stats":"{\"totalAccepted\": \"259.1K\", \"totalSubmission\": \"502.2K\", \"totalAcceptedRaw\": 259088, \"totalSubmissionRaw\": 502197, \"acRate\": \"51.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"861","questionFrontendId":"832","title":"Flipping an Image","titleSlug":"flipping-an-image","translatedTitle":null,"stats":"{\"totalAccepted\": \"352.4K\", \"totalSubmission\": \"436.4K\", \"totalAcceptedRaw\": 352387, \"totalSubmissionRaw\": 436417, \"acRate\": \"80.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"862","questionFrontendId":"833","title":"Find And Replace in String","titleSlug":"find-and-replace-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"133.3K\", \"totalSubmission\": \"246.8K\", \"totalAcceptedRaw\": 133263, \"totalSubmissionRaw\": 246785, \"acRate\": \"54.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"864","questionFrontendId":"835","title":"Image Overlap","titleSlug":"image-overlap","translatedTitle":null,"stats":"{\"totalAccepted\": \"88.3K\", \"totalSubmission\": \"138.2K\", \"totalAcceptedRaw\": 88300, \"totalSubmissionRaw\": 138231, \"acRate\": \"63.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"869","questionFrontendId":"839","title":"Similar String Groups","titleSlug":"similar-string-groups","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.9K\", \"totalSubmission\": \"133.2K\", \"totalAcceptedRaw\": 63879, \"totalSubmissionRaw\": 133184, \"acRate\": \"48.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"870","questionFrontendId":"840","title":"Magic Squares In Grid","titleSlug":"magic-squares-in-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"35K\", \"totalSubmission\": \"90.6K\", \"totalAcceptedRaw\": 34991, \"totalSubmissionRaw\": 90589, \"acRate\": \"38.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"873","questionFrontendId":"843","title":"Guess the Word","titleSlug":"guess-the-word","translatedTitle":null,"stats":"{\"totalAccepted\": \"130.1K\", \"totalSubmission\": \"314.2K\", \"totalAcceptedRaw\": 130129, \"totalSubmissionRaw\": 314220, \"acRate\": \"41.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"875","questionFrontendId":"845","title":"Longest Mountain in Array","titleSlug":"longest-mountain-in-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"108.4K\", \"totalSubmission\": \"269.6K\", \"totalAcceptedRaw\": 108405, \"totalSubmissionRaw\": 269596, \"acRate\": \"40.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"876","questionFrontendId":"846","title":"Hand of Straights","titleSlug":"hand-of-straights","translatedTitle":null,"stats":"{\"totalAccepted\": \"113.5K\", \"totalSubmission\": \"201.8K\", \"totalAcceptedRaw\": 113453, \"totalSubmissionRaw\": 201770, \"acRate\": \"56.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"878","questionFrontendId":"848","title":"Shifting Letters","titleSlug":"shifting-letters","translatedTitle":null,"stats":"{\"totalAccepted\": \"84.4K\", \"totalSubmission\": \"186.7K\", \"totalAcceptedRaw\": 84404, \"totalSubmissionRaw\": 186717, \"acRate\": \"45.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"879","questionFrontendId":"849","title":"Maximize Distance to Closest Person","titleSlug":"maximize-distance-to-closest-person","translatedTitle":null,"stats":"{\"totalAccepted\": \"196.9K\", \"totalSubmission\": \"413.4K\", \"totalAcceptedRaw\": 196942, \"totalSubmissionRaw\": 413439, \"acRate\": \"47.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"880","questionFrontendId":"850","title":"Rectangle Area II","titleSlug":"rectangle-area-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.3K\", \"totalSubmission\": \"59.9K\", \"totalAcceptedRaw\": 32323, \"totalSubmissionRaw\": 59947, \"acRate\": \"53.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Line Sweep","translatedName":null,"slug":"line-sweep","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"881","questionFrontendId":"851","title":"Loud and Rich","titleSlug":"loud-and-rich","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.4K\", \"totalSubmission\": \"55.5K\", \"totalAcceptedRaw\": 32382, \"totalSubmissionRaw\": 55452, \"acRate\": \"58.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"882","questionFrontendId":"852","title":"Peak Index in a Mountain Array","titleSlug":"peak-index-in-a-mountain-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"530.8K\", \"totalSubmission\": \"768.1K\", \"totalAcceptedRaw\": 530810, \"totalSubmissionRaw\": 768079, \"acRate\": \"69.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"883","questionFrontendId":"853","title":"Car Fleet","titleSlug":"car-fleet","translatedTitle":null,"stats":"{\"totalAccepted\": \"129K\", \"totalSubmission\": \"256.6K\", \"totalAcceptedRaw\": 128974, \"totalSubmissionRaw\": 256638, \"acRate\": \"50.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"887","questionFrontendId":"857","title":"Minimum Cost to Hire K Workers","titleSlug":"minimum-cost-to-hire-k-workers","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.2K\", \"totalSubmission\": \"111.4K\", \"totalAcceptedRaw\": 58233, \"totalSubmissionRaw\": 111424, \"acRate\": \"52.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"890","questionFrontendId":"860","title":"Lemonade Change","titleSlug":"lemonade-change","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.3K\", \"totalSubmission\": \"235K\", \"totalAcceptedRaw\": 124263, \"totalSubmissionRaw\": 234991, \"acRate\": \"52.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"891","questionFrontendId":"861","title":"Score After Flipping Matrix","titleSlug":"score-after-flipping-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.7K\", \"totalSubmission\": \"54.3K\", \"totalAcceptedRaw\": 40694, \"totalSubmissionRaw\": 54294, \"acRate\": \"75.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"892","questionFrontendId":"862","title":"Shortest Subarray with Sum at Least K","titleSlug":"shortest-subarray-with-sum-at-least-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"84.1K\", \"totalSubmission\": \"322.7K\", \"totalAcceptedRaw\": 84068, \"totalSubmissionRaw\": 322662, \"acRate\": \"26.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"894","questionFrontendId":"710","title":"Random Pick with Blacklist","titleSlug":"random-pick-with-blacklist","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.8K\", \"totalSubmission\": \"106.6K\", \"totalAcceptedRaw\": 35755, \"totalSubmissionRaw\": 106616, \"acRate\": \"33.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"895","questionFrontendId":"864","title":"Shortest Path to Get All Keys","titleSlug":"shortest-path-to-get-all-keys","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.5K\", \"totalSubmission\": \"66.9K\", \"totalAcceptedRaw\": 30479, \"totalSubmissionRaw\": 66925, \"acRate\": \"45.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"898","questionFrontendId":"867","title":"Transpose Matrix","titleSlug":"transpose-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"237.8K\", \"totalSubmission\": \"370.7K\", \"totalAcceptedRaw\": 237800, \"totalSubmissionRaw\": 370747, \"acRate\": \"64.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"901","questionFrontendId":"870","title":"Advantage Shuffle","titleSlug":"advantage-shuffle","translatedTitle":null,"stats":"{\"totalAccepted\": \"59.8K\", \"totalSubmission\": \"115.3K\", \"totalAcceptedRaw\": 59785, \"totalSubmissionRaw\": 115308, \"acRate\": \"51.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"902","questionFrontendId":"871","title":"Minimum Number of Refueling Stops","titleSlug":"minimum-number-of-refueling-stops","translatedTitle":null,"stats":"{\"totalAccepted\": \"121.8K\", \"totalSubmission\": \"305.8K\", \"totalAcceptedRaw\": 121760, \"totalSubmissionRaw\": 305763, \"acRate\": \"39.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"905","questionFrontendId":"873","title":"Length of Longest Fibonacci Subsequence","titleSlug":"length-of-longest-fibonacci-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"55.4K\", \"totalSubmission\": \"114.6K\", \"totalAcceptedRaw\": 55403, \"totalSubmissionRaw\": 114643, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"906","questionFrontendId":"874","title":"Walking Robot Simulation","titleSlug":"walking-robot-simulation","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.1K\", \"totalSubmission\": \"92.9K\", \"totalAcceptedRaw\": 36098, \"totalSubmissionRaw\": 92871, \"acRate\": \"38.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"907","questionFrontendId":"875","title":"Koko Eating Bananas","titleSlug":"koko-eating-bananas","translatedTitle":null,"stats":"{\"totalAccepted\": \"340.7K\", \"totalSubmission\": \"651.7K\", \"totalAcceptedRaw\": 340689, \"totalSubmissionRaw\": 651731, \"acRate\": \"52.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"909","questionFrontendId":"877","title":"Stone Game","titleSlug":"stone-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"182.4K\", \"totalSubmission\": \"261.7K\", \"totalAcceptedRaw\": 182449, \"totalSubmissionRaw\": 261655, \"acRate\": \"69.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"911","questionFrontendId":"879","title":"Profitable Schemes","titleSlug":"profitable-schemes","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.8K\", \"totalSubmission\": \"43.8K\", \"totalAcceptedRaw\": 17776, \"totalSubmissionRaw\": 43793, \"acRate\": \"40.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"912","questionFrontendId":"528","title":"Random Pick with Weight","titleSlug":"random-pick-with-weight","translatedTitle":null,"stats":"{\"totalAccepted\": \"357K\", \"totalSubmission\": \"774.5K\", \"totalAcceptedRaw\": 356996, \"totalSubmissionRaw\": 774550, \"acRate\": \"46.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"914","questionFrontendId":"497","title":"Random Point in Non-overlapping Rectangles","titleSlug":"random-point-in-non-overlapping-rectangles","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.7K\", \"totalSubmission\": \"93.2K\", \"totalAcceptedRaw\": 36679, \"totalSubmissionRaw\": 93194, \"acRate\": \"39.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Reservoir Sampling","translatedName":null,"slug":"reservoir-sampling","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"917","questionFrontendId":"881","title":"Boats to Save People","titleSlug":"boats-to-save-people","translatedTitle":null,"stats":"{\"totalAccepted\": \"173.4K\", \"totalSubmission\": \"326.8K\", \"totalAcceptedRaw\": 173407, \"totalSubmissionRaw\": 326835, \"acRate\": \"53.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"919","questionFrontendId":"883","title":"Projection Area of 3D Shapes","titleSlug":"projection-area-of-3d-shapes","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.8K\", \"totalSubmission\": \"65.7K\", \"totalAcceptedRaw\": 46774, \"totalSubmissionRaw\": 65738, \"acRate\": \"71.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"921","questionFrontendId":"885","title":"Spiral Matrix III","titleSlug":"spiral-matrix-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.9K\", \"totalSubmission\": \"55.7K\", \"totalAcceptedRaw\": 40879, \"totalSubmissionRaw\": 55729, \"acRate\": \"73.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"924","questionFrontendId":"888","title":"Fair Candy Swap","titleSlug":"fair-candy-swap","translatedTitle":null,"stats":"{\"totalAccepted\": \"99.4K\", \"totalSubmission\": \"163.8K\", \"totalAcceptedRaw\": 99438, \"totalSubmissionRaw\": 163833, \"acRate\": \"60.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"925","questionFrontendId":"889","title":"Construct Binary Tree from Preorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"86.7K\", \"totalSubmission\": \"122.2K\", \"totalAcceptedRaw\": 86717, \"totalSubmissionRaw\": 122198, \"acRate\": \"71.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"926","questionFrontendId":"890","title":"Find and Replace Pattern","titleSlug":"find-and-replace-pattern","translatedTitle":null,"stats":"{\"totalAccepted\": \"167.9K\", \"totalSubmission\": \"216.3K\", \"totalAcceptedRaw\": 167897, \"totalSubmissionRaw\": 216346, \"acRate\": \"77.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"927","questionFrontendId":"891","title":"Sum of Subsequence Widths","titleSlug":"sum-of-subsequence-widths","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.3K\", \"totalSubmission\": \"50.1K\", \"totalAcceptedRaw\": 18328, \"totalSubmissionRaw\": 50080, \"acRate\": \"36.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"928","questionFrontendId":"892","title":"Surface Area of 3D Shapes","titleSlug":"surface-area-of-3d-shapes","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.6K\", \"totalSubmission\": \"52.5K\", \"totalAcceptedRaw\": 33586, \"totalSubmissionRaw\": 52489, \"acRate\": \"64.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"929","questionFrontendId":"893","title":"Groups of Special-Equivalent Strings","titleSlug":"groups-of-special-equivalent-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.6K\", \"totalSubmission\": \"62.7K\", \"totalAcceptedRaw\": 44551, \"totalSubmissionRaw\": 62696, \"acRate\": \"71.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"932","questionFrontendId":"896","title":"Monotonic Array","titleSlug":"monotonic-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"253.6K\", \"totalSubmission\": \"434.6K\", \"totalAcceptedRaw\": 253628, \"totalSubmissionRaw\": 434608, \"acRate\": \"58.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"934","questionFrontendId":"898","title":"Bitwise ORs of Subarrays","titleSlug":"bitwise-ors-of-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.5K\", \"totalSubmission\": \"81.9K\", \"totalAcceptedRaw\": 30458, \"totalSubmissionRaw\": 81921, \"acRate\": \"37.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"936","questionFrontendId":"900","title":"RLE Iterator","titleSlug":"rle-iterator","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.1K\", \"totalSubmission\": \"106.2K\", \"totalAcceptedRaw\": 63098, \"totalSubmissionRaw\": 106174, \"acRate\": \"59.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Iterator","translatedName":null,"slug":"iterator","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"938","questionFrontendId":"902","title":"Numbers At Most N Given Digit Set","titleSlug":"numbers-at-most-n-given-digit-set","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.6K\", \"totalSubmission\": \"95.6K\", \"totalAcceptedRaw\": 39603, \"totalSubmissionRaw\": 95582, \"acRate\": \"41.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"940","questionFrontendId":"904","title":"Fruit Into Baskets","titleSlug":"fruit-into-baskets","translatedTitle":null,"stats":"{\"totalAccepted\": \"327K\", \"totalSubmission\": \"747.8K\", \"totalAcceptedRaw\": 326964, \"totalSubmissionRaw\": 747764, \"acRate\": \"43.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"941","questionFrontendId":"905","title":"Sort Array By Parity","titleSlug":"sort-array-by-parity","translatedTitle":null,"stats":"{\"totalAccepted\": \"588.7K\", \"totalSubmission\": \"778.7K\", \"totalAcceptedRaw\": 588664, \"totalSubmissionRaw\": 778692, \"acRate\": \"75.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"943","questionFrontendId":"907","title":"Sum of Subarray Minimums","titleSlug":"sum-of-subarray-minimums","translatedTitle":null,"stats":"{\"totalAccepted\": \"142.4K\", \"totalSubmission\": \"397.8K\", \"totalAcceptedRaw\": 142438, \"totalSubmissionRaw\": 397827, \"acRate\": \"35.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"944","questionFrontendId":"908","title":"Smallest Range I","titleSlug":"smallest-range-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.9K\", \"totalSubmission\": \"104K\", \"totalAcceptedRaw\": 70921, \"totalSubmissionRaw\": 103956, \"acRate\": \"68.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"945","questionFrontendId":"909","title":"Snakes and Ladders","titleSlug":"snakes-and-ladders","translatedTitle":null,"stats":"{\"totalAccepted\": \"135.7K\", \"totalSubmission\": \"300.9K\", \"totalAcceptedRaw\": 135731, \"totalSubmissionRaw\": 300906, \"acRate\": \"45.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"946","questionFrontendId":"910","title":"Smallest Range II","titleSlug":"smallest-range-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.8K\", \"totalSubmission\": \"130.5K\", \"totalAcceptedRaw\": 45848, \"totalSubmissionRaw\": 130519, \"acRate\": \"35.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"947","questionFrontendId":"911","title":"Online Election","titleSlug":"online-election","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.3K\", \"totalSubmission\": \"92.6K\", \"totalAcceptedRaw\": 48341, \"totalSubmissionRaw\": 92643, \"acRate\": \"52.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"948","questionFrontendId":"912","title":"Sort an Array","titleSlug":"sort-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"438.2K\", \"totalSubmission\": \"734K\", \"totalAcceptedRaw\": 438182, \"totalSubmissionRaw\": 733984, \"acRate\": \"59.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Bucket Sort","translatedName":null,"slug":"bucket-sort","__typename":"TopicTagNode"},{"name":"Radix Sort","translatedName":null,"slug":"radix-sort","__typename":"TopicTagNode"},{"name":"Counting Sort","translatedName":null,"slug":"counting-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"950","questionFrontendId":"914","title":"X of a Kind in a Deck of Cards","titleSlug":"x-of-a-kind-in-a-deck-of-cards","translatedTitle":null,"stats":"{\"totalAccepted\": \"102.7K\", \"totalSubmission\": \"328.4K\", \"totalAcceptedRaw\": 102721, \"totalSubmissionRaw\": 328393, \"acRate\": \"31.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"951","questionFrontendId":"915","title":"Partition Array into Disjoint Intervals","titleSlug":"partition-array-into-disjoint-intervals","translatedTitle":null,"stats":"{\"totalAccepted\": \"73.5K\", \"totalSubmission\": \"151.5K\", \"totalAcceptedRaw\": 73544, \"totalSubmissionRaw\": 151546, \"acRate\": \"48.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"952","questionFrontendId":"916","title":"Word Subsets","titleSlug":"word-subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"107.7K\", \"totalSubmission\": \"200.3K\", \"totalAcceptedRaw\": 107678, \"totalSubmissionRaw\": 200341, \"acRate\": \"53.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"954","questionFrontendId":"918","title":"Maximum Sum Circular Subarray","titleSlug":"maximum-sum-circular-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"203.8K\", \"totalSubmission\": \"475.3K\", \"totalAcceptedRaw\": 203775, \"totalSubmissionRaw\": 475269, \"acRate\": \"42.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"958","questionFrontendId":"922","title":"Sort Array By Parity II","titleSlug":"sort-array-by-parity-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"213.8K\", \"totalSubmission\": \"302.6K\", \"totalAcceptedRaw\": 213847, \"totalSubmissionRaw\": 302555, \"acRate\": \"70.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"959","questionFrontendId":"923","title":"3Sum With Multiplicity","titleSlug":"3sum-with-multiplicity","translatedTitle":null,"stats":"{\"totalAccepted\": \"95.4K\", \"totalSubmission\": \"210.5K\", \"totalAcceptedRaw\": 95352, \"totalSubmissionRaw\": 210469, \"acRate\": \"45.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"960","questionFrontendId":"924","title":"Minimize Malware Spread","titleSlug":"minimize-malware-spread","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.8K\", \"totalSubmission\": \"101.8K\", \"totalAcceptedRaw\": 42842, \"totalSubmissionRaw\": 101803, \"acRate\": \"42.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"963","questionFrontendId":"927","title":"Three Equal Parts","titleSlug":"three-equal-parts","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.7K\", \"totalSubmission\": \"70.1K\", \"totalAcceptedRaw\": 27737, \"totalSubmissionRaw\": 70135, \"acRate\": \"39.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"964","questionFrontendId":"928","title":"Minimize Malware Spread II","titleSlug":"minimize-malware-spread-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"42.5K\", \"totalAcceptedRaw\": 18155, \"totalSubmissionRaw\": 42506, \"acRate\": \"42.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"965","questionFrontendId":"929","title":"Unique Email Addresses","titleSlug":"unique-email-addresses","translatedTitle":null,"stats":"{\"totalAccepted\": \"415.2K\", \"totalSubmission\": \"618.4K\", \"totalAcceptedRaw\": 415205, \"totalSubmissionRaw\": 618445, \"acRate\": \"67.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"966","questionFrontendId":"930","title":"Binary Subarrays With Sum","titleSlug":"binary-subarrays-with-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"64.7K\", \"totalSubmission\": \"124.5K\", \"totalAcceptedRaw\": 64720, \"totalSubmissionRaw\": 124513, \"acRate\": \"52.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"967","questionFrontendId":"931","title":"Minimum Falling Path Sum","titleSlug":"minimum-falling-path-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"235.1K\", \"totalSubmission\": \"340.2K\", \"totalAcceptedRaw\": 235130, \"totalSubmissionRaw\": 340229, \"acRate\": \"69.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"968","questionFrontendId":"932","title":"Beautiful Array","titleSlug":"beautiful-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.4K\", \"totalSubmission\": \"60.4K\", \"totalAcceptedRaw\": 39377, \"totalSubmissionRaw\": 60405, \"acRate\": \"65.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"971","questionFrontendId":"934","title":"Shortest Bridge","titleSlug":"shortest-bridge","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.2K\", \"totalSubmission\": \"228.6K\", \"totalAcceptedRaw\": 124183, \"totalSubmissionRaw\": 228582, \"acRate\": \"54.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"974","questionFrontendId":"937","title":"Reorder Data in Log Files","titleSlug":"reorder-data-in-log-files","translatedTitle":null,"stats":"{\"totalAccepted\": \"340.3K\", \"totalSubmission\": \"603.5K\", \"totalAcceptedRaw\": 340321, \"totalSubmissionRaw\": 603482, \"acRate\": \"56.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"976","questionFrontendId":"939","title":"Minimum Area Rectangle","titleSlug":"minimum-area-rectangle","translatedTitle":null,"stats":"{\"totalAccepted\": \"121.1K\", \"totalSubmission\": \"228.9K\", \"totalAcceptedRaw\": 121134, \"totalSubmissionRaw\": 228875, \"acRate\": \"52.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"978","questionFrontendId":"941","title":"Valid Mountain Array","titleSlug":"valid-mountain-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"354K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 353997, \"totalSubmissionRaw\": 1059039, \"acRate\": \"33.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"979","questionFrontendId":"942","title":"DI String Match","titleSlug":"di-string-match","translatedTitle":null,"stats":"{\"totalAccepted\": \"128.6K\", \"totalSubmission\": \"166.4K\", \"totalAcceptedRaw\": 128585, \"totalSubmissionRaw\": 166435, \"acRate\": \"77.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"980","questionFrontendId":"943","title":"Find the Shortest Superstring","titleSlug":"find-the-shortest-superstring","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.8K\", \"totalSubmission\": \"58K\", \"totalAcceptedRaw\": 25813, \"totalSubmissionRaw\": 58022, \"acRate\": \"44.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"981","questionFrontendId":"944","title":"Delete Columns to Make Sorted","titleSlug":"delete-columns-to-make-sorted","translatedTitle":null,"stats":"{\"totalAccepted\": \"168.5K\", \"totalSubmission\": \"225.3K\", \"totalAcceptedRaw\": 168537, \"totalSubmissionRaw\": 225319, \"acRate\": \"74.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"982","questionFrontendId":"945","title":"Minimum Increment to Make Array Unique","titleSlug":"minimum-increment-to-make-array-unique","translatedTitle":null,"stats":"{\"totalAccepted\": \"73.2K\", \"totalSubmission\": \"143.3K\", \"totalAcceptedRaw\": 73166, \"totalSubmissionRaw\": 143320, \"acRate\": \"51.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"983","questionFrontendId":"946","title":"Validate Stack Sequences","titleSlug":"validate-stack-sequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"197.8K\", \"totalSubmission\": \"292.4K\", \"totalAcceptedRaw\": 197829, \"totalSubmissionRaw\": 292361, \"acRate\": \"67.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"985","questionFrontendId":"948","title":"Bag of Tokens","titleSlug":"bag-of-tokens","translatedTitle":null,"stats":"{\"totalAccepted\": \"100.2K\", \"totalSubmission\": \"192.4K\", \"totalAcceptedRaw\": 100213, \"totalSubmissionRaw\": 192421, \"acRate\": \"52.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"987","questionFrontendId":"950","title":"Reveal Cards In Increasing Order","titleSlug":"reveal-cards-in-increasing-order","translatedTitle":null,"stats":"{\"totalAccepted\": \"66.1K\", \"totalSubmission\": \"85K\", \"totalAcceptedRaw\": 66089, \"totalSubmissionRaw\": 85005, \"acRate\": \"77.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"989","questionFrontendId":"952","title":"Largest Component Size by Common Factor","titleSlug":"largest-component-size-by-common-factor","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.4K\", \"totalSubmission\": \"120.7K\", \"totalAcceptedRaw\": 48439, \"totalSubmissionRaw\": 120726, \"acRate\": \"40.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"990","questionFrontendId":"953","title":"Verifying an Alien Dictionary","titleSlug":"verifying-an-alien-dictionary","translatedTitle":null,"stats":"{\"totalAccepted\": \"453.7K\", \"totalSubmission\": \"833.1K\", \"totalAcceptedRaw\": 453731, \"totalSubmissionRaw\": 833145, \"acRate\": \"54.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"991","questionFrontendId":"954","title":"Array of Doubled Pairs","titleSlug":"array-of-doubled-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"80.4K\", \"totalSubmission\": \"205.8K\", \"totalAcceptedRaw\": 80388, \"totalSubmissionRaw\": 205805, \"acRate\": \"39.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"992","questionFrontendId":"955","title":"Delete Columns to Make Sorted II","titleSlug":"delete-columns-to-make-sorted-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.7K\", \"totalSubmission\": \"51K\", \"totalAcceptedRaw\": 17692, \"totalSubmissionRaw\": 50999, \"acRate\": \"34.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"993","questionFrontendId":"956","title":"Tallest Billboard","titleSlug":"tallest-billboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.8K\", \"totalSubmission\": \"39.5K\", \"totalAcceptedRaw\": 15768, \"totalSubmissionRaw\": 39522, \"acRate\": \"39.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"994","questionFrontendId":"957","title":"Prison Cells After N Days","titleSlug":"prison-cells-after-n-days","translatedTitle":null,"stats":"{\"totalAccepted\": \"151.5K\", \"totalSubmission\": \"387.8K\", \"totalAcceptedRaw\": 151477, \"totalSubmissionRaw\": 387757, \"acRate\": \"39.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1000","questionFrontendId":"960","title":"Delete Columns to Make Sorted III","titleSlug":"delete-columns-to-make-sorted-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"12K\", \"totalSubmission\": \"20.9K\", \"totalAcceptedRaw\": 11983, \"totalSubmissionRaw\": 20933, \"acRate\": \"57.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1001","questionFrontendId":"961","title":"N-Repeated Element in Size 2N Array","titleSlug":"n-repeated-element-in-size-2n-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"202.1K\", \"totalSubmission\": \"265.8K\", \"totalAcceptedRaw\": 202051, \"totalSubmissionRaw\": 265761, \"acRate\": \"76.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1002","questionFrontendId":"962","title":"Maximum Width Ramp","titleSlug":"maximum-width-ramp","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.4K\", \"totalSubmission\": \"80.4K\", \"totalAcceptedRaw\": 39373, \"totalSubmissionRaw\": 80424, \"acRate\": \"49.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1003","questionFrontendId":"963","title":"Minimum Area Rectangle II","titleSlug":"minimum-area-rectangle-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"25K\", \"totalSubmission\": \"45.8K\", \"totalAcceptedRaw\": 25031, \"totalSubmissionRaw\": 45758, \"acRate\": \"54.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1006","questionFrontendId":"966","title":"Vowel Spellchecker","titleSlug":"vowel-spellchecker","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.2K\", \"totalSubmission\": \"74.2K\", \"totalAcceptedRaw\": 38161, \"totalSubmissionRaw\": 74214, \"acRate\": \"51.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1009","questionFrontendId":"969","title":"Pancake Sorting","titleSlug":"pancake-sorting","translatedTitle":null,"stats":"{\"totalAccepted\": \"82.7K\", \"totalSubmission\": \"118K\", \"totalAcceptedRaw\": 82721, \"totalSubmissionRaw\": 118018, \"acRate\": \"70.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1014","questionFrontendId":"973","title":"K Closest Points to Origin","titleSlug":"k-closest-points-to-origin","translatedTitle":null,"stats":"{\"totalAccepted\": \"955.7K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 955670, \"totalSubmissionRaw\": 1453778, \"acRate\": \"65.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Quickselect","translatedName":null,"slug":"quickselect","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1016","questionFrontendId":"974","title":"Subarray Sums Divisible by K","titleSlug":"subarray-sums-divisible-by-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"193.3K\", \"totalSubmission\": \"355.2K\", \"totalAcceptedRaw\": 193321, \"totalSubmissionRaw\": 355154, \"acRate\": \"54.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1017","questionFrontendId":"975","title":"Odd Even Jump","titleSlug":"odd-even-jump","translatedTitle":null,"stats":"{\"totalAccepted\": \"72K\", \"totalSubmission\": \"184.8K\", \"totalAcceptedRaw\": 71998, \"totalSubmissionRaw\": 184811, \"acRate\": \"39.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1018","questionFrontendId":"976","title":"Largest Perimeter Triangle","titleSlug":"largest-perimeter-triangle","translatedTitle":null,"stats":"{\"totalAccepted\": \"198.2K\", \"totalSubmission\": \"362.7K\", \"totalAcceptedRaw\": 198155, \"totalSubmissionRaw\": 362737, \"acRate\": \"54.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1019","questionFrontendId":"977","title":"Squares of a Sorted Array","titleSlug":"squares-of-a-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 1359168, \"totalSubmissionRaw\": 1890450, \"acRate\": \"71.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1020","questionFrontendId":"978","title":"Longest Turbulent Subarray","titleSlug":"longest-turbulent-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"82.3K\", \"totalSubmission\": \"174.4K\", \"totalAcceptedRaw\": 82301, \"totalSubmissionRaw\": 174411, \"acRate\": \"47.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1022","questionFrontendId":"980","title":"Unique Paths III","titleSlug":"unique-paths-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"172.2K\", \"totalSubmission\": \"210.3K\", \"totalAcceptedRaw\": 172206, \"totalSubmissionRaw\": 210334, \"acRate\": \"81.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1024","questionFrontendId":"982","title":"Triples with Bitwise AND Equal To Zero","titleSlug":"triples-with-bitwise-and-equal-to-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.7K\", \"totalSubmission\": \"25.5K\", \"totalAcceptedRaw\": 14665, \"totalSubmissionRaw\": 25478, \"acRate\": \"57.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1025","questionFrontendId":"983","title":"Minimum Cost For Tickets","titleSlug":"minimum-cost-for-tickets","translatedTitle":null,"stats":"{\"totalAccepted\": \"187.8K\", \"totalSubmission\": \"292.1K\", \"totalAcceptedRaw\": 187818, \"totalSubmissionRaw\": 292130, \"acRate\": \"64.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1027","questionFrontendId":"985","title":"Sum of Even Numbers After Queries","titleSlug":"sum-of-even-numbers-after-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"130.8K\", \"totalSubmission\": \"191.9K\", \"totalAcceptedRaw\": 130846, \"totalSubmissionRaw\": 191936, \"acRate\": \"68.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1028","questionFrontendId":"986","title":"Interval List Intersections","titleSlug":"interval-list-intersections","translatedTitle":null,"stats":"{\"totalAccepted\": \"349.2K\", \"totalSubmission\": \"489.5K\", \"totalAcceptedRaw\": 349184, \"totalSubmissionRaw\": 489453, \"acRate\": \"71.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1031","questionFrontendId":"989","title":"Add to Array-Form of Integer","titleSlug":"add-to-array-form-of-integer","translatedTitle":null,"stats":"{\"totalAccepted\": \"220.8K\", \"totalSubmission\": \"468.7K\", \"totalAcceptedRaw\": 220842, \"totalSubmissionRaw\": 468742, \"acRate\": \"47.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1032","questionFrontendId":"990","title":"Satisfiability of Equality Equations","titleSlug":"satisfiability-of-equality-equations","translatedTitle":null,"stats":"{\"totalAccepted\": \"109.1K\", \"totalSubmission\": \"216K\", \"totalAcceptedRaw\": 109149, \"totalSubmissionRaw\": 215959, \"acRate\": \"50.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1034","questionFrontendId":"992","title":"Subarrays with K Different Integers","titleSlug":"subarrays-with-k-different-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"90.2K\", \"totalSubmission\": \"165K\", \"totalAcceptedRaw\": 90236, \"totalSubmissionRaw\": 165019, \"acRate\": \"54.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1036","questionFrontendId":"994","title":"Rotting Oranges","titleSlug":"rotting-oranges","translatedTitle":null,"stats":"{\"totalAccepted\": \"574K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 574007, \"totalSubmissionRaw\": 1085286, \"acRate\": \"52.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1037","questionFrontendId":"995","title":"Minimum Number of K Consecutive Bit Flips","titleSlug":"minimum-number-of-k-consecutive-bit-flips","translatedTitle":null,"stats":"{\"totalAccepted\": \"30K\", \"totalSubmission\": \"58.7K\", \"totalAcceptedRaw\": 30028, \"totalSubmissionRaw\": 58669, \"acRate\": \"51.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1038","questionFrontendId":"996","title":"Number of Squareful Arrays","titleSlug":"number-of-squareful-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.6K\", \"totalSubmission\": \"62.2K\", \"totalAcceptedRaw\": 30618, \"totalSubmissionRaw\": 62202, \"acRate\": \"49.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1039","questionFrontendId":"997","title":"Find the Town Judge","titleSlug":"find-the-town-judge","translatedTitle":null,"stats":"{\"totalAccepted\": \"401.3K\", \"totalSubmission\": \"809.5K\", \"totalAcceptedRaw\": 401329, \"totalSubmissionRaw\": 809533, \"acRate\": \"49.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1041","questionFrontendId":"999","title":"Available Captures for Rook","titleSlug":"available-captures-for-rook","translatedTitle":null,"stats":"{\"totalAccepted\": \"57.1K\", \"totalSubmission\": \"83.8K\", \"totalAcceptedRaw\": 57108, \"totalSubmissionRaw\": 83829, \"acRate\": \"68.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1042","questionFrontendId":"1000","title":"Minimum Cost to Merge Stones","titleSlug":"minimum-cost-to-merge-stones","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.3K\", \"totalSubmission\": \"78.7K\", \"totalAcceptedRaw\": 33328, \"totalSubmissionRaw\": 78730, \"acRate\": \"42.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1043","questionFrontendId":"1001","title":"Grid Illumination","titleSlug":"grid-illumination","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.6K\", \"totalSubmission\": \"48.6K\", \"totalAcceptedRaw\": 17587, \"totalSubmissionRaw\": 48627, \"acRate\": \"36.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1044","questionFrontendId":"1002","title":"Find Common Characters","titleSlug":"find-common-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"174.1K\", \"totalSubmission\": \"254.4K\", \"totalAcceptedRaw\": 174136, \"totalSubmissionRaw\": 254382, \"acRate\": \"68.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1046","questionFrontendId":"1004","title":"Max Consecutive Ones III","titleSlug":"max-consecutive-ones-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"284.6K\", \"totalSubmission\": \"450K\", \"totalAcceptedRaw\": 284557, \"totalSubmissionRaw\": 449973, \"acRate\": \"63.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1047","questionFrontendId":"1005","title":"Maximize Sum Of Array After K Negations","titleSlug":"maximize-sum-of-array-after-k-negations","translatedTitle":null,"stats":"{\"totalAccepted\": \"69.5K\", \"totalSubmission\": \"136.6K\", \"totalAcceptedRaw\": 69504, \"totalSubmissionRaw\": 136616, \"acRate\": \"50.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1049","questionFrontendId":"1007","title":"Minimum Domino Rotations For Equal Row","titleSlug":"minimum-domino-rotations-for-equal-row","translatedTitle":null,"stats":"{\"totalAccepted\": \"190.6K\", \"totalSubmission\": \"364.7K\", \"totalAcceptedRaw\": 190638, \"totalSubmissionRaw\": 364702, \"acRate\": \"52.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1050","questionFrontendId":"1008","title":"Construct Binary Search Tree from Preorder Traversal","titleSlug":"construct-binary-search-tree-from-preorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"285.7K\", \"totalSubmission\": \"352.2K\", \"totalAcceptedRaw\": 285727, \"totalSubmissionRaw\": 352247, \"acRate\": \"81.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1052","questionFrontendId":"1057","title":"Campus Bikes","titleSlug":"campus-bikes","translatedTitle":null,"stats":"{\"totalAccepted\": \"64.1K\", \"totalSubmission\": \"111.2K\", \"totalAcceptedRaw\": 64088, \"totalSubmissionRaw\": 111192, \"acRate\": \"57.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1053","questionFrontendId":"1058","title":"Minimize Rounding Error to Meet Target","titleSlug":"minimize-rounding-error-to-meet-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.4K\", \"totalSubmission\": \"18.7K\", \"totalAcceptedRaw\": 8379, \"totalSubmissionRaw\": 18653, \"acRate\": \"44.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1055","questionFrontendId":"1010","title":"Pairs of Songs With Total Durations Divisible by 60","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60","translatedTitle":null,"stats":"{\"totalAccepted\": \"236.5K\", \"totalSubmission\": \"448.1K\", \"totalAcceptedRaw\": 236487, \"totalSubmissionRaw\": 448062, \"acRate\": \"52.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1056","questionFrontendId":"1011","title":"Capacity To Ship Packages Within D Days","titleSlug":"capacity-to-ship-packages-within-d-days","translatedTitle":null,"stats":"{\"totalAccepted\": \"260.9K\", \"totalSubmission\": \"385.4K\", \"totalAcceptedRaw\": 260870, \"totalSubmissionRaw\": 385431, \"acRate\": \"67.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1059","questionFrontendId":"1060","title":"Missing Element in Sorted Array","titleSlug":"missing-element-in-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"112.3K\", \"totalSubmission\": \"205.2K\", \"totalAcceptedRaw\": 112270, \"totalSubmissionRaw\": 205218, \"acRate\": \"54.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1061","questionFrontendId":"1063","title":"Number of Valid Subarrays","titleSlug":"number-of-valid-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.4K\", \"totalSubmission\": \"9.9K\", \"totalAcceptedRaw\": 7381, \"totalSubmissionRaw\": 9925, \"acRate\": \"74.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1062","questionFrontendId":"1013","title":"Partition Array Into Three Parts With Equal Sum","titleSlug":"partition-array-into-three-parts-with-equal-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"77.5K\", \"totalSubmission\": \"181.1K\", \"totalAcceptedRaw\": 77477, \"totalSubmissionRaw\": 181090, \"acRate\": \"42.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1063","questionFrontendId":"1014","title":"Best Sightseeing Pair","titleSlug":"best-sightseeing-pair","translatedTitle":null,"stats":"{\"totalAccepted\": \"82.3K\", \"totalSubmission\": \"138.4K\", \"totalAcceptedRaw\": 82265, \"totalSubmissionRaw\": 138430, \"acRate\": \"59.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1066","questionFrontendId":"1064","title":"Fixed Point","titleSlug":"fixed-point","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.4K\", \"totalSubmission\": \"62.9K\", \"totalAcceptedRaw\": 40372, \"totalSubmissionRaw\": 62892, \"acRate\": \"64.2%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1067","questionFrontendId":"1066","title":"Campus Bikes II","titleSlug":"campus-bikes-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.4K\", \"totalSubmission\": \"81K\", \"totalAcceptedRaw\": 44444, \"totalSubmissionRaw\": 80995, \"acRate\": \"54.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1071","questionFrontendId":"1018","title":"Binary Prefix Divisible By 5","titleSlug":"binary-prefix-divisible-by-5","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.7K\", \"totalSubmission\": \"97.3K\", \"totalAcceptedRaw\": 45655, \"totalSubmissionRaw\": 97254, \"acRate\": \"46.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1072","questionFrontendId":"1019","title":"Next Greater Node In Linked List","titleSlug":"next-greater-node-in-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.5K\", \"totalSubmission\": \"207.9K\", \"totalAcceptedRaw\": 124540, \"totalSubmissionRaw\": 207923, \"acRate\": \"59.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1073","questionFrontendId":"1020","title":"Number of Enclaves","titleSlug":"number-of-enclaves","translatedTitle":null,"stats":"{\"totalAccepted\": \"96.3K\", \"totalSubmission\": \"147K\", \"totalAcceptedRaw\": 96274, \"totalSubmissionRaw\": 147006, \"acRate\": \"65.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1074","questionFrontendId":"1086","title":"High Five","titleSlug":"high-five","translatedTitle":null,"stats":"{\"totalAccepted\": \"93.2K\", \"totalSubmission\": \"124.1K\", \"totalAcceptedRaw\": 93171, \"totalSubmissionRaw\": 124138, \"acRate\": \"75.1%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1075","questionFrontendId":"1065","title":"Index Pairs of a String","titleSlug":"index-pairs-of-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.7K\", \"totalSubmission\": \"32.5K\", \"totalAcceptedRaw\": 20743, \"totalSubmissionRaw\": 32527, \"acRate\": \"63.8%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1081","questionFrontendId":"1024","title":"Video Stitching","titleSlug":"video-stitching","translatedTitle":null,"stats":"{\"totalAccepted\": \"56.1K\", \"totalSubmission\": \"111.2K\", \"totalAcceptedRaw\": 56140, \"totalSubmissionRaw\": 111237, \"acRate\": \"50.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1082","questionFrontendId":"1085","title":"Sum of Digits in the Minimum Number","titleSlug":"sum-of-digits-in-the-minimum-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.2K\", \"totalSubmission\": \"29.1K\", \"totalAcceptedRaw\": 22183, \"totalSubmissionRaw\": 29072, \"acRate\": \"76.3%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1083","questionFrontendId":"1099","title":"Two Sum Less Than K","titleSlug":"two-sum-less-than-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.6K\", \"totalSubmission\": \"187.8K\", \"totalAcceptedRaw\": 114602, \"totalSubmissionRaw\": 187804, \"acRate\": \"61.0%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1085","questionFrontendId":"1101","title":"The Earliest Moment When Everyone Become Friends","titleSlug":"the-earliest-moment-when-everyone-become-friends","translatedTitle":null,"stats":"{\"totalAccepted\": \"62.7K\", \"totalSubmission\": \"96.8K\", \"totalAcceptedRaw\": 62660, \"totalSubmissionRaw\": 96828, \"acRate\": \"64.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1087","questionFrontendId":"1027","title":"Longest Arithmetic Subsequence","titleSlug":"longest-arithmetic-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"99.8K\", \"totalSubmission\": \"213.3K\", \"totalAcceptedRaw\": 99805, \"totalSubmissionRaw\": 213286, \"acRate\": \"46.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1094","questionFrontendId":"1030","title":"Matrix Cells in Distance Order","titleSlug":"matrix-cells-in-distance-order","translatedTitle":null,"stats":"{\"totalAccepted\": \"49.2K\", \"totalSubmission\": \"70.7K\", \"totalAcceptedRaw\": 49221, \"totalSubmissionRaw\": 70684, \"acRate\": \"69.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1095","questionFrontendId":"1029","title":"Two City Scheduling","titleSlug":"two-city-scheduling","translatedTitle":null,"stats":"{\"totalAccepted\": \"209.2K\", \"totalSubmission\": \"320.9K\", \"totalAcceptedRaw\": 209220, \"totalSubmissionRaw\": 320892, \"acRate\": \"65.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1096","questionFrontendId":"1031","title":"Maximum Sum of Two Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"61.3K\", \"totalSubmission\": \"102.9K\", \"totalAcceptedRaw\": 61303, \"totalSubmissionRaw\": 102853, \"acRate\": \"59.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1097","questionFrontendId":"1032","title":"Stream of Characters","titleSlug":"stream-of-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"81.4K\", \"totalSubmission\": \"157.8K\", \"totalAcceptedRaw\": 81407, \"totalSubmissionRaw\": 157795, \"acRate\": \"51.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1098","questionFrontendId":"1133","title":"Largest Unique Number","titleSlug":"largest-unique-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.8K\", \"totalSubmission\": \"56K\", \"totalAcceptedRaw\": 37833, \"totalSubmissionRaw\": 55972, \"acRate\": \"67.6%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1099","questionFrontendId":"1102","title":"Path With Maximum Minimum Value","titleSlug":"path-with-maximum-minimum-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"56.1K\", \"totalSubmission\": \"105.3K\", \"totalAcceptedRaw\": 56109, \"totalSubmissionRaw\": 105287, \"acRate\": \"53.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1102","questionFrontendId":"1150","title":"Check If a Number Is Majority Element in a Sorted Array","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"38K\", \"totalSubmission\": \"66.5K\", \"totalAcceptedRaw\": 38013, \"totalSubmissionRaw\": 66487, \"acRate\": \"57.2%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1104","questionFrontendId":"1034","title":"Coloring A Border","titleSlug":"coloring-a-border","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.9K\", \"totalSubmission\": \"58.8K\", \"totalAcceptedRaw\": 28910, \"totalSubmissionRaw\": 58810, \"acRate\": \"49.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1105","questionFrontendId":"1035","title":"Uncrossed Lines","titleSlug":"uncrossed-lines","translatedTitle":null,"stats":"{\"totalAccepted\": \"77.6K\", \"totalSubmission\": \"131.4K\", \"totalAcceptedRaw\": 77628, \"totalSubmissionRaw\": 131390, \"acRate\": \"59.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1106","questionFrontendId":"1036","title":"Escape a Large Maze","titleSlug":"escape-a-large-maze","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"52.5K\", \"totalAcceptedRaw\": 17925, \"totalSubmissionRaw\": 52548, \"acRate\": \"34.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1107","questionFrontendId":"1151","title":"Minimum Swaps to Group All 1's Together","titleSlug":"minimum-swaps-to-group-all-1s-together","translatedTitle":null,"stats":"{\"totalAccepted\": \"55.1K\", \"totalSubmission\": \"90.5K\", \"totalAcceptedRaw\": 55053, \"totalSubmissionRaw\": 90456, \"acRate\": \"60.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1108","questionFrontendId":"1152","title":"Analyze User Website Visit Pattern","titleSlug":"analyze-user-website-visit-pattern","translatedTitle":null,"stats":"{\"totalAccepted\": \"86.8K\", \"totalSubmission\": \"201.2K\", \"totalAcceptedRaw\": 86798, \"totalSubmissionRaw\": 201226, \"acRate\": \"43.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1111","questionFrontendId":"1039","title":"Minimum Score Triangulation of Polygon","titleSlug":"minimum-score-triangulation-of-polygon","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.6K\", \"totalSubmission\": \"59K\", \"totalAcceptedRaw\": 32615, \"totalSubmissionRaw\": 58973, \"acRate\": \"55.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1112","questionFrontendId":"1160","title":"Find Words That Can Be Formed by Characters","titleSlug":"find-words-that-can-be-formed-by-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"142.2K\", \"totalSubmission\": \"210.5K\", \"totalAcceptedRaw\": 142183, \"totalSubmissionRaw\": 210516, \"acRate\": \"67.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1113","questionFrontendId":"1040","title":"Moving Stones Until Consecutive II","titleSlug":"moving-stones-until-consecutive-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"15.4K\", \"totalAcceptedRaw\": 8595, \"totalSubmissionRaw\": 15395, \"acRate\": \"55.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1115","questionFrontendId":"1037","title":"Valid Boomerang","titleSlug":"valid-boomerang","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.4K\", \"totalSubmission\": \"108.9K\", \"totalAcceptedRaw\": 40373, \"totalSubmissionRaw\": 108903, \"acRate\": \"37.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1117","questionFrontendId":"1162","title":"As Far from Land as Possible","titleSlug":"as-far-from-land-as-possible","translatedTitle":null,"stats":"{\"totalAccepted\": \"135.4K\", \"totalSubmission\": \"260.8K\", \"totalAcceptedRaw\": 135378, \"totalSubmissionRaw\": 260848, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1118","questionFrontendId":"1121","title":"Divide Array Into Increasing Sequences","titleSlug":"divide-array-into-increasing-sequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"7.2K\", \"totalAcceptedRaw\": 4352, \"totalSubmissionRaw\": 7188, \"acRate\": \"60.5%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1121","questionFrontendId":"1043","title":"Partition Array for Maximum Sum","titleSlug":"partition-array-for-maximum-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"68.5K\", \"totalSubmission\": \"95.7K\", \"totalAcceptedRaw\": 68457, \"totalSubmissionRaw\": 95699, \"acRate\": \"71.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1126","questionFrontendId":"1167","title":"Minimum Cost to Connect Sticks","titleSlug":"minimum-cost-to-connect-sticks","translatedTitle":null,"stats":"{\"totalAccepted\": \"103.1K\", \"totalSubmission\": \"150.7K\", \"totalAcceptedRaw\": 103082, \"totalSubmissionRaw\": 150661, \"acRate\": \"68.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1127","questionFrontendId":"1046","title":"Last Stone Weight","titleSlug":"last-stone-weight","translatedTitle":null,"stats":"{\"totalAccepted\": \"397.3K\", \"totalSubmission\": \"613K\", \"totalAcceptedRaw\": 397347, \"totalSubmissionRaw\": 612962, \"acRate\": \"64.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1129","questionFrontendId":"1048","title":"Longest String Chain","titleSlug":"longest-string-chain","translatedTitle":null,"stats":"{\"totalAccepted\": \"302.1K\", \"totalSubmission\": \"509.9K\", \"totalAcceptedRaw\": 302070, \"totalSubmissionRaw\": 509934, \"acRate\": \"59.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1130","questionFrontendId":"1049","title":"Last Stone Weight II","titleSlug":"last-stone-weight-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.6K\", \"totalSubmission\": \"127.5K\", \"totalAcceptedRaw\": 67649, \"totalSubmissionRaw\": 127491, \"acRate\": \"53.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1132","questionFrontendId":"1181","title":"Before and After Puzzle","titleSlug":"before-and-after-puzzle","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"20.4K\", \"totalAcceptedRaw\": 9235, \"totalSubmissionRaw\": 20399, \"acRate\": \"45.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1134","questionFrontendId":"1182","title":"Shortest Distance to Target Color","titleSlug":"shortest-distance-to-target-color","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.2K\", \"totalSubmission\": \"60K\", \"totalAcceptedRaw\": 33200, \"totalSubmissionRaw\": 59974, \"acRate\": \"55.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1137","questionFrontendId":"1051","title":"Height Checker","titleSlug":"height-checker","translatedTitle":null,"stats":"{\"totalAccepted\": \"262.1K\", \"totalSubmission\": \"347K\", \"totalAcceptedRaw\": 262075, \"totalSubmissionRaw\": 346967, \"acRate\": \"75.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting Sort","translatedName":null,"slug":"counting-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1138","questionFrontendId":"1052","title":"Grumpy Bookstore Owner","titleSlug":"grumpy-bookstore-owner","translatedTitle":null,"stats":"{\"totalAccepted\": \"62.1K\", \"totalSubmission\": \"108.8K\", \"totalAcceptedRaw\": 62146, \"totalSubmissionRaw\": 108823, \"acRate\": \"57.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1139","questionFrontendId":"1053","title":"Previous Permutation With One Swap","titleSlug":"previous-permutation-with-one-swap","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.3K\", \"totalSubmission\": \"69.9K\", \"totalAcceptedRaw\": 35326, \"totalSubmissionRaw\": 69948, \"acRate\": \"50.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1140","questionFrontendId":"1054","title":"Distant Barcodes","titleSlug":"distant-barcodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.1K\", \"totalSubmission\": \"78.8K\", \"totalAcceptedRaw\": 36058, \"totalSubmissionRaw\": 78752, \"acRate\": \"45.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1141","questionFrontendId":"1196","title":"How Many Apples Can You Put into the Basket","titleSlug":"how-many-apples-can-you-put-into-the-basket","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.9K\", \"totalSubmission\": \"37.3K\", \"totalAcceptedRaw\": 24909, \"totalSubmissionRaw\": 37253, \"acRate\": \"66.9%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1143","questionFrontendId":"1198","title":"Find Smallest Common Element in All Rows","titleSlug":"find-smallest-common-element-in-all-rows","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.1K\", \"totalSubmission\": \"49.8K\", \"totalAcceptedRaw\": 38137, \"totalSubmissionRaw\": 49777, \"acRate\": \"76.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1145","questionFrontendId":"1074","title":"Number of Submatrices That Sum to Target","titleSlug":"number-of-submatrices-that-sum-to-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"86.2K\", \"totalSubmission\": \"123.7K\", \"totalAcceptedRaw\": 86236, \"totalSubmissionRaw\": 123654, \"acRate\": \"69.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1147","questionFrontendId":"1072","title":"Flip Columns For Maximum Number of Equal Rows","titleSlug":"flip-columns-for-maximum-number-of-equal-rows","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.7K\", \"totalSubmission\": \"31.1K\", \"totalAcceptedRaw\": 19689, \"totalSubmissionRaw\": 31096, \"acRate\": \"63.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1148","questionFrontendId":"1073","title":"Adding Two Negabinary Numbers","titleSlug":"adding-two-negabinary-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.1K\", \"totalSubmission\": \"41.3K\", \"totalAcceptedRaw\": 15060, \"totalSubmissionRaw\": 41327, \"acRate\": \"36.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1149","questionFrontendId":"1213","title":"Intersection of Three Sorted Arrays","titleSlug":"intersection-of-three-sorted-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"76.9K\", \"totalSubmission\": \"96.2K\", \"totalAcceptedRaw\": 76872, \"totalSubmissionRaw\": 96199, \"acRate\": \"79.9%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1164","questionFrontendId":"1228","title":"Missing Number In Arithmetic Progression","titleSlug":"missing-number-in-arithmetic-progression","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.4K\", \"totalSubmission\": \"45.4K\", \"totalAcceptedRaw\": 23366, \"totalSubmissionRaw\": 45416, \"acRate\": \"51.4%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1165","questionFrontendId":"1229","title":"Meeting Scheduler","titleSlug":"meeting-scheduler","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.8K\", \"totalSubmission\": \"128.2K\", \"totalAcceptedRaw\": 70827, \"totalSubmissionRaw\": 128196, \"acRate\": \"55.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1168","questionFrontendId":"1089","title":"Duplicate Zeros","titleSlug":"duplicate-zeros","translatedTitle":null,"stats":"{\"totalAccepted\": \"339.7K\", \"totalSubmission\": \"659.5K\", \"totalAcceptedRaw\": 339683, \"totalSubmissionRaw\": 659470, \"acRate\": \"51.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1169","questionFrontendId":"1090","title":"Largest Values From Labels","titleSlug":"largest-values-from-labels","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.6K\", \"totalSubmission\": \"53.4K\", \"totalAcceptedRaw\": 32604, \"totalSubmissionRaw\": 53384, \"acRate\": \"61.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1171","questionFrontendId":"1091","title":"Shortest Path in Binary Matrix","titleSlug":"shortest-path-in-binary-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"294.9K\", \"totalSubmission\": \"660.6K\", \"totalAcceptedRaw\": 294863, \"totalSubmissionRaw\": 660602, \"acRate\": \"44.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1175","questionFrontendId":"1243","title":"Array Transformation","titleSlug":"array-transformation","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.6K\", \"totalSubmission\": \"22.7K\", \"totalAcceptedRaw\": 11616, \"totalSubmissionRaw\": 22749, \"acRate\": \"51.1%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1183","questionFrontendId":"1093","title":"Statistics from a Large Sample","titleSlug":"statistics-from-a-large-sample","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.8K\", \"totalSubmission\": \"36.2K\", \"totalAcceptedRaw\": 15804, \"totalSubmissionRaw\": 36227, \"acRate\": \"43.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Probability and Statistics","translatedName":null,"slug":"probability-and-statistics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1184","questionFrontendId":"1094","title":"Car Pooling","titleSlug":"car-pooling","translatedTitle":null,"stats":"{\"totalAccepted\": \"188K\", \"totalSubmission\": \"330.1K\", \"totalAcceptedRaw\": 187965, \"totalSubmissionRaw\": 330098, \"acRate\": \"56.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1185","questionFrontendId":"1095","title":"Find in Mountain Array","titleSlug":"find-in-mountain-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.5K\", \"totalSubmission\": \"164.5K\", \"totalAcceptedRaw\": 58462, \"totalSubmissionRaw\": 164456, \"acRate\": \"35.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1190","questionFrontendId":"1257","title":"Smallest Common Region","titleSlug":"smallest-common-region","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.5K\", \"totalSubmission\": \"30.3K\", \"totalAcceptedRaw\": 19481, \"totalSubmissionRaw\": 30285, \"acRate\": \"64.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1191","questionFrontendId":"1258","title":"Synonymous Sentences","titleSlug":"synonymous-sentences","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.9K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 18944, \"totalSubmissionRaw\": 33431, \"acRate\": \"56.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1192","questionFrontendId":"1231","title":"Divide Chocolate","titleSlug":"divide-chocolate","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.4K\", \"totalSubmission\": \"77.3K\", \"totalAcceptedRaw\": 44380, \"totalSubmissionRaw\": 77335, \"acRate\": \"57.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1196","questionFrontendId":"1105","title":"Filling Bookcase Shelves","titleSlug":"filling-bookcase-shelves","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.6K\", \"totalSubmission\": \"75.2K\", \"totalAcceptedRaw\": 44608, \"totalSubmissionRaw\": 75185, \"acRate\": \"59.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1200","questionFrontendId":"1272","title":"Remove Interval","titleSlug":"remove-interval","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.9K\", \"totalSubmission\": \"42.3K\", \"totalAcceptedRaw\": 26899, \"totalSubmissionRaw\": 42326, \"acRate\": \"63.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1202","questionFrontendId":"1246","title":"Palindrome Removal","titleSlug":"palindrome-removal","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.9K\", \"totalSubmission\": \"21.3K\", \"totalAcceptedRaw\": 9868, \"totalSubmissionRaw\": 21348, \"acRate\": \"46.2%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1206","questionFrontendId":"1109","title":"Corporate Flight Bookings","titleSlug":"corporate-flight-bookings","translatedTitle":null,"stats":"{\"totalAccepted\": \"50.8K\", \"totalSubmission\": \"83.7K\", \"totalAcceptedRaw\": 50750, \"totalSubmissionRaw\": 83724, \"acRate\": \"60.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1210","questionFrontendId":"1619","title":"Mean of Array After Removing Some Elements","titleSlug":"mean-of-array-after-removing-some-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.6K\", \"totalSubmission\": \"66.4K\", \"totalAcceptedRaw\": 43598, \"totalSubmissionRaw\": 66417, \"acRate\": \"65.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1217","questionFrontendId":"1122","title":"Relative Sort Array","titleSlug":"relative-sort-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"152.5K\", \"totalSubmission\": \"222.3K\", \"totalAcceptedRaw\": 152502, \"totalSubmissionRaw\": 222303, \"acRate\": \"68.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting Sort","translatedName":null,"slug":"counting-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1219","questionFrontendId":"1124","title":"Longest Well-Performing Interval","titleSlug":"longest-well-performing-interval","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.3K\", \"totalSubmission\": \"75.8K\", \"totalAcceptedRaw\": 26256, \"totalSubmissionRaw\": 75782, \"acRate\": \"34.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1220","questionFrontendId":"1125","title":"Smallest Sufficient Team","titleSlug":"smallest-sufficient-team","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.6K\", \"totalSubmission\": \"39.9K\", \"totalAcceptedRaw\": 18642, \"totalSubmissionRaw\": 39854, \"acRate\": \"46.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1221","questionFrontendId":"1287","title":"Element Appearing More Than 25% In Sorted Array","titleSlug":"element-appearing-more-than-25-in-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"75.8K\", \"totalSubmission\": \"127.5K\", \"totalAcceptedRaw\": 75804, \"totalSubmissionRaw\": 127495, \"acRate\": \"59.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1222","questionFrontendId":"1288","title":"Remove Covered Intervals","titleSlug":"remove-covered-intervals","translatedTitle":null,"stats":"{\"totalAccepted\": \"106.5K\", \"totalSubmission\": \"186.8K\", \"totalAcceptedRaw\": 106503, \"totalSubmissionRaw\": 186779, \"acRate\": \"57.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1223","questionFrontendId":"1627","title":"Graph Connectivity With Threshold","titleSlug":"graph-connectivity-with-threshold","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"29.9K\", \"totalAcceptedRaw\": 13817, \"totalSubmissionRaw\": 29882, \"acRate\": \"46.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1224","questionFrontendId":"1289","title":"Minimum Falling Path Sum II","titleSlug":"minimum-falling-path-sum-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.8K\", \"totalSubmission\": \"68.1K\", \"totalAcceptedRaw\": 39831, \"totalSubmissionRaw\": 68057, \"acRate\": \"58.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1227","questionFrontendId":"1128","title":"Number of Equivalent Domino Pairs","titleSlug":"number-of-equivalent-domino-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"56.7K\", \"totalSubmission\": \"120.4K\", \"totalAcceptedRaw\": 56721, \"totalSubmissionRaw\": 120429, \"acRate\": \"47.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1230","questionFrontendId":"1131","title":"Maximum of Absolute Value Expression","titleSlug":"maximum-of-absolute-value-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.3K\", \"totalSubmission\": \"39.4K\", \"totalAcceptedRaw\": 19346, \"totalSubmissionRaw\": 39389, \"acRate\": \"49.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1231","questionFrontendId":"1299","title":"Replace Elements with Greatest Element on Right Side","titleSlug":"replace-elements-with-greatest-element-on-right-side","translatedTitle":null,"stats":"{\"totalAccepted\": \"280K\", \"totalSubmission\": \"380.7K\", \"totalAcceptedRaw\": 279992, \"totalSubmissionRaw\": 380717, \"acRate\": \"73.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1232","questionFrontendId":"1300","title":"Sum of Mutated Array Closest to Target","titleSlug":"sum-of-mutated-array-closest-to-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.2K\", \"totalSubmission\": \"73.8K\", \"totalAcceptedRaw\": 32155, \"totalSubmissionRaw\": 73832, \"acRate\": \"43.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1233","questionFrontendId":"1274","title":"Number of Ships in a Rectangle","titleSlug":"number-of-ships-in-a-rectangle","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.3K\", \"totalSubmission\": \"35.2K\", \"totalAcceptedRaw\": 24349, \"totalSubmissionRaw\": 35167, \"acRate\": \"69.2%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1234","questionFrontendId":"1301","title":"Number of Paths with Max Score","titleSlug":"number-of-paths-with-max-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"11K\", \"totalSubmission\": \"28.3K\", \"totalAcceptedRaw\": 10962, \"totalSubmissionRaw\": 28263, \"acRate\": \"38.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1239","questionFrontendId":"1139","title":"Largest 1-Bordered Square","titleSlug":"largest-1-bordered-square","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.9K\", \"totalSubmission\": \"43.6K\", \"totalAcceptedRaw\": 21865, \"totalSubmissionRaw\": 43586, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1240","questionFrontendId":"1140","title":"Stone Game II","titleSlug":"stone-game-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.7K\", \"totalSubmission\": \"70.6K\", \"totalAcceptedRaw\": 45741, \"totalSubmissionRaw\": 70629, \"acRate\": \"64.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1241","questionFrontendId":"1313","title":"Decompress Run-Length Encoded List","titleSlug":"decompress-run-length-encoded-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"220.7K\", \"totalSubmission\": \"257.2K\", \"totalAcceptedRaw\": 220690, \"totalSubmissionRaw\": 257242, \"acRate\": \"85.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1242","questionFrontendId":"1314","title":"Matrix Block Sum","titleSlug":"matrix-block-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"75.9K\", \"totalSubmission\": \"100.6K\", \"totalAcceptedRaw\": 75880, \"totalSubmissionRaw\": 100626, \"acRate\": \"75.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1247","questionFrontendId":"1144","title":"Decrease Elements To Make Array Zigzag","titleSlug":"decrease-elements-to-make-array-zigzag","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.1K\", \"totalSubmission\": \"36.1K\", \"totalAcceptedRaw\": 17088, \"totalSubmissionRaw\": 36103, \"acRate\": \"47.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1249","questionFrontendId":"1146","title":"Snapshot Array","titleSlug":"snapshot-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"140.6K\", \"totalSubmission\": \"377.7K\", \"totalAcceptedRaw\": 140558, \"totalSubmissionRaw\": 377697, \"acRate\": \"37.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1253","questionFrontendId":"1329","title":"Sort the Matrix Diagonally","titleSlug":"sort-the-matrix-diagonally","translatedTitle":null,"stats":"{\"totalAccepted\": \"144.4K\", \"totalSubmission\": \"173.2K\", \"totalAcceptedRaw\": 144427, \"totalSubmissionRaw\": 173250, \"acRate\": \"83.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1255","questionFrontendId":"1330","title":"Reverse Subarray To Maximize Array Value","titleSlug":"reverse-subarray-to-maximize-array-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"11.5K\", \"totalAcceptedRaw\": 4613, \"totalSubmissionRaw\": 11469, \"acRate\": \"40.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1256","questionFrontendId":"1331","title":"Rank Transform of an Array","titleSlug":"rank-transform-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"81.3K\", \"totalSubmission\": \"137.2K\", \"totalAcceptedRaw\": 81289, \"totalSubmissionRaw\": 137244, \"acRate\": \"59.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1257","questionFrontendId":"1632","title":"Rank Transform of a Matrix","titleSlug":"rank-transform-of-a-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"48.6K\", \"totalAcceptedRaw\": 19894, \"totalSubmissionRaw\": 48593, \"acRate\": \"40.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1262","questionFrontendId":"1157","title":"Online Majority Element In Subarray","titleSlug":"online-majority-element-in-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.5K\", \"totalSubmission\": \"34.8K\", \"totalAcceptedRaw\": 14496, \"totalSubmissionRaw\": 34767, \"acRate\": \"41.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1272","questionFrontendId":"1169","title":"Invalid Transactions","titleSlug":"invalid-transactions","translatedTitle":null,"stats":"{\"totalAccepted\": \"60.2K\", \"totalSubmission\": \"192.9K\", \"totalAcceptedRaw\": 60216, \"totalSubmissionRaw\": 192888, \"acRate\": \"31.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1273","questionFrontendId":"1170","title":"Compare Strings by Frequency of the Smallest Character","titleSlug":"compare-strings-by-frequency-of-the-smallest-character","translatedTitle":null,"stats":"{\"totalAccepted\": \"72.1K\", \"totalSubmission\": \"117.3K\", \"totalAcceptedRaw\": 72132, \"totalSubmissionRaw\": 117266, \"acRate\": \"61.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1277","questionFrontendId":"1363","title":"Largest Multiple of Three","titleSlug":"largest-multiple-of-three","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.9K\", \"totalSubmission\": \"50.9K\", \"totalAcceptedRaw\": 16942, \"totalSubmissionRaw\": 50921, \"acRate\": \"33.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1280","questionFrontendId":"1176","title":"Diet Plan Performance","titleSlug":"diet-plan-performance","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.9K\", \"totalSubmission\": \"54.7K\", \"totalAcceptedRaw\": 28858, \"totalSubmissionRaw\": 54745, \"acRate\": \"52.7%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1282","questionFrontendId":"1178","title":"Number of Valid Words for Each Puzzle","titleSlug":"number-of-valid-words-for-each-puzzle","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.4K\", \"totalSubmission\": \"61.4K\", \"totalAcceptedRaw\": 28445, \"totalSubmissionRaw\": 61429, \"acRate\": \"46.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1284","questionFrontendId":"1390","title":"Four Divisors","titleSlug":"four-divisors","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.2K\", \"totalSubmission\": \"61.2K\", \"totalAcceptedRaw\": 25197, \"totalSubmissionRaw\": 61220, \"acRate\": \"41.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1286","questionFrontendId":"1425","title":"Constrained Subsequence Sum","titleSlug":"constrained-subsequence-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.7K\", \"totalSubmission\": \"49.9K\", \"totalAcceptedRaw\": 23700, \"totalSubmissionRaw\": 49852, \"acRate\": \"47.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1287","questionFrontendId":"1184","title":"Distance Between Bus Stops","titleSlug":"distance-between-bus-stops","translatedTitle":null,"stats":"{\"totalAccepted\": \"49.6K\", \"totalSubmission\": \"91.8K\", \"totalAcceptedRaw\": 49587, \"totalSubmissionRaw\": 91795, \"acRate\": \"54.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1288","questionFrontendId":"1186","title":"Maximum Subarray Sum with One Deletion","titleSlug":"maximum-subarray-sum-with-one-deletion","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.4K\", \"totalSubmission\": \"92.8K\", \"totalAcceptedRaw\": 38444, \"totalSubmissionRaw\": 92807, \"acRate\": \"41.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1290","questionFrontendId":"1187","title":"Make Array Strictly Increasing","titleSlug":"make-array-strictly-increasing","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.7K\", \"totalSubmission\": \"30.2K\", \"totalAcceptedRaw\": 13669, \"totalSubmissionRaw\": 30168, \"acRate\": \"45.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1293","questionFrontendId":"1550","title":"Three Consecutive Odds","titleSlug":"three-consecutive-odds","translatedTitle":null,"stats":"{\"totalAccepted\": \"64.3K\", \"totalSubmission\": \"101.2K\", \"totalAcceptedRaw\": 64307, \"totalSubmissionRaw\": 101201, \"acRate\": \"63.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1294","questionFrontendId":"2080","title":"Range Frequency Queries","titleSlug":"range-frequency-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.9K\", \"totalSubmission\": \"41.1K\", \"totalAcceptedRaw\": 15852, \"totalSubmissionRaw\": 41081, \"acRate\": \"38.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1299","questionFrontendId":"1191","title":"K-Concatenation Maximum Sum","titleSlug":"k-concatenation-maximum-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.6K\", \"totalSubmission\": \"124.3K\", \"totalAcceptedRaw\": 29560, \"totalSubmissionRaw\": 124340, \"acRate\": \"23.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1305","questionFrontendId":"1944","title":"Number of Visible People in a Queue","titleSlug":"number-of-visible-people-in-a-queue","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.2K\", \"totalSubmission\": \"46.6K\", \"totalAcceptedRaw\": 32234, \"totalSubmissionRaw\": 46596, \"acRate\": \"69.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1306","questionFrontendId":"1200","title":"Minimum Absolute Difference","titleSlug":"minimum-absolute-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"152.5K\", \"totalSubmission\": \"219.1K\", \"totalAcceptedRaw\": 152549, \"totalSubmissionRaw\": 219064, \"acRate\": \"69.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1310","questionFrontendId":"2079","title":"Watering Plants","titleSlug":"watering-plants","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.2K\", \"totalSubmission\": \"41.5K\", \"totalAcceptedRaw\": 33221, \"totalSubmissionRaw\": 41531, \"acRate\": \"80.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1311","questionFrontendId":"1895","title":"Largest Magic Square","titleSlug":"largest-magic-square","translatedTitle":null,"stats":"{\"totalAccepted\": \"9K\", \"totalSubmission\": \"17.4K\", \"totalAcceptedRaw\": 9029, \"totalSubmissionRaw\": 17360, \"acRate\": \"52.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1312","questionFrontendId":"2201","title":"Count Artifacts That Can Be Extracted","titleSlug":"count-artifacts-that-can-be-extracted","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.9K\", \"totalSubmission\": \"30.5K\", \"totalAcceptedRaw\": 16859, \"totalSubmissionRaw\": 30482, \"acRate\": \"55.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1319","questionFrontendId":"1207","title":"Unique Number of Occurrences","titleSlug":"unique-number-of-occurrences","translatedTitle":null,"stats":"{\"totalAccepted\": \"257.9K\", \"totalSubmission\": \"350.8K\", \"totalAcceptedRaw\": 257863, \"totalSubmissionRaw\": 350754, \"acRate\": \"73.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1322","questionFrontendId":"1210","title":"Minimum Moves to Reach Target with Rotations","titleSlug":"minimum-moves-to-reach-target-with-rotations","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.3K\", \"totalSubmission\": \"16.8K\", \"totalAcceptedRaw\": 8292, \"totalSubmissionRaw\": 16841, \"acRate\": \"49.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1324","questionFrontendId":"1706","title":"Where Will the Ball Fall","titleSlug":"where-will-the-ball-fall","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.7K\", \"totalSubmission\": \"174.4K\", \"totalAcceptedRaw\": 124660, \"totalSubmissionRaw\": 174408, \"acRate\": \"71.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1325","questionFrontendId":"1514","title":"Path with Maximum Probability","titleSlug":"path-with-maximum-probability","translatedTitle":null,"stats":"{\"totalAccepted\": \"62.6K\", \"totalSubmission\": \"128.9K\", \"totalAcceptedRaw\": 62647, \"totalSubmissionRaw\": 128862, \"acRate\": \"48.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1326","questionFrontendId":"1862","title":"Sum of Floored Pairs","titleSlug":"sum-of-floored-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.4K\", \"totalSubmission\": \"26.3K\", \"totalAcceptedRaw\": 7374, \"totalSubmissionRaw\": 26264, \"acRate\": \"28.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1329","questionFrontendId":"1217","title":"Minimum Cost to Move Chips to The Same Position","titleSlug":"minimum-cost-to-move-chips-to-the-same-position","translatedTitle":null,"stats":"{\"totalAccepted\": \"110.7K\", \"totalSubmission\": \"153.9K\", \"totalAcceptedRaw\": 110677, \"totalSubmissionRaw\": 153906, \"acRate\": \"71.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1330","questionFrontendId":"1218","title":"Longest Arithmetic Subsequence of Given Difference","titleSlug":"longest-arithmetic-subsequence-of-given-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"59.6K\", \"totalSubmission\": \"114.9K\", \"totalAcceptedRaw\": 59633, \"totalSubmissionRaw\": 114943, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1331","questionFrontendId":"1219","title":"Path with Maximum Gold","titleSlug":"path-with-maximum-gold","translatedTitle":null,"stats":"{\"totalAccepted\": \"98.3K\", \"totalSubmission\": \"154.3K\", \"totalAcceptedRaw\": 98323, \"totalSubmissionRaw\": 154271, \"acRate\": \"63.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1333","questionFrontendId":"2191","title":"Sort the Jumbled Numbers","titleSlug":"sort-the-jumbled-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.1K\", \"totalSubmission\": \"35.2K\", \"totalAcceptedRaw\": 16103, \"totalSubmissionRaw\": 35182, \"acRate\": \"45.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1335","questionFrontendId":"2226","title":"Maximum Candies Allocated to K Children","titleSlug":"maximum-candies-allocated-to-k-children","translatedTitle":null,"stats":"{\"totalAccepted\": \"26K\", \"totalSubmission\": \"71K\", \"totalAcceptedRaw\": 25997, \"totalSubmissionRaw\": 71017, \"acRate\": \"36.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1342","questionFrontendId":"1222","title":"Queens That Can Attack the King","titleSlug":"queens-that-can-attack-the-king","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.2K\", \"totalSubmission\": \"51.8K\", \"totalAcceptedRaw\": 37233, \"totalSubmissionRaw\": 51830, \"acRate\": \"71.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1343","questionFrontendId":"1223","title":"Dice Roll Simulation","titleSlug":"dice-roll-simulation","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.2K\", \"totalSubmission\": \"51.8K\", \"totalAcceptedRaw\": 25217, \"totalSubmissionRaw\": 51829, \"acRate\": \"48.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1344","questionFrontendId":"1224","title":"Maximum Equal Frequency","titleSlug":"maximum-equal-frequency","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.8K\", \"totalSubmission\": \"34.7K\", \"totalAcceptedRaw\": 12838, \"totalSubmissionRaw\": 34698, \"acRate\": \"37.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1345","questionFrontendId":"1427","title":"Perform String Shifts","titleSlug":"perform-string-shifts","translatedTitle":null,"stats":"{\"totalAccepted\": \"73.4K\", \"totalSubmission\": \"135.1K\", \"totalAcceptedRaw\": 73379, \"totalSubmissionRaw\": 135140, \"acRate\": \"54.3%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1346","questionFrontendId":"2202","title":"Maximize the Topmost Element After K Moves","titleSlug":"maximize-the-topmost-element-after-k-moves","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.2K\", \"totalSubmission\": \"97.6K\", \"totalAcceptedRaw\": 22250, \"totalSubmissionRaw\": 97553, \"acRate\": \"22.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1348","questionFrontendId":"2321","title":"Maximum Score Of Spliced Array","titleSlug":"maximum-score-of-spliced-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.3K\", \"totalSubmission\": \"27.5K\", \"totalAcceptedRaw\": 15345, \"totalSubmissionRaw\": 27516, \"acRate\": \"55.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1349","questionFrontendId":"1232","title":"Check If It Is a Straight Line","titleSlug":"check-if-it-is-a-straight-line","translatedTitle":null,"stats":"{\"totalAccepted\": \"145.8K\", \"totalSubmission\": \"360.9K\", \"totalAcceptedRaw\": 145832, \"totalSubmissionRaw\": 360927, \"acRate\": \"40.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1350","questionFrontendId":"1233","title":"Remove Sub-Folders from the Filesystem","titleSlug":"remove-sub-folders-from-the-filesystem","translatedTitle":null,"stats":"{\"totalAccepted\": \"47.7K\", \"totalSubmission\": \"72.7K\", \"totalAcceptedRaw\": 47678, \"totalSubmissionRaw\": 72718, \"acRate\": \"65.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1352","questionFrontendId":"1235","title":"Maximum Profit in Job Scheduling","titleSlug":"maximum-profit-in-job-scheduling","translatedTitle":null,"stats":"{\"totalAccepted\": \"178.8K\", \"totalSubmission\": \"334.7K\", \"totalAcceptedRaw\": 178833, \"totalSubmissionRaw\": 334691, \"acRate\": \"53.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1353","questionFrontendId":"2273","title":"Find Resultant Array After Removing Anagrams","titleSlug":"find-resultant-array-after-removing-anagrams","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.4K\", \"totalSubmission\": \"65.7K\", \"totalAcceptedRaw\": 38388, \"totalSubmissionRaw\": 65727, \"acRate\": \"58.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1354","questionFrontendId":"2225","title":"Find Players With Zero or One Losses","titleSlug":"find-players-with-zero-or-one-losses","translatedTitle":null,"stats":"{\"totalAccepted\": \"89K\", \"totalSubmission\": \"122.4K\", \"totalAcceptedRaw\": 88955, \"totalSubmissionRaw\": 122438, \"acRate\": \"72.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1355","questionFrontendId":"2216","title":"Minimum Deletions to Make Array Beautiful","titleSlug":"minimum-deletions-to-make-array-beautiful","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.7K\", \"totalSubmission\": \"52.7K\", \"totalAcceptedRaw\": 24693, \"totalSubmissionRaw\": 52704, \"acRate\": \"46.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1360","questionFrontendId":"1239","title":"Maximum Length of a Concatenated String with Unique Characters","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"170.2K\", \"totalSubmission\": \"326.2K\", \"totalAcceptedRaw\": 170160, \"totalSubmissionRaw\": 326223, \"acRate\": \"52.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1364","questionFrontendId":"1726","title":"Tuple with Same Product","titleSlug":"tuple-with-same-product","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.1K\", \"totalSubmission\": \"38K\", \"totalAcceptedRaw\": 23084, \"totalSubmissionRaw\": 37994, \"acRate\": \"60.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1366","questionFrontendId":"1429","title":"First Unique Number","titleSlug":"first-unique-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"77.7K\", \"totalSubmission\": \"146.8K\", \"totalAcceptedRaw\": 77708, \"totalSubmissionRaw\": 146809, \"acRate\": \"52.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1367","questionFrontendId":"1691","title":"Maximum Height by Stacking Cuboids ","titleSlug":"maximum-height-by-stacking-cuboids","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.1K\", \"totalSubmission\": \"31.5K\", \"totalAcceptedRaw\": 17144, \"totalSubmissionRaw\": 31539, \"acRate\": \"54.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1370","questionFrontendId":"1248","title":"Count Number of Nice Subarrays","titleSlug":"count-number-of-nice-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.1K\", \"totalSubmission\": \"128.4K\", \"totalAcceptedRaw\": 78097, \"totalSubmissionRaw\": 128353, \"acRate\": \"60.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1372","questionFrontendId":"1250","title":"Check If It Is a Good Array","titleSlug":"check-if-it-is-a-good-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.3K\", \"totalSubmission\": \"29.4K\", \"totalAcceptedRaw\": 17318, \"totalSubmissionRaw\": 29392, \"acRate\": \"58.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1374","questionFrontendId":"1428","title":"Leftmost Column with at Least a One","titleSlug":"leftmost-column-with-at-least-a-one","translatedTitle":null,"stats":"{\"totalAccepted\": \"164.4K\", \"totalSubmission\": \"307.7K\", \"totalAcceptedRaw\": 164445, \"totalSubmissionRaw\": 307716, \"acRate\": \"53.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1375","questionFrontendId":"2217","title":"Find Palindrome With Fixed Length","titleSlug":"find-palindrome-with-fixed-length","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"41.8K\", \"totalAcceptedRaw\": 14220, \"totalSubmissionRaw\": 41775, \"acRate\": \"34.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1376","questionFrontendId":"2312","title":"Selling Pieces of Wood","titleSlug":"selling-pieces-of-wood","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.7K\", \"totalSubmission\": \"16K\", \"totalAcceptedRaw\": 7731, \"totalSubmissionRaw\": 15963, \"acRate\": \"48.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1378","questionFrontendId":"1252","title":"Cells with Odd Values in a Matrix","titleSlug":"cells-with-odd-values-in-a-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"92.9K\", \"totalSubmission\": \"118.3K\", \"totalAcceptedRaw\": 92883, \"totalSubmissionRaw\": 118278, \"acRate\": \"78.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1379","questionFrontendId":"1253","title":"Reconstruct a 2-Row Binary Matrix","titleSlug":"reconstruct-a-2-row-binary-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.4K\", \"totalSubmission\": \"50.5K\", \"totalAcceptedRaw\": 22364, \"totalSubmissionRaw\": 50528, \"acRate\": \"44.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1380","questionFrontendId":"1254","title":"Number of Closed Islands","titleSlug":"number-of-closed-islands","translatedTitle":null,"stats":"{\"totalAccepted\": \"127.9K\", \"totalSubmission\": \"199.5K\", \"totalAcceptedRaw\": 127869, \"totalSubmissionRaw\": 199499, \"acRate\": \"64.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1381","questionFrontendId":"1255","title":"Maximum Score Words Formed by Letters","titleSlug":"maximum-score-words-formed-by-letters","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.3K\", \"totalSubmission\": \"40.4K\", \"totalAcceptedRaw\": 29283, \"totalSubmissionRaw\": 40433, \"acRate\": \"72.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1382","questionFrontendId":"2303","title":"Calculate Amount Paid in Taxes","titleSlug":"calculate-amount-paid-in-taxes","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.5K\", \"totalSubmission\": \"44.5K\", \"totalAcceptedRaw\": 28517, \"totalSubmissionRaw\": 44480, \"acRate\": \"64.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1384","questionFrontendId":"1618","title":"Maximum Font to Fit a Sentence in a Screen","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"10.2K\", \"totalAcceptedRaw\": 6103, \"totalSubmissionRaw\": 10219, \"acRate\": \"59.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1386","questionFrontendId":"1260","title":"Shift 2D Grid","titleSlug":"shift-2d-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"94.2K\", \"totalSubmission\": \"138.8K\", \"totalAcceptedRaw\": 94160, \"totalSubmissionRaw\": 138844, \"acRate\": \"67.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1388","questionFrontendId":"1262","title":"Greatest Sum Divisible by Three","titleSlug":"greatest-sum-divisible-by-three","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.3K\", \"totalSubmission\": \"89.1K\", \"totalAcceptedRaw\": 45254, \"totalSubmissionRaw\": 89061, \"acRate\": \"50.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1389","questionFrontendId":"1263","title":"Minimum Moves to Move a Box to Their Target Location","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.6K\", \"totalSubmission\": \"50.3K\", \"totalAcceptedRaw\": 24646, \"totalSubmissionRaw\": 50274, \"acRate\": \"49.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1391","questionFrontendId":"1426","title":"Counting Elements","titleSlug":"counting-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"98.8K\", \"totalSubmission\": \"165.4K\", \"totalAcceptedRaw\": 98759, \"totalSubmissionRaw\": 165438, \"acRate\": \"59.7%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1392","questionFrontendId":"2215","title":"Find the Difference of Two Arrays","titleSlug":"find-the-difference-of-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"49.4K\", \"totalSubmission\": \"70.1K\", \"totalAcceptedRaw\": 49416, \"totalSubmissionRaw\": 70064, \"acRate\": \"70.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1393","questionFrontendId":"2218","title":"Maximum Value of K Coins From Piles","titleSlug":"maximum-value-of-k-coins-from-piles","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"28.6K\", \"totalAcceptedRaw\": 13768, \"totalSubmissionRaw\": 28569, \"acRate\": \"48.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1394","questionFrontendId":"2304","title":"Minimum Path Cost in a Grid","titleSlug":"minimum-path-cost-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.9K\", \"totalSubmission\": \"31.8K\", \"totalAcceptedRaw\": 20909, \"totalSubmissionRaw\": 31800, \"acRate\": \"65.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1395","questionFrontendId":"1266","title":"Minimum Time Visiting All Points","titleSlug":"minimum-time-visiting-all-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"132.9K\", \"totalSubmission\": \"168K\", \"totalAcceptedRaw\": 132857, \"totalSubmissionRaw\": 168011, \"acRate\": \"79.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1396","questionFrontendId":"1267","title":"Count Servers that Communicate","titleSlug":"count-servers-that-communicate","translatedTitle":null,"stats":"{\"totalAccepted\": \"50.8K\", \"totalSubmission\": \"85.5K\", \"totalAcceptedRaw\": 50795, \"totalSubmissionRaw\": 85462, \"acRate\": \"59.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1397","questionFrontendId":"1268","title":"Search Suggestions System","titleSlug":"search-suggestions-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"243K\", \"totalSubmission\": \"366.8K\", \"totalAcceptedRaw\": 243049, \"totalSubmissionRaw\": 366808, \"acRate\": \"66.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1400","questionFrontendId":"1275","title":"Find Winner on a Tic Tac Toe Game","titleSlug":"find-winner-on-a-tic-tac-toe-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"99.7K\", \"totalSubmission\": \"183.9K\", \"totalAcceptedRaw\": 99725, \"totalSubmissionRaw\": 183898, \"acRate\": \"54.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1402","questionFrontendId":"1277","title":"Count Square Submatrices with All Ones","titleSlug":"count-square-submatrices-with-all-ones","translatedTitle":null,"stats":"{\"totalAccepted\": \"190.8K\", \"totalSubmission\": \"256.2K\", \"totalAcceptedRaw\": 190846, \"totalSubmissionRaw\": 256157, \"acRate\": \"74.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1407","questionFrontendId":"1282","title":"Group the People Given the Group Size They Belong To","titleSlug":"group-the-people-given-the-group-size-they-belong-to","translatedTitle":null,"stats":"{\"totalAccepted\": \"99.3K\", \"totalSubmission\": \"116.1K\", \"totalAcceptedRaw\": 99347, \"totalSubmissionRaw\": 116065, \"acRate\": \"85.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1408","questionFrontendId":"1283","title":"Find the Smallest Divisor Given a Threshold","titleSlug":"find-the-smallest-divisor-given-a-threshold","translatedTitle":null,"stats":"{\"totalAccepted\": \"105.5K\", \"totalSubmission\": \"188.3K\", \"totalAcceptedRaw\": 105534, \"totalSubmissionRaw\": 188300, \"acRate\": \"56.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1409","questionFrontendId":"1284","title":"Minimum Number of Flips to Convert Binary Matrix to Zero Matrix","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.9K\", \"totalSubmission\": \"40.2K\", \"totalAcceptedRaw\": 28917, \"totalSubmissionRaw\": 40221, \"acRate\": \"71.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1413","questionFrontendId":"1292","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.6K\", \"totalSubmission\": \"55.5K\", \"totalAcceptedRaw\": 29594, \"totalSubmissionRaw\": 55521, \"acRate\": \"53.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1414","questionFrontendId":"1293","title":"Shortest Path in a Grid with Obstacles Elimination","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination","translatedTitle":null,"stats":"{\"totalAccepted\": \"175.1K\", \"totalSubmission\": \"385.8K\", \"totalAcceptedRaw\": 175129, \"totalSubmissionRaw\": 385848, \"acRate\": \"45.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1416","questionFrontendId":"2229","title":"Check if an Array Is Consecutive","titleSlug":"check-if-an-array-is-consecutive","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.9K\", \"totalSubmission\": \"6.4K\", \"totalAcceptedRaw\": 3896, \"totalSubmissionRaw\": 6383, \"acRate\": \"61.0%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1417","questionFrontendId":"10005","title":"Design a Load Distributor","titleSlug":"design-a-load-distributor","translatedTitle":null,"stats":"{\"totalAccepted\": \"444\", \"totalSubmission\": \"2.4K\", \"totalAcceptedRaw\": 444, \"totalSubmissionRaw\": 2387, \"acRate\": \"18.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1418","questionFrontendId":"2305","title":"Fair Distribution of Cookies","titleSlug":"fair-distribution-of-cookies","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"36K\", \"totalAcceptedRaw\": 22289, \"totalSubmissionRaw\": 36014, \"acRate\": \"61.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1421","questionFrontendId":"1295","title":"Find Numbers with Even Number of Digits","titleSlug":"find-numbers-with-even-number-of-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"539.1K\", \"totalSubmission\": \"699.9K\", \"totalAcceptedRaw\": 539054, \"totalSubmissionRaw\": 699851, \"acRate\": \"77.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1422","questionFrontendId":"1296","title":"Divide Array in Sets of K Consecutive Numbers","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.9K\", \"totalSubmission\": \"125.6K\", \"totalAcceptedRaw\": 70940, \"totalSubmissionRaw\": 125609, \"acRate\": \"56.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1424","questionFrontendId":"1298","title":"Maximum Candies You Can Get from Boxes","titleSlug":"maximum-candies-you-can-get-from-boxes","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.7K\", \"totalSubmission\": \"21.2K\", \"totalAcceptedRaw\": 12736, \"totalSubmissionRaw\": 21164, \"acRate\": \"60.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1426","questionFrontendId":"1304","title":"Find N Unique Integers Sum up to Zero","titleSlug":"find-n-unique-integers-sum-up-to-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"180.3K\", \"totalSubmission\": \"234.3K\", \"totalAcceptedRaw\": 180325, \"totalSubmissionRaw\": 234311, \"acRate\": \"77.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1428","questionFrontendId":"1306","title":"Jump Game III","titleSlug":"jump-game-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"184.6K\", \"totalSubmission\": \"290.9K\", \"totalAcceptedRaw\": 184606, \"totalSubmissionRaw\": 290865, \"acRate\": \"63.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1429","questionFrontendId":"1307","title":"Verbal Arithmetic Puzzle","titleSlug":"verbal-arithmetic-puzzle","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"31.1K\", \"totalAcceptedRaw\": 10646, \"totalSubmissionRaw\": 31144, \"acRate\": \"34.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1433","questionFrontendId":"2227","title":"Encrypt and Decrypt Strings","titleSlug":"encrypt-and-decrypt-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.8K\", \"totalSubmission\": \"25K\", \"totalAcceptedRaw\": 9848, \"totalSubmissionRaw\": 25014, \"acRate\": \"39.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1435","questionFrontendId":"1310","title":"XOR Queries of a Subarray","titleSlug":"xor-queries-of-a-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.4K\", \"totalSubmission\": \"64.2K\", \"totalAcceptedRaw\": 46389, \"totalSubmissionRaw\": 64174, \"acRate\": \"72.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1436","questionFrontendId":"1311","title":"Get Watched Videos by Your Friends","titleSlug":"get-watched-videos-by-your-friends","translatedTitle":null,"stats":"{\"totalAccepted\": \"18K\", \"totalSubmission\": \"39.2K\", \"totalAcceptedRaw\": 17986, \"totalSubmissionRaw\": 39164, \"acRate\": \"45.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1445","questionFrontendId":"1343","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"53.1K\", \"totalSubmission\": \"78.6K\", \"totalAcceptedRaw\": 53125, \"totalSubmissionRaw\": 78613, \"acRate\": \"67.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1447","questionFrontendId":"1345","title":"Jump Game IV","titleSlug":"jump-game-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"127.9K\", \"totalSubmission\": \"272.1K\", \"totalAcceptedRaw\": 127949, \"totalSubmissionRaw\": 272108, \"acRate\": \"47.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1449","questionFrontendId":"1324","title":"Print Words Vertically","titleSlug":"print-words-vertically","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.9K\", \"totalSubmission\": \"53.6K\", \"totalAcceptedRaw\": 32904, \"totalSubmissionRaw\": 53607, \"acRate\": \"61.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1451","questionFrontendId":"1326","title":"Minimum Number of Taps to Open to Water a Garden","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.5K\", \"totalSubmission\": \"141.8K\", \"totalAcceptedRaw\": 67547, \"totalSubmissionRaw\": 141782, \"acRate\": \"47.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1455","questionFrontendId":"1333","title":"Filter Restaurants by Vegan-Friendly, Price and Distance","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.1K\", \"totalSubmission\": \"43.4K\", \"totalAcceptedRaw\": 26081, \"totalSubmissionRaw\": 43442, \"acRate\": \"60.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1457","questionFrontendId":"1335","title":"Minimum Difficulty of a Job Schedule","titleSlug":"minimum-difficulty-of-a-job-schedule","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.2K\", \"totalSubmission\": \"203.7K\", \"totalAcceptedRaw\": 119247, \"totalSubmissionRaw\": 203668, \"acRate\": \"58.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1458","questionFrontendId":"1356","title":"Sort Integers by The Number of 1 Bits","titleSlug":"sort-integers-by-the-number-of-1-bits","translatedTitle":null,"stats":"{\"totalAccepted\": \"106.6K\", \"totalSubmission\": \"146.1K\", \"totalAcceptedRaw\": 106562, \"totalSubmissionRaw\": 146099, \"acRate\": \"72.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1459","questionFrontendId":"1357","title":"Apply Discount Every n Orders","titleSlug":"apply-discount-every-n-orders","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.6K\", \"totalSubmission\": \"25.1K\", \"totalAcceptedRaw\": 17581, \"totalSubmissionRaw\": 25150, \"acRate\": \"69.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1463","questionFrontendId":"1337","title":"The K Weakest Rows in a Matrix","titleSlug":"the-k-weakest-rows-in-a-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"236.7K\", \"totalSubmission\": \"328.2K\", \"totalAcceptedRaw\": 236728, \"totalSubmissionRaw\": 328219, \"acRate\": \"72.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1464","questionFrontendId":"1338","title":"Reduce Array Size to The Half","titleSlug":"reduce-array-size-to-the-half","translatedTitle":null,"stats":"{\"totalAccepted\": \"169.1K\", \"totalSubmission\": \"243.5K\", \"totalAcceptedRaw\": 169119, \"totalSubmissionRaw\": 243543, \"acRate\": \"69.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1466","questionFrontendId":"1340","title":"Jump Game V","titleSlug":"jump-game-v","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.8K\", \"totalSubmission\": \"39.7K\", \"totalAcceptedRaw\": 24845, \"totalSubmissionRaw\": 39736, \"acRate\": \"62.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1468","questionFrontendId":"1346","title":"Check If N and Its Double Exist","titleSlug":"check-if-n-and-its-double-exist","translatedTitle":null,"stats":"{\"totalAccepted\": \"272.7K\", \"totalSubmission\": \"746.9K\", \"totalAcceptedRaw\": 272653, \"totalSubmissionRaw\": 746897, \"acRate\": \"36.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1471","questionFrontendId":"1349","title":"Maximum Students Taking Exam","titleSlug":"maximum-students-taking-exam","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.7K\", \"totalSubmission\": \"26K\", \"totalAcceptedRaw\": 12718, \"totalSubmissionRaw\": 25989, \"acRate\": \"48.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1476","questionFrontendId":"1351","title":"Count Negative Numbers in a Sorted Matrix","titleSlug":"count-negative-numbers-in-a-sorted-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"234.2K\", \"totalSubmission\": \"310.3K\", \"totalAcceptedRaw\": 234177, \"totalSubmissionRaw\": 310323, \"acRate\": \"75.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1477","questionFrontendId":"1352","title":"Product of the Last K Numbers","titleSlug":"product-of-the-last-k-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.8K\", \"totalSubmission\": \"135.5K\", \"totalAcceptedRaw\": 67769, \"totalSubmissionRaw\": 135489, \"acRate\": \"50.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1478","questionFrontendId":"1353","title":"Maximum Number of Events That Can Be Attended","titleSlug":"maximum-number-of-events-that-can-be-attended","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.8K\", \"totalSubmission\": \"208K\", \"totalAcceptedRaw\": 67778, \"totalSubmissionRaw\": 208031, \"acRate\": \"32.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1479","questionFrontendId":"1354","title":"Construct Target Array With Multiple Sums","titleSlug":"construct-target-array-with-multiple-sums","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.9K\", \"totalSubmission\": \"176.2K\", \"totalAcceptedRaw\": 63913, \"totalSubmissionRaw\": 176156, \"acRate\": \"36.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1482","questionFrontendId":"1365","title":"How Many Numbers Are Smaller Than the Current Number","titleSlug":"how-many-numbers-are-smaller-than-the-current-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"414.7K\", \"totalSubmission\": \"478.5K\", \"totalAcceptedRaw\": 414663, \"totalSubmissionRaw\": 478465, \"acRate\": \"86.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1483","questionFrontendId":"1366","title":"Rank Teams by Votes","titleSlug":"rank-teams-by-votes","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.6K\", \"totalSubmission\": \"89.1K\", \"totalAcceptedRaw\": 51621, \"totalSubmissionRaw\": 89105, \"acRate\": \"57.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1485","questionFrontendId":"1368","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.2K\", \"totalSubmission\": \"63.7K\", \"totalAcceptedRaw\": 39165, \"totalSubmissionRaw\": 63654, \"acRate\": \"61.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1486","questionFrontendId":"1385","title":"Find the Distance Value Between Two Arrays","titleSlug":"find-the-distance-value-between-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.5K\", \"totalSubmission\": \"118.2K\", \"totalAcceptedRaw\": 78467, \"totalSubmissionRaw\": 118199, \"acRate\": \"66.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1487","questionFrontendId":"1386","title":"Cinema Seat Allocation","titleSlug":"cinema-seat-allocation","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.8K\", \"totalSubmission\": \"92.3K\", \"totalAcceptedRaw\": 37761, \"totalSubmissionRaw\": 92306, \"acRate\": \"40.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1489","questionFrontendId":"1388","title":"Pizza With 3n Slices","titleSlug":"pizza-with-3n-slices","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"27.5K\", \"totalAcceptedRaw\": 13811, \"totalSubmissionRaw\": 27525, \"acRate\": \"50.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1491","questionFrontendId":"1375","title":"Number of Times Binary String Is Prefix-Aligned","titleSlug":"number-of-times-binary-string-is-prefix-aligned","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.7K\", \"totalSubmission\": \"69.5K\", \"totalAcceptedRaw\": 45688, \"totalSubmissionRaw\": 69451, \"acRate\": \"65.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1496","questionFrontendId":"1380","title":"Lucky Numbers in a Matrix","titleSlug":"lucky-numbers-in-a-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"81.2K\", \"totalSubmission\": \"115K\", \"totalAcceptedRaw\": 81203, \"totalSubmissionRaw\": 114964, \"acRate\": \"70.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1497","questionFrontendId":"1381","title":"Design a Stack With Increment Operation","titleSlug":"design-a-stack-with-increment-operation","translatedTitle":null,"stats":"{\"totalAccepted\": \"89.8K\", \"totalSubmission\": \"116.4K\", \"totalAcceptedRaw\": 89787, \"totalSubmissionRaw\": 116422, \"acRate\": \"77.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1499","questionFrontendId":"1383","title":"Maximum Performance of a Team","titleSlug":"maximum-performance-of-a-team","translatedTitle":null,"stats":"{\"totalAccepted\": \"85.7K\", \"totalSubmission\": \"176.8K\", \"totalAcceptedRaw\": 85743, \"totalSubmissionRaw\": 176760, \"acRate\": \"48.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1503","questionFrontendId":"1402","title":"Reducing Dishes","titleSlug":"reducing-dishes","translatedTitle":null,"stats":"{\"totalAccepted\": \"53.8K\", \"totalSubmission\": \"74.8K\", \"totalAcceptedRaw\": 53835, \"totalSubmissionRaw\": 74750, \"acRate\": \"72.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1505","questionFrontendId":"1389","title":"Create Target Array in the Given Order","titleSlug":"create-target-array-in-the-given-order","translatedTitle":null,"stats":"{\"totalAccepted\": \"186.3K\", \"totalSubmission\": \"217.1K\", \"totalAcceptedRaw\": 186339, \"totalSubmissionRaw\": 217081, \"acRate\": \"85.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1507","questionFrontendId":"1391","title":"Check if There is a Valid Path in a Grid","titleSlug":"check-if-there-is-a-valid-path-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"51.1K\", \"totalAcceptedRaw\": 24159, \"totalSubmissionRaw\": 51128, \"acRate\": \"47.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1510","questionFrontendId":"1394","title":"Find Lucky Integer in an Array","titleSlug":"find-lucky-integer-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"90.1K\", \"totalSubmission\": \"140K\", \"totalAcceptedRaw\": 90129, \"totalSubmissionRaw\": 140029, \"acRate\": \"64.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1511","questionFrontendId":"1395","title":"Count Number of Teams","titleSlug":"count-number-of-teams","translatedTitle":null,"stats":"{\"totalAccepted\": \"99.6K\", \"totalSubmission\": \"147.9K\", \"totalAcceptedRaw\": 99588, \"totalSubmissionRaw\": 147895, \"acRate\": \"67.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1514","questionFrontendId":"1413","title":"Minimum Value to Get Positive Step by Step Sum","titleSlug":"minimum-value-to-get-positive-step-by-step-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"95.1K\", \"totalSubmission\": \"141.2K\", \"totalAcceptedRaw\": 95147, \"totalSubmissionRaw\": 141205, \"acRate\": \"67.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1519","questionFrontendId":"1403","title":"Minimum Subsequence in Non-Increasing Order","titleSlug":"minimum-subsequence-in-non-increasing-order","translatedTitle":null,"stats":"{\"totalAccepted\": \"60K\", \"totalSubmission\": \"83K\", \"totalAcceptedRaw\": 60001, \"totalSubmissionRaw\": 83033, \"acRate\": \"72.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1522","questionFrontendId":"1406","title":"Stone Game III","titleSlug":"stone-game-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.2K\", \"totalSubmission\": \"70.9K\", \"totalAcceptedRaw\": 42223, \"totalSubmissionRaw\": 70908, \"acRate\": \"59.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1524","questionFrontendId":"1408","title":"String Matching in an Array","titleSlug":"string-matching-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"68.3K\", \"totalSubmission\": \"107K\", \"totalAcceptedRaw\": 68263, \"totalSubmissionRaw\": 107028, \"acRate\": \"63.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1525","questionFrontendId":"1409","title":"Queries on a Permutation With Key","titleSlug":"queries-on-a-permutation-with-key","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.7K\", \"totalSubmission\": \"51.2K\", \"totalAcceptedRaw\": 42685, \"totalSubmissionRaw\": 51172, \"acRate\": \"83.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1528","questionFrontendId":"1431","title":"Kids With the Greatest Number of Candies","titleSlug":"kids-with-the-greatest-number-of-candies","translatedTitle":null,"stats":"{\"totalAccepted\": \"388.8K\", \"totalSubmission\": \"445.6K\", \"totalAcceptedRaw\": 388783, \"totalSubmissionRaw\": 445574, \"acRate\": \"87.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1531","questionFrontendId":"1434","title":"Number of Ways to Wear Different Hats to Each Other","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.4K\", \"totalSubmission\": \"26.6K\", \"totalAcceptedRaw\": 11431, \"totalSubmissionRaw\": 26557, \"acRate\": \"43.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1533","questionFrontendId":"1418","title":"Display Table of Food Orders in a Restaurant","titleSlug":"display-table-of-food-orders-in-a-restaurant","translatedTitle":null,"stats":"{\"totalAccepted\": \"23K\", \"totalSubmission\": \"31K\", \"totalAcceptedRaw\": 22977, \"totalSubmissionRaw\": 31012, \"acRate\": \"74.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1538","questionFrontendId":"1423","title":"Maximum Points You Can Obtain from Cards","titleSlug":"maximum-points-you-can-obtain-from-cards","translatedTitle":null,"stats":"{\"totalAccepted\": \"216.9K\", \"totalSubmission\": \"415.1K\", \"totalAcceptedRaw\": 216947, \"totalSubmissionRaw\": 415147, \"acRate\": \"52.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1539","questionFrontendId":"1424","title":"Diagonal Traverse II","titleSlug":"diagonal-traverse-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"47.3K\", \"totalSubmission\": \"93.6K\", \"totalAcceptedRaw\": 47272, \"totalSubmissionRaw\": 93638, \"acRate\": \"50.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1545","questionFrontendId":"1449","title":"Form Largest Integer With Digits That Add up to Target","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.6K\", \"totalSubmission\": \"30.6K\", \"totalAcceptedRaw\": 14621, \"totalSubmissionRaw\": 30640, \"acRate\": \"47.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1548","questionFrontendId":"1437","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"66K\", \"totalSubmission\": \"112.2K\", \"totalAcceptedRaw\": 65981, \"totalSubmissionRaw\": 112238, \"acRate\": \"58.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1549","questionFrontendId":"1438","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"107.6K\", \"totalSubmission\": \"222.8K\", \"totalAcceptedRaw\": 107575, \"totalSubmissionRaw\": 222784, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1550","questionFrontendId":"1439","title":"Find the Kth Smallest Sum of a Matrix With Sorted Rows","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.5K\", \"totalSubmission\": \"46.4K\", \"totalAcceptedRaw\": 28480, \"totalSubmissionRaw\": 46387, \"acRate\": \"61.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1552","questionFrontendId":"1441","title":"Build an Array With Stack Operations","titleSlug":"build-an-array-with-stack-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"72K\", \"totalSubmission\": \"100.3K\", \"totalAcceptedRaw\": 71952, \"totalSubmissionRaw\": 100258, \"acRate\": \"71.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1553","questionFrontendId":"1442","title":"Count Triplets That Can Form Two Arrays of Equal XOR","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.4K\", \"totalSubmission\": \"41.3K\", \"totalAcceptedRaw\": 31365, \"totalSubmissionRaw\": 41263, \"acRate\": \"76.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1555","questionFrontendId":"1444","title":"Number of Ways of Cutting a Pizza","titleSlug":"number-of-ways-of-cutting-a-pizza","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.3K\", \"totalSubmission\": \"45K\", \"totalAcceptedRaw\": 25266, \"totalSubmissionRaw\": 45020, \"acRate\": \"56.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1556","questionFrontendId":"1460","title":"Make Two Arrays Equal by Reversing Subarrays","titleSlug":"make-two-arrays-equal-by-reversing-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"103.9K\", \"totalSubmission\": \"143.9K\", \"totalAcceptedRaw\": 103880, \"totalSubmissionRaw\": 143902, \"acRate\": \"72.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1559","questionFrontendId":"1463","title":"Cherry Pickup II","titleSlug":"cherry-pickup-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.1K\", \"totalSubmission\": \"112.1K\", \"totalAcceptedRaw\": 78080, \"totalSubmissionRaw\": 112093, \"acRate\": \"69.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1560","questionFrontendId":"1450","title":"Number of Students Doing Homework at a Given Time","titleSlug":"number-of-students-doing-homework-at-a-given-time","translatedTitle":null,"stats":"{\"totalAccepted\": \"100.3K\", \"totalSubmission\": \"132.2K\", \"totalAcceptedRaw\": 100268, \"totalSubmissionRaw\": 132152, \"acRate\": \"75.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1562","questionFrontendId":"1452","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"21K\", \"totalSubmission\": \"36.9K\", \"totalAcceptedRaw\": 20987, \"totalSubmissionRaw\": 36938, \"acRate\": \"56.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1563","questionFrontendId":"1453","title":"Maximum Number of Darts Inside of a Circular Dartboard","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.2K\", \"totalSubmission\": \"14K\", \"totalAcceptedRaw\": 5150, \"totalSubmissionRaw\": 13963, \"acRate\": \"36.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1569","questionFrontendId":"1458","title":"Max Dot Product of Two Subsequences","titleSlug":"max-dot-product-of-two-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.4K\", \"totalSubmission\": \"41.6K\", \"totalAcceptedRaw\": 19385, \"totalSubmissionRaw\": 41598, \"acRate\": \"46.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1570","questionFrontendId":"1475","title":"Final Prices With a Special Discount in a Shop","titleSlug":"final-prices-with-a-special-discount-in-a-shop","translatedTitle":null,"stats":"{\"totalAccepted\": \"103.6K\", \"totalSubmission\": \"136.3K\", \"totalAcceptedRaw\": 103626, \"totalSubmissionRaw\": 136343, \"acRate\": \"76.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1571","questionFrontendId":"1478","title":"Allocate Mailboxes","titleSlug":"allocate-mailboxes","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"35.8K\", \"totalAcceptedRaw\": 19894, \"totalSubmissionRaw\": 35815, \"acRate\": \"55.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1572","questionFrontendId":"1476","title":"Subrectangle Queries","titleSlug":"subrectangle-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"87.1K\", \"totalSubmission\": \"98.7K\", \"totalAcceptedRaw\": 87140, \"totalSubmissionRaw\": 98652, \"acRate\": \"88.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1573","questionFrontendId":"1477","title":"Find Two Non-overlapping Sub-arrays Each With Target Sum","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.1K\", \"totalSubmission\": \"117.1K\", \"totalAcceptedRaw\": 43129, \"totalSubmissionRaw\": 117109, \"acRate\": \"36.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1574","questionFrontendId":"1464","title":"Maximum Product of Two Elements in an Array","titleSlug":"maximum-product-of-two-elements-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"181.9K\", \"totalSubmission\": \"227.8K\", \"totalAcceptedRaw\": 181946, \"totalSubmissionRaw\": 227843, \"acRate\": \"79.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1575","questionFrontendId":"1465","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"159.7K\", \"totalSubmission\": \"390.8K\", \"totalAcceptedRaw\": 159692, \"totalSubmissionRaw\": 390781, \"acRate\": \"40.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1577","questionFrontendId":"1467","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"7K\", \"totalSubmission\": \"11.6K\", \"totalAcceptedRaw\": 7024, \"totalSubmissionRaw\": 11561, \"acRate\": \"60.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Probability and Statistics","translatedName":null,"slug":"probability-and-statistics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1580","questionFrontendId":"1470","title":"Shuffle the Array","titleSlug":"shuffle-the-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"507.6K\", \"totalSubmission\": \"570K\", \"totalAcceptedRaw\": 507577, \"totalSubmissionRaw\": 570016, \"acRate\": \"89.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1581","questionFrontendId":"1471","title":"The k Strongest Values in an Array","titleSlug":"the-k-strongest-values-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"33K\", \"totalSubmission\": \"54.7K\", \"totalAcceptedRaw\": 33022, \"totalSubmissionRaw\": 54653, \"acRate\": \"60.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1582","questionFrontendId":"1472","title":"Design Browser History","titleSlug":"design-browser-history","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.9K\", \"totalSubmission\": \"157.3K\", \"totalAcceptedRaw\": 119865, \"totalSubmissionRaw\": 157289, \"acRate\": \"76.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1583","questionFrontendId":"1473","title":"Paint House III","titleSlug":"paint-house-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"55K\", \"totalSubmission\": \"89.3K\", \"totalAcceptedRaw\": 55037, \"totalSubmissionRaw\": 89327, \"acRate\": \"61.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1584","questionFrontendId":"1491","title":"Average Salary Excluding the Minimum and Maximum Salary","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary","translatedTitle":null,"stats":"{\"totalAccepted\": \"196.2K\", \"totalSubmission\": \"319.5K\", \"totalAcceptedRaw\": 196204, \"totalSubmissionRaw\": 319505, \"acRate\": \"61.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1586","questionFrontendId":"1493","title":"Longest Subarray of 1's After Deleting One Element","titleSlug":"longest-subarray-of-1s-after-deleting-one-element","translatedTitle":null,"stats":"{\"totalAccepted\": \"58K\", \"totalSubmission\": \"96.2K\", \"totalAcceptedRaw\": 58044, \"totalSubmissionRaw\": 96214, \"acRate\": \"60.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1603","questionFrontendId":"1480","title":"Running Sum of 1d Array","titleSlug":"running-sum-of-1d-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"1.6M\", \"totalAcceptedRaw\": 1364080, \"totalSubmissionRaw\": 1555318, \"acRate\": \"87.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1604","questionFrontendId":"1481","title":"Least Number of Unique Integers after K Removals","titleSlug":"least-number-of-unique-integers-after-k-removals","translatedTitle":null,"stats":"{\"totalAccepted\": \"93.8K\", \"totalSubmission\": \"168.3K\", \"totalAcceptedRaw\": 93784, \"totalSubmissionRaw\": 168316, \"acRate\": \"55.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1605","questionFrontendId":"1482","title":"Minimum Number of Days to Make m Bouquets","titleSlug":"minimum-number-of-days-to-make-m-bouquets","translatedTitle":null,"stats":"{\"totalAccepted\": \"58K\", \"totalSubmission\": \"107K\", \"totalAcceptedRaw\": 57955, \"totalSubmissionRaw\": 106955, \"acRate\": \"54.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1611","questionFrontendId":"1487","title":"Making File Names Unique","titleSlug":"making-file-names-unique","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.6K\", \"totalSubmission\": \"81.8K\", \"totalAcceptedRaw\": 29598, \"totalSubmissionRaw\": 81809, \"acRate\": \"36.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1612","questionFrontendId":"1488","title":"Avoid Flood in The City","titleSlug":"avoid-flood-in-the-city","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.1K\", \"totalSubmission\": \"114.2K\", \"totalAcceptedRaw\": 30123, \"totalSubmissionRaw\": 114183, \"acRate\": \"26.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1615","questionFrontendId":"1508","title":"Range Sum of Sorted Subarray Sums","titleSlug":"range-sum-of-sorted-subarray-sums","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.1K\", \"totalSubmission\": \"54.3K\", \"totalAcceptedRaw\": 32070, \"totalSubmissionRaw\": 54333, \"acRate\": \"59.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1616","questionFrontendId":"1509","title":"Minimum Difference Between Largest and Smallest Value in Three Moves","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves","translatedTitle":null,"stats":"{\"totalAccepted\": \"74.2K\", \"totalSubmission\": \"135.9K\", \"totalAcceptedRaw\": 74224, \"totalSubmissionRaw\": 135894, \"acRate\": \"54.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1620","questionFrontendId":"1497","title":"Check If Array Pairs Are Divisible by k","titleSlug":"check-if-array-pairs-are-divisible-by-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"40K\", \"totalSubmission\": \"102.1K\", \"totalAcceptedRaw\": 39973, \"totalSubmissionRaw\": 102091, \"acRate\": \"39.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1621","questionFrontendId":"1498","title":"Number of Subsequences That Satisfy the Given Sum Condition","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.5K\", \"totalSubmission\": \"107.8K\", \"totalAcceptedRaw\": 40463, \"totalSubmissionRaw\": 107780, \"acRate\": \"37.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1622","questionFrontendId":"1499","title":"Max Value of Equation","titleSlug":"max-value-of-equation","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.8K\", \"totalSubmission\": \"80.3K\", \"totalAcceptedRaw\": 36804, \"totalSubmissionRaw\": 80301, \"acRate\": \"45.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1626","questionFrontendId":"1502","title":"Can Make Arithmetic Progression From Sequence","titleSlug":"can-make-arithmetic-progression-from-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"125.1K\", \"totalSubmission\": \"184.7K\", \"totalAcceptedRaw\": 125124, \"totalSubmissionRaw\": 184691, \"acRate\": \"67.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1627","questionFrontendId":"1503","title":"Last Moment Before All Ants Fall Out of a Plank","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"32.7K\", \"totalAcceptedRaw\": 18195, \"totalSubmissionRaw\": 32697, \"acRate\": \"55.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1628","questionFrontendId":"1504","title":"Count Submatrices With All Ones","titleSlug":"count-submatrices-with-all-ones","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.2K\", \"totalSubmission\": \"75K\", \"totalAcceptedRaw\": 43164, \"totalSubmissionRaw\": 75010, \"acRate\": \"57.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1631","questionFrontendId":"1524","title":"Number of Sub-arrays With Odd Sum","titleSlug":"number-of-sub-arrays-with-odd-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.5K\", \"totalSubmission\": \"72.8K\", \"totalAcceptedRaw\": 31509, \"totalSubmissionRaw\": 72836, \"acRate\": \"43.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1633","questionFrontendId":"1526","title":"Minimum Number of Increments on Subarrays to Form a Target Array","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.6K\", \"totalSubmission\": \"44.7K\", \"totalAcceptedRaw\": 30642, \"totalSubmissionRaw\": 44713, \"acRate\": \"68.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1635","questionFrontendId":"1512","title":"Number of Good Pairs","titleSlug":"number-of-good-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"419.9K\", \"totalSubmission\": \"475.9K\", \"totalAcceptedRaw\": 419858, \"totalSubmissionRaw\": 475854, \"acRate\": \"88.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1645","questionFrontendId":"1521","title":"Find a Value of a Mysterious Function Closest to Target","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"19.8K\", \"totalAcceptedRaw\": 8608, \"totalSubmissionRaw\": 19783, \"acRate\": \"43.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1646","questionFrontendId":"1539","title":"Kth Missing Positive Number","titleSlug":"kth-missing-positive-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"295.6K\", \"totalSubmission\": \"505K\", \"totalAcceptedRaw\": 295648, \"totalSubmissionRaw\": 504955, \"acRate\": \"58.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1649","questionFrontendId":"1546","title":"Maximum Number of Non-Overlapping Subarrays With Sum Equals Target","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.3K\", \"totalSubmission\": \"51.3K\", \"totalAcceptedRaw\": 24273, \"totalSubmissionRaw\": 51263, \"acRate\": \"47.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1651","questionFrontendId":"1528","title":"Shuffle String","titleSlug":"shuffle-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"283.5K\", \"totalSubmission\": \"332.6K\", \"totalAcceptedRaw\": 283505, \"totalSubmissionRaw\": 332604, \"acRate\": \"85.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1656","questionFrontendId":"1534","title":"Count Good Triplets","titleSlug":"count-good-triplets","translatedTitle":null,"stats":"{\"totalAccepted\": \"94.6K\", \"totalSubmission\": \"116.9K\", \"totalAcceptedRaw\": 94584, \"totalSubmissionRaw\": 116858, \"acRate\": \"80.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1657","questionFrontendId":"1535","title":"Find the Winner of an Array Game","titleSlug":"find-the-winner-of-an-array-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.2K\", \"totalSubmission\": \"57.9K\", \"totalAcceptedRaw\": 28160, \"totalSubmissionRaw\": 57943, \"acRate\": \"48.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1658","questionFrontendId":"1536","title":"Minimum Swaps to Arrange a Binary Grid","titleSlug":"minimum-swaps-to-arrange-a-binary-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.8K\", \"totalSubmission\": \"27.5K\", \"totalAcceptedRaw\": 12799, \"totalSubmissionRaw\": 27505, \"acRate\": \"46.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1659","questionFrontendId":"1537","title":"Get the Maximum Score","titleSlug":"get-the-maximum-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.1K\", \"totalSubmission\": \"53.8K\", \"totalAcceptedRaw\": 21144, \"totalSubmissionRaw\": 53756, \"acRate\": \"39.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1662","questionFrontendId":"1558","title":"Minimum Numbers of Function Calls to Make Target Array","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"18K\", \"totalSubmission\": \"28.2K\", \"totalAcceptedRaw\": 18001, \"totalSubmissionRaw\": 28183, \"acRate\": \"63.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1663","questionFrontendId":"1559","title":"Detect Cycles in 2D Grid","titleSlug":"detect-cycles-in-2d-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.9K\", \"totalSubmission\": \"66.6K\", \"totalAcceptedRaw\": 31944, \"totalSubmissionRaw\": 66595, \"acRate\": \"48.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1669","questionFrontendId":"1547","title":"Minimum Cost to Cut a Stick","titleSlug":"minimum-cost-to-cut-a-stick","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.4K\", \"totalSubmission\": \"79.5K\", \"totalAcceptedRaw\": 45370, \"totalSubmissionRaw\": 79478, \"acRate\": \"57.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1672","questionFrontendId":"1533","title":"Find the Index of the Large Integer","titleSlug":"find-the-index-of-the-large-integer","translatedTitle":null,"stats":"{\"totalAccepted\": \"10K\", \"totalSubmission\": \"17.9K\", \"totalAcceptedRaw\": 10022, \"totalSubmissionRaw\": 17909, \"acRate\": \"56.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1675","questionFrontendId":"1552","title":"Magnetic Force Between Two Balls","titleSlug":"magnetic-force-between-two-balls","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.4K\", \"totalSubmission\": \"68K\", \"totalAcceptedRaw\": 39385, \"totalSubmissionRaw\": 67953, \"acRate\": \"58.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1677","questionFrontendId":"1572","title":"Matrix Diagonal Sum","titleSlug":"matrix-diagonal-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"171K\", \"totalSubmission\": \"213.2K\", \"totalAcceptedRaw\": 171014, \"totalSubmissionRaw\": 213234, \"acRate\": \"80.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1679","questionFrontendId":"1574","title":"Shortest Subarray to be Removed to Make Array Sorted","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.7K\", \"totalSubmission\": \"66.8K\", \"totalAcceptedRaw\": 24721, \"totalSubmissionRaw\": 66827, \"acRate\": \"37.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1680","questionFrontendId":"1575","title":"Count All Possible Routes","titleSlug":"count-all-possible-routes","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"22.2K\", \"totalAcceptedRaw\": 12612, \"totalSubmissionRaw\": 22223, \"acRate\": \"56.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1681","questionFrontendId":"1538","title":"Guess the Majority in a Hidden Array","titleSlug":"guess-the-majority-in-a-hidden-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"2.7K\", \"totalAcceptedRaw\": 1736, \"totalSubmissionRaw\": 2734, \"acRate\": \"63.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1682","questionFrontendId":"1560","title":"Most Visited Sector in a Circular Track","titleSlug":"most-visited-sector-in-a-circular-track","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.9K\", \"totalSubmission\": \"44.3K\", \"totalAcceptedRaw\": 25942, \"totalSubmissionRaw\": 44285, \"acRate\": \"58.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1683","questionFrontendId":"1561","title":"Maximum Number of Coins You Can Get","titleSlug":"maximum-number-of-coins-you-can-get","translatedTitle":null,"stats":"{\"totalAccepted\": \"64K\", \"totalSubmission\": \"81K\", \"totalAcceptedRaw\": 64033, \"totalSubmissionRaw\": 80980, \"acRate\": \"79.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1684","questionFrontendId":"1562","title":"Find Latest Group of Size M","titleSlug":"find-latest-group-of-size-m","translatedTitle":null,"stats":"{\"totalAccepted\": \"16K\", \"totalSubmission\": \"37.4K\", \"totalAcceptedRaw\": 15978, \"totalSubmissionRaw\": 37352, \"acRate\": \"42.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1685","questionFrontendId":"1563","title":"Stone Game V","titleSlug":"stone-game-v","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.5K\", \"totalSubmission\": \"38.4K\", \"totalAcceptedRaw\": 15507, \"totalSubmissionRaw\": 38438, \"acRate\": \"40.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1689","questionFrontendId":"1566","title":"Detect Pattern of Length M Repeated K or More Times","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.1K\", \"totalSubmission\": \"67K\", \"totalAcceptedRaw\": 29062, \"totalSubmissionRaw\": 66976, \"acRate\": \"43.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1690","questionFrontendId":"1567","title":"Maximum Length of Subarray With Positive Product","titleSlug":"maximum-length-of-subarray-with-positive-product","translatedTitle":null,"stats":"{\"totalAccepted\": \"81.7K\", \"totalSubmission\": \"185.6K\", \"totalAcceptedRaw\": 81666, \"totalSubmissionRaw\": 185628, \"acRate\": \"44.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1691","questionFrontendId":"1568","title":"Minimum Number of Days to Disconnect Island","titleSlug":"minimum-number-of-days-to-disconnect-island","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"22.8K\", \"totalAcceptedRaw\": 10619, \"totalSubmissionRaw\": 22816, \"acRate\": \"46.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Strongly Connected Component","translatedName":null,"slug":"strongly-connected-component","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1692","questionFrontendId":"1569","title":"Number of Ways to Reorder Array to Get Same BST","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"24.4K\", \"totalAcceptedRaw\": 11685, \"totalSubmissionRaw\": 24422, \"acRate\": \"47.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1693","questionFrontendId":"1588","title":"Sum of All Odd Length Subarrays","titleSlug":"sum-of-all-odd-length-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"150.5K\", \"totalSubmission\": \"180.6K\", \"totalAcceptedRaw\": 150547, \"totalSubmissionRaw\": 180559, \"acRate\": \"83.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1694","questionFrontendId":"1590","title":"Make Sum Divisible by P","titleSlug":"make-sum-divisible-by-p","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"75.7K\", \"totalAcceptedRaw\": 21235, \"totalSubmissionRaw\": 75674, \"acRate\": \"28.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1695","questionFrontendId":"1589","title":"Maximum Sum Obtained of Any Permutation","titleSlug":"maximum-sum-obtained-of-any-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.6K\", \"totalSubmission\": \"41.9K\", \"totalAcceptedRaw\": 15609, \"totalSubmissionRaw\": 41932, \"acRate\": \"37.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1696","questionFrontendId":"1591","title":"Strange Printer II","titleSlug":"strange-printer-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.4K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 8424, \"totalSubmissionRaw\": 14378, \"acRate\": \"58.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1699","questionFrontendId":"1577","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"44.6K\", \"totalAcceptedRaw\": 17874, \"totalSubmissionRaw\": 44569, \"acRate\": \"40.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1700","questionFrontendId":"1578","title":"Minimum Time to Make Rope Colorful","titleSlug":"minimum-time-to-make-rope-colorful","translatedTitle":null,"stats":"{\"totalAccepted\": \"144.9K\", \"totalSubmission\": \"228.1K\", \"totalAcceptedRaw\": 144852, \"totalSubmissionRaw\": 228129, \"acRate\": \"63.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1703","questionFrontendId":"1564","title":"Put Boxes Into the Warehouse I","titleSlug":"put-boxes-into-the-warehouse-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"21.2K\", \"totalAcceptedRaw\": 14227, \"totalSubmissionRaw\": 21220, \"acRate\": \"67.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1704","questionFrontendId":"1582","title":"Special Positions in a Binary Matrix","titleSlug":"special-positions-in-a-binary-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.6K\", \"totalSubmission\": \"60.6K\", \"totalAcceptedRaw\": 39632, \"totalSubmissionRaw\": 60620, \"acRate\": \"65.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1705","questionFrontendId":"1583","title":"Count Unhappy Friends","titleSlug":"count-unhappy-friends","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.6K\", \"totalSubmission\": \"38.6K\", \"totalAcceptedRaw\": 23552, \"totalSubmissionRaw\": 38644, \"acRate\": \"60.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1706","questionFrontendId":"1584","title":"Min Cost to Connect All Points","titleSlug":"min-cost-to-connect-all-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"152.1K\", \"totalSubmission\": \"237.8K\", \"totalAcceptedRaw\": 152120, \"totalSubmissionRaw\": 237783, \"acRate\": \"64.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Minimum Spanning Tree","translatedName":null,"slug":"minimum-spanning-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1709","questionFrontendId":"1604","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.1K\", \"totalSubmission\": \"61.9K\", \"totalAcceptedRaw\": 29087, \"totalSubmissionRaw\": 61891, \"acRate\": \"47.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1710","questionFrontendId":"1606","title":"Find Servers That Handled Most Number of Requests","titleSlug":"find-servers-that-handled-most-number-of-requests","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.8K\", \"totalSubmission\": \"29.9K\", \"totalAcceptedRaw\": 12834, \"totalSubmissionRaw\": 29895, \"acRate\": \"42.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1711","questionFrontendId":"1605","title":"Find Valid Matrix Given Row and Column Sums","titleSlug":"find-valid-matrix-given-row-and-column-sums","translatedTitle":null,"stats":"{\"totalAccepted\": \"33K\", \"totalSubmission\": \"42.3K\", \"totalAcceptedRaw\": 33006, \"totalSubmissionRaw\": 42325, \"acRate\": \"78.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1713","questionFrontendId":"1570","title":"Dot Product of Two Sparse Vectors","titleSlug":"dot-product-of-two-sparse-vectors","translatedTitle":null,"stats":"{\"totalAccepted\": \"183K\", \"totalSubmission\": \"202.6K\", \"totalAcceptedRaw\": 183016, \"totalSubmissionRaw\": 202582, \"acRate\": \"90.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1716","questionFrontendId":"1594","title":"Maximum Non Negative Product in a Matrix","titleSlug":"maximum-non-negative-product-in-a-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.2K\", \"totalSubmission\": \"61.1K\", \"totalAcceptedRaw\": 20234, \"totalSubmissionRaw\": 61119, \"acRate\": \"33.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1717","questionFrontendId":"1595","title":"Minimum Cost to Connect Two Groups of Points","titleSlug":"minimum-cost-to-connect-two-groups-of-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.2K\", \"totalSubmission\": \"15.5K\", \"totalAcceptedRaw\": 7189, \"totalSubmissionRaw\": 15474, \"acRate\": \"46.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1719","questionFrontendId":"1580","title":"Put Boxes Into the Warehouse II","titleSlug":"put-boxes-into-the-warehouse-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.9K\", \"totalSubmission\": \"6.1K\", \"totalAcceptedRaw\": 3901, \"totalSubmissionRaw\": 6120, \"acRate\": \"63.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1720","questionFrontendId":"1598","title":"Crawler Log Folder","titleSlug":"crawler-log-folder","translatedTitle":null,"stats":"{\"totalAccepted\": \"57.6K\", \"totalSubmission\": \"89.3K\", \"totalAcceptedRaw\": 57590, \"totalSubmissionRaw\": 89268, \"acRate\": \"64.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1721","questionFrontendId":"1599","title":"Maximum Profit of Operating a Centennial Wheel","titleSlug":"maximum-profit-of-operating-a-centennial-wheel","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.8K\", \"totalSubmission\": \"24.7K\", \"totalAcceptedRaw\": 10828, \"totalSubmissionRaw\": 24738, \"acRate\": \"43.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1723","questionFrontendId":"1601","title":"Maximum Number of Achievable Transfer Requests","titleSlug":"maximum-number-of-achievable-transfer-requests","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"17.9K\", \"totalAcceptedRaw\": 9170, \"totalSubmissionRaw\": 17924, \"acRate\": \"51.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1726","questionFrontendId":"1620","title":"Coordinate With Maximum Network Quality","titleSlug":"coordinate-with-maximum-network-quality","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.4K\", \"totalSubmission\": \"19.7K\", \"totalAcceptedRaw\": 7409, \"totalSubmissionRaw\": 19670, \"acRate\": \"37.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1727","questionFrontendId":"1728","title":"Cat and Mouse II","titleSlug":"cat-and-mouse-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"14.3K\", \"totalAcceptedRaw\": 5730, \"totalSubmissionRaw\": 14349, \"acRate\": \"39.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1730","questionFrontendId":"1608","title":"Special Array With X Elements Greater Than or Equal X","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.5K\", \"totalSubmission\": \"105.1K\", \"totalAcceptedRaw\": 63520, \"totalSubmissionRaw\": 105100, \"acRate\": \"60.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1733","questionFrontendId":"1610","title":"Maximum Number of Visible Points","titleSlug":"maximum-number-of-visible-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"36K\", \"totalSubmission\": \"96.4K\", \"totalAcceptedRaw\": 35953, \"totalSubmissionRaw\": 96401, \"acRate\": \"37.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1741","questionFrontendId":"1636","title":"Sort Array by Increasing Frequency","titleSlug":"sort-array-by-increasing-frequency","translatedTitle":null,"stats":"{\"totalAccepted\": \"91.4K\", \"totalSubmission\": \"131.6K\", \"totalAcceptedRaw\": 91396, \"totalSubmissionRaw\": 131557, \"acRate\": \"69.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1742","questionFrontendId":"1637","title":"Widest Vertical Area Between Two Points Containing No Points","titleSlug":"widest-vertical-area-between-two-points-containing-no-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.2K\", \"totalSubmission\": \"45.3K\", \"totalAcceptedRaw\": 38243, \"totalSubmissionRaw\": 45342, \"acRate\": \"84.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1744","questionFrontendId":"1639","title":"Number of Ways to Form a Target String Given a Dictionary","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.4K\", \"totalSubmission\": \"24.1K\", \"totalAcceptedRaw\": 10410, \"totalSubmissionRaw\": 24079, \"acRate\": \"43.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1748","questionFrontendId":"1626","title":"Best Team With No Conflicts","titleSlug":"best-team-with-no-conflicts","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.1K\", \"totalSubmission\": \"137.1K\", \"totalAcceptedRaw\": 70104, \"totalSubmissionRaw\": 137060, \"acRate\": \"51.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1751","questionFrontendId":"1629","title":"Slowest Key","titleSlug":"slowest-key","translatedTitle":null,"stats":"{\"totalAccepted\": \"87.9K\", \"totalSubmission\": \"148.5K\", \"totalAcceptedRaw\": 87901, \"totalSubmissionRaw\": 148484, \"acRate\": \"59.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1752","questionFrontendId":"1630","title":"Arithmetic Subarrays","titleSlug":"arithmetic-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.7K\", \"totalSubmission\": \"60.6K\", \"totalAcceptedRaw\": 48685, \"totalSubmissionRaw\": 60630, \"acRate\": \"80.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1753","questionFrontendId":"1631","title":"Path With Minimum Effort","titleSlug":"path-with-minimum-effort","translatedTitle":null,"stats":"{\"totalAccepted\": \"140.9K\", \"totalSubmission\": \"253.4K\", \"totalAcceptedRaw\": 140915, \"totalSubmissionRaw\": 253403, \"acRate\": \"55.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1755","questionFrontendId":"1652","title":"Defuse the Bomb","titleSlug":"defuse-the-bomb","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.3K\", \"totalSubmission\": \"48.7K\", \"totalAcceptedRaw\": 30274, \"totalSubmissionRaw\": 48673, \"acRate\": \"62.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1757","questionFrontendId":"1654","title":"Minimum Jumps to Reach Home","titleSlug":"minimum-jumps-to-reach-home","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.6K\", \"totalSubmission\": \"119.2K\", \"totalAcceptedRaw\": 34578, \"totalSubmissionRaw\": 119164, \"acRate\": \"29.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1758","questionFrontendId":"1655","title":"Distribute Repeating Integers","titleSlug":"distribute-repeating-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.2K\", \"totalSubmission\": \"26.1K\", \"totalAcceptedRaw\": 10163, \"totalSubmissionRaw\": 26134, \"acRate\": \"38.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1760","questionFrontendId":"1640","title":"Check Array Formation Through Concatenation","titleSlug":"check-array-formation-through-concatenation","translatedTitle":null,"stats":"{\"totalAccepted\": \"74K\", \"totalSubmission\": \"131.6K\", \"totalAcceptedRaw\": 73987, \"totalSubmissionRaw\": 131593, \"acRate\": \"56.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1762","questionFrontendId":"1642","title":"Furthest Building You Can Reach","titleSlug":"furthest-building-you-can-reach","translatedTitle":null,"stats":"{\"totalAccepted\": \"112.4K\", \"totalSubmission\": \"232.7K\", \"totalAcceptedRaw\": 112383, \"totalSubmissionRaw\": 232653, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1766","questionFrontendId":"1671","title":"Minimum Number of Removals to Make Mountain Array","titleSlug":"minimum-number-of-removals-to-make-mountain-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.7K\", \"totalSubmission\": \"48.7K\", \"totalAcceptedRaw\": 20674, \"totalSubmissionRaw\": 48695, \"acRate\": \"42.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1767","questionFrontendId":"1670","title":"Design Front Middle Back Queue","titleSlug":"design-front-middle-back-queue","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.5K\", \"totalSubmission\": \"35.9K\", \"totalAcceptedRaw\": 20547, \"totalSubmissionRaw\": 35853, \"acRate\": \"57.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1769","questionFrontendId":"1646","title":"Get Maximum in Generated Array","titleSlug":"get-maximum-in-generated-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"84.1K\", \"totalSubmission\": \"167.6K\", \"totalAcceptedRaw\": 84069, \"totalSubmissionRaw\": 167598, \"acRate\": \"50.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1771","questionFrontendId":"1648","title":"Sell Diminishing-Valued Colored Balls","titleSlug":"sell-diminishing-valued-colored-balls","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.5K\", \"totalSubmission\": \"113.5K\", \"totalAcceptedRaw\": 34526, \"totalSubmissionRaw\": 113477, \"acRate\": \"30.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1772","questionFrontendId":"1649","title":"Create Sorted Array through Instructions","titleSlug":"create-sorted-array-through-instructions","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"59.6K\", \"totalAcceptedRaw\": 22274, \"totalSubmissionRaw\": 59648, \"acRate\": \"37.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1775","questionFrontendId":"1656","title":"Design an Ordered Stream","titleSlug":"design-an-ordered-stream","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.4K\", \"totalSubmission\": \"76.7K\", \"totalAcceptedRaw\": 65427, \"totalSubmissionRaw\": 76735, \"acRate\": \"85.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1776","questionFrontendId":"1658","title":"Minimum Operations to Reduce X to Zero","titleSlug":"minimum-operations-to-reduce-x-to-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"109K\", \"totalSubmission\": \"289.9K\", \"totalAcceptedRaw\": 109032, \"totalSubmissionRaw\": 289890, \"acRate\": \"37.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1781","questionFrontendId":"1662","title":"Check If Two String Arrays are Equivalent","titleSlug":"check-if-two-string-arrays-are-equivalent","translatedTitle":null,"stats":"{\"totalAccepted\": \"264.7K\", \"totalSubmission\": \"317.2K\", \"totalAcceptedRaw\": 264700, \"totalSubmissionRaw\": 317231, \"acRate\": \"83.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1783","questionFrontendId":"1664","title":"Ways to Make a Fair Array","titleSlug":"ways-to-make-a-fair-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.1K\", \"totalSubmission\": \"47.4K\", \"totalAcceptedRaw\": 30068, \"totalSubmissionRaw\": 47371, \"acRate\": \"63.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1784","questionFrontendId":"1665","title":"Minimum Initial Energy to Finish Tasks","titleSlug":"minimum-initial-energy-to-finish-tasks","translatedTitle":null,"stats":"{\"totalAccepted\": \"14K\", \"totalSubmission\": \"24.9K\", \"totalAcceptedRaw\": 14037, \"totalSubmissionRaw\": 24933, \"acRate\": \"56.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1786","questionFrontendId":"1684","title":"Count the Number of Consistent Strings","titleSlug":"count-the-number-of-consistent-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.2K\", \"totalSubmission\": \"151.1K\", \"totalAcceptedRaw\": 124227, \"totalSubmissionRaw\": 151147, \"acRate\": \"82.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1787","questionFrontendId":"1685","title":"Sum of Absolute Differences in a Sorted Array","titleSlug":"sum-of-absolute-differences-in-a-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.6K\", \"totalSubmission\": \"41.7K\", \"totalAcceptedRaw\": 26573, \"totalSubmissionRaw\": 41680, \"acRate\": \"63.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1788","questionFrontendId":"1686","title":"Stone Game VI","titleSlug":"stone-game-vi","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"25.9K\", \"totalAcceptedRaw\": 14167, \"totalSubmissionRaw\": 25862, \"acRate\": \"54.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1789","questionFrontendId":"1687","title":"Delivering Boxes from Storage to Ports","titleSlug":"delivering-boxes-from-storage-to-ports","translatedTitle":null,"stats":"{\"totalAccepted\": \"5K\", \"totalSubmission\": \"12.8K\", \"totalAcceptedRaw\": 4956, \"totalSubmissionRaw\": 12791, \"acRate\": \"38.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1791","questionFrontendId":"1672","title":"Richest Customer Wealth","titleSlug":"richest-customer-wealth","translatedTitle":null,"stats":"{\"totalAccepted\": \"557.7K\", \"totalSubmission\": \"634.4K\", \"totalAcceptedRaw\": 557725, \"totalSubmissionRaw\": 634437, \"acRate\": \"87.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1792","questionFrontendId":"1673","title":"Find the Most Competitive Subsequence","titleSlug":"find-the-most-competitive-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.1K\", \"totalSubmission\": \"103.7K\", \"totalAcceptedRaw\": 51074, \"totalSubmissionRaw\": 103688, \"acRate\": \"49.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1793","questionFrontendId":"1674","title":"Minimum Moves to Make Array Complementary","titleSlug":"minimum-moves-to-make-array-complementary","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.3K\", \"totalSubmission\": \"18.9K\", \"totalAcceptedRaw\": 7305, \"totalSubmissionRaw\": 18936, \"acRate\": \"38.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1794","questionFrontendId":"1675","title":"Minimize Deviation in Array","titleSlug":"minimize-deviation-in-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"87.5K\", \"totalSubmission\": \"159.9K\", \"totalAcceptedRaw\": 87512, \"totalSubmissionRaw\": 159879, \"acRate\": \"54.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1798","questionFrontendId":"1679","title":"Max Number of K-Sum Pairs","titleSlug":"max-number-of-k-sum-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"121.5K\", \"totalSubmission\": \"212.1K\", \"totalAcceptedRaw\": 121487, \"totalSubmissionRaw\": 212103, \"acRate\": \"57.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1799","questionFrontendId":"1681","title":"Minimum Incompatibility","titleSlug":"minimum-incompatibility","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.7K\", \"totalSubmission\": \"18K\", \"totalAcceptedRaw\": 6735, \"totalSubmissionRaw\": 18002, \"acRate\": \"37.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1802","questionFrontendId":"1700","title":"Number of Students Unable to Eat Lunch","titleSlug":"number-of-students-unable-to-eat-lunch","translatedTitle":null,"stats":"{\"totalAccepted\": \"61K\", \"totalSubmission\": \"88.8K\", \"totalAcceptedRaw\": 60960, \"totalSubmissionRaw\": 88845, \"acRate\": \"68.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1803","questionFrontendId":"1701","title":"Average Waiting Time","titleSlug":"average-waiting-time","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.7K\", \"totalSubmission\": \"37.8K\", \"totalAcceptedRaw\": 23693, \"totalSubmissionRaw\": 37847, \"acRate\": \"62.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1805","questionFrontendId":"1703","title":"Minimum Adjacent Swaps for K Consecutive Ones","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.2K\", \"totalSubmission\": \"19.4K\", \"totalAcceptedRaw\": 8208, \"totalSubmissionRaw\": 19402, \"acRate\": \"42.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1808","questionFrontendId":"1690","title":"Stone Game VII","titleSlug":"stone-game-vii","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.1K\", \"totalSubmission\": \"51.7K\", \"totalAcceptedRaw\": 30081, \"totalSubmissionRaw\": 51720, \"acRate\": \"58.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1809","questionFrontendId":"1714","title":"Sum Of Special Evenly-Spaced Elements In Array","titleSlug":"sum-of-special-evenly-spaced-elements-in-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1K\", \"totalSubmission\": \"2.3K\", \"totalAcceptedRaw\": 1128, \"totalSubmissionRaw\": 2298, \"acRate\": \"49.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1813","questionFrontendId":"1695","title":"Maximum Erasure Value","titleSlug":"maximum-erasure-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"107.8K\", \"totalSubmission\": \"187.3K\", \"totalAcceptedRaw\": 107766, \"totalSubmissionRaw\": 187253, \"acRate\": \"57.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1814","questionFrontendId":"1696","title":"Jump Game VI","titleSlug":"jump-game-vi","translatedTitle":null,"stats":"{\"totalAccepted\": \"97.4K\", \"totalSubmission\": \"211.4K\", \"totalAcceptedRaw\": 97397, \"totalSubmissionRaw\": 211365, \"acRate\": \"46.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1815","questionFrontendId":"1697","title":"Checking Existence of Edge Length Limited Paths","titleSlug":"checking-existence-of-edge-length-limited-paths","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.4K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 12436, \"totalSubmissionRaw\": 24505, \"acRate\": \"50.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1819","questionFrontendId":"1718","title":"Construct the Lexicographically Largest Valid Sequence","titleSlug":"construct-the-lexicographically-largest-valid-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"20.3K\", \"totalAcceptedRaw\": 10563, \"totalSubmissionRaw\": 20333, \"acRate\": \"52.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1824","questionFrontendId":"1705","title":"Maximum Number of Eaten Apples","titleSlug":"maximum-number-of-eaten-apples","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.8K\", \"totalSubmission\": \"49.4K\", \"totalAcceptedRaw\": 18773, \"totalSubmissionRaw\": 49429, \"acRate\": \"38.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1825","questionFrontendId":"1723","title":"Find Minimum Time to Finish All Jobs","titleSlug":"find-minimum-time-to-finish-all-jobs","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.3K\", \"totalSubmission\": \"47.7K\", \"totalAcceptedRaw\": 20251, \"totalSubmissionRaw\": 47657, \"acRate\": \"42.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1826","questionFrontendId":"1707","title":"Maximum XOR With an Element From Array","titleSlug":"maximum-xor-with-an-element-from-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.6K\", \"totalSubmission\": \"30.4K\", \"totalAcceptedRaw\": 13607, \"totalSubmissionRaw\": 30384, \"acRate\": \"44.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1829","questionFrontendId":"1710","title":"Maximum Units on a Truck","titleSlug":"maximum-units-on-a-truck","translatedTitle":null,"stats":"{\"totalAccepted\": \"261.9K\", \"totalSubmission\": \"354.9K\", \"totalAcceptedRaw\": 261930, \"totalSubmissionRaw\": 354850, \"acRate\": \"73.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1830","questionFrontendId":"1711","title":"Count Good Meals","titleSlug":"count-good-meals","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.7K\", \"totalSubmission\": \"108.3K\", \"totalAcceptedRaw\": 31666, \"totalSubmissionRaw\": 108282, \"acRate\": \"29.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1831","questionFrontendId":"1712","title":"Ways to Split Array Into Three Subarrays","titleSlug":"ways-to-split-array-into-three-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.2K\", \"totalSubmission\": \"83.1K\", \"totalAcceptedRaw\": 27156, \"totalSubmissionRaw\": 83139, \"acRate\": \"32.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1832","questionFrontendId":"1713","title":"Minimum Operations to Make a Subsequence","titleSlug":"minimum-operations-to-make-a-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"18.7K\", \"totalAcceptedRaw\": 9170, \"totalSubmissionRaw\": 18749, \"acRate\": \"48.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1833","questionFrontendId":"1732","title":"Find the Highest Altitude","titleSlug":"find-the-highest-altitude","translatedTitle":null,"stats":"{\"totalAccepted\": \"107.3K\", \"totalSubmission\": \"136.1K\", \"totalAcceptedRaw\": 107281, \"totalSubmissionRaw\": 136065, \"acRate\": \"78.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1834","questionFrontendId":"1733","title":"Minimum Number of People to Teach","titleSlug":"minimum-number-of-people-to-teach","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.4K\", \"totalSubmission\": \"17.7K\", \"totalAcceptedRaw\": 7408, \"totalSubmissionRaw\": 17670, \"acRate\": \"41.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1835","questionFrontendId":"1734","title":"Decode XORed Permutation","titleSlug":"decode-xored-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"12K\", \"totalSubmission\": \"19.1K\", \"totalAcceptedRaw\": 12013, \"totalSubmissionRaw\": 19068, \"acRate\": \"63.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1836","questionFrontendId":"1735","title":"Count Ways to Make Array With Product","titleSlug":"count-ways-to-make-array-with-product","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"8.9K\", \"totalAcceptedRaw\": 4456, \"totalSubmissionRaw\": 8862, \"acRate\": \"50.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1839","questionFrontendId":"1720","title":"Decode XORed Array","titleSlug":"decode-xored-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"107.4K\", \"totalSubmission\": \"125.2K\", \"totalAcceptedRaw\": 107417, \"totalSubmissionRaw\": 125182, \"acRate\": \"85.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1840","questionFrontendId":"1722","title":"Minimize Hamming Distance After Swap Operations","titleSlug":"minimize-hamming-distance-after-swap-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.1K\", \"totalSubmission\": \"30.9K\", \"totalAcceptedRaw\": 15076, \"totalSubmissionRaw\": 30949, \"acRate\": \"48.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1843","questionFrontendId":"1725","title":"Number Of Rectangles That Can Form The Largest Square","titleSlug":"number-of-rectangles-that-can-form-the-largest-square","translatedTitle":null,"stats":"{\"totalAccepted\": \"54.9K\", \"totalSubmission\": \"69.9K\", \"totalAcceptedRaw\": 54939, \"totalSubmissionRaw\": 69862, \"acRate\": \"78.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1845","questionFrontendId":"1727","title":"Largest Submatrix With Rearrangements","titleSlug":"largest-submatrix-with-rearrangements","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.9K\", \"totalSubmission\": \"24.3K\", \"totalAcceptedRaw\": 14854, \"totalSubmissionRaw\": 24260, \"acRate\": \"61.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1847","questionFrontendId":"1708","title":"Largest Subarray Length K","titleSlug":"largest-subarray-length-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.1K\", \"totalSubmission\": \"11.1K\", \"totalAcceptedRaw\": 7078, \"totalSubmissionRaw\": 11074, \"acRate\": \"63.9%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1848","questionFrontendId":"1748","title":"Sum of Unique Elements","titleSlug":"sum-of-unique-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"111.1K\", \"totalSubmission\": \"145.7K\", \"totalAcceptedRaw\": 111059, \"totalSubmissionRaw\": 145702, \"acRate\": \"76.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1849","questionFrontendId":"1749","title":"Maximum Absolute Sum of Any Subarray","titleSlug":"maximum-absolute-sum-of-any-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.2K\", \"totalSubmission\": \"51.6K\", \"totalAcceptedRaw\": 30175, \"totalSubmissionRaw\": 51647, \"acRate\": \"58.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1851","questionFrontendId":"1751","title":"Maximum Number of Events That Can Be Attended II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"21K\", \"totalSubmission\": \"36.9K\", \"totalAcceptedRaw\": 20983, \"totalSubmissionRaw\": 36900, \"acRate\": \"56.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1860","questionFrontendId":"1738","title":"Find Kth Largest XOR Coordinate Value","titleSlug":"find-kth-largest-xor-coordinate-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.3K\", \"totalSubmission\": \"29.9K\", \"totalAcceptedRaw\": 18263, \"totalSubmissionRaw\": 29935, \"acRate\": \"61.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Quickselect","translatedName":null,"slug":"quickselect","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1866","questionFrontendId":"1743","title":"Restore the Array From Adjacent Pairs","titleSlug":"restore-the-array-from-adjacent-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.1K\", \"totalSubmission\": \"49.7K\", \"totalAcceptedRaw\": 34086, \"totalSubmissionRaw\": 49712, \"acRate\": \"68.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1872","questionFrontendId":"1744","title":"Can You Eat Your Favorite Candy on Your Favorite Day?","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day","translatedTitle":null,"stats":"{\"totalAccepted\": \"9K\", \"totalSubmission\": \"27.2K\", \"totalAcceptedRaw\": 8962, \"totalSubmissionRaw\": 27154, \"acRate\": \"33.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1874","questionFrontendId":"1764","title":"Form Array by Concatenating Subarrays of Another Array","titleSlug":"form-array-by-concatenating-subarrays-of-another-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.5K\", \"totalSubmission\": \"23.7K\", \"totalAcceptedRaw\": 12542, \"totalSubmissionRaw\": 23701, \"acRate\": \"52.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1876","questionFrontendId":"1765","title":"Map of Highest Peak","titleSlug":"map-of-highest-peak","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.5K\", \"totalSubmission\": \"34.1K\", \"totalAcceptedRaw\": 20501, \"totalSubmissionRaw\": 34060, \"acRate\": \"60.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1878","questionFrontendId":"1752","title":"Check if Array Is Sorted and Rotated","titleSlug":"check-if-array-is-sorted-and-rotated","translatedTitle":null,"stats":"{\"totalAccepted\": \"80.5K\", \"totalSubmission\": \"160.8K\", \"totalAcceptedRaw\": 80452, \"totalSubmissionRaw\": 160799, \"acRate\": \"50.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1881","questionFrontendId":"1755","title":"Closest Subsequence Sum","titleSlug":"closest-subsequence-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"32K\", \"totalAcceptedRaw\": 11748, \"totalSubmissionRaw\": 32027, \"acRate\": \"36.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1886","questionFrontendId":"1760","title":"Minimum Limit of Balls in a Bag","titleSlug":"minimum-limit-of-balls-in-a-bag","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.8K\", \"totalSubmission\": \"49.3K\", \"totalAcceptedRaw\": 29786, \"totalSubmissionRaw\": 49340, \"acRate\": \"60.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1888","questionFrontendId":"1779","title":"Find Nearest Point That Has the Same X or Y Coordinate","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate","translatedTitle":null,"stats":"{\"totalAccepted\": \"93.3K\", \"totalSubmission\": \"138.6K\", \"totalAcceptedRaw\": 93263, \"totalSubmissionRaw\": 138570, \"acRate\": \"67.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1893","questionFrontendId":"1746","title":"Maximum Subarray Sum After One Operation","titleSlug":"maximum-subarray-sum-after-one-operation","translatedTitle":null,"stats":"{\"totalAccepted\": \"8K\", \"totalSubmission\": \"12.9K\", \"totalAcceptedRaw\": 8019, \"totalSubmissionRaw\": 12881, \"acRate\": \"62.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1895","questionFrontendId":"1769","title":"Minimum Number of Operations to Move All Balls to Each Box","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box","translatedTitle":null,"stats":"{\"totalAccepted\": \"98K\", \"totalSubmission\": \"115.1K\", \"totalAcceptedRaw\": 97997, \"totalSubmissionRaw\": 115095, \"acRate\": \"85.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1896","questionFrontendId":"1770","title":"Maximum Score from Performing Multiplication Operations","titleSlug":"maximum-score-from-performing-multiplication-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"91.9K\", \"totalSubmission\": \"246.1K\", \"totalAcceptedRaw\": 91931, \"totalSubmissionRaw\": 246128, \"acRate\": \"37.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1899","questionFrontendId":"1773","title":"Count Items Matching a Rule","titleSlug":"count-items-matching-a-rule","translatedTitle":null,"stats":"{\"totalAccepted\": \"150.1K\", \"totalSubmission\": \"177.9K\", \"totalAcceptedRaw\": 150142, \"totalSubmissionRaw\": 177875, \"acRate\": \"84.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1900","questionFrontendId":"1774","title":"Closest Dessert Cost","titleSlug":"closest-dessert-cost","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.5K\", \"totalSubmission\": \"51.8K\", \"totalAcceptedRaw\": 24532, \"totalSubmissionRaw\": 51757, \"acRate\": \"47.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1901","questionFrontendId":"1775","title":"Equal Sum Arrays With Minimum Number of Operations","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"45.7K\", \"totalAcceptedRaw\": 24240, \"totalSubmissionRaw\": 45709, \"acRate\": \"53.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1902","questionFrontendId":"1776","title":"Car Fleet II","titleSlug":"car-fleet-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.6K\", \"totalSubmission\": \"40.3K\", \"totalAcceptedRaw\": 21564, \"totalSubmissionRaw\": 40305, \"acRate\": \"53.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1903","questionFrontendId":"1756","title":"Design Most Recently Used Queue","titleSlug":"design-most-recently-used-queue","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.9K\", \"totalSubmission\": \"11.3K\", \"totalAcceptedRaw\": 8907, \"totalSubmissionRaw\": 11346, \"acRate\": \"78.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1906","questionFrontendId":"1799","title":"Maximize Score After N Operations","titleSlug":"maximize-score-after-n-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.9K\", \"totalSubmission\": \"34.5K\", \"totalAcceptedRaw\": 15865, \"totalSubmissionRaw\": 34490, \"acRate\": \"46.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1907","questionFrontendId":"1803","title":"Count Pairs With XOR in a Range","titleSlug":"count-pairs-with-xor-in-a-range","translatedTitle":null,"stats":"{\"totalAccepted\": \"6K\", \"totalSubmission\": \"12.7K\", \"totalAcceptedRaw\": 5970, \"totalSubmissionRaw\": 12705, \"acRate\": \"47.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1909","questionFrontendId":"1762","title":"Buildings With an Ocean View","titleSlug":"buildings-with-an-ocean-view","translatedTitle":null,"stats":"{\"totalAccepted\": \"139.8K\", \"totalSubmission\": \"176.7K\", \"totalAcceptedRaw\": 139780, \"totalSubmissionRaw\": 176738, \"acRate\": \"79.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1911","questionFrontendId":"1785","title":"Minimum Elements to Add to Form a Given Sum","titleSlug":"minimum-elements-to-add-to-form-a-given-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.4K\", \"totalSubmission\": \"40.8K\", \"totalAcceptedRaw\": 17374, \"totalSubmissionRaw\": 40781, \"acRate\": \"42.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1913","questionFrontendId":"1787","title":"Make the XOR of All Segments Equal to Zero","titleSlug":"make-the-xor-of-all-segments-equal-to-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"11K\", \"totalAcceptedRaw\": 4345, \"totalSubmissionRaw\": 11026, \"acRate\": \"39.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1917","questionFrontendId":"1792","title":"Maximum Average Pass Ratio","titleSlug":"maximum-average-pass-ratio","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.7K\", \"totalSubmission\": \"35.8K\", \"totalAcceptedRaw\": 18718, \"totalSubmissionRaw\": 35767, \"acRate\": \"52.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1918","questionFrontendId":"1793","title":"Maximum Score of a Good Subarray","titleSlug":"maximum-score-of-a-good-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.4K\", \"totalSubmission\": \"36.3K\", \"totalAcceptedRaw\": 19408, \"totalSubmissionRaw\": 36265, \"acRate\": \"53.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1919","questionFrontendId":"1772","title":"Sort Features by Popularity","titleSlug":"sort-features-by-popularity","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.9K\", \"totalSubmission\": \"7.5K\", \"totalAcceptedRaw\": 4874, \"totalSubmissionRaw\": 7485, \"acRate\": \"65.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1923","questionFrontendId":"1813","title":"Sentence Similarity III","titleSlug":"sentence-similarity-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"13K\", \"totalSubmission\": \"38.9K\", \"totalAcceptedRaw\": 12959, \"totalSubmissionRaw\": 38912, \"acRate\": \"33.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1924","questionFrontendId":"1815","title":"Maximum Number of Groups Getting Fresh Donuts","titleSlug":"maximum-number-of-groups-getting-fresh-donuts","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"13.4K\", \"totalAcceptedRaw\": 5377, \"totalSubmissionRaw\": 13425, \"acRate\": \"40.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1925","questionFrontendId":"1814","title":"Count Nice Pairs in an Array","titleSlug":"count-nice-pairs-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.8K\", \"totalSubmission\": \"56.8K\", \"totalAcceptedRaw\": 23836, \"totalSubmissionRaw\": 56790, \"acRate\": \"42.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1927","questionFrontendId":"1800","title":"Maximum Ascending Subarray Sum","titleSlug":"maximum-ascending-subarray-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"41.1K\", \"totalSubmission\": \"65.1K\", \"totalAcceptedRaw\": 41125, \"totalSubmissionRaw\": 65062, \"acRate\": \"63.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1928","questionFrontendId":"1801","title":"Number of Orders in the Backlog","titleSlug":"number-of-orders-in-the-backlog","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.9K\", \"totalSubmission\": \"32.9K\", \"totalAcceptedRaw\": 15883, \"totalSubmissionRaw\": 32922, \"acRate\": \"48.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1930","questionFrontendId":"1798","title":"Maximum Number of Consecutive Values You Can Make","titleSlug":"maximum-number-of-consecutive-values-you-can-make","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.2K\", \"totalSubmission\": \"23.8K\", \"totalAcceptedRaw\": 13229, \"totalSubmissionRaw\": 23765, \"acRate\": \"55.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1934","questionFrontendId":"1807","title":"Evaluate the Bracket Pairs of a String","titleSlug":"evaluate-the-bracket-pairs-of-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.4K\", \"totalSubmission\": \"36.6K\", \"totalAcceptedRaw\": 24367, \"totalSubmissionRaw\": 36577, \"acRate\": \"66.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1935","questionFrontendId":"1806","title":"Minimum Number of Operations to Reinitialize a Permutation","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.7K\", \"totalSubmission\": \"21.9K\", \"totalAcceptedRaw\": 15739, \"totalSubmissionRaw\": 21870, \"acRate\": \"72.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1937","questionFrontendId":"1788","title":"Maximize the Beauty of the Garden","titleSlug":"maximize-the-beauty-of-the-garden","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.8K\", \"totalSubmission\": \"2.6K\", \"totalAcceptedRaw\": 1751, \"totalSubmissionRaw\": 2629, \"acRate\": \"66.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1938","questionFrontendId":"1827","title":"Minimum Operations to Make the Array Increasing","titleSlug":"minimum-operations-to-make-the-array-increasing","translatedTitle":null,"stats":"{\"totalAccepted\": \"64.1K\", \"totalSubmission\": \"81.8K\", \"totalAcceptedRaw\": 64106, \"totalSubmissionRaw\": 81834, \"acRate\": \"78.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1939","questionFrontendId":"1828","title":"Queries on Number of Points Inside a Circle","titleSlug":"queries-on-number-of-points-inside-a-circle","translatedTitle":null,"stats":"{\"totalAccepted\": \"57.9K\", \"totalSubmission\": \"67K\", \"totalAcceptedRaw\": 57860, \"totalSubmissionRaw\": 67034, \"acRate\": \"86.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1940","questionFrontendId":"1829","title":"Maximum XOR for Each Query","titleSlug":"maximum-xor-for-each-query","translatedTitle":null,"stats":"{\"totalAccepted\": \"22K\", \"totalSubmission\": \"28.7K\", \"totalAcceptedRaw\": 22011, \"totalSubmissionRaw\": 28677, \"acRate\": \"76.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1944","questionFrontendId":"1816","title":"Truncate Sentence","titleSlug":"truncate-sentence","translatedTitle":null,"stats":"{\"totalAccepted\": \"97.8K\", \"totalSubmission\": \"117.9K\", \"totalAcceptedRaw\": 97834, \"totalSubmissionRaw\": 117944, \"acRate\": \"82.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1945","questionFrontendId":"1817","title":"Finding the Users Active Minutes","titleSlug":"finding-the-users-active-minutes","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.9K\", \"totalSubmission\": \"57.1K\", \"totalAcceptedRaw\": 45917, \"totalSubmissionRaw\": 57087, \"acRate\": \"80.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1946","questionFrontendId":"1818","title":"Minimum Absolute Sum Difference","titleSlug":"minimum-absolute-sum-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.4K\", \"totalSubmission\": \"67.1K\", \"totalAcceptedRaw\": 20353, \"totalSubmissionRaw\": 67143, \"acRate\": \"30.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1947","questionFrontendId":"1819","title":"Number of Different Subsequences GCDs","titleSlug":"number-of-different-subsequences-gcds","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.3K\", \"totalSubmission\": \"18.6K\", \"totalAcceptedRaw\": 7277, \"totalSubmissionRaw\": 18636, \"acRate\": \"39.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1950","questionFrontendId":"1822","title":"Sign of the Product of an Array","titleSlug":"sign-of-the-product-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"161.3K\", \"totalSubmission\": \"247.2K\", \"totalAcceptedRaw\": 161324, \"totalSubmissionRaw\": 247214, \"acRate\": \"65.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1951","questionFrontendId":"1823","title":"Find the Winner of the Circular Game","titleSlug":"find-the-winner-of-the-circular-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"86.6K\", \"totalSubmission\": \"110.8K\", \"totalAcceptedRaw\": 86641, \"totalSubmissionRaw\": 110755, \"acRate\": \"78.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1952","questionFrontendId":"1824","title":"Minimum Sideway Jumps","titleSlug":"minimum-sideway-jumps","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.3K\", \"totalSubmission\": \"53.3K\", \"totalAcceptedRaw\": 26347, \"totalSubmissionRaw\": 53309, \"acRate\": \"49.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1956","questionFrontendId":"1846","title":"Maximum Element After Decreasing and Rearranging","titleSlug":"maximum-element-after-decreasing-and-rearranging","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.9K\", \"totalSubmission\": \"32K\", \"totalAcceptedRaw\": 18863, \"totalSubmissionRaw\": 32036, \"acRate\": \"58.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1957","questionFrontendId":"1847","title":"Closest Room","titleSlug":"closest-room","translatedTitle":null,"stats":"{\"totalAccepted\": \"7K\", \"totalSubmission\": \"19.7K\", \"totalAcceptedRaw\": 7004, \"totalSubmissionRaw\": 19690, \"acRate\": \"35.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1961","questionFrontendId":"1833","title":"Maximum Ice Cream Bars","titleSlug":"maximum-ice-cream-bars","translatedTitle":null,"stats":"{\"totalAccepted\": \"137.8K\", \"totalSubmission\": \"186.2K\", \"totalAcceptedRaw\": 137810, \"totalSubmissionRaw\": 186235, \"acRate\": \"74.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1962","questionFrontendId":"1834","title":"Single-Threaded CPU","titleSlug":"single-threaded-cpu","translatedTitle":null,"stats":"{\"totalAccepted\": \"86.3K\", \"totalSubmission\": \"188.5K\", \"totalAcceptedRaw\": 86272, \"totalSubmissionRaw\": 188526, \"acRate\": \"45.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1963","questionFrontendId":"1835","title":"Find XOR Sum of All Pairs Bitwise AND","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.7K\", \"totalSubmission\": \"24.1K\", \"totalAcceptedRaw\": 14652, \"totalSubmissionRaw\": 24115, \"acRate\": \"60.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1966","questionFrontendId":"1838","title":"Frequency of the Most Frequent Element","titleSlug":"frequency-of-the-most-frequent-element","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.9K\", \"totalSubmission\": \"101.8K\", \"totalAcceptedRaw\": 39940, \"totalSubmissionRaw\": 101833, \"acRate\": \"39.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1968","questionFrontendId":"1840","title":"Maximum Building Height","titleSlug":"maximum-building-height","translatedTitle":null,"stats":"{\"totalAccepted\": \"6K\", \"totalSubmission\": \"17K\", \"totalAcceptedRaw\": 6033, \"totalSubmissionRaw\": 16999, \"acRate\": \"35.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1969","questionFrontendId":"1820","title":"Maximum Number of Accepted Invitations","titleSlug":"maximum-number-of-accepted-invitations","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.2K\", \"totalSubmission\": \"10.6K\", \"totalAcceptedRaw\": 5234, \"totalSubmissionRaw\": 10568, \"acRate\": \"49.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1972","questionFrontendId":"1861","title":"Rotating the Box","titleSlug":"rotating-the-box","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.7K\", \"totalSubmission\": \"60.8K\", \"totalAcceptedRaw\": 39719, \"totalSubmissionRaw\": 60837, \"acRate\": \"65.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1975","questionFrontendId":"1848","title":"Minimum Distance to the Target Element","titleSlug":"minimum-distance-to-the-target-element","translatedTitle":null,"stats":"{\"totalAccepted\": \"33K\", \"totalSubmission\": \"57K\", \"totalAcceptedRaw\": 33012, \"totalSubmissionRaw\": 57029, \"acRate\": \"57.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1977","questionFrontendId":"1851","title":"Minimum Interval to Include Each Query","titleSlug":"minimum-interval-to-include-each-query","translatedTitle":null,"stats":"{\"totalAccepted\": \"16K\", \"totalSubmission\": \"33.2K\", \"totalAcceptedRaw\": 16003, \"totalSubmissionRaw\": 33222, \"acRate\": \"48.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Line Sweep","translatedName":null,"slug":"line-sweep","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1979","questionFrontendId":"1989","title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6K\", \"totalSubmission\": \"3.1K\", \"totalAcceptedRaw\": 1629, \"totalSubmissionRaw\": 3116, \"acRate\": \"52.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1980","questionFrontendId":"1826","title":"Faulty Sensor","titleSlug":"faulty-sensor","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"7.1K\", \"totalAcceptedRaw\": 3519, \"totalSubmissionRaw\": 7073, \"acRate\": \"49.8%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1983","questionFrontendId":"1854","title":"Maximum Population Year","titleSlug":"maximum-population-year","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.9K\", \"totalSubmission\": \"78K\", \"totalAcceptedRaw\": 46851, \"totalSubmissionRaw\": 78045, \"acRate\": \"60.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1984","questionFrontendId":"1855","title":"Maximum Distance Between a Pair of Values","titleSlug":"maximum-distance-between-a-pair-of-values","translatedTitle":null,"stats":"{\"totalAccepted\": \"40K\", \"totalSubmission\": \"75.3K\", \"totalAcceptedRaw\": 39958, \"totalSubmissionRaw\": 75265, \"acRate\": \"53.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1985","questionFrontendId":"1856","title":"Maximum Subarray Min-Product","titleSlug":"maximum-subarray-min-product","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.4K\", \"totalSubmission\": \"53.9K\", \"totalAcceptedRaw\": 20390, \"totalSubmissionRaw\": 53863, \"acRate\": \"37.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1988","questionFrontendId":"1877","title":"Minimize Maximum Pair Sum in Array","titleSlug":"minimize-maximum-pair-sum-in-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"70K\", \"totalSubmission\": \"87.6K\", \"totalAcceptedRaw\": 69969, \"totalSubmissionRaw\": 87552, \"acRate\": \"79.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1989","questionFrontendId":"1879","title":"Minimum XOR Sum of Two Arrays","titleSlug":"minimum-xor-sum-of-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.4K\", \"totalSubmission\": \"23.1K\", \"totalAcceptedRaw\": 10396, \"totalSubmissionRaw\": 23089, \"acRate\": \"45.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1990","questionFrontendId":"1878","title":"Get Biggest Three Rhombus Sums in a Grid","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.4K\", \"totalSubmission\": \"26.3K\", \"totalAcceptedRaw\": 12381, \"totalSubmissionRaw\": 26283, \"acRate\": \"47.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1993","questionFrontendId":"1863","title":"Sum of All Subset XOR Totals","titleSlug":"sum-of-all-subset-xor-totals","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.4K\", \"totalSubmission\": \"64.4K\", \"totalAcceptedRaw\": 51448, \"totalSubmissionRaw\": 64365, \"acRate\": \"79.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1995","questionFrontendId":"1865","title":"Finding Pairs With a Certain Sum","titleSlug":"finding-pairs-with-a-certain-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.1K\", \"totalSubmission\": \"39.9K\", \"totalAcceptedRaw\": 20067, \"totalSubmissionRaw\": 39874, \"acRate\": \"50.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2000","questionFrontendId":"1870","title":"Minimum Speed to Arrive on Time","titleSlug":"minimum-speed-to-arrive-on-time","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.7K\", \"totalSubmission\": \"72.1K\", \"totalAcceptedRaw\": 27667, \"totalSubmissionRaw\": 72144, \"acRate\": \"38.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2002","questionFrontendId":"1872","title":"Stone Game VIII","titleSlug":"stone-game-viii","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.2K\", \"totalSubmission\": \"13.7K\", \"totalAcceptedRaw\": 7203, \"totalSubmissionRaw\": 13677, \"acRate\": \"52.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2003","questionFrontendId":"1852","title":"Distinct Numbers in Each Subarray","titleSlug":"distinct-numbers-in-each-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"7.8K\", \"totalAcceptedRaw\": 5574, \"totalSubmissionRaw\": 7831, \"acRate\": \"71.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2005","questionFrontendId":"1893","title":"Check if All the Integers in a Range Are Covered","titleSlug":"check-if-all-the-integers-in-a-range-are-covered","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.5K\", \"totalSubmission\": \"60.4K\", \"totalAcceptedRaw\": 30488, \"totalSubmissionRaw\": 60441, \"acRate\": \"50.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2006","questionFrontendId":"1894","title":"Find the Student that Will Replace the Chalk","titleSlug":"find-the-student-that-will-replace-the-chalk","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.6K\", \"totalSubmission\": \"64.5K\", \"totalAcceptedRaw\": 28619, \"totalSubmissionRaw\": 64539, \"acRate\": \"44.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2012","questionFrontendId":"1882","title":"Process Tasks Using Servers","titleSlug":"process-tasks-using-servers","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.8K\", \"totalSubmission\": \"62.8K\", \"totalAcceptedRaw\": 24821, \"totalSubmissionRaw\": 62829, \"acRate\": \"39.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2013","questionFrontendId":"1883","title":"Minimum Skips to Arrive at Meeting On Time","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.5K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 5494, \"totalSubmissionRaw\": 14365, \"acRate\": \"38.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2015","questionFrontendId":"1886","title":"Determine Whether Matrix Can Be Obtained By Rotation","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.1K\", \"totalSubmission\": \"91.6K\", \"totalAcceptedRaw\": 51114, \"totalSubmissionRaw\": 91610, \"acRate\": \"55.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2016","questionFrontendId":"1887","title":"Reduction Operations to Make the Array Elements Equal","titleSlug":"reduction-operations-to-make-the-array-elements-equal","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.9K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 20864, \"totalSubmissionRaw\": 33405, \"acRate\": \"62.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2018","questionFrontendId":"1889","title":"Minimum Space Wasted From Packaging","titleSlug":"minimum-space-wasted-from-packaging","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.2K\", \"totalSubmission\": \"32.6K\", \"totalAcceptedRaw\": 10157, \"totalSubmissionRaw\": 32556, \"acRate\": \"31.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2019","questionFrontendId":"1868","title":"Product of Two Run-Length Encoded Arrays","titleSlug":"product-of-two-run-length-encoded-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.6K\", \"totalSubmission\": \"44.4K\", \"totalAcceptedRaw\": 25641, \"totalSubmissionRaw\": 44414, \"acRate\": \"57.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2020","questionFrontendId":"1909","title":"Remove One Element to Make the Array Strictly Increasing","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.2K\", \"totalSubmission\": \"170K\", \"totalAcceptedRaw\": 44207, \"totalSubmissionRaw\": 169970, \"acRate\": \"26.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2022","questionFrontendId":"1911","title":"Maximum Alternating Subsequence Sum","titleSlug":"maximum-alternating-subsequence-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.8K\", \"totalSubmission\": \"40.1K\", \"totalAcceptedRaw\": 23763, \"totalSubmissionRaw\": 40089, \"acRate\": \"59.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2023","questionFrontendId":"1912","title":"Design Movie Rental System","titleSlug":"design-movie-rental-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.9K\", \"totalSubmission\": \"12.3K\", \"totalAcceptedRaw\": 4897, \"totalSubmissionRaw\": 12270, \"acRate\": \"39.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2026","questionFrontendId":"1899","title":"Merge Triplets to Form Target Triplet","titleSlug":"merge-triplets-to-form-target-triplet","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.7K\", \"totalSubmission\": \"44.5K\", \"totalAcceptedRaw\": 28720, \"totalSubmissionRaw\": 44457, \"acRate\": \"64.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2027","questionFrontendId":"1898","title":"Maximum Number of Removable Characters","titleSlug":"maximum-number-of-removable-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.1K\", \"totalSubmission\": \"52.2K\", \"totalAcceptedRaw\": 21149, \"totalSubmissionRaw\": 52215, \"acRate\": \"40.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2029","questionFrontendId":"1874","title":"Minimize Product Sum of Two Arrays","titleSlug":"minimize-product-sum-of-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"16K\", \"totalSubmission\": \"17.7K\", \"totalAcceptedRaw\": 15987, \"totalSubmissionRaw\": 17747, \"acRate\": \"90.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2034","questionFrontendId":"1906","title":"Minimum Absolute Difference Queries","titleSlug":"minimum-absolute-difference-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.4K\", \"totalSubmission\": \"21.3K\", \"totalAcceptedRaw\": 9354, \"totalSubmissionRaw\": 21321, \"acRate\": \"43.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2035","questionFrontendId":"1905","title":"Count Sub Islands","titleSlug":"count-sub-islands","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.8K\", \"totalSubmission\": \"94.3K\", \"totalAcceptedRaw\": 63768, \"totalSubmissionRaw\": 94304, \"acRate\": \"67.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2036","questionFrontendId":"1885","title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"7.5K\", \"totalAcceptedRaw\": 4440, \"totalSubmissionRaw\": 7475, \"acRate\": \"59.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2038","questionFrontendId":"1926","title":"Nearest Exit from Entrance in Maze","titleSlug":"nearest-exit-from-entrance-in-maze","translatedTitle":null,"stats":"{\"totalAccepted\": \"76.1K\", \"totalSubmission\": \"156K\", \"totalAcceptedRaw\": 76120, \"totalSubmissionRaw\": 155994, \"acRate\": \"48.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2042","questionFrontendId":"1913","title":"Maximum Product Difference Between Two Pairs","titleSlug":"maximum-product-difference-between-two-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"80.5K\", \"totalSubmission\": \"99K\", \"totalAcceptedRaw\": 80476, \"totalSubmissionRaw\": 98993, \"acRate\": \"81.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2043","questionFrontendId":"1914","title":"Cyclically Rotating a Grid","titleSlug":"cyclically-rotating-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.8K\", \"totalSubmission\": \"22.3K\", \"totalAcceptedRaw\": 10782, \"totalSubmissionRaw\": 22300, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2045","questionFrontendId":"1891","title":"Cutting Ribbons","titleSlug":"cutting-ribbons","translatedTitle":null,"stats":"{\"totalAccepted\": \"50.6K\", \"totalSubmission\": \"104.7K\", \"totalAcceptedRaw\": 50619, \"totalSubmissionRaw\": 104746, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2047","questionFrontendId":"1901","title":"Find a Peak Element II","titleSlug":"find-a-peak-element-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.5K\", \"totalSubmission\": \"67.7K\", \"totalAcceptedRaw\": 35484, \"totalSubmissionRaw\": 67720, \"acRate\": \"52.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2048","questionFrontendId":"1920","title":"Build Array from Permutation","titleSlug":"build-array-from-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"310.9K\", \"totalSubmission\": \"344.3K\", \"totalAcceptedRaw\": 310869, \"totalSubmissionRaw\": 344301, \"acRate\": \"90.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2049","questionFrontendId":"1921","title":"Eliminate Maximum Number of Monsters","titleSlug":"eliminate-maximum-number-of-monsters","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.4K\", \"totalSubmission\": \"57.1K\", \"totalAcceptedRaw\": 21359, \"totalSubmissionRaw\": 57147, \"acRate\": \"37.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2051","questionFrontendId":"1923","title":"Longest Common Subpath","titleSlug":"longest-common-subpath","translatedTitle":null,"stats":"{\"totalAccepted\": \"6K\", \"totalSubmission\": \"21.8K\", \"totalAcceptedRaw\": 6026, \"totalSubmissionRaw\": 21801, \"acRate\": \"27.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Suffix Array","translatedName":null,"slug":"suffix-array","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2054","questionFrontendId":"1942","title":"The Number of the Smallest Unoccupied Chair","titleSlug":"the-number-of-the-smallest-unoccupied-chair","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.9K\", \"totalSubmission\": \"34.1K\", \"totalAcceptedRaw\": 13858, \"totalSubmissionRaw\": 34087, \"acRate\": \"40.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2055","questionFrontendId":"1943","title":"Describe the Painting","titleSlug":"describe-the-painting","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.9K\", \"totalSubmission\": \"20.5K\", \"totalAcceptedRaw\": 9863, \"totalSubmissionRaw\": 20455, \"acRate\": \"48.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2056","questionFrontendId":"2297","title":"Jump Game VIII","titleSlug":"jump-game-viii","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"2.5K\", \"totalAcceptedRaw\": 1423, \"totalSubmissionRaw\": 2536, \"acRate\": \"56.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2058","questionFrontendId":"1929","title":"Concatenation of Array","titleSlug":"concatenation-of-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"380.6K\", \"totalSubmission\": \"421.7K\", \"totalAcceptedRaw\": 380591, \"totalSubmissionRaw\": 421695, \"acRate\": \"90.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2062","questionFrontendId":"1908","title":"Game of Nim","titleSlug":"game-of-nim","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.8K\", \"totalSubmission\": \"6K\", \"totalAcceptedRaw\": 3849, \"totalSubmissionRaw\": 5963, \"acRate\": \"64.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2065","questionFrontendId":"2307","title":"Check for Contradictions in Equations","titleSlug":"check-for-contradictions-in-equations","translatedTitle":null,"stats":"{\"totalAccepted\": \"848\", \"totalSubmission\": \"1.9K\", \"totalAcceptedRaw\": 848, \"totalSubmissionRaw\": 1941, \"acRate\": \"43.7%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2066","questionFrontendId":"1936","title":"Add Minimum Number of Rungs","titleSlug":"add-minimum-number-of-rungs","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.7K\", \"totalSubmission\": \"53.1K\", \"totalAcceptedRaw\": 22712, \"totalSubmissionRaw\": 53142, \"acRate\": \"42.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2067","questionFrontendId":"1937","title":"Maximum Number of Points with Cost","titleSlug":"maximum-number-of-points-with-cost","translatedTitle":null,"stats":"{\"totalAccepted\": \"53.8K\", \"totalSubmission\": \"149K\", \"totalAcceptedRaw\": 53796, \"totalSubmissionRaw\": 148959, \"acRate\": \"36.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2068","questionFrontendId":"1938","title":"Maximum Genetic Difference Query","titleSlug":"maximum-genetic-difference-query","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.2K\", \"totalSubmission\": \"10.7K\", \"totalAcceptedRaw\": 4229, \"totalSubmissionRaw\": 10687, \"acRate\": \"39.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2069","questionFrontendId":"1918","title":"Kth Smallest Subarray Sum","titleSlug":"kth-smallest-subarray-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.2K\", \"totalSubmission\": \"6.1K\", \"totalAcceptedRaw\": 3216, \"totalSubmissionRaw\": 6118, \"acRate\": \"52.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2071","questionFrontendId":"1940","title":"Longest Common Subsequence Between Sorted Arrays","titleSlug":"longest-common-subsequence-between-sorted-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"5K\", \"totalSubmission\": \"6.3K\", \"totalAcceptedRaw\": 5013, \"totalSubmissionRaw\": 6341, \"acRate\": \"79.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2072","questionFrontendId":"1950","title":"Maximum of Minimum Values in All Subarrays","titleSlug":"maximum-of-minimum-values-in-all-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.4K\", \"totalSubmission\": \"4.9K\", \"totalAcceptedRaw\": 2441, \"totalSubmissionRaw\": 4897, \"acRate\": \"49.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2073","questionFrontendId":"1956","title":"Minimum Time For K Virus Variants to Spread","titleSlug":"minimum-time-for-k-virus-variants-to-spread","translatedTitle":null,"stats":"{\"totalAccepted\": \"695\", \"totalSubmission\": \"1.4K\", \"totalAcceptedRaw\": 695, \"totalSubmissionRaw\": 1448, \"acRate\": \"48.0%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2074","questionFrontendId":"1924","title":"Erect the Fence II","titleSlug":"erect-the-fence-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"558\", \"totalSubmission\": \"1.1K\", \"totalAcceptedRaw\": 558, \"totalSubmissionRaw\": 1050, \"acRate\": \"53.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2075","questionFrontendId":"2021","title":"Brightest Position on Street","titleSlug":"brightest-position-on-street","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.1K\", \"totalSubmission\": \"6.6K\", \"totalAcceptedRaw\": 4133, \"totalSubmissionRaw\": 6633, \"acRate\": \"62.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2077","questionFrontendId":"1946","title":"Largest Number After Mutating Substring","titleSlug":"largest-number-after-mutating-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"17K\", \"totalSubmission\": \"48.8K\", \"totalAcceptedRaw\": 17027, \"totalSubmissionRaw\": 48843, \"acRate\": \"34.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2078","questionFrontendId":"1947","title":"Maximum Compatibility Score Sum","titleSlug":"maximum-compatibility-score-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.1K\", \"totalSubmission\": \"31.3K\", \"totalAcceptedRaw\": 19085, \"totalSubmissionRaw\": 31295, \"acRate\": \"61.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2079","questionFrontendId":"1948","title":"Delete Duplicate Folders in System","titleSlug":"delete-duplicate-folders-in-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.1K\", \"totalSubmission\": \"12.5K\", \"totalAcceptedRaw\": 7054, \"totalSubmissionRaw\": 12452, \"acRate\": \"56.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2080","questionFrontendId":"1958","title":"Check if Move is Legal","titleSlug":"check-if-move-is-legal","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.9K\", \"totalSubmission\": \"19.7K\", \"totalAcceptedRaw\": 8920, \"totalSubmissionRaw\": 19654, \"acRate\": \"45.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2081","questionFrontendId":"1959","title":"Minimum Total Space Wasted With K Resizing Operations","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.8K\", \"totalSubmission\": \"16K\", \"totalAcceptedRaw\": 6753, \"totalSubmissionRaw\": 15957, \"acRate\": \"42.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2082","questionFrontendId":"2052","title":"Minimum Cost to Separate Sentence Into Rows","titleSlug":"minimum-cost-to-separate-sentence-into-rows","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"2.7K\", \"totalAcceptedRaw\": 1366, \"totalSubmissionRaw\": 2724, \"acRate\": \"50.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2084","questionFrontendId":"1953","title":"Maximum Number of Weeks for Which You Can Work","titleSlug":"maximum-number-of-weeks-for-which-you-can-work","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.9K\", \"totalSubmission\": \"48K\", \"totalAcceptedRaw\": 18895, \"totalSubmissionRaw\": 48001, \"acRate\": \"39.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2085","questionFrontendId":"1968","title":"Array With Elements Not Equal to Average of Neighbors","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.7K\", \"totalSubmission\": \"47.9K\", \"totalAcceptedRaw\": 23710, \"totalSubmissionRaw\": 47894, \"acRate\": \"49.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2086","questionFrontendId":"1955","title":"Count Number of Special Subsequences","titleSlug":"count-number-of-special-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"18K\", \"totalAcceptedRaw\": 9243, \"totalSubmissionRaw\": 18037, \"acRate\": \"51.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2089","questionFrontendId":"1975","title":"Maximum Matrix Sum","titleSlug":"maximum-matrix-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.6K\", \"totalSubmission\": \"30.2K\", \"totalAcceptedRaw\": 14574, \"totalSubmissionRaw\": 30191, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2093","questionFrontendId":"1961","title":"Check If String Is a Prefix of Array","titleSlug":"check-if-string-is-a-prefix-of-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.7K\", \"totalSubmission\": \"68.7K\", \"totalAcceptedRaw\": 36749, \"totalSubmissionRaw\": 68698, \"acRate\": \"53.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2094","questionFrontendId":"1962","title":"Remove Stones to Minimize the Total","titleSlug":"remove-stones-to-minimize-the-total","translatedTitle":null,"stats":"{\"totalAccepted\": \"77.6K\", \"totalSubmission\": \"129K\", \"totalAcceptedRaw\": 77605, \"totalSubmissionRaw\": 128998, \"acRate\": \"60.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2096","questionFrontendId":"1964","title":"Find the Longest Valid Obstacle Course at Each Position","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.1K\", \"totalSubmission\": \"21.4K\", \"totalAcceptedRaw\": 10122, \"totalSubmissionRaw\": 21447, \"acRate\": \"47.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2101","questionFrontendId":"1970","title":"Last Day Where You Can Still Cross","titleSlug":"last-day-where-you-can-still-cross","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.4K\", \"totalSubmission\": \"23K\", \"totalAcceptedRaw\": 11403, \"totalSubmissionRaw\": 22978, \"acRate\": \"49.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2102","questionFrontendId":"1991","title":"Find the Middle Index in Array","titleSlug":"find-the-middle-index-in-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.5K\", \"totalSubmission\": \"86.8K\", \"totalAcceptedRaw\": 58548, \"totalSubmissionRaw\": 86839, \"acRate\": \"67.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2103","questionFrontendId":"1992","title":"Find All Groups of Farmland","titleSlug":"find-all-groups-of-farmland","translatedTitle":null,"stats":"{\"totalAccepted\": \"21K\", \"totalSubmission\": \"30.6K\", \"totalAcceptedRaw\": 21032, \"totalSubmissionRaw\": 30623, \"acRate\": \"68.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2105","questionFrontendId":"1994","title":"The Number of Good Subsets","titleSlug":"the-number-of-good-subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.1K\", \"totalSubmission\": \"14.7K\", \"totalAcceptedRaw\": 5111, \"totalSubmissionRaw\": 14706, \"acRate\": \"34.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2106","questionFrontendId":"1979","title":"Find Greatest Common Divisor of Array","titleSlug":"find-greatest-common-divisor-of-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"77.7K\", \"totalSubmission\": \"100.9K\", \"totalAcceptedRaw\": 77669, \"totalSubmissionRaw\": 100940, \"acRate\": \"76.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2107","questionFrontendId":"1980","title":"Find Unique Binary String","titleSlug":"find-unique-binary-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.3K\", \"totalSubmission\": \"54.1K\", \"totalAcceptedRaw\": 35270, \"totalSubmissionRaw\": 54138, \"acRate\": \"65.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2108","questionFrontendId":"1981","title":"Minimize the Difference Between Target and Chosen Elements","titleSlug":"minimize-the-difference-between-target-and-chosen-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"20K\", \"totalSubmission\": \"61.8K\", \"totalAcceptedRaw\": 20038, \"totalSubmissionRaw\": 61839, \"acRate\": \"32.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2109","questionFrontendId":"1982","title":"Find Array Given Subset Sums","titleSlug":"find-array-given-subset-sums","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.1K\", \"totalSubmission\": \"8.6K\", \"totalAcceptedRaw\": 4148, \"totalSubmissionRaw\": 8553, \"acRate\": \"48.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2111","questionFrontendId":"1966","title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"3.4K\", \"totalAcceptedRaw\": 2218, \"totalSubmissionRaw\": 3394, \"acRate\": \"65.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2112","questionFrontendId":"1984","title":"Minimum Difference Between Highest and Lowest of K Scores","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores","translatedTitle":null,"stats":"{\"totalAccepted\": \"41.9K\", \"totalSubmission\": \"77.1K\", \"totalAcceptedRaw\": 41912, \"totalSubmissionRaw\": 77077, \"acRate\": \"54.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2113","questionFrontendId":"1985","title":"Find the Kth Largest Integer in the Array","titleSlug":"find-the-kth-largest-integer-in-the-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.8K\", \"totalSubmission\": \"100.7K\", \"totalAcceptedRaw\": 44825, \"totalSubmissionRaw\": 100665, \"acRate\": \"44.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Quickselect","translatedName":null,"slug":"quickselect","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2114","questionFrontendId":"1986","title":"Minimum Number of Work Sessions to Finish the Tasks","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.3K\", \"totalSubmission\": \"59.1K\", \"totalAcceptedRaw\": 19336, \"totalSubmissionRaw\": 59096, \"acRate\": \"32.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2116","questionFrontendId":"2006","title":"Count Number of Pairs With Absolute Difference K","titleSlug":"count-number-of-pairs-with-absolute-difference-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"90.5K\", \"totalSubmission\": \"109.5K\", \"totalAcceptedRaw\": 90547, \"totalSubmissionRaw\": 109460, \"acRate\": \"82.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2117","questionFrontendId":"2007","title":"Find Original Array From Doubled Array","titleSlug":"find-original-array-from-doubled-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"117.3K\", \"totalSubmission\": \"288.1K\", \"totalAcceptedRaw\": 117298, \"totalSubmissionRaw\": 288074, \"acRate\": \"40.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2118","questionFrontendId":"2008","title":"Maximum Earnings From Taxi","titleSlug":"maximum-earnings-from-taxi","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.1K\", \"totalSubmission\": \"48.3K\", \"totalAcceptedRaw\": 21055, \"totalSubmissionRaw\": 48338, \"acRate\": \"43.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2119","questionFrontendId":"2009","title":"Minimum Number of Operations to Make Array Continuous","titleSlug":"minimum-number-of-operations-to-make-array-continuous","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"23.2K\", \"totalAcceptedRaw\": 10579, \"totalSubmissionRaw\": 23172, \"acRate\": \"45.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2122","questionFrontendId":"1995","title":"Count Special Quadruplets","titleSlug":"count-special-quadruplets","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.9K\", \"totalSubmission\": \"50K\", \"totalAcceptedRaw\": 29903, \"totalSubmissionRaw\": 50049, \"acRate\": \"59.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2123","questionFrontendId":"1996","title":"The Number of Weak Characters in the Game","titleSlug":"the-number-of-weak-characters-in-the-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"93.5K\", \"totalSubmission\": \"212.6K\", \"totalAcceptedRaw\": 93510, \"totalSubmissionRaw\": 212637, \"acRate\": \"44.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2124","questionFrontendId":"1997","title":"First Day Where You Have Been in All the Rooms","titleSlug":"first-day-where-you-have-been-in-all-the-rooms","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.5K\", \"totalSubmission\": \"20.3K\", \"totalAcceptedRaw\": 7519, \"totalSubmissionRaw\": 20341, \"acRate\": \"37.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2125","questionFrontendId":"1998","title":"GCD Sort of an Array","titleSlug":"gcd-sort-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.6K\", \"totalSubmission\": \"14.5K\", \"totalAcceptedRaw\": 6629, \"totalSubmissionRaw\": 14522, \"acRate\": \"45.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2129","questionFrontendId":"2001","title":"Number of Pairs of Interchangeable Rectangles","titleSlug":"number-of-pairs-of-interchangeable-rectangles","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.7K\", \"totalSubmission\": \"51.5K\", \"totalAcceptedRaw\": 23699, \"totalSubmissionRaw\": 51498, \"acRate\": \"46.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2132","questionFrontendId":"2022","title":"Convert 1D Array Into 2D Array","titleSlug":"convert-1d-array-into-2d-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"55.5K\", \"totalSubmission\": \"94.1K\", \"totalAcceptedRaw\": 55517, \"totalSubmissionRaw\": 94134, \"acRate\": \"59.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2133","questionFrontendId":"2023","title":"Number of Pairs of Strings With Concatenation Equal to Target","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.5K\", \"totalSubmission\": \"41.6K\", \"totalAcceptedRaw\": 30534, \"totalSubmissionRaw\": 41639, \"acRate\": \"73.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2135","questionFrontendId":"2025","title":"Maximum Number of Ways to Partition an Array","titleSlug":"maximum-number-of-ways-to-partition-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"21K\", \"totalAcceptedRaw\": 6873, \"totalSubmissionRaw\": 20959, \"acRate\": \"32.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2137","questionFrontendId":"2011","title":"Final Value of Variable After Performing Operations","titleSlug":"final-value-of-variable-after-performing-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"211.7K\", \"totalSubmission\": \"238.7K\", \"totalAcceptedRaw\": 211725, \"totalSubmissionRaw\": 238743, \"acRate\": \"88.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2138","questionFrontendId":"2012","title":"Sum of Beauty in the Array","titleSlug":"sum-of-beauty-in-the-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.4K\", \"totalSubmission\": \"39.2K\", \"totalAcceptedRaw\": 18371, \"totalSubmissionRaw\": 39201, \"acRate\": \"46.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2139","questionFrontendId":"2013","title":"Detect Squares","titleSlug":"detect-squares","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.2K\", \"totalSubmission\": \"87.9K\", \"totalAcceptedRaw\": 44217, \"totalSubmissionRaw\": 87914, \"acRate\": \"50.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2142","questionFrontendId":"2015","title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5K\", \"totalSubmission\": \"2.6K\", \"totalAcceptedRaw\": 1530, \"totalSubmissionRaw\": 2598, \"acRate\": \"58.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2144","questionFrontendId":"2016","title":"Maximum Difference Between Increasing Elements","titleSlug":"maximum-difference-between-increasing-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"57.2K\", \"totalSubmission\": \"105.5K\", \"totalAcceptedRaw\": 57160, \"totalSubmissionRaw\": 105478, \"acRate\": \"54.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2145","questionFrontendId":"2017","title":"Grid Game","titleSlug":"grid-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"15K\", \"totalSubmission\": \"34.4K\", \"totalAcceptedRaw\": 15006, \"totalSubmissionRaw\": 34444, \"acRate\": \"43.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2146","questionFrontendId":"2018","title":"Check if Word Can Be Placed In Crossword","titleSlug":"check-if-word-can-be-placed-in-crossword","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.9K\", \"totalSubmission\": \"34.2K\", \"totalAcceptedRaw\": 16883, \"totalSubmissionRaw\": 34172, \"acRate\": \"49.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2147","questionFrontendId":"2019","title":"The Score of Students Solving Math Expression","titleSlug":"the-score-of-students-solving-math-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"16.8K\", \"totalAcceptedRaw\": 5676, \"totalSubmissionRaw\": 16803, \"acRate\": \"33.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2148","questionFrontendId":"2037","title":"Minimum Number of Moves to Seat Everyone","titleSlug":"minimum-number-of-moves-to-seat-everyone","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.3K\", \"totalSubmission\": \"55.2K\", \"totalAcceptedRaw\": 45303, \"totalSubmissionRaw\": 55216, \"acRate\": \"82.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2150","questionFrontendId":"2040","title":"Kth Smallest Product of Two Sorted Arrays","titleSlug":"kth-smallest-product-of-two-sorted-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.9K\", \"totalSubmission\": \"30.9K\", \"totalAcceptedRaw\": 8921, \"totalSubmissionRaw\": 30885, \"acRate\": \"28.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2151","questionFrontendId":"2039","title":"The Time When the Network Becomes Idle","titleSlug":"the-time-when-the-network-becomes-idle","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.5K\", \"totalSubmission\": \"20.6K\", \"totalAcceptedRaw\": 10516, \"totalSubmissionRaw\": 20615, \"acRate\": \"51.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2155","questionFrontendId":"2028","title":"Find Missing Observations","titleSlug":"find-missing-observations","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.2K\", \"totalSubmission\": \"45.4K\", \"totalAcceptedRaw\": 20226, \"totalSubmissionRaw\": 45412, \"acRate\": \"44.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2156","questionFrontendId":"2029","title":"Stone Game IX","titleSlug":"stone-game-ix","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"23.7K\", \"totalAcceptedRaw\": 6310, \"totalSubmissionRaw\": 23708, \"acRate\": \"26.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2159","questionFrontendId":"2032","title":"Two Out of Three","titleSlug":"two-out-of-three","translatedTitle":null,"stats":"{\"totalAccepted\": \"45K\", \"totalSubmission\": \"61.2K\", \"totalAcceptedRaw\": 44995, \"totalSubmissionRaw\": 61240, \"acRate\": \"73.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2160","questionFrontendId":"2033","title":"Minimum Operations to Make a Uni-Value Grid","titleSlug":"minimum-operations-to-make-a-uni-value-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.6K\", \"totalSubmission\": \"35.5K\", \"totalAcceptedRaw\": 18604, \"totalSubmissionRaw\": 35485, \"acRate\": \"52.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2162","questionFrontendId":"2035","title":"Partition Array Into Two Arrays to Minimize Sum Difference","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.1K\", \"totalSubmission\": \"69.8K\", \"totalAcceptedRaw\": 13133, \"totalSubmissionRaw\": 69768, \"acRate\": \"18.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2163","questionFrontendId":"2053","title":"Kth Distinct String in an Array","titleSlug":"kth-distinct-string-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.1K\", \"totalSubmission\": \"58.4K\", \"totalAcceptedRaw\": 42057, \"totalSubmissionRaw\": 58366, \"acRate\": \"72.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2164","questionFrontendId":"2054","title":"Two Best Non-Overlapping Events","titleSlug":"two-best-non-overlapping-events","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"29.4K\", \"totalAcceptedRaw\": 13290, \"totalSubmissionRaw\": 29383, \"acRate\": \"45.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2165","questionFrontendId":"2055","title":"Plates Between Candles","titleSlug":"plates-between-candles","translatedTitle":null,"stats":"{\"totalAccepted\": \"29K\", \"totalSubmission\": \"65K\", \"totalAcceptedRaw\": 28970, \"totalSubmissionRaw\": 64967, \"acRate\": \"44.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2166","questionFrontendId":"2056","title":"Number of Valid Move Combinations On Chessboard","titleSlug":"number-of-valid-move-combinations-on-chessboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.4K\", \"totalSubmission\": \"5.8K\", \"totalAcceptedRaw\": 3374, \"totalSubmissionRaw\": 5804, \"acRate\": \"58.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2169","questionFrontendId":"2043","title":"Simple Bank System","titleSlug":"simple-bank-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"18K\", \"totalSubmission\": \"27.6K\", \"totalAcceptedRaw\": 18020, \"totalSubmissionRaw\": 27592, \"acRate\": \"65.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2170","questionFrontendId":"2044","title":"Count Number of Maximum Bitwise-OR Subsets","titleSlug":"count-number-of-maximum-bitwise-or-subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.1K\", \"totalSubmission\": \"26.6K\", \"totalAcceptedRaw\": 20123, \"totalSubmissionRaw\": 26636, \"acRate\": \"75.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2175","questionFrontendId":"2049","title":"Count Nodes With the Highest Score","titleSlug":"count-nodes-with-the-highest-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.1K\", \"totalSubmission\": \"33.9K\", \"totalAcceptedRaw\": 16121, \"totalSubmissionRaw\": 33853, \"acRate\": \"47.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2179","questionFrontendId":"2070","title":"Most Beautiful Item for Each Query","titleSlug":"most-beautiful-item-for-each-query","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.1K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 12139, \"totalSubmissionRaw\": 24501, \"acRate\": \"49.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2180","questionFrontendId":"2071","title":"Maximum Number of Tasks You Can Assign","titleSlug":"maximum-number-of-tasks-you-can-assign","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.5K\", \"totalSubmission\": \"19.2K\", \"totalAcceptedRaw\": 6516, \"totalSubmissionRaw\": 19174, \"acRate\": \"34.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2181","questionFrontendId":"2057","title":"Smallest Index With Equal Value","titleSlug":"smallest-index-with-equal-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.1K\", \"totalSubmission\": \"56K\", \"totalAcceptedRaw\": 40085, \"totalSubmissionRaw\": 56029, \"acRate\": \"71.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2183","questionFrontendId":"2059","title":"Minimum Operations to Convert Number","titleSlug":"minimum-operations-to-convert-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"13K\", \"totalSubmission\": \"27.3K\", \"totalAcceptedRaw\": 13010, \"totalSubmissionRaw\": 27255, \"acRate\": \"47.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2188","questionFrontendId":"2064","title":"Minimized Maximum of Products Distributed to Any Store","titleSlug":"minimized-maximum-of-products-distributed-to-any-store","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.2K\", \"totalSubmission\": \"38K\", \"totalAcceptedRaw\": 19247, \"totalSubmissionRaw\": 37965, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2189","questionFrontendId":"2065","title":"Maximum Path Quality of a Graph","titleSlug":"maximum-path-quality-of-a-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.8K\", \"totalSubmission\": \"25.8K\", \"totalAcceptedRaw\": 14791, \"totalSubmissionRaw\": 25819, \"acRate\": \"57.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2190","questionFrontendId":"2085","title":"Count Common Words With One Occurrence","titleSlug":"count-common-words-with-one-occurrence","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.1K\", \"totalSubmission\": \"61.6K\", \"totalAcceptedRaw\": 43123, \"totalSubmissionRaw\": 61599, \"acRate\": \"70.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2192","questionFrontendId":"2087","title":"Minimum Cost Homecoming of a Robot in a Grid","titleSlug":"minimum-cost-homecoming-of-a-robot-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.2K\", \"totalSubmission\": \"25.8K\", \"totalAcceptedRaw\": 13210, \"totalSubmissionRaw\": 25840, \"acRate\": \"51.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2193","questionFrontendId":"2088","title":"Count Fertile Pyramids in a Land","titleSlug":"count-fertile-pyramids-in-a-land","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"9K\", \"totalAcceptedRaw\": 5723, \"totalSubmissionRaw\": 8983, \"acRate\": \"63.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2195","questionFrontendId":"2073","title":"Time Needed to Buy Tickets","titleSlug":"time-needed-to-buy-tickets","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.1K\", \"totalSubmission\": \"62.8K\", \"totalAcceptedRaw\": 39141, \"totalSubmissionRaw\": 62798, \"acRate\": \"62.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2199","questionFrontendId":"2078","title":"Two Furthest Houses With Different Colors","titleSlug":"two-furthest-houses-with-different-colors","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.8K\", \"totalSubmission\": \"59.3K\", \"totalAcceptedRaw\": 39755, \"totalSubmissionRaw\": 59267, \"acRate\": \"67.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2200","questionFrontendId":"2132","title":"Stamping the Grid","titleSlug":"stamping-the-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"17.6K\", \"totalAcceptedRaw\": 5555, \"totalSubmissionRaw\": 17550, \"acRate\": \"31.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2203","questionFrontendId":"2061","title":"Number of Spaces Cleaning Robot Cleaned","titleSlug":"number-of-spaces-cleaning-robot-cleaned","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"6.4K\", \"totalAcceptedRaw\": 3505, \"totalSubmissionRaw\": 6414, \"acRate\": \"54.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2204","questionFrontendId":"2099","title":"Find Subsequence of Length K With the Largest Sum","titleSlug":"find-subsequence-of-length-k-with-the-largest-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"32K\", \"totalSubmission\": \"74.7K\", \"totalAcceptedRaw\": 31997, \"totalSubmissionRaw\": 74652, \"acRate\": \"42.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2205","questionFrontendId":"2100","title":"Find Good Days to Rob the Bank","titleSlug":"find-good-days-to-rob-the-bank","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"40.5K\", \"totalAcceptedRaw\": 19922, \"totalSubmissionRaw\": 40479, \"acRate\": \"49.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2206","questionFrontendId":"2101","title":"Detonate the Maximum Bombs","titleSlug":"detonate-the-maximum-bombs","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.4K\", \"totalSubmission\": \"67.7K\", \"totalAcceptedRaw\": 28437, \"totalSubmissionRaw\": 67665, \"acRate\": \"42.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2210","questionFrontendId":"2089","title":"Find Target Indices After Sorting Array","titleSlug":"find-target-indices-after-sorting-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"109.3K\", \"totalSubmission\": \"143K\", \"totalAcceptedRaw\": 109283, \"totalSubmissionRaw\": 142997, \"acRate\": \"76.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2211","questionFrontendId":"2090","title":"K Radius Subarray Averages","titleSlug":"k-radius-subarray-averages","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.8K\", \"totalSubmission\": \"53.5K\", \"totalAcceptedRaw\": 22839, \"totalSubmissionRaw\": 53531, \"acRate\": \"42.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2212","questionFrontendId":"2091","title":"Removing Minimum and Maximum From Array","titleSlug":"removing-minimum-and-maximum-from-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.7K\", \"totalSubmission\": \"51.3K\", \"totalAcceptedRaw\": 28673, \"totalSubmissionRaw\": 51285, \"acRate\": \"55.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2215","questionFrontendId":"2094","title":"Finding 3-Digit Even Numbers","titleSlug":"finding-3-digit-even-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"38.7K\", \"totalAcceptedRaw\": 22314, \"totalSubmissionRaw\": 38660, \"acRate\": \"57.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2219","questionFrontendId":"2114","title":"Maximum Number of Words Found in Sentences","titleSlug":"maximum-number-of-words-found-in-sentences","translatedTitle":null,"stats":"{\"totalAccepted\": \"168.9K\", \"totalSubmission\": \"193.7K\", \"totalAcceptedRaw\": 168947, \"totalSubmissionRaw\": 193655, \"acRate\": \"87.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2220","questionFrontendId":"2115","title":"Find All Possible Recipes from Given Supplies","titleSlug":"find-all-possible-recipes-from-given-supplies","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.9K\", \"totalSubmission\": \"131.8K\", \"totalAcceptedRaw\": 63897, \"totalSubmissionRaw\": 131785, \"acRate\": \"48.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2227","questionFrontendId":"2104","title":"Sum of Subarray Ranges","titleSlug":"sum-of-subarray-ranges","translatedTitle":null,"stats":"{\"totalAccepted\": \"66.8K\", \"totalSubmission\": \"110.8K\", \"totalAcceptedRaw\": 66796, \"totalSubmissionRaw\": 110777, \"acRate\": \"60.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2228","questionFrontendId":"2105","title":"Watering Plants II","titleSlug":"watering-plants-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.2K\", \"totalSubmission\": \"30.6K\", \"totalAcceptedRaw\": 15174, \"totalSubmissionRaw\": 30629, \"acRate\": \"49.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2229","questionFrontendId":"2106","title":"Maximum Fruits Harvested After at Most K Steps","titleSlug":"maximum-fruits-harvested-after-at-most-k-steps","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.4K\", \"totalSubmission\": \"24.1K\", \"totalAcceptedRaw\": 8447, \"totalSubmissionRaw\": 24113, \"acRate\": \"35.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2231","questionFrontendId":"2108","title":"Find First Palindromic String in the Array","titleSlug":"find-first-palindromic-string-in-the-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"80.8K\", \"totalSubmission\": \"102.7K\", \"totalAcceptedRaw\": 80795, \"totalSubmissionRaw\": 102687, \"acRate\": \"78.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2232","questionFrontendId":"2109","title":"Adding Spaces to a String","titleSlug":"adding-spaces-to-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.3K\", \"totalSubmission\": \"53.6K\", \"totalAcceptedRaw\": 30296, \"totalSubmissionRaw\": 53620, \"acRate\": \"56.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2233","questionFrontendId":"2110","title":"Number of Smooth Descent Periods of a Stock","titleSlug":"number-of-smooth-descent-periods-of-a-stock","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.6K\", \"totalSubmission\": \"47.9K\", \"totalAcceptedRaw\": 27618, \"totalSubmissionRaw\": 47892, \"acRate\": \"57.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2234","questionFrontendId":"2111","title":"Minimum Operations to Make the Array K-Increasing","titleSlug":"minimum-operations-to-make-the-array-k-increasing","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.7K\", \"totalSubmission\": \"28.5K\", \"totalAcceptedRaw\": 10733, \"totalSubmissionRaw\": 28544, \"acRate\": \"37.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2237","questionFrontendId":"2131","title":"Longest Palindrome by Concatenating Two Letter Words","titleSlug":"longest-palindrome-by-concatenating-two-letter-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"98K\", \"totalSubmission\": \"201.9K\", \"totalAcceptedRaw\": 97963, \"totalSubmissionRaw\": 201949, \"acRate\": \"48.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2240","questionFrontendId":"2121","title":"Intervals Between Identical Elements","titleSlug":"intervals-between-identical-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.2K\", \"totalSubmission\": \"35.1K\", \"totalAcceptedRaw\": 15152, \"totalSubmissionRaw\": 35087, \"acRate\": \"43.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2241","questionFrontendId":"2122","title":"Recover the Original Array","titleSlug":"recover-the-original-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.7K\", \"totalSubmission\": \"22.6K\", \"totalAcceptedRaw\": 8715, \"totalSubmissionRaw\": 22649, \"acRate\": \"38.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2242","questionFrontendId":"2098","title":"Subsequence of Size K With the Largest Even Sum","titleSlug":"subsequence-of-size-k-with-the-largest-even-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"5.6K\", \"totalAcceptedRaw\": 2158, \"totalSubmissionRaw\": 5635, \"acRate\": \"38.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2244","questionFrontendId":"2125","title":"Number of Laser Beams in a Bank","titleSlug":"number-of-laser-beams-in-a-bank","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.2K\", \"totalSubmission\": \"53.8K\", \"totalAcceptedRaw\": 44207, \"totalSubmissionRaw\": 53771, \"acRate\": \"82.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2245","questionFrontendId":"2126","title":"Destroying Asteroids","titleSlug":"destroying-asteroids","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.9K\", \"totalSubmission\": \"54K\", \"totalAcceptedRaw\": 26949, \"totalSubmissionRaw\": 53973, \"acRate\": \"49.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2247","questionFrontendId":"2107","title":"Number of Unique Flavors After Sharing K Candies","titleSlug":"number-of-unique-flavors-after-sharing-k-candies","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"4K\", \"totalAcceptedRaw\": 2229, \"totalSubmissionRaw\": 3966, \"acRate\": \"56.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2248","questionFrontendId":"2144","title":"Minimum Cost of Buying Candies With Discount","titleSlug":"minimum-cost-of-buying-candies-with-discount","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.6K\", \"totalSubmission\": \"56.7K\", \"totalAcceptedRaw\": 34602, \"totalSubmissionRaw\": 56738, \"acRate\": \"61.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2249","questionFrontendId":"2145","title":"Count the Hidden Sequences","titleSlug":"count-the-hidden-sequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.7K\", \"totalSubmission\": \"39.9K\", \"totalAcceptedRaw\": 14713, \"totalSubmissionRaw\": 39936, \"acRate\": \"36.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2250","questionFrontendId":"2146","title":"K Highest Ranked Items Within a Price Range","titleSlug":"k-highest-ranked-items-within-a-price-range","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.2K\", \"totalSubmission\": \"29.5K\", \"totalAcceptedRaw\": 12198, \"totalSubmissionRaw\": 29500, \"acRate\": \"41.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2254","questionFrontendId":"2133","title":"Check if Every Row and Column Contains All Numbers","titleSlug":"check-if-every-row-and-column-contains-all-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"50.7K\", \"totalSubmission\": \"96.6K\", \"totalAcceptedRaw\": 50684, \"totalSubmissionRaw\": 96636, \"acRate\": \"52.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2255","questionFrontendId":"2134","title":"Minimum Swaps to Group All 1's Together II","titleSlug":"minimum-swaps-to-group-all-1s-together-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"41.4K\", \"totalAcceptedRaw\": 21237, \"totalSubmissionRaw\": 41412, \"acRate\": \"51.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2256","questionFrontendId":"2135","title":"Count Words Obtained After Adding a Letter","titleSlug":"count-words-obtained-after-adding-a-letter","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.3K\", \"totalSubmission\": \"68.4K\", \"totalAcceptedRaw\": 29298, \"totalSubmissionRaw\": 68420, \"acRate\": \"42.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2257","questionFrontendId":"2136","title":"Earliest Possible Day of Full Bloom","titleSlug":"earliest-possible-day-of-full-bloom","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.9K\", \"totalSubmission\": \"63.7K\", \"totalAcceptedRaw\": 46910, \"totalSubmissionRaw\": 63699, \"acRate\": \"73.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2258","questionFrontendId":"2113","title":"Elements in Array After Removing and Replacing Elements","titleSlug":"elements-in-array-after-removing-and-replacing-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"2K\", \"totalAcceptedRaw\": 1438, \"totalSubmissionRaw\": 1965, \"acRate\": \"73.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2259","questionFrontendId":"2123","title":"Minimum Operations to Remove Adjacent Ones in Matrix","titleSlug":"minimum-operations-to-remove-adjacent-ones-in-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"685\", \"totalSubmission\": \"1.7K\", \"totalAcceptedRaw\": 685, \"totalSubmissionRaw\": 1667, \"acRate\": \"41.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2261","questionFrontendId":"2155","title":"All Divisions With the Highest Score of a Binary Array","titleSlug":"all-divisions-with-the-highest-score-of-a-binary-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.6K\", \"totalSubmission\": \"38.7K\", \"totalAcceptedRaw\": 24568, \"totalSubmissionRaw\": 38672, \"acRate\": \"63.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2262","questionFrontendId":"2140","title":"Solving Questions With Brainpower","titleSlug":"solving-questions-with-brainpower","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.8K\", \"totalSubmission\": \"53.4K\", \"totalAcceptedRaw\": 24770, \"totalSubmissionRaw\": 53428, \"acRate\": \"46.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2263","questionFrontendId":"2141","title":"Maximum Running Time of N Computers","titleSlug":"maximum-running-time-of-n-computers","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.1K\", \"totalSubmission\": \"28.2K\", \"totalAcceptedRaw\": 11072, \"totalSubmissionRaw\": 28244, \"acRate\": \"39.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2265","questionFrontendId":"2161","title":"Partition Array According to Given Pivot","titleSlug":"partition-array-according-to-given-pivot","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.8K\", \"totalSubmission\": \"54K\", \"totalAcceptedRaw\": 45758, \"totalSubmissionRaw\": 53988, \"acRate\": \"84.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2267","questionFrontendId":"2163","title":"Minimum Difference in Sums After Removal of Elements","titleSlug":"minimum-difference-in-sums-after-removal-of-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.5K\", \"totalSubmission\": \"15.7K\", \"totalAcceptedRaw\": 7472, \"totalSubmissionRaw\": 15701, \"acRate\": \"47.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2268","questionFrontendId":"2128","title":"Remove All Ones With Row and Column Flips","titleSlug":"remove-all-ones-with-row-and-column-flips","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.2K\", \"totalSubmission\": \"39.6K\", \"totalAcceptedRaw\": 30229, \"totalSubmissionRaw\": 39600, \"acRate\": \"76.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2269","questionFrontendId":"2148","title":"Count Elements With Strictly Smaller and Greater Elements ","titleSlug":"count-elements-with-strictly-smaller-and-greater-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.9K\", \"totalSubmission\": \"66.9K\", \"totalAcceptedRaw\": 39942, \"totalSubmissionRaw\": 66858, \"acRate\": \"59.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2270","questionFrontendId":"2150","title":"Find All Lonely Numbers in the Array","titleSlug":"find-all-lonely-numbers-in-the-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.6K\", \"totalSubmission\": \"55.4K\", \"totalAcceptedRaw\": 33570, \"totalSubmissionRaw\": 55408, \"acRate\": \"60.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2271","questionFrontendId":"2149","title":"Rearrange Array Elements by Sign","titleSlug":"rearrange-array-elements-by-sign","translatedTitle":null,"stats":"{\"totalAccepted\": \"69.9K\", \"totalSubmission\": \"86.5K\", \"totalAcceptedRaw\": 69909, \"totalSubmissionRaw\": 86491, \"acRate\": \"80.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2272","questionFrontendId":"2151","title":"Maximum Good People Based on Statements","titleSlug":"maximum-good-people-based-on-statements","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.1K\", \"totalSubmission\": \"22.5K\", \"totalAcceptedRaw\": 11058, \"totalSubmissionRaw\": 22463, \"acRate\": \"49.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2273","questionFrontendId":"2137","title":"Pour Water Between Buckets to Make Water Levels Equal","titleSlug":"pour-water-between-buckets-to-make-water-levels-equal","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"2.5K\", \"totalAcceptedRaw\": 1696, \"totalSubmissionRaw\": 2528, \"acRate\": \"67.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2274","questionFrontendId":"2154","title":"Keep Multiplying Found Values by Two","titleSlug":"keep-multiplying-found-values-by-two","translatedTitle":null,"stats":"{\"totalAccepted\": \"62.5K\", \"totalSubmission\": \"86K\", \"totalAcceptedRaw\": 62522, \"totalSubmissionRaw\": 86045, \"acRate\": \"72.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2277","questionFrontendId":"2176","title":"Count Equal and Divisible Pairs in an Array","titleSlug":"count-equal-and-divisible-pairs-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.7K\", \"totalSubmission\": \"61.1K\", \"totalAcceptedRaw\": 48730, \"totalSubmissionRaw\": 61131, \"acRate\": \"79.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2280","questionFrontendId":"2179","title":"Count Good Triplets in an Array","titleSlug":"count-good-triplets-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"15.3K\", \"totalAcceptedRaw\": 5891, \"totalSubmissionRaw\": 15350, \"acRate\": \"38.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2282","questionFrontendId":"2143","title":"Choose Numbers From Two Arrays in Range","titleSlug":"choose-numbers-from-two-arrays-in-range","translatedTitle":null,"stats":"{\"totalAccepted\": \"783\", \"totalSubmission\": \"1.5K\", \"totalAcceptedRaw\": 783, \"totalSubmissionRaw\": 1498, \"acRate\": \"52.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2283","questionFrontendId":"2164","title":"Sort Even and Odd Indices Independently","titleSlug":"sort-even-and-odd-indices-independently","translatedTitle":null,"stats":"{\"totalAccepted\": \"41.9K\", \"totalSubmission\": \"64.3K\", \"totalAcceptedRaw\": 41890, \"totalSubmissionRaw\": 64345, \"acRate\": \"65.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2285","questionFrontendId":"2166","title":"Design Bitset","titleSlug":"design-bitset","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.5K\", \"totalSubmission\": \"58.3K\", \"totalAcceptedRaw\": 18481, \"totalSubmissionRaw\": 58262, \"acRate\": \"31.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2287","questionFrontendId":"2152","title":"Minimum Number of Lines to Cover Points","titleSlug":"minimum-number-of-lines-to-cover-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"3K\", \"totalAcceptedRaw\": 1407, \"totalSubmissionRaw\": 3016, \"acRate\": \"46.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2289","questionFrontendId":"2170","title":"Minimum Operations to Make the Array Alternating","titleSlug":"minimum-operations-to-make-the-array-alternating","translatedTitle":null,"stats":"{\"totalAccepted\": \"19K\", \"totalSubmission\": \"57.3K\", \"totalAcceptedRaw\": 19007, \"totalSubmissionRaw\": 57269, \"acRate\": \"33.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2290","questionFrontendId":"2171","title":"Removing Minimum Number of Magic Beans","titleSlug":"removing-minimum-number-of-magic-beans","translatedTitle":null,"stats":"{\"totalAccepted\": \"21K\", \"totalSubmission\": \"49.8K\", \"totalAcceptedRaw\": 20955, \"totalSubmissionRaw\": 49835, \"acRate\": \"42.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2291","questionFrontendId":"2172","title":"Maximum AND Sum of Array","titleSlug":"maximum-and-sum-of-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.5K\", \"totalSubmission\": \"21.7K\", \"totalAcceptedRaw\": 10496, \"totalSubmissionRaw\": 21726, \"acRate\": \"48.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2292","questionFrontendId":"2185","title":"Counting Words With a Given Prefix","titleSlug":"counting-words-with-a-given-prefix","translatedTitle":null,"stats":"{\"totalAccepted\": \"59.7K\", \"totalSubmission\": \"77.2K\", \"totalAcceptedRaw\": 59666, \"totalSubmissionRaw\": 77153, \"acRate\": \"77.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2294","questionFrontendId":"2187","title":"Minimum Time to Complete Trips","titleSlug":"minimum-time-to-complete-trips","translatedTitle":null,"stats":"{\"totalAccepted\": \"93.1K\", \"totalSubmission\": \"237.5K\", \"totalAcceptedRaw\": 93092, \"totalSubmissionRaw\": 237451, \"acRate\": \"39.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2295","questionFrontendId":"2188","title":"Minimum Time to Finish the Race","titleSlug":"minimum-time-to-finish-the-race","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.7K\", \"totalSubmission\": \"23.3K\", \"totalAcceptedRaw\": 9730, \"totalSubmissionRaw\": 23321, \"acRate\": \"41.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2297","questionFrontendId":"2158","title":"Amount of New Area Painted Each Day","titleSlug":"amount-of-new-area-painted-each-day","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.1K\", \"totalSubmission\": \"42.3K\", \"totalAcceptedRaw\": 23091, \"totalSubmissionRaw\": 42281, \"acRate\": \"54.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2301","questionFrontendId":"2183","title":"Count Array Pairs Divisible by K","titleSlug":"count-array-pairs-divisible-by-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"41.1K\", \"totalAcceptedRaw\": 11663, \"totalSubmissionRaw\": 41107, \"acRate\": \"28.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2305","questionFrontendId":"2195","title":"Append K Integers With Minimal Sum","titleSlug":"append-k-integers-with-minimal-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.5K\", \"totalSubmission\": \"102.1K\", \"totalAcceptedRaw\": 25530, \"totalSubmissionRaw\": 102065, \"acRate\": \"25.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2306","questionFrontendId":"2196","title":"Create Binary Tree From Descriptions","titleSlug":"create-binary-tree-from-descriptions","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.7K\", \"totalSubmission\": \"35.5K\", \"totalAcceptedRaw\": 25701, \"totalSubmissionRaw\": 35531, \"acRate\": \"72.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2307","questionFrontendId":"2197","title":"Replace Non-Coprime Numbers in Array","titleSlug":"replace-non-coprime-numbers-in-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.5K\", \"totalSubmission\": \"29.8K\", \"totalAcceptedRaw\": 11507, \"totalSubmissionRaw\": 29828, \"acRate\": \"38.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2308","questionFrontendId":"2206","title":"Divide Array Into Equal Pairs","titleSlug":"divide-array-into-equal-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.2K\", \"totalSubmission\": \"69.2K\", \"totalAcceptedRaw\": 51177, \"totalSubmissionRaw\": 69249, \"acRate\": \"73.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2310","questionFrontendId":"2208","title":"Minimum Operations to Halve Array Sum","titleSlug":"minimum-operations-to-halve-array-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.1K\", \"totalSubmission\": \"44.3K\", \"totalAcceptedRaw\": 20116, \"totalSubmissionRaw\": 44277, \"acRate\": \"45.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2312","questionFrontendId":"2190","title":"Most Frequent Number Following Key In an Array","titleSlug":"most-frequent-number-following-key-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.1K\", \"totalSubmission\": \"43.5K\", \"totalAcceptedRaw\": 26107, \"totalSubmissionRaw\": 43492, \"acRate\": \"60.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2314","questionFrontendId":"2174","title":"Remove All Ones With Row and Column Flips II","titleSlug":"remove-all-ones-with-row-and-column-flips-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.1K\", \"totalSubmission\": \"6K\", \"totalAcceptedRaw\": 4101, \"totalSubmissionRaw\": 6016, \"acRate\": \"68.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2316","questionFrontendId":"2210","title":"Count Hills and Valleys in an Array","titleSlug":"count-hills-and-valleys-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.4K\", \"totalSubmission\": \"52.2K\", \"totalAcceptedRaw\": 30423, \"totalSubmissionRaw\": 52160, \"acRate\": \"58.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2318","questionFrontendId":"2212","title":"Maximum Points in an Archery Competition","titleSlug":"maximum-points-in-an-archery-competition","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.4K\", \"totalSubmission\": \"25.1K\", \"totalAcceptedRaw\": 12415, \"totalSubmissionRaw\": 25067, \"acRate\": \"49.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2319","questionFrontendId":"2213","title":"Longest Substring of One Repeating Character","titleSlug":"longest-substring-of-one-repeating-character","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.4K\", \"totalSubmission\": \"11K\", \"totalAcceptedRaw\": 3412, \"totalSubmissionRaw\": 11038, \"acRate\": \"30.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2320","questionFrontendId":"2200","title":"Find All K-Distant Indices in an Array","titleSlug":"find-all-k-distant-indices-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.9K\", \"totalSubmission\": \"47.6K\", \"totalAcceptedRaw\": 30921, \"totalSubmissionRaw\": 47554, \"acRate\": \"65.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2322","questionFrontendId":"2184","title":"Number of Ways to Build Sturdy Brick Wall","titleSlug":"number-of-ways-to-build-sturdy-brick-wall","translatedTitle":null,"stats":"{\"totalAccepted\": \"5K\", \"totalSubmission\": \"10K\", \"totalAcceptedRaw\": 5024, \"totalSubmissionRaw\": 10015, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2324","questionFrontendId":"2221","title":"Find Triangular Sum of an Array","titleSlug":"find-triangular-sum-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.3K\", \"totalSubmission\": \"66.6K\", \"totalAcceptedRaw\": 52305, \"totalSubmissionRaw\": 66593, \"acRate\": \"78.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2329","questionFrontendId":"2233","title":"Maximum Product After K Increments","titleSlug":"maximum-product-after-k-increments","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.6K\", \"totalSubmission\": \"55K\", \"totalAcceptedRaw\": 22629, \"totalSubmissionRaw\": 55025, \"acRate\": \"41.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2330","questionFrontendId":"2234","title":"Maximum Total Beauty of the Gardens","titleSlug":"maximum-total-beauty-of-the-gardens","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"18.6K\", \"totalAcceptedRaw\": 5305, \"totalSubmissionRaw\": 18638, \"acRate\": \"28.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2331","questionFrontendId":"2248","title":"Intersection of Multiple Arrays","titleSlug":"intersection-of-multiple-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.4K\", \"totalSubmission\": \"67.5K\", \"totalAcceptedRaw\": 46431, \"totalSubmissionRaw\": 67533, \"acRate\": \"68.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2332","questionFrontendId":"2249","title":"Count Lattice Points Inside a Circle","titleSlug":"count-lattice-points-inside-a-circle","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"36K\", \"totalAcceptedRaw\": 18182, \"totalSubmissionRaw\": 35992, \"acRate\": \"50.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2333","questionFrontendId":"2250","title":"Count Number of Rectangles Containing Each Point","titleSlug":"count-number-of-rectangles-containing-each-point","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.8K\", \"totalSubmission\": \"34.7K\", \"totalAcceptedRaw\": 11822, \"totalSubmissionRaw\": 34677, \"acRate\": \"34.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2334","questionFrontendId":"2251","title":"Number of Flowers in Full Bloom","titleSlug":"number-of-flowers-in-full-bloom","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.5K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 12546, \"totalSubmissionRaw\": 24455, \"acRate\": \"51.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2338","questionFrontendId":"2260","title":"Minimum Consecutive Cards to Pick Up","titleSlug":"minimum-consecutive-cards-to-pick-up","translatedTitle":null,"stats":"{\"totalAccepted\": \"40K\", \"totalSubmission\": \"78K\", \"totalAcceptedRaw\": 39971, \"totalSubmissionRaw\": 78007, \"acRate\": \"51.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2339","questionFrontendId":"2261","title":"K Divisible Elements Subarrays","titleSlug":"k-divisible-elements-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.4K\", \"totalSubmission\": \"42.5K\", \"totalAcceptedRaw\": 20442, \"totalSubmissionRaw\": 42548, \"acRate\": \"48.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2341","questionFrontendId":"2255","title":"Count Prefixes of a Given String","titleSlug":"count-prefixes-of-a-given-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.5K\", \"totalSubmission\": \"52.7K\", \"totalAcceptedRaw\": 38451, \"totalSubmissionRaw\": 52729, \"acRate\": \"72.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2342","questionFrontendId":"2256","title":"Minimum Average Difference","titleSlug":"minimum-average-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"74.7K\", \"totalSubmission\": \"173.2K\", \"totalAcceptedRaw\": 74656, \"totalSubmissionRaw\": 173171, \"acRate\": \"43.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2343","questionFrontendId":"2257","title":"Count Unguarded Cells in the Grid","titleSlug":"count-unguarded-cells-in-the-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.2K\", \"totalSubmission\": \"25.3K\", \"totalAcceptedRaw\": 13185, \"totalSubmissionRaw\": 25271, \"acRate\": \"52.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2344","questionFrontendId":"2258","title":"Escape the Spreading Fire","titleSlug":"escape-the-spreading-fire","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.7K\", \"totalSubmission\": \"19.3K\", \"totalAcceptedRaw\": 6746, \"totalSubmissionRaw\": 19253, \"acRate\": \"35.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2349","questionFrontendId":"2267","title":" Check if There Is a Valid Parentheses String Path","titleSlug":"check-if-there-is-a-valid-parentheses-string-path","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.4K\", \"totalSubmission\": \"32.6K\", \"totalAcceptedRaw\": 12378, \"totalSubmissionRaw\": 32557, \"acRate\": \"38.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2350","questionFrontendId":"2239","title":"Find Closest Number to Zero","titleSlug":"find-closest-number-to-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.4K\", \"totalSubmission\": \"82.2K\", \"totalAcceptedRaw\": 37409, \"totalSubmissionRaw\": 82201, \"acRate\": \"45.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2352","questionFrontendId":"2241","title":"Design an ATM Machine","titleSlug":"design-an-atm-machine","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.2K\", \"totalSubmission\": \"34K\", \"totalAcceptedRaw\": 13208, \"totalSubmissionRaw\": 33965, \"acRate\": \"38.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2353","questionFrontendId":"2242","title":"Maximum Score of a Node Sequence","titleSlug":"maximum-score-of-a-node-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.5K\", \"totalSubmission\": \"25K\", \"totalAcceptedRaw\": 9480, \"totalSubmissionRaw\": 25018, \"acRate\": \"37.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2354","questionFrontendId":"2214","title":"Minimum Health to Beat Game","titleSlug":"minimum-health-to-beat-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.3K\", \"totalSubmission\": \"47K\", \"totalAcceptedRaw\": 27278, \"totalSubmissionRaw\": 47000, \"acRate\": \"58.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2355","questionFrontendId":"2274","title":"Maximum Consecutive Floors Without Special Floors","titleSlug":"maximum-consecutive-floors-without-special-floors","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.2K\", \"totalSubmission\": \"48.4K\", \"totalAcceptedRaw\": 25229, \"totalSubmissionRaw\": 48396, \"acRate\": \"52.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2356","questionFrontendId":"2275","title":"Largest Combination With Bitwise AND Greater Than Zero","titleSlug":"largest-combination-with-bitwise-and-greater-than-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.2K\", \"totalSubmission\": \"27.9K\", \"totalAcceptedRaw\": 20201, \"totalSubmissionRaw\": 27919, \"acRate\": \"72.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2358","questionFrontendId":"2270","title":"Number of Ways to Split Array","titleSlug":"number-of-ways-to-split-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.3K\", \"totalSubmission\": \"55.4K\", \"totalAcceptedRaw\": 25284, \"totalSubmissionRaw\": 55391, \"acRate\": \"45.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2359","questionFrontendId":"2271","title":"Maximum White Tiles Covered by a Carpet","titleSlug":"maximum-white-tiles-covered-by-a-carpet","translatedTitle":null,"stats":"{\"totalAccepted\": \"13K\", \"totalSubmission\": \"39.5K\", \"totalAcceptedRaw\": 13026, \"totalSubmissionRaw\": 39479, \"acRate\": \"33.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2360","questionFrontendId":"2272","title":"Substring With Largest Variance","titleSlug":"substring-with-largest-variance","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.4K\", \"totalSubmission\": \"63.2K\", \"totalAcceptedRaw\": 23372, \"totalSubmissionRaw\": 63160, \"acRate\": \"37.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2362","questionFrontendId":"2244","title":"Minimum Rounds to Complete All Tasks","titleSlug":"minimum-rounds-to-complete-all-tasks","translatedTitle":null,"stats":"{\"totalAccepted\": \"130.1K\", \"totalSubmission\": \"206.7K\", \"totalAcceptedRaw\": 130080, \"totalSubmissionRaw\": 206731, \"acRate\": \"62.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2363","questionFrontendId":"2245","title":"Maximum Trailing Zeros in a Cornered Path","titleSlug":"maximum-trailing-zeros-in-a-cornered-path","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"19.7K\", \"totalAcceptedRaw\": 6883, \"totalSubmissionRaw\": 19653, \"acRate\": \"35.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2364","questionFrontendId":"2246","title":"Longest Path With Different Adjacent Characters","titleSlug":"longest-path-with-different-adjacent-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.1K\", \"totalSubmission\": \"116.7K\", \"totalAcceptedRaw\": 65147, \"totalSubmissionRaw\": 116672, \"acRate\": \"55.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2366","questionFrontendId":"2279","title":"Maximum Bags With Full Capacity of Rocks","titleSlug":"maximum-bags-with-full-capacity-of-rocks","translatedTitle":null,"stats":"{\"totalAccepted\": \"83.8K\", \"totalSubmission\": \"123.7K\", \"totalAcceptedRaw\": 83818, \"totalSubmissionRaw\": 123739, \"acRate\": \"67.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2367","questionFrontendId":"2280","title":"Minimum Lines to Represent a Line Chart","titleSlug":"minimum-lines-to-represent-a-line-chart","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.8K\", \"totalSubmission\": \"89.9K\", \"totalAcceptedRaw\": 21814, \"totalSubmissionRaw\": 89888, \"acRate\": \"24.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2368","questionFrontendId":"2281","title":"Sum of Total Strength of Wizards","titleSlug":"sum-of-total-strength-of-wizards","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"50.5K\", \"totalAcceptedRaw\": 13816, \"totalSubmissionRaw\": 50503, \"acRate\": \"27.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2369","questionFrontendId":"2219","title":"Maximum Sum Score of Array","titleSlug":"maximum-sum-score-of-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.8K\", \"totalSubmission\": \"4.6K\", \"totalAcceptedRaw\": 2768, \"totalSubmissionRaw\": 4557, \"acRate\": \"60.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2374","questionFrontendId":"2289","title":"Steps to Make Array Non-decreasing","titleSlug":"steps-to-make-array-non-decreasing","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.1K\", \"totalSubmission\": \"67K\", \"totalAcceptedRaw\": 14120, \"totalSubmissionRaw\": 66974, \"acRate\": \"21.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2375","questionFrontendId":"2290","title":"Minimum Obstacle Removal to Reach Corner","titleSlug":"minimum-obstacle-removal-to-reach-corner","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.8K\", \"totalSubmission\": \"31.9K\", \"totalAcceptedRaw\": 15811, \"totalSubmissionRaw\": 31910, \"acRate\": \"49.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2378","questionFrontendId":"2284","title":"Sender With Largest Word Count","titleSlug":"sender-with-largest-word-count","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.8K\", \"totalSubmission\": \"46K\", \"totalAcceptedRaw\": 25769, \"totalSubmissionRaw\": 45959, \"acRate\": \"56.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2385","questionFrontendId":"2237","title":"Count Positions on Street With Required Brightness","titleSlug":"count-positions-on-street-with-required-brightness","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.9K\", \"totalSubmission\": \"3K\", \"totalAcceptedRaw\": 1929, \"totalSubmissionRaw\": 2983, \"acRate\": \"64.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2386","questionFrontendId":"2293","title":"Min Max Game","titleSlug":"min-max-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.4K\", \"totalSubmission\": \"55.5K\", \"totalAcceptedRaw\": 35393, \"totalSubmissionRaw\": 55495, \"acRate\": \"63.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2387","questionFrontendId":"2294","title":"Partition Array Such That Maximum Difference Is K","titleSlug":"partition-array-such-that-maximum-difference-is-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.3K\", \"totalSubmission\": \"41.8K\", \"totalAcceptedRaw\": 30346, \"totalSubmissionRaw\": 41759, \"acRate\": \"72.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2388","questionFrontendId":"2295","title":"Replace Elements in an Array","titleSlug":"replace-elements-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.5K\", \"totalSubmission\": \"47.8K\", \"totalAcceptedRaw\": 27489, \"totalSubmissionRaw\": 47770, \"acRate\": \"57.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2390","questionFrontendId":"2306","title":"Naming a Company","titleSlug":"naming-a-company","translatedTitle":null,"stats":"{\"totalAccepted\": \"54.7K\", \"totalSubmission\": \"116.1K\", \"totalAcceptedRaw\": 54658, \"totalSubmissionRaw\": 116079, \"acRate\": \"47.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2392","questionFrontendId":"2300","title":"Successful Pairs of Spells and Potions","titleSlug":"successful-pairs-of-spells-and-potions","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"68.7K\", \"totalAcceptedRaw\": 22286, \"totalSubmissionRaw\": 68695, \"acRate\": \"32.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2393","questionFrontendId":"2301","title":"Match Substring After Replacement","titleSlug":"match-substring-after-replacement","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.1K\", \"totalSubmission\": \"28.2K\", \"totalAcceptedRaw\": 11110, \"totalSubmissionRaw\": 28169, \"acRate\": \"39.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2394","questionFrontendId":"2302","title":"Count Subarrays With Score Less Than K","titleSlug":"count-subarrays-with-score-less-than-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.1K\", \"totalSubmission\": \"30.8K\", \"totalAcceptedRaw\": 16066, \"totalSubmissionRaw\": 30757, \"acRate\": \"52.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2398","questionFrontendId":"2319","title":"Check if Matrix Is X-Matrix","titleSlug":"check-if-matrix-is-x-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.6K\", \"totalSubmission\": \"54.8K\", \"totalAcceptedRaw\": 36591, \"totalSubmissionRaw\": 54825, \"acRate\": \"66.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2400","questionFrontendId":"2322","title":"Minimum Score After Removals on a Tree","titleSlug":"minimum-score-after-removals-on-a-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"10.6K\", \"totalAcceptedRaw\": 5358, \"totalSubmissionRaw\": 10554, \"acRate\": \"50.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2402","questionFrontendId":"2317","title":"Maximum XOR After Operations ","titleSlug":"maximum-xor-after-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.8K\", \"totalSubmission\": \"21.2K\", \"totalAcceptedRaw\": 16779, \"totalSubmissionRaw\": 21198, \"acRate\": \"79.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2405","questionFrontendId":"2268","title":"Minimum Number of Keypresses","titleSlug":"minimum-number-of-keypresses","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.5K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 10547, \"totalSubmissionRaw\": 14412, \"acRate\": \"73.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2409","questionFrontendId":"2328","title":"Number of Increasing Paths in a Grid","titleSlug":"number-of-increasing-paths-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.4K\", \"totalSubmission\": \"34.5K\", \"totalAcceptedRaw\": 16428, \"totalSubmissionRaw\": 34536, \"acRate\": \"47.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2411","questionFrontendId":"2326","title":"Spiral Matrix IV","titleSlug":"spiral-matrix-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"26K\", \"totalSubmission\": \"34.8K\", \"totalAcceptedRaw\": 25971, \"totalSubmissionRaw\": 34761, \"acRate\": \"74.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2412","questionFrontendId":"2335","title":"Minimum Amount of Time to Fill Cups","titleSlug":"minimum-amount-of-time-to-fill-cups","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.4K\", \"totalSubmission\": \"59.4K\", \"totalAcceptedRaw\": 33420, \"totalSubmissionRaw\": 59380, \"acRate\": \"56.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2417","questionFrontendId":"2332","title":"The Latest Time to Catch a Bus","titleSlug":"the-latest-time-to-catch-a-bus","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.2K\", \"totalSubmission\": \"56.3K\", \"totalAcceptedRaw\": 13185, \"totalSubmissionRaw\": 56331, \"acRate\": \"23.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2418","questionFrontendId":"2333","title":"Minimum Sum of Squared Difference","titleSlug":"minimum-sum-of-squared-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"11K\", \"totalSubmission\": \"42.9K\", \"totalAcceptedRaw\": 10958, \"totalSubmissionRaw\": 42935, \"acRate\": \"25.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2419","questionFrontendId":"2334","title":"Subarray With Elements Greater Than Varying Threshold","titleSlug":"subarray-with-elements-greater-than-varying-threshold","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 5921, \"totalSubmissionRaw\": 14392, \"acRate\": \"41.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2420","questionFrontendId":"2277","title":"Closest Node to Path in Tree","titleSlug":"closest-node-to-path-in-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.5K\", \"totalSubmission\": \"3.9K\", \"totalAcceptedRaw\": 2466, \"totalSubmissionRaw\": 3868, \"acRate\": \"63.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2421","questionFrontendId":"2341","title":"Maximum Number of Pairs in Array","titleSlug":"maximum-number-of-pairs-in-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.2K\", \"totalSubmission\": \"60.8K\", \"totalAcceptedRaw\": 46179, \"totalSubmissionRaw\": 60778, \"acRate\": \"76.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2422","questionFrontendId":"2343","title":"Query Kth Smallest Trimmed Number","titleSlug":"query-kth-smallest-trimmed-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.7K\", \"totalSubmission\": \"50.2K\", \"totalAcceptedRaw\": 20742, \"totalSubmissionRaw\": 50189, \"acRate\": \"41.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Radix Sort","translatedName":null,"slug":"radix-sort","__typename":"TopicTagNode"},{"name":"Quickselect","translatedName":null,"slug":"quickselect","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2423","questionFrontendId":"2344","title":"Minimum Deletions to Make Array Divisible","titleSlug":"minimum-deletions-to-make-array-divisible","translatedTitle":null,"stats":"{\"totalAccepted\": \"23K\", \"totalSubmission\": \"40.6K\", \"totalAcceptedRaw\": 23032, \"totalSubmissionRaw\": 40557, \"acRate\": \"56.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2425","questionFrontendId":"2282","title":"Number of People That Can Be Seen in a Grid","titleSlug":"number-of-people-that-can-be-seen-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1K\", \"totalSubmission\": \"2.3K\", \"totalAcceptedRaw\": 1129, \"totalSubmissionRaw\": 2275, \"acRate\": \"49.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2426","questionFrontendId":"2291","title":"Maximum Profit From Trading Stocks","titleSlug":"maximum-profit-from-trading-stocks","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.4K\", \"totalSubmission\": \"7.6K\", \"totalAcceptedRaw\": 3440, \"totalSubmissionRaw\": 7564, \"acRate\": \"45.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2428","questionFrontendId":"2352","title":"Equal Row and Column Pairs","titleSlug":"equal-row-and-column-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.5K\", \"totalSubmission\": \"47.4K\", \"totalAcceptedRaw\": 33502, \"totalSubmissionRaw\": 47389, \"acRate\": \"70.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2430","questionFrontendId":"2354","title":"Number of Excellent Pairs","titleSlug":"number-of-excellent-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.8K\", \"totalSubmission\": \"25.6K\", \"totalAcceptedRaw\": 11797, \"totalSubmissionRaw\": 25639, \"acRate\": \"46.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2432","questionFrontendId":"2348","title":"Number of Zero-Filled Subarrays","titleSlug":"number-of-zero-filled-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.3K\", \"totalSubmission\": \"49.1K\", \"totalAcceptedRaw\": 28338, \"totalSubmissionRaw\": 49054, \"acRate\": \"57.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2433","questionFrontendId":"2347","title":"Best Poker Hand","titleSlug":"best-poker-hand","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.5K\", \"totalSubmission\": \"48.6K\", \"totalAcceptedRaw\": 29504, \"totalSubmissionRaw\": 48626, \"acRate\": \"60.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2435","questionFrontendId":"2350","title":"Shortest Impossible Sequence of Rolls","titleSlug":"shortest-impossible-sequence-of-rolls","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.5K\", \"totalSubmission\": \"16.9K\", \"totalAcceptedRaw\": 11526, \"totalSubmissionRaw\": 16874, \"acRate\": \"68.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2436","questionFrontendId":"2357","title":"Make Array Zero by Subtracting Equal Amounts","titleSlug":"make-array-zero-by-subtracting-equal-amounts","translatedTitle":null,"stats":"{\"totalAccepted\": \"62.3K\", \"totalSubmission\": \"85.7K\", \"totalAcceptedRaw\": 62276, \"totalSubmissionRaw\": 85663, \"acRate\": \"72.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2437","questionFrontendId":"2358","title":"Maximum Number of Groups Entering a Competition","titleSlug":"maximum-number-of-groups-entering-a-competition","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.5K\", \"totalSubmission\": \"42.2K\", \"totalAcceptedRaw\": 28514, \"totalSubmissionRaw\": 42152, \"acRate\": \"67.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2442","questionFrontendId":"2367","title":"Number of Arithmetic Triplets","titleSlug":"number-of-arithmetic-triplets","translatedTitle":null,"stats":"{\"totalAccepted\": \"65K\", \"totalSubmission\": \"77.7K\", \"totalAcceptedRaw\": 64961, \"totalSubmissionRaw\": 77674, \"acRate\": \"83.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2443","questionFrontendId":"2369","title":"Check if There is a Valid Partition For The Array","titleSlug":"check-if-there-is-a-valid-partition-for-the-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.9K\", \"totalSubmission\": \"47.2K\", \"totalAcceptedRaw\": 18934, \"totalSubmissionRaw\": 47180, \"acRate\": \"40.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2445","questionFrontendId":"2368","title":"Reachable Nodes With Restrictions","titleSlug":"reachable-nodes-with-restrictions","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.2K\", \"totalSubmission\": \"54K\", \"totalAcceptedRaw\": 31231, \"totalSubmissionRaw\": 54027, \"acRate\": \"57.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2447","questionFrontendId":"2363","title":"Merge Similar Items","titleSlug":"merge-similar-items","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.8K\", \"totalSubmission\": \"46.1K\", \"totalAcceptedRaw\": 34843, \"totalSubmissionRaw\": 46123, \"acRate\": \"75.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2448","questionFrontendId":"2364","title":"Count Number of Bad Pairs","titleSlug":"count-number-of-bad-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.4K\", \"totalSubmission\": \"54.5K\", \"totalAcceptedRaw\": 22391, \"totalSubmissionRaw\": 54452, \"acRate\": \"41.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2449","questionFrontendId":"2398","title":"Maximum Number of Robots Within Budget","titleSlug":"maximum-number-of-robots-within-budget","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.6K\", \"totalSubmission\": \"44.3K\", \"totalAcceptedRaw\": 14582, \"totalSubmissionRaw\": 44331, \"acRate\": \"32.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2450","questionFrontendId":"2366","title":"Minimum Replacements to Sort the Array","titleSlug":"minimum-replacements-to-sort-the-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.6K\", \"totalSubmission\": \"23.3K\", \"totalAcceptedRaw\": 9550, \"totalSubmissionRaw\": 23338, \"acRate\": \"40.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2454","questionFrontendId":"2373","title":"Largest Local Values in a Matrix","titleSlug":"largest-local-values-in-a-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.9K\", \"totalSubmission\": \"40.7K\", \"totalAcceptedRaw\": 33944, \"totalSubmissionRaw\": 40726, \"acRate\": \"83.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2458","questionFrontendId":"2323","title":"Find Minimum Time to Finish All Jobs II","titleSlug":"find-minimum-time-to-finish-all-jobs-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6K\", \"totalSubmission\": \"2.1K\", \"totalAcceptedRaw\": 1571, \"totalSubmissionRaw\": 2128, \"acRate\": \"73.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2459","questionFrontendId":"2383","title":"Minimum Hours of Training to Win a Competition","titleSlug":"minimum-hours-of-training-to-win-a-competition","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.2K\", \"totalSubmission\": \"61.3K\", \"totalAcceptedRaw\": 25156, \"totalSubmissionRaw\": 61334, \"acRate\": \"41.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2462","questionFrontendId":"2386","title":"Find the K-Sum of an Array","titleSlug":"find-the-k-sum-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"18K\", \"totalAcceptedRaw\": 6933, \"totalSubmissionRaw\": 18020, \"acRate\": \"38.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2465","questionFrontendId":"2381","title":"Shifting Letters II","titleSlug":"shifting-letters-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.5K\", \"totalSubmission\": \"41.4K\", \"totalAcceptedRaw\": 14459, \"totalSubmissionRaw\": 41394, \"acRate\": \"34.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2466","questionFrontendId":"2382","title":"Maximum Segment Sum After Removals","titleSlug":"maximum-segment-sum-after-removals","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"13.2K\", \"totalAcceptedRaw\": 6310, \"totalSubmissionRaw\": 13201, \"acRate\": \"47.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2469","questionFrontendId":"2389","title":"Longest Subsequence With Limited Sum","titleSlug":"longest-subsequence-with-limited-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.6K\", \"totalSubmission\": \"108.3K\", \"totalAcceptedRaw\": 78564, \"totalSubmissionRaw\": 108317, \"acRate\": \"72.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2471","questionFrontendId":"2391","title":"Minimum Amount of Time to Collect Garbage","titleSlug":"minimum-amount-of-time-to-collect-garbage","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.8K\", \"totalSubmission\": \"37.6K\", \"totalAcceptedRaw\": 31764, \"totalSubmissionRaw\": 37623, \"acRate\": \"84.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2472","questionFrontendId":"2392","title":"Build a Matrix With Conditions","titleSlug":"build-a-matrix-with-conditions","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.9K\", \"totalSubmission\": \"18.3K\", \"totalAcceptedRaw\": 10872, \"totalSubmissionRaw\": 18293, \"acRate\": \"59.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2473","questionFrontendId":"2342","title":"Max Sum of a Pair With Equal Sum of Digits","titleSlug":"max-sum-of-a-pair-with-equal-sum-of-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.4K\", \"totalSubmission\": \"58.9K\", \"totalAcceptedRaw\": 31426, \"totalSubmissionRaw\": 58890, \"acRate\": \"53.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2474","questionFrontendId":"2340","title":"Minimum Adjacent Swaps to Make a Valid Array","titleSlug":"minimum-adjacent-swaps-to-make-a-valid-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"8.2K\", \"totalAcceptedRaw\": 6134, \"totalSubmissionRaw\": 8161, \"acRate\": \"75.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2476","questionFrontendId":"2399","title":"Check Distances Between Same Letters","titleSlug":"check-distances-between-same-letters","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.8K\", \"totalSubmission\": \"47.9K\", \"totalAcceptedRaw\": 33840, \"totalSubmissionRaw\": 47949, \"acRate\": \"70.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2478","questionFrontendId":"2401","title":"Longest Nice Subarray","titleSlug":"longest-nice-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.3K\", \"totalSubmission\": \"41.3K\", \"totalAcceptedRaw\": 20313, \"totalSubmissionRaw\": 41272, \"acRate\": \"49.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2479","questionFrontendId":"2402","title":"Meeting Rooms III","titleSlug":"meeting-rooms-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.7K\", \"totalSubmission\": \"46.9K\", \"totalAcceptedRaw\": 15746, \"totalSubmissionRaw\": 46921, \"acRate\": \"33.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2480","questionFrontendId":"2395","title":"Find Subarrays With Equal Sum","titleSlug":"find-subarrays-with-equal-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.8K\", \"totalSubmission\": \"52.5K\", \"totalAcceptedRaw\": 33845, \"totalSubmissionRaw\": 52517, \"acRate\": \"64.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2482","questionFrontendId":"2397","title":"Maximum Rows Covered by Columns","titleSlug":"maximum-rows-covered-by-columns","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"22.2K\", \"totalAcceptedRaw\": 11694, \"totalSubmissionRaw\": 22158, \"acRate\": \"52.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2483","questionFrontendId":"2365","title":"Task Scheduler II","titleSlug":"task-scheduler-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.6K\", \"totalSubmission\": \"37.7K\", \"totalAcceptedRaw\": 17604, \"totalSubmissionRaw\": 37654, \"acRate\": \"46.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2485","questionFrontendId":"2345","title":"Finding the Number of Visible Mountains","titleSlug":"finding-the-number-of-visible-mountains","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"7.7K\", \"totalAcceptedRaw\": 3252, \"totalSubmissionRaw\": 7697, \"acRate\": \"42.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2486","questionFrontendId":"2404","title":"Most Frequent Even Element","titleSlug":"most-frequent-even-element","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.4K\", \"totalSubmission\": \"89.1K\", \"totalAcceptedRaw\": 45370, \"totalSubmissionRaw\": 89081, \"acRate\": \"50.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2488","questionFrontendId":"2406","title":"Divide Intervals Into Minimum Number of Groups","titleSlug":"divide-intervals-into-minimum-number-of-groups","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.3K\", \"totalSubmission\": \"44.2K\", \"totalAcceptedRaw\": 20310, \"totalSubmissionRaw\": 44185, \"acRate\": \"46.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2489","questionFrontendId":"2459","title":"Sort Array by Moving Items to Empty Space","titleSlug":"sort-array-by-moving-items-to-empty-space","translatedTitle":null,"stats":"{\"totalAccepted\": \"461\", \"totalSubmission\": \"889\", \"totalAcceptedRaw\": 461, \"totalSubmissionRaw\": 889, \"acRate\": \"51.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2490","questionFrontendId":"2355","title":"Maximum Number of Books You Can Take","titleSlug":"maximum-number-of-books-you-can-take","translatedTitle":null,"stats":"{\"totalAccepted\": \"4K\", \"totalSubmission\": \"9K\", \"totalAcceptedRaw\": 3986, \"totalSubmissionRaw\": 9042, \"acRate\": \"44.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2494","questionFrontendId":"2416","title":"Sum of Prefix Scores of Strings","titleSlug":"sum-of-prefix-scores-of-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.4K\", \"totalSubmission\": \"44.5K\", \"totalAcceptedRaw\": 19442, \"totalSubmissionRaw\": 44514, \"acRate\": \"43.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2497","questionFrontendId":"2410","title":"Maximum Matching of Players With Trainers","titleSlug":"maximum-matching-of-players-with-trainers","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.7K\", \"totalSubmission\": \"37.3K\", \"totalAcceptedRaw\": 22709, \"totalSubmissionRaw\": 37287, \"acRate\": \"60.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2498","questionFrontendId":"2411","title":"Smallest Subarrays With Maximum Bitwise OR","titleSlug":"smallest-subarrays-with-maximum-bitwise-or","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.4K\", \"totalSubmission\": \"22.5K\", \"totalAcceptedRaw\": 9379, \"totalSubmissionRaw\": 22537, \"acRate\": \"41.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2499","questionFrontendId":"2412","title":"Minimum Money Required Before Transactions","titleSlug":"minimum-money-required-before-transactions","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.3K\", \"totalSubmission\": \"21.1K\", \"totalAcceptedRaw\": 8349, \"totalSubmissionRaw\": 21061, \"acRate\": \"39.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2500","questionFrontendId":"2361","title":"Minimum Costs Using the Train Line","titleSlug":"minimum-costs-using-the-train-line","translatedTitle":null,"stats":"{\"totalAccepted\": \"4K\", \"totalSubmission\": \"5.3K\", \"totalAcceptedRaw\": 4015, \"totalSubmissionRaw\": 5279, \"acRate\": \"76.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2502","questionFrontendId":"2418","title":"Sort the People","titleSlug":"sort-the-people","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.9K\", \"totalSubmission\": \"81.3K\", \"totalAcceptedRaw\": 65943, \"totalSubmissionRaw\": 81260, \"acRate\": \"81.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2503","questionFrontendId":"2419","title":"Longest Subarray With Maximum Bitwise AND","titleSlug":"longest-subarray-with-maximum-bitwise-and","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"44.2K\", \"totalAcceptedRaw\": 21192, \"totalSubmissionRaw\": 44194, \"acRate\": \"48.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2504","questionFrontendId":"2420","title":"Find All Good Indices","titleSlug":"find-all-good-indices","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.1K\", \"totalSubmission\": \"48.3K\", \"totalAcceptedRaw\": 18121, \"totalSubmissionRaw\": 48303, \"acRate\": \"37.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2505","questionFrontendId":"2421","title":"Number of Good Paths","titleSlug":"number-of-good-paths","translatedTitle":null,"stats":"{\"totalAccepted\": \"47.8K\", \"totalSubmission\": \"82.9K\", \"totalAcceptedRaw\": 47759, \"totalSubmissionRaw\": 82944, \"acRate\": \"57.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2506","questionFrontendId":"2371","title":"Minimize Maximum Value in a Grid","titleSlug":"minimize-maximum-value-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"890\", \"totalSubmission\": \"1.2K\", \"totalAcceptedRaw\": 890, \"totalSubmissionRaw\": 1249, \"acRate\": \"71.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2508","questionFrontendId":"2428","title":"Maximum Sum of an Hourglass","titleSlug":"maximum-sum-of-an-hourglass","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.6K\", \"totalSubmission\": \"35.9K\", \"totalAcceptedRaw\": 26623, \"totalSubmissionRaw\": 35873, \"acRate\": \"74.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2513","questionFrontendId":"2426","title":"Number of Pairs Satisfying Inequality","titleSlug":"number-of-pairs-satisfying-inequality","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.8K\", \"totalSubmission\": \"20.4K\", \"totalAcceptedRaw\": 8763, \"totalSubmissionRaw\": 20397, \"acRate\": \"43.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2518","questionFrontendId":"2432","title":"The Employee That Worked on the Longest Task","titleSlug":"the-employee-that-worked-on-the-longest-task","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.8K\", \"totalSubmission\": \"54.2K\", \"totalAcceptedRaw\": 26772, \"totalSubmissionRaw\": 54196, \"acRate\": \"49.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2519","questionFrontendId":"2433","title":"Find The Original Array of Prefix Xor","titleSlug":"find-the-original-array-of-prefix-xor","translatedTitle":null,"stats":"{\"totalAccepted\": \"31K\", \"totalSubmission\": \"36.2K\", \"totalAcceptedRaw\": 30954, \"totalSubmissionRaw\": 36158, \"acRate\": \"85.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2521","questionFrontendId":"2435","title":"Paths in Matrix Whose Sum Is Divisible by K","titleSlug":"paths-in-matrix-whose-sum-is-divisible-by-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"15K\", \"totalSubmission\": \"36K\", \"totalAcceptedRaw\": 14952, \"totalSubmissionRaw\": 35995, \"acRate\": \"41.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2522","questionFrontendId":"2387","title":"Median of a Row Wise Sorted Matrix","titleSlug":"median-of-a-row-wise-sorted-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"2K\", \"totalAcceptedRaw\": 1379, \"totalSubmissionRaw\": 2001, \"acRate\": \"68.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2524","questionFrontendId":"2441","title":"Largest Positive Integer That Exists With Its Negative","titleSlug":"largest-positive-integer-that-exists-with-its-negative","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.9K\", \"totalSubmission\": \"54.2K\", \"totalAcceptedRaw\": 36894, \"totalSubmissionRaw\": 54228, \"acRate\": \"68.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2525","questionFrontendId":"2442","title":"Count Number of Distinct Integers After Reverse Operations","titleSlug":"count-number-of-distinct-integers-after-reverse-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"35K\", \"totalSubmission\": \"44.5K\", \"totalAcceptedRaw\": 35023, \"totalSubmissionRaw\": 44505, \"acRate\": \"78.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2526","questionFrontendId":"2407","title":"Longest Increasing Subsequence II","titleSlug":"longest-increasing-subsequence-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.8K\", \"totalSubmission\": \"36.2K\", \"totalAcceptedRaw\": 7841, \"totalSubmissionRaw\": 36205, \"acRate\": \"21.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2527","questionFrontendId":"2444","title":"Count Subarrays With Fixed Bounds","titleSlug":"count-subarrays-with-fixed-bounds","translatedTitle":null,"stats":"{\"totalAccepted\": \"54.7K\", \"totalSubmission\": \"88.2K\", \"totalAcceptedRaw\": 54701, \"totalSubmissionRaw\": 88186, \"acRate\": \"62.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2529","questionFrontendId":"2438","title":"Range Product Queries of Powers","titleSlug":"range-product-queries-of-powers","translatedTitle":null,"stats":"{\"totalAccepted\": \"13K\", \"totalSubmission\": \"33.5K\", \"totalAcceptedRaw\": 13023, \"totalSubmissionRaw\": 33464, \"acRate\": \"38.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2530","questionFrontendId":"2439","title":"Minimize Maximum of Array","titleSlug":"minimize-maximum-of-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.9K\", \"totalSubmission\": \"31.6K\", \"totalAcceptedRaw\": 10855, \"totalSubmissionRaw\": 31573, \"acRate\": \"34.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2531","questionFrontendId":"2440","title":"Create Components With Same Value","titleSlug":"create-components-with-same-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.2K\", \"totalSubmission\": \"7.6K\", \"totalAcceptedRaw\": 4167, \"totalSubmissionRaw\": 7629, \"acRate\": \"54.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2533","questionFrontendId":"2425","title":"Bitwise XOR of All Pairings","titleSlug":"bitwise-xor-of-all-pairings","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.1K\", \"totalSubmission\": \"24K\", \"totalAcceptedRaw\": 14054, \"totalSubmissionRaw\": 23993, \"acRate\": \"58.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2535","questionFrontendId":"2393","title":"Count Strictly Increasing Subarrays","titleSlug":"count-strictly-increasing-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"3K\", \"totalAcceptedRaw\": 2193, \"totalSubmissionRaw\": 3007, \"acRate\": \"72.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2536","questionFrontendId":"2446","title":"Determine if Two Events Have Conflict","titleSlug":"determine-if-two-events-have-conflict","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.2K\", \"totalSubmission\": \"54.5K\", \"totalAcceptedRaw\": 27191, \"totalSubmissionRaw\": 54520, \"acRate\": \"49.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2537","questionFrontendId":"2403","title":"Minimum Time to Kill All Monsters","titleSlug":"minimum-time-to-kill-all-monsters","translatedTitle":null,"stats":"{\"totalAccepted\": \"754\", \"totalSubmission\": \"1.5K\", \"totalAcceptedRaw\": 754, \"totalSubmissionRaw\": 1473, \"acRate\": \"51.2%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2538","questionFrontendId":"2448","title":"Minimum Cost to Make Array Equal","titleSlug":"minimum-cost-to-make-array-equal","translatedTitle":null,"stats":"{\"totalAccepted\": \"12K\", \"totalSubmission\": \"34.4K\", \"totalAcceptedRaw\": 11957, \"totalSubmissionRaw\": 34361, \"acRate\": \"34.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2539","questionFrontendId":"2449","title":"Minimum Number of Operations to Make Arrays Similar","titleSlug":"minimum-number-of-operations-to-make-arrays-similar","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.9K\", \"totalSubmission\": \"13.9K\", \"totalAcceptedRaw\": 8918, \"totalSubmissionRaw\": 13937, \"acRate\": \"64.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2542","questionFrontendId":"2455","title":"Average Value of Even Numbers That Are Divisible by Three","titleSlug":"average-value-of-even-numbers-that-are-divisible-by-three","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.3K\", \"totalSubmission\": \"58K\", \"totalAcceptedRaw\": 34280, \"totalSubmissionRaw\": 58045, \"acRate\": \"59.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2543","questionFrontendId":"2456","title":"Most Popular Video Creator","titleSlug":"most-popular-video-creator","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.6K\", \"totalSubmission\": \"40.2K\", \"totalAcceptedRaw\": 17613, \"totalSubmissionRaw\": 40196, \"acRate\": \"43.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2545","questionFrontendId":"2458","title":"Height of Binary Tree After Subtree Removal Queries","titleSlug":"height-of-binary-tree-after-subtree-removal-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.4K\", \"totalSubmission\": \"22.6K\", \"totalAcceptedRaw\": 8376, \"totalSubmissionRaw\": 22614, \"acRate\": \"37.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2546","questionFrontendId":"2447","title":"Number of Subarrays With GCD Equal to K","titleSlug":"number-of-subarrays-with-gcd-equal-to-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"19K\", \"totalSubmission\": \"39.1K\", \"totalAcceptedRaw\": 19010, \"totalSubmissionRaw\": 39112, \"acRate\": \"48.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2548","questionFrontendId":"2453","title":"Destroy Sequential Targets","titleSlug":"destroy-sequential-targets","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.3K\", \"totalSubmission\": \"30.1K\", \"totalAcceptedRaw\": 11343, \"totalSubmissionRaw\": 30064, \"acRate\": \"37.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2549","questionFrontendId":"2454","title":"Next Greater Element IV","titleSlug":"next-greater-element-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"15.9K\", \"totalAcceptedRaw\": 6338, \"totalSubmissionRaw\": 15923, \"acRate\": \"39.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2550","questionFrontendId":"2452","title":"Words Within Two Edits of Dictionary","titleSlug":"words-within-two-edits-of-dictionary","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.5K\", \"totalSubmission\": \"25.6K\", \"totalAcceptedRaw\": 15465, \"totalSubmissionRaw\": 25624, \"acRate\": \"60.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2551","questionFrontendId":"2460","title":"Apply Operations to an Array","titleSlug":"apply-operations-to-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.4K\", \"totalSubmission\": \"51.2K\", \"totalAcceptedRaw\": 34382, \"totalSubmissionRaw\": 51202, \"acRate\": \"67.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2552","questionFrontendId":"2461","title":"Maximum Sum of Distinct Subarrays With Length K","titleSlug":"maximum-sum-of-distinct-subarrays-with-length-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.5K\", \"totalSubmission\": \"65.8K\", \"totalAcceptedRaw\": 22535, \"totalSubmissionRaw\": 65769, \"acRate\": \"34.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2553","questionFrontendId":"2462","title":"Total Cost to Hire K Workers","titleSlug":"total-cost-to-hire-k-workers","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.9K\", \"totalSubmission\": \"37K\", \"totalAcceptedRaw\": 13890, \"totalSubmissionRaw\": 36989, \"acRate\": \"37.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2554","questionFrontendId":"2463","title":"Minimum Total Distance Traveled","titleSlug":"minimum-total-distance-traveled","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 5861, \"totalSubmissionRaw\": 14423, \"acRate\": \"40.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2555","questionFrontendId":"2408","title":"Design SQL","titleSlug":"design-sql","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2K\", \"totalSubmission\": \"1.5K\", \"totalAcceptedRaw\": 1230, \"totalSubmissionRaw\": 1464, \"acRate\": \"84.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2557","questionFrontendId":"2470","title":"Number of Subarrays With LCM Equal to K","titleSlug":"number-of-subarrays-with-lcm-equal-to-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.8K\", \"totalSubmission\": \"46.5K\", \"totalAcceptedRaw\": 17826, \"totalSubmissionRaw\": 46468, \"acRate\": \"38.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2561","questionFrontendId":"2465","title":"Number of Distinct Averages","titleSlug":"number-of-distinct-averages","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.3K\", \"totalSubmission\": \"43.3K\", \"totalAcceptedRaw\": 25253, \"totalSubmissionRaw\": 43315, \"acRate\": \"58.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2564","questionFrontendId":"2467","title":"Most Profitable Path in a Tree","titleSlug":"most-profitable-path-in-a-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"14.3K\", \"totalAcceptedRaw\": 6893, \"totalSubmissionRaw\": 14272, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2565","questionFrontendId":"2422","title":"Merge Operations to Turn Array Into a Palindrome","titleSlug":"merge-operations-to-turn-array-into-a-palindrome","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2K\", \"totalSubmission\": \"1.8K\", \"totalAcceptedRaw\": 1220, \"totalSubmissionRaw\": 1750, \"acRate\": \"69.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2566","questionFrontendId":"2475","title":"Number of Unequal Triplets in Array","titleSlug":"number-of-unequal-triplets-in-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.1K\", \"totalSubmission\": \"35.5K\", \"totalAcceptedRaw\": 25135, \"totalSubmissionRaw\": 35479, \"acRate\": \"70.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2567","questionFrontendId":"2476","title":"Closest Nodes Queries in a Binary Search Tree","titleSlug":"closest-nodes-queries-in-a-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.7K\", \"totalSubmission\": \"36.2K\", \"totalAcceptedRaw\": 14732, \"totalSubmissionRaw\": 36204, \"acRate\": \"40.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2570","questionFrontendId":"2431","title":"Maximize Total Tastiness of Purchased Fruits","titleSlug":"maximize-total-tastiness-of-purchased-fruits","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"1.9K\", \"totalAcceptedRaw\": 1303, \"totalSubmissionRaw\": 1928, \"acRate\": \"67.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2574","questionFrontendId":"2488","title":"Count Subarrays With Median K","titleSlug":"count-subarrays-with-median-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.9K\", \"totalSubmission\": \"18.7K\", \"totalAcceptedRaw\": 7918, \"totalSubmissionRaw\": 18733, \"acRate\": \"42.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2579","questionFrontendId":"2436","title":"Minimum Split Into Subarrays With GCD Greater Than One","titleSlug":"minimum-split-into-subarrays-with-gcd-greater-than-one","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"1.8K\", \"totalAcceptedRaw\": 1339, \"totalSubmissionRaw\": 1805, \"acRate\": \"74.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2581","questionFrontendId":"2491","title":"Divide Players Into Teams of Equal Skill","titleSlug":"divide-players-into-teams-of-equal-skill","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.5K\", \"totalSubmission\": \"38.3K\", \"totalAcceptedRaw\": 22498, \"totalSubmissionRaw\": 38254, \"acRate\": \"58.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2585","questionFrontendId":"2500","title":"Delete Greatest Value in Each Row","titleSlug":"delete-greatest-value-in-each-row","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.2K\", \"totalSubmission\": \"34.8K\", \"totalAcceptedRaw\": 28225, \"totalSubmissionRaw\": 34835, \"acRate\": \"81.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2586","questionFrontendId":"2501","title":"Longest Square Streak in an Array","titleSlug":"longest-square-streak-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"19K\", \"totalSubmission\": \"47.9K\", \"totalAcceptedRaw\": 18961, \"totalSubmissionRaw\": 47944, \"acRate\": \"39.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2587","questionFrontendId":"2502","title":"Design Memory Allocator","titleSlug":"design-memory-allocator","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.8K\", \"totalSubmission\": \"20.6K\", \"totalAcceptedRaw\": 10786, \"totalSubmissionRaw\": 20650, \"acRate\": \"52.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2588","questionFrontendId":"2503","title":"Maximum Number of Points From Grid Queries","titleSlug":"maximum-number-of-points-from-grid-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.2K\", \"totalSubmission\": \"16.6K\", \"totalAcceptedRaw\": 6160, \"totalSubmissionRaw\": 16650, \"acRate\": \"37.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2589","questionFrontendId":"2496","title":"Maximum Value of a String in an Array","titleSlug":"maximum-value-of-a-string-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.8K\", \"totalSubmission\": \"31.6K\", \"totalAcceptedRaw\": 22766, \"totalSubmissionRaw\": 31600, \"acRate\": \"72.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2590","questionFrontendId":"2497","title":"Maximum Star Sum of a Graph","titleSlug":"maximum-star-sum-of-a-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.6K\", \"totalSubmission\": \"30.2K\", \"totalAcceptedRaw\": 11609, \"totalSubmissionRaw\": 30211, \"acRate\": \"38.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2591","questionFrontendId":"2498","title":"Frog Jump II","titleSlug":"frog-jump-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.8K\", \"totalSubmission\": \"17.8K\", \"totalAcceptedRaw\": 10835, \"totalSubmissionRaw\": 17763, \"acRate\": \"61.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2592","questionFrontendId":"2499","title":"Minimum Total Cost to Make Arrays Unequal","titleSlug":"minimum-total-cost-to-make-arrays-unequal","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.7K\", \"totalSubmission\": \"6.1K\", \"totalAcceptedRaw\": 2671, \"totalSubmissionRaw\": 6054, \"acRate\": \"44.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2594","questionFrontendId":"2506","title":"Count Pairs Of Similar Strings","titleSlug":"count-pairs-of-similar-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.8K\", \"totalSubmission\": \"35.1K\", \"totalAcceptedRaw\": 24786, \"totalSubmissionRaw\": 35146, \"acRate\": \"70.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2598","questionFrontendId":"2515","title":"Shortest Distance to Target String in a Circular Array","titleSlug":"shortest-distance-to-target-string-in-a-circular-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.6K\", \"totalSubmission\": \"40.1K\", \"totalAcceptedRaw\": 19639, \"totalSubmissionRaw\": 40100, \"acRate\": \"49.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2600","questionFrontendId":"2517","title":"Maximum Tastiness of Candy Basket","titleSlug":"maximum-tastiness-of-candy-basket","translatedTitle":null,"stats":"{\"totalAccepted\": \"10K\", \"totalSubmission\": \"15.5K\", \"totalAcceptedRaw\": 10013, \"totalSubmissionRaw\": 15511, \"acRate\": \"64.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2601","questionFrontendId":"2518","title":"Number of Great Partitions","titleSlug":"number-of-great-partitions","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.1K\", \"totalSubmission\": \"15.5K\", \"totalAcceptedRaw\": 5107, \"totalSubmissionRaw\": 15514, \"acRate\": \"32.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2602","questionFrontendId":"2511","title":"Maximum Enemy Forts That Can Be Captured","titleSlug":"maximum-enemy-forts-that-can-be-captured","translatedTitle":null,"stats":"{\"totalAccepted\": \"15K\", \"totalSubmission\": \"40.3K\", \"totalAcceptedRaw\": 15046, \"totalSubmissionRaw\": 40260, \"acRate\": \"37.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2603","questionFrontendId":"2512","title":"Reward Top K Students","titleSlug":"reward-top-k-students","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.3K\", \"totalSubmission\": \"26.5K\", \"totalAcceptedRaw\": 12320, \"totalSubmissionRaw\": 26513, \"acRate\": \"46.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2604","questionFrontendId":"2541","title":"Minimum Operations to Make Array Equal II","titleSlug":"minimum-operations-to-make-array-equal-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.6K\", \"totalSubmission\": \"53.9K\", \"totalAcceptedRaw\": 16646, \"totalSubmissionRaw\": 53949, \"acRate\": \"30.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2606","questionFrontendId":"2482","title":"Difference Between Ones and Zeros in Row and Column","titleSlug":"difference-between-ones-and-zeros-in-row-and-column","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.6K\", \"totalSubmission\": \"20.8K\", \"totalAcceptedRaw\": 16555, \"totalSubmissionRaw\": 20756, \"acRate\": \"79.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2607","questionFrontendId":"2464","title":"Minimum Subarrays in a Valid Split","titleSlug":"minimum-subarrays-in-a-valid-split","translatedTitle":null,"stats":"{\"totalAccepted\": \"665\", \"totalSubmission\": \"1.2K\", \"totalAcceptedRaw\": 665, \"totalSubmissionRaw\": 1187, \"acRate\": \"56.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2609","questionFrontendId":"2521","title":"Distinct Prime Factors of Product of Array","titleSlug":"distinct-prime-factors-of-product-of-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.5K\", \"totalSubmission\": \"39.1K\", \"totalAcceptedRaw\": 19548, \"totalSubmissionRaw\": 39054, \"acRate\": \"50.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2612","questionFrontendId":"2473","title":"Minimum Cost to Buy Apples","titleSlug":"minimum-cost-to-buy-apples","translatedTitle":null,"stats":"{\"totalAccepted\": \"826\", \"totalSubmission\": \"1.3K\", \"totalAcceptedRaw\": 826, \"totalSubmissionRaw\": 1312, \"acRate\": \"63.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2614","questionFrontendId":"2529","title":"Maximum Count of Positive Integer and Negative Integer","titleSlug":"maximum-count-of-positive-integer-and-negative-integer","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.3K\", \"totalSubmission\": \"57.8K\", \"totalAcceptedRaw\": 43319, \"totalSubmissionRaw\": 57821, \"acRate\": \"74.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2616","questionFrontendId":"2530","title":"Maximal Score After Applying K Operations","titleSlug":"maximal-score-after-applying-k-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.8K\", \"totalSubmission\": \"47.9K\", \"totalAcceptedRaw\": 20769, \"totalSubmissionRaw\": 47930, \"acRate\": \"43.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2617","questionFrontendId":"2534","title":"Time Taken to Cross the Door","titleSlug":"time-taken-to-cross-the-door","translatedTitle":null,"stats":"{\"totalAccepted\": \"417\", \"totalSubmission\": \"591\", \"totalAcceptedRaw\": 417, \"totalSubmissionRaw\": 591, \"acRate\": \"70.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2618","questionFrontendId":"2528","title":"Maximize the Minimum Powered City","titleSlug":"maximize-the-minimum-powered-city","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"13.3K\", \"totalAcceptedRaw\": 4282, \"totalSubmissionRaw\": 13347, \"acRate\": \"32.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2621","questionFrontendId":"2527","title":"Find Xor-Beauty of Array","titleSlug":"find-xor-beauty-of-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.5K\", \"totalSubmission\": \"19.2K\", \"totalAcceptedRaw\": 13480, \"totalSubmissionRaw\": 19234, \"acRate\": \"70.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2624","questionFrontendId":"2535","title":"Difference Between Element Sum and Digit Sum of an Array","titleSlug":"difference-between-element-sum-and-digit-sum-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.3K\", \"totalSubmission\": \"60K\", \"totalAcceptedRaw\": 51322, \"totalSubmissionRaw\": 60025, \"acRate\": \"85.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2625","questionFrontendId":"2536","title":"Increment Submatrices by One","titleSlug":"increment-submatrices-by-one","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.5K\", \"totalSubmission\": \"34.1K\", \"totalAcceptedRaw\": 16463, \"totalSubmissionRaw\": 34096, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2626","questionFrontendId":"2537","title":"Count the Number of Good Subarrays","titleSlug":"count-the-number-of-good-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 11735, \"totalSubmissionRaw\": 24498, \"acRate\": \"47.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2627","questionFrontendId":"2538","title":"Difference Between Maximum and Minimum Price Sum","titleSlug":"difference-between-maximum-and-minimum-price-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.9K\", \"totalSubmission\": \"14.1K\", \"totalAcceptedRaw\": 4922, \"totalSubmissionRaw\": 14131, \"acRate\": \"34.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2631","questionFrontendId":"2545","title":"Sort the Students by Their Kth Score","titleSlug":"sort-the-students-by-their-kth-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.2K\", \"totalSubmission\": \"32.8K\", \"totalAcceptedRaw\": 28199, \"totalSubmissionRaw\": 32847, \"acRate\": \"85.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2633","questionFrontendId":"2547","title":"Minimum Cost to Split an Array","titleSlug":"minimum-cost-to-split-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.3K\", \"totalSubmission\": \"21.5K\", \"totalAcceptedRaw\": 8326, \"totalSubmissionRaw\": 21453, \"acRate\": \"38.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2634","questionFrontendId":"2540","title":"Minimum Common Value","titleSlug":"minimum-common-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.6K\", \"totalSubmission\": \"57.2K\", \"totalAcceptedRaw\": 29563, \"totalSubmissionRaw\": 57239, \"acRate\": \"51.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2636","questionFrontendId":"2542","title":"Maximum Subsequence Score","titleSlug":"maximum-subsequence-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.7K\", \"totalSubmission\": \"20.3K\", \"totalAcceptedRaw\": 7704, \"totalSubmissionRaw\": 20288, \"acRate\": \"38.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2638","questionFrontendId":"2495","title":"Number of Subarrays Having Even Product","titleSlug":"number-of-subarrays-having-even-product","translatedTitle":null,"stats":"{\"totalAccepted\": \"930\", \"totalSubmission\": \"1.4K\", \"totalAcceptedRaw\": 930, \"totalSubmissionRaw\": 1419, \"acRate\": \"65.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2639","questionFrontendId":"2553","title":"Separate the Digits in an Array","titleSlug":"separate-the-digits-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.6K\", \"totalSubmission\": \"38.5K\", \"totalAcceptedRaw\": 30614, \"totalSubmissionRaw\": 38480, \"acRate\": \"79.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2640","questionFrontendId":"2554","title":"Maximum Number of Integers to Choose From a Range I","titleSlug":"maximum-number-of-integers-to-choose-from-a-range-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.7K\", \"totalSubmission\": \"39.5K\", \"totalAcceptedRaw\": 20691, \"totalSubmissionRaw\": 39493, \"acRate\": \"52.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2641","questionFrontendId":"2556","title":"Disconnect Path in a Binary Matrix by at Most One Flip","titleSlug":"disconnect-path-in-a-binary-matrix-by-at-most-one-flip","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.2K\", \"totalSubmission\": \"28.7K\", \"totalAcceptedRaw\": 8192, \"totalSubmissionRaw\": 28713, \"acRate\": \"28.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2642","questionFrontendId":"2532","title":"Time to Cross a Bridge","titleSlug":"time-to-cross-a-bridge","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"5.5K\", \"totalAcceptedRaw\": 2945, \"totalSubmissionRaw\": 5495, \"acRate\": \"53.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2644","questionFrontendId":"2505","title":"Bitwise OR of All Subsequence Sums","titleSlug":"bitwise-or-of-all-subsequence-sums","translatedTitle":null,"stats":"{\"totalAccepted\": \"555\", \"totalSubmission\": \"930\", \"totalAcceptedRaw\": 555, \"totalSubmissionRaw\": 930, \"acRate\": \"59.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2647","questionFrontendId":"2584","title":"Split the Array to Make Coprime Products","titleSlug":"split-the-array-to-make-coprime-products","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.9K\", \"totalSubmission\": \"36.2K\", \"totalAcceptedRaw\": 7936, \"totalSubmissionRaw\": 36240, \"acRate\": \"21.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2648","questionFrontendId":"2585","title":"Number of Ways to Earn Points","titleSlug":"number-of-ways-to-earn-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 8627, \"totalSubmissionRaw\": 14387, \"acRate\": \"60.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2651","questionFrontendId":"2580","title":"Count Ways to Group Overlapping Ranges","titleSlug":"count-ways-to-group-overlapping-ranges","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"30.8K\", \"totalAcceptedRaw\": 10636, \"totalSubmissionRaw\": 30783, \"acRate\": \"34.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2653","questionFrontendId":"2510","title":"Check if There is a Path With Equal Number of 0's And 1's","titleSlug":"check-if-there-is-a-path-with-equal-number-of-0s-and-1s","translatedTitle":null,"stats":"{\"totalAccepted\": \"952\", \"totalSubmission\": \"1.7K\", \"totalAcceptedRaw\": 952, \"totalSubmissionRaw\": 1717, \"acRate\": \"55.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2654","questionFrontendId":"2586","title":"Count the Number of Vowel Strings in Range","titleSlug":"count-the-number-of-vowel-strings-in-range","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.1K\", \"totalSubmission\": \"26.7K\", \"totalAcceptedRaw\": 21074, \"totalSubmissionRaw\": 26656, \"acRate\": \"79.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2655","questionFrontendId":"2587","title":"Rearrange Array to Maximize Prefix Score","titleSlug":"rearrange-array-to-maximize-prefix-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.1K\", \"totalSubmission\": \"46.3K\", \"totalAcceptedRaw\": 18144, \"totalSubmissionRaw\": 46316, \"acRate\": \"39.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2656","questionFrontendId":"2588","title":"Count the Number of Beautiful Subarrays","titleSlug":"count-the-number-of-beautiful-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.4K\", \"totalSubmission\": \"21.3K\", \"totalAcceptedRaw\": 10374, \"totalSubmissionRaw\": 21316, \"acRate\": \"48.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2657","questionFrontendId":"2589","title":"Minimum Time to Complete All Tasks","titleSlug":"minimum-time-to-complete-all-tasks","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"12.6K\", \"totalAcceptedRaw\": 4351, \"totalSubmissionRaw\": 12553, \"acRate\": \"34.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2658","questionFrontendId":"2519","title":"Count the Number of K-Big Indices","titleSlug":"count-the-number-of-k-big-indices","translatedTitle":null,"stats":"{\"totalAccepted\": \"565\", \"totalSubmission\": \"879\", \"totalAcceptedRaw\": 565, \"totalSubmissionRaw\": 879, \"acRate\": \"64.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2667","questionFrontendId":"2524","title":"Maximum Frequency Score of a Subarray","titleSlug":"maximum-frequency-score-of-a-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"530\", \"totalSubmission\": \"1.3K\", \"totalAcceptedRaw\": 530, \"totalSubmissionRaw\": 1318, \"acRate\": \"40.2%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2673","questionFrontendId":"2555","title":"Maximize Win From Two Segments","titleSlug":"maximize-win-from-two-segments","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"20.8K\", \"totalAcceptedRaw\": 6279, \"totalSubmissionRaw\": 20844, \"acRate\": \"30.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2679","questionFrontendId":"2549","title":"Count Distinct Numbers on Board","titleSlug":"count-distinct-numbers-on-board","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.9K\", \"totalSubmission\": \"43.3K\", \"totalAcceptedRaw\": 25882, \"totalSubmissionRaw\": 43263, \"acRate\": \"59.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2681","questionFrontendId":"2551","title":"Put Marbles in Bags","titleSlug":"put-marbles-in-bags","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"16.3K\", \"totalAcceptedRaw\": 8604, \"totalSubmissionRaw\": 16291, \"acRate\": \"52.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2682","questionFrontendId":"2552","title":"Count Increasing Quadruplets","titleSlug":"count-increasing-quadruplets","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.7K\", \"totalSubmission\": \"15K\", \"totalAcceptedRaw\": 4706, \"totalSubmissionRaw\": 14981, \"acRate\": \"31.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2689","questionFrontendId":"2561","title":"Rearranging Fruits","titleSlug":"rearranging-fruits","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"18K\", \"totalAcceptedRaw\": 6138, \"totalSubmissionRaw\": 17961, \"acRate\": \"34.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2690","questionFrontendId":"2560","title":"House Robber IV","titleSlug":"house-robber-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.9K\", \"totalSubmission\": \"25K\", \"totalAcceptedRaw\": 9902, \"totalSubmissionRaw\": 25000, \"acRate\": \"39.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2691","questionFrontendId":"2559","title":"Count Vowel Strings in Ranges","titleSlug":"count-vowel-strings-in-ranges","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.5K\", \"totalSubmission\": \"38K\", \"totalAcceptedRaw\": 19465, \"totalSubmissionRaw\": 37955, \"acRate\": \"51.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2692","questionFrontendId":"2558","title":"Take Gifts From the Richest Pile","titleSlug":"take-gifts-from-the-richest-pile","translatedTitle":null,"stats":"{\"totalAccepted\": \"26K\", \"totalSubmission\": \"39.2K\", \"totalAcceptedRaw\": 26024, \"totalSubmissionRaw\": 39205, \"acRate\": \"66.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2693","questionFrontendId":"2548","title":"Maximum Price to Fill a Bag","titleSlug":"maximum-price-to-fill-a-bag","translatedTitle":null,"stats":"{\"totalAccepted\": \"699\", \"totalSubmission\": \"1K\", \"totalAcceptedRaw\": 699, \"totalSubmissionRaw\": 1013, \"acRate\": \"69.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2698","questionFrontendId":"2562","title":"Find the Array Concatenation Value","titleSlug":"find-the-array-concatenation-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.8K\", \"totalSubmission\": \"39.9K\", \"totalAcceptedRaw\": 27803, \"totalSubmissionRaw\": 39889, \"acRate\": \"69.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2699","questionFrontendId":"2563","title":"Count the Number of Fair Pairs","titleSlug":"count-the-number-of-fair-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.4K\", \"totalSubmission\": \"51.5K\", \"totalAcceptedRaw\": 16374, \"totalSubmissionRaw\": 51502, \"acRate\": \"31.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2700","questionFrontendId":"2564","title":"Substring XOR Queries","titleSlug":"substring-xor-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.3K\", \"totalSubmission\": \"27.8K\", \"totalAcceptedRaw\": 9300, \"totalSubmissionRaw\": 27784, \"acRate\": \"33.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2702","questionFrontendId":"2557","title":"Maximum Number of Integers to Choose From a Range II","titleSlug":"maximum-number-of-integers-to-choose-from-a-range-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"682\", \"totalSubmission\": \"1.5K\", \"totalAcceptedRaw\": 682, \"totalSubmissionRaw\": 1491, \"acRate\": \"45.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2703","questionFrontendId":"2569","title":"Handling Sum Queries After Update","titleSlug":"handling-sum-queries-after-update","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"11.9K\", \"totalAcceptedRaw\": 3053, \"totalSubmissionRaw\": 11907, \"acRate\": \"25.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2705","questionFrontendId":"2568","title":"Minimum Impossible OR","titleSlug":"minimum-impossible-or","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.7K\", \"totalSubmission\": \"18.8K\", \"totalAcceptedRaw\": 10737, \"totalSubmissionRaw\": 18771, \"acRate\": \"57.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2706","questionFrontendId":"2567","title":"Minimum Score by Changing Two Elements","titleSlug":"minimum-score-by-changing-two-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.4K\", \"totalSubmission\": \"26.1K\", \"totalAcceptedRaw\": 12419, \"totalSubmissionRaw\": 26129, \"acRate\": \"47.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2707","questionFrontendId":"2570","title":"Merge Two 2D Arrays by Summing Values","titleSlug":"merge-two-2d-arrays-by-summing-values","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.7K\", \"totalSubmission\": \"29.7K\", \"totalAcceptedRaw\": 21656, \"totalSubmissionRaw\": 29667, \"acRate\": \"73.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2709","questionFrontendId":"2572","title":"Count the Number of Square-Free Subsets","titleSlug":"count-the-number-of-square-free-subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"22.7K\", \"totalAcceptedRaw\": 4600, \"totalSubmissionRaw\": 22696, \"acRate\": \"20.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2711","questionFrontendId":"2577","title":"Minimum Time to Visit a Cell In a Grid","titleSlug":"minimum-time-to-visit-a-cell-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"16.6K\", \"totalAcceptedRaw\": 5905, \"totalSubmissionRaw\": 16633, \"acRate\": \"35.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2712","questionFrontendId":"2576","title":"Find the Maximum Number of Marked Indices","titleSlug":"find-the-maximum-number-of-marked-indices","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.1K\", \"totalSubmission\": \"35.2K\", \"totalAcceptedRaw\": 13091, \"totalSubmissionRaw\": 35197, \"acRate\": \"37.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2713","questionFrontendId":"2575","title":"Find the Divisibility Array of a String","titleSlug":"find-the-divisibility-array-of-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.8K\", \"totalSubmission\": \"60.8K\", \"totalAcceptedRaw\": 18753, \"totalSubmissionRaw\": 60764, \"acRate\": \"30.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2714","questionFrontendId":"2574","title":"Left and Right Sum Differences","titleSlug":"left-and-right-sum-differences","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.6K\", \"totalSubmission\": \"36.8K\", \"totalAcceptedRaw\": 32614, \"totalSubmissionRaw\": 36758, \"acRate\": \"88.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/tmp/backtracking-graphql.json b/tmp/backtracking-graphql.json
new file mode 100644
index 000000000..d1e4dbf8f
--- /dev/null
+++ b/tmp/backtracking-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"Backtracking","translatedName":null,"slug":"backtracking","questions":[{"status":null,"questionId":"17","questionFrontendId":"17","title":"Letter Combinations of a Phone Number","titleSlug":"letter-combinations-of-a-phone-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5M\", \"totalSubmission\": \"2.7M\", \"totalAcceptedRaw\": 1503848, \"totalSubmissionRaw\": 2665165, \"acRate\": \"56.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"22","questionFrontendId":"22","title":"Generate Parentheses","titleSlug":"generate-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 1352114, \"totalSubmissionRaw\": 1866646, \"acRate\": \"72.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"37","questionFrontendId":"37","title":"Sudoku Solver","titleSlug":"sudoku-solver","translatedTitle":null,"stats":"{\"totalAccepted\": \"444.1K\", \"totalSubmission\": \"771.6K\", \"totalAcceptedRaw\": 444094, \"totalSubmissionRaw\": 771588, \"acRate\": \"57.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"39","questionFrontendId":"39","title":"Combination Sum","titleSlug":"combination-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 1417523, \"totalSubmissionRaw\": 2069175, \"acRate\": \"68.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"40","questionFrontendId":"40","title":"Combination Sum II","titleSlug":"combination-sum-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"718.7K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 718708, \"totalSubmissionRaw\": 1345776, \"acRate\": \"53.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"46","questionFrontendId":"46","title":"Permutations","titleSlug":"permutations","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5M\", \"totalSubmission\": \"2M\", \"totalAcceptedRaw\": 1523085, \"totalSubmissionRaw\": 2015200, \"acRate\": \"75.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"47","questionFrontendId":"47","title":"Permutations II","titleSlug":"permutations-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"767.3K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 767320, \"totalSubmissionRaw\": 1339334, \"acRate\": \"57.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"51","questionFrontendId":"51","title":"N-Queens","titleSlug":"n-queens","translatedTitle":null,"stats":"{\"totalAccepted\": \"523.9K\", \"totalSubmission\": \"817.9K\", \"totalAcceptedRaw\": 523860, \"totalSubmissionRaw\": 817937, \"acRate\": \"64.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"52","questionFrontendId":"52","title":"N-Queens II","titleSlug":"n-queens-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"302.6K\", \"totalSubmission\": \"422.9K\", \"totalAcceptedRaw\": 302582, \"totalSubmissionRaw\": 422897, \"acRate\": \"71.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"77","questionFrontendId":"77","title":"Combinations","titleSlug":"combinations","translatedTitle":null,"stats":"{\"totalAccepted\": \"648.8K\", \"totalSubmission\": \"970K\", \"totalAcceptedRaw\": 648789, \"totalSubmissionRaw\": 969989, \"acRate\": \"66.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"78","questionFrontendId":"78","title":"Subsets","titleSlug":"subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 1396111, \"totalSubmissionRaw\": 1866728, \"acRate\": \"74.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"79","questionFrontendId":"79","title":"Word Search","titleSlug":"word-search","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"3.1M\", \"totalAcceptedRaw\": 1243447, \"totalSubmissionRaw\": 3092559, \"acRate\": \"40.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"89","questionFrontendId":"89","title":"Gray Code","titleSlug":"gray-code","translatedTitle":null,"stats":"{\"totalAccepted\": \"258.2K\", \"totalSubmission\": \"452.4K\", \"totalAcceptedRaw\": 258170, \"totalSubmissionRaw\": 452378, \"acRate\": \"57.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"90","questionFrontendId":"90","title":"Subsets II","titleSlug":"subsets-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"675.4K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 675418, \"totalSubmissionRaw\": 1210151, \"acRate\": \"55.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"93","questionFrontendId":"93","title":"Restore IP Addresses","titleSlug":"restore-ip-addresses","translatedTitle":null,"stats":"{\"totalAccepted\": \"394.7K\", \"totalSubmission\": \"834.5K\", \"totalAcceptedRaw\": 394708, \"totalSubmissionRaw\": 834455, \"acRate\": \"47.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"95","questionFrontendId":"95","title":"Unique Binary Search Trees II","titleSlug":"unique-binary-search-trees-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"347.9K\", \"totalSubmission\": \"665.5K\", \"totalAcceptedRaw\": 347904, \"totalSubmissionRaw\": 665456, \"acRate\": \"52.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"113","questionFrontendId":"113","title":"Path Sum II","titleSlug":"path-sum-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"730K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 730033, \"totalSubmissionRaw\": 1279923, \"acRate\": \"57.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"126","questionFrontendId":"126","title":"Word Ladder II","titleSlug":"word-ladder-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"339.2K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 339186, \"totalSubmissionRaw\": 1232948, \"acRate\": \"27.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"131","questionFrontendId":"131","title":"Palindrome Partitioning","titleSlug":"palindrome-partitioning","translatedTitle":null,"stats":"{\"totalAccepted\": \"624.6K\", \"totalSubmission\": \"964.7K\", \"totalAcceptedRaw\": 624593, \"totalSubmissionRaw\": 964712, \"acRate\": \"64.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"140","questionFrontendId":"140","title":"Word Break II","titleSlug":"word-break-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"507.3K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 507264, \"totalSubmissionRaw\": 1122470, \"acRate\": \"45.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"212","questionFrontendId":"212","title":"Word Search II","titleSlug":"word-search-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"547.8K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 547761, \"totalSubmissionRaw\": 1501670, \"acRate\": \"36.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"216","questionFrontendId":"216","title":"Combination Sum III","titleSlug":"combination-sum-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"391.2K\", \"totalSubmission\": \"579.1K\", \"totalAcceptedRaw\": 391236, \"totalSubmissionRaw\": 579069, \"acRate\": \"67.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"254","questionFrontendId":"254","title":"Factor Combinations","titleSlug":"factor-combinations","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.4K\", \"totalSubmission\": \"243.4K\", \"totalAcceptedRaw\": 119429, \"totalSubmissionRaw\": 243415, \"acRate\": \"49.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"257","questionFrontendId":"257","title":"Binary Tree Paths","titleSlug":"binary-tree-paths","translatedTitle":null,"stats":"{\"totalAccepted\": \"603.6K\", \"totalSubmission\": \"984.7K\", \"totalAcceptedRaw\": 603639, \"totalSubmissionRaw\": 984698, \"acRate\": \"61.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"267","questionFrontendId":"267","title":"Palindrome Permutation II","titleSlug":"palindrome-permutation-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"60.9K\", \"totalSubmission\": \"149.7K\", \"totalAcceptedRaw\": 60906, \"totalSubmissionRaw\": 149659, \"acRate\": \"40.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"282","questionFrontendId":"282","title":"Expression Add Operators","titleSlug":"expression-add-operators","translatedTitle":null,"stats":"{\"totalAccepted\": \"197.5K\", \"totalSubmission\": \"503.7K\", \"totalAcceptedRaw\": 197479, \"totalSubmissionRaw\": 503690, \"acRate\": \"39.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"291","questionFrontendId":"291","title":"Word Pattern II","titleSlug":"word-pattern-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"67K\", \"totalSubmission\": \"142.3K\", \"totalAcceptedRaw\": 66973, \"totalSubmissionRaw\": 142304, \"acRate\": \"47.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"294","questionFrontendId":"294","title":"Flip Game II","titleSlug":"flip-game-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.4K\", \"totalSubmission\": \"129.8K\", \"totalAcceptedRaw\": 67351, \"totalSubmissionRaw\": 129839, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"301","questionFrontendId":"301","title":"Remove Invalid Parentheses","titleSlug":"remove-invalid-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"378.8K\", \"totalSubmission\": \"802.9K\", \"totalAcceptedRaw\": 378847, \"totalSubmissionRaw\": 802924, \"acRate\": \"47.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"306","questionFrontendId":"306","title":"Additive Number","titleSlug":"additive-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"78K\", \"totalSubmission\": \"251.4K\", \"totalAcceptedRaw\": 78048, \"totalSubmissionRaw\": 251412, \"acRate\": \"31.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"320","questionFrontendId":"320","title":"Generalized Abbreviation","titleSlug":"generalized-abbreviation","translatedTitle":null,"stats":"{\"totalAccepted\": \"65K\", \"totalSubmission\": \"112.8K\", \"totalAcceptedRaw\": 65030, \"totalSubmissionRaw\": 112833, \"acRate\": \"57.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"351","questionFrontendId":"351","title":"Android Unlock Patterns","titleSlug":"android-unlock-patterns","translatedTitle":null,"stats":"{\"totalAccepted\": \"68.8K\", \"totalSubmission\": \"133.6K\", \"totalAcceptedRaw\": 68757, \"totalSubmissionRaw\": 133570, \"acRate\": \"51.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"357","questionFrontendId":"357","title":"Count Numbers with Unique Digits","titleSlug":"count-numbers-with-unique-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"115.8K\", \"totalSubmission\": \"223.5K\", \"totalAcceptedRaw\": 115821, \"totalSubmissionRaw\": 223547, \"acRate\": \"51.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"401","questionFrontendId":"401","title":"Binary Watch","titleSlug":"binary-watch","translatedTitle":null,"stats":"{\"totalAccepted\": \"122.9K\", \"totalSubmission\": \"235.6K\", \"totalAcceptedRaw\": 122896, \"totalSubmissionRaw\": 235581, \"acRate\": \"52.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"411","questionFrontendId":"411","title":"Minimum Unique Word Abbreviation","titleSlug":"minimum-unique-word-abbreviation","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"36K\", \"totalAcceptedRaw\": 14181, \"totalSubmissionRaw\": 35994, \"acRate\": \"39.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"425","questionFrontendId":"425","title":"Word Squares","titleSlug":"word-squares","translatedTitle":null,"stats":"{\"totalAccepted\": \"69.2K\", \"totalSubmission\": \"131.1K\", \"totalAcceptedRaw\": 69203, \"totalSubmissionRaw\": 131137, \"acRate\": \"52.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"465","questionFrontendId":"465","title":"Optimal Account Balancing","titleSlug":"optimal-account-balancing","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.1K\", \"totalSubmission\": \"158.6K\", \"totalAcceptedRaw\": 78082, \"totalSubmissionRaw\": 158560, \"acRate\": \"49.2%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"473","questionFrontendId":"473","title":"Matchsticks to Square","titleSlug":"matchsticks-to-square","translatedTitle":null,"stats":"{\"totalAccepted\": \"139K\", \"totalSubmission\": \"345.8K\", \"totalAcceptedRaw\": 139023, \"totalSubmissionRaw\": 345797, \"acRate\": \"40.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"491","questionFrontendId":"491","title":"Non-decreasing Subsequences","titleSlug":"non-decreasing-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"146.6K\", \"totalSubmission\": \"243.8K\", \"totalAcceptedRaw\": 146564, \"totalSubmissionRaw\": 243806, \"acRate\": \"60.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"494","questionFrontendId":"494","title":"Target Sum","titleSlug":"target-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"445.3K\", \"totalSubmission\": \"975.3K\", \"totalAcceptedRaw\": 445323, \"totalSubmissionRaw\": 975251, \"acRate\": \"45.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"526","questionFrontendId":"526","title":"Beautiful Arrangement","titleSlug":"beautiful-arrangement","translatedTitle":null,"stats":"{\"totalAccepted\": \"149.6K\", \"totalSubmission\": \"232K\", \"totalAcceptedRaw\": 149569, \"totalSubmissionRaw\": 232039, \"acRate\": \"64.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"638","questionFrontendId":"638","title":"Shopping Offers","titleSlug":"shopping-offers","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.1K\", \"totalSubmission\": \"97.6K\", \"totalAcceptedRaw\": 52064, \"totalSubmissionRaw\": 97609, \"acRate\": \"53.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"679","questionFrontendId":"679","title":"24 Game","titleSlug":"24-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.5K\", \"totalSubmission\": \"143.4K\", \"totalAcceptedRaw\": 70519, \"totalSubmissionRaw\": 143429, \"acRate\": \"49.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"691","questionFrontendId":"691","title":"Stickers to Spell Word","titleSlug":"stickers-to-spell-word","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.2K\", \"totalSubmission\": \"80.4K\", \"totalAcceptedRaw\": 37219, \"totalSubmissionRaw\": 80424, \"acRate\": \"46.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"698","questionFrontendId":"698","title":"Partition to K Equal Sum Subsets","titleSlug":"partition-to-k-equal-sum-subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"232.1K\", \"totalSubmission\": \"579K\", \"totalAcceptedRaw\": 232079, \"totalSubmissionRaw\": 578988, \"acRate\": \"40.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"800","questionFrontendId":"784","title":"Letter Case Permutation","titleSlug":"letter-case-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"266.4K\", \"totalSubmission\": \"361.1K\", \"totalAcceptedRaw\": 266409, \"totalSubmissionRaw\": 361088, \"acRate\": \"73.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"813","questionFrontendId":"797","title":"All Paths From Source to Target","titleSlug":"all-paths-from-source-to-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"425.3K\", \"totalSubmission\": \"517K\", \"totalAcceptedRaw\": 425277, \"totalSubmissionRaw\": 517003, \"acRate\": \"82.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"834","questionFrontendId":"816","title":"Ambiguous Coordinates","titleSlug":"ambiguous-coordinates","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.5K\", \"totalSubmission\": \"48.8K\", \"totalAcceptedRaw\": 27495, \"totalSubmissionRaw\": 48839, \"acRate\": \"56.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"865","questionFrontendId":"489","title":"Robot Room Cleaner","titleSlug":"robot-room-cleaner","translatedTitle":null,"stats":"{\"totalAccepted\": \"142.7K\", \"totalSubmission\": \"186.3K\", \"totalAcceptedRaw\": 142690, \"totalSubmissionRaw\": 186321, \"acRate\": \"76.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"872","questionFrontendId":"842","title":"Split Array into Fibonacci Sequence","titleSlug":"split-array-into-fibonacci-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"35K\", \"totalSubmission\": \"91K\", \"totalAcceptedRaw\": 34959, \"totalSubmissionRaw\": 91038, \"acRate\": \"38.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1007","questionFrontendId":"967","title":"Numbers With Same Consecutive Differences","titleSlug":"numbers-with-same-consecutive-differences","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.1K\", \"totalSubmission\": \"207.5K\", \"totalAcceptedRaw\": 119143, \"totalSubmissionRaw\": 207546, \"acRate\": \"57.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1022","questionFrontendId":"980","title":"Unique Paths III","titleSlug":"unique-paths-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"172.2K\", \"totalSubmission\": \"210.3K\", \"totalAcceptedRaw\": 172206, \"totalSubmissionRaw\": 210334, \"acRate\": \"81.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1038","questionFrontendId":"996","title":"Number of Squareful Arrays","titleSlug":"number-of-squareful-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.6K\", \"totalSubmission\": \"62.2K\", \"totalAcceptedRaw\": 30618, \"totalSubmissionRaw\": 62202, \"acRate\": \"49.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1067","questionFrontendId":"1066","title":"Campus Bikes II","titleSlug":"campus-bikes-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.4K\", \"totalSubmission\": \"81K\", \"totalAcceptedRaw\": 44444, \"totalSubmissionRaw\": 80995, \"acRate\": \"54.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1076","questionFrontendId":"1087","title":"Brace Expansion","titleSlug":"brace-expansion","translatedTitle":null,"stats":"{\"totalAccepted\": \"47.4K\", \"totalSubmission\": \"71.6K\", \"totalAcceptedRaw\": 47375, \"totalSubmissionRaw\": 71592, \"acRate\": \"66.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1077","questionFrontendId":"1088","title":"Confusing Number II","titleSlug":"confusing-number-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.5K\", \"totalSubmission\": \"75.2K\", \"totalAcceptedRaw\": 35546, \"totalSubmissionRaw\": 75226, \"acRate\": \"47.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1151","questionFrontendId":"1215","title":"Stepping Numbers","titleSlug":"stepping-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.3K\", \"totalSubmission\": \"17.9K\", \"totalAcceptedRaw\": 8270, \"totalSubmissionRaw\": 17899, \"acRate\": \"46.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1160","questionFrontendId":"1079","title":"Letter Tile Possibilities","titleSlug":"letter-tile-possibilities","translatedTitle":null,"stats":"{\"totalAccepted\": \"83.1K\", \"totalSubmission\": \"109.3K\", \"totalAcceptedRaw\": 83056, \"totalSubmissionRaw\": 109302, \"acRate\": \"76.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1188","questionFrontendId":"1096","title":"Brace Expansion II","titleSlug":"brace-expansion-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.1K\", \"totalSubmission\": \"34.8K\", \"totalAcceptedRaw\": 22075, \"totalSubmissionRaw\": 34791, \"acRate\": \"63.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1191","questionFrontendId":"1258","title":"Synonymous Sentences","titleSlug":"synonymous-sentences","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.9K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 18944, \"totalSubmissionRaw\": 33431, \"acRate\": \"56.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1211","questionFrontendId":"1286","title":"Iterator for Combination","titleSlug":"iterator-for-combination","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.4K\", \"totalSubmission\": \"91.9K\", \"totalAcceptedRaw\": 67366, \"totalSubmissionRaw\": 91860, \"acRate\": \"73.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Iterator","translatedName":null,"slug":"iterator","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1331","questionFrontendId":"1219","title":"Path with Maximum Gold","titleSlug":"path-with-maximum-gold","translatedTitle":null,"stats":"{\"totalAccepted\": \"98.3K\", \"totalSubmission\": \"154.3K\", \"totalAcceptedRaw\": 98323, \"totalSubmissionRaw\": 154271, \"acRate\": \"63.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1359","questionFrontendId":"1238","title":"Circular Permutation in Binary Representation","titleSlug":"circular-permutation-in-binary-representation","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.6K\", \"totalSubmission\": \"21.2K\", \"totalAcceptedRaw\": 14582, \"totalSubmissionRaw\": 21201, \"acRate\": \"68.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1360","questionFrontendId":"1239","title":"Maximum Length of a Concatenated String with Unique Characters","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"170.2K\", \"totalSubmission\": \"326.2K\", \"totalAcceptedRaw\": 170160, \"totalSubmissionRaw\": 326223, \"acRate\": \"52.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1361","questionFrontendId":"1240","title":"Tiling a Rectangle with the Fewest Squares","titleSlug":"tiling-a-rectangle-with-the-fewest-squares","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"39.2K\", \"totalAcceptedRaw\": 21172, \"totalSubmissionRaw\": 39214, \"acRate\": \"54.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1381","questionFrontendId":"1255","title":"Maximum Score Words Formed by Letters","titleSlug":"maximum-score-words-formed-by-letters","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.3K\", \"totalSubmission\": \"40.4K\", \"totalAcceptedRaw\": 29283, \"totalSubmissionRaw\": 40433, \"acRate\": \"72.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1418","questionFrontendId":"2305","title":"Fair Distribution of Cookies","titleSlug":"fair-distribution-of-cookies","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"36K\", \"totalAcceptedRaw\": 22289, \"totalSubmissionRaw\": 36014, \"acRate\": \"61.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1429","questionFrontendId":"1307","title":"Verbal Arithmetic Puzzle","titleSlug":"verbal-arithmetic-puzzle","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"31.1K\", \"totalAcceptedRaw\": 10646, \"totalSubmissionRaw\": 31144, \"acRate\": \"34.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1516","questionFrontendId":"1415","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"31K\", \"totalSubmission\": \"42.9K\", \"totalAcceptedRaw\": 31044, \"totalSubmissionRaw\": 42854, \"acRate\": \"72.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1577","questionFrontendId":"1467","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"7K\", \"totalSubmission\": \"11.6K\", \"totalAcceptedRaw\": 7024, \"totalSubmissionRaw\": 11561, \"acRate\": \"60.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Probability and Statistics","translatedName":null,"slug":"probability-and-statistics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1715","questionFrontendId":"1593","title":"Split a String Into the Max Number of Unique Substrings","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.3K\", \"totalSubmission\": \"45.8K\", \"totalAcceptedRaw\": 25313, \"totalSubmissionRaw\": 45758, \"acRate\": \"55.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1723","questionFrontendId":"1601","title":"Maximum Number of Achievable Transfer Requests","titleSlug":"maximum-number-of-achievable-transfer-requests","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"17.9K\", \"totalAcceptedRaw\": 9170, \"totalSubmissionRaw\": 17924, \"acRate\": \"51.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1758","questionFrontendId":"1655","title":"Distribute Repeating Integers","titleSlug":"distribute-repeating-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.2K\", \"totalSubmission\": \"26.1K\", \"totalAcceptedRaw\": 10163, \"totalSubmissionRaw\": 26134, \"acRate\": \"38.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1819","questionFrontendId":"1718","title":"Construct the Lexicographically Largest Valid Sequence","titleSlug":"construct-the-lexicographically-largest-valid-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"20.3K\", \"totalAcceptedRaw\": 10563, \"totalSubmissionRaw\": 20333, \"acRate\": \"52.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1825","questionFrontendId":"1723","title":"Find Minimum Time to Finish All Jobs","titleSlug":"find-minimum-time-to-finish-all-jobs","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.3K\", \"totalSubmission\": \"47.7K\", \"totalAcceptedRaw\": 20251, \"totalSubmissionRaw\": 47657, \"acRate\": \"42.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1900","questionFrontendId":"1774","title":"Closest Dessert Cost","titleSlug":"closest-dessert-cost","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.5K\", \"totalSubmission\": \"51.8K\", \"totalAcceptedRaw\": 24532, \"totalSubmissionRaw\": 51757, \"acRate\": \"47.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1906","questionFrontendId":"1799","title":"Maximize Score After N Operations","titleSlug":"maximize-score-after-n-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.9K\", \"totalSubmission\": \"34.5K\", \"totalAcceptedRaw\": 15865, \"totalSubmissionRaw\": 34490, \"acRate\": \"46.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1969","questionFrontendId":"1820","title":"Maximum Number of Accepted Invitations","titleSlug":"maximum-number-of-accepted-invitations","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.2K\", \"totalSubmission\": \"10.6K\", \"totalAcceptedRaw\": 5234, \"totalSubmissionRaw\": 10568, \"acRate\": \"49.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1976","questionFrontendId":"1849","title":"Splitting a String Into Descending Consecutive Values","titleSlug":"splitting-a-string-into-descending-consecutive-values","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.8K\", \"totalSubmission\": \"56.7K\", \"totalAcceptedRaw\": 18772, \"totalSubmissionRaw\": 56697, \"acRate\": \"33.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1993","questionFrontendId":"1863","title":"Sum of All Subset XOR Totals","titleSlug":"sum-of-all-subset-xor-totals","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.4K\", \"totalSubmission\": \"64.4K\", \"totalAcceptedRaw\": 51448, \"totalSubmissionRaw\": 64365, \"acRate\": \"79.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2078","questionFrontendId":"1947","title":"Maximum Compatibility Score Sum","titleSlug":"maximum-compatibility-score-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.1K\", \"totalSubmission\": \"31.3K\", \"totalAcceptedRaw\": 19085, \"totalSubmissionRaw\": 31295, \"acRate\": \"61.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2107","questionFrontendId":"1980","title":"Find Unique Binary String","titleSlug":"find-unique-binary-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.3K\", \"totalSubmission\": \"54.1K\", \"totalAcceptedRaw\": 35270, \"totalSubmissionRaw\": 54138, \"acRate\": \"65.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2114","questionFrontendId":"1986","title":"Minimum Number of Work Sessions to Finish the Tasks","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.3K\", \"totalSubmission\": \"59.1K\", \"totalAcceptedRaw\": 19336, \"totalSubmissionRaw\": 59096, \"acRate\": \"32.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2130","questionFrontendId":"2002","title":"Maximum Product of the Length of Two Palindromic Subsequences","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.3K\", \"totalSubmission\": \"31.9K\", \"totalAcceptedRaw\": 17337, \"totalSubmissionRaw\": 31860, \"acRate\": \"54.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2140","questionFrontendId":"2014","title":"Longest Subsequence Repeated k Times","titleSlug":"longest-subsequence-repeated-k-times","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"10.3K\", \"totalAcceptedRaw\": 5701, \"totalSubmissionRaw\": 10257, \"acRate\": \"55.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2166","questionFrontendId":"2056","title":"Number of Valid Move Combinations On Chessboard","titleSlug":"number-of-valid-move-combinations-on-chessboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.4K\", \"totalSubmission\": \"5.8K\", \"totalAcceptedRaw\": 3374, \"totalSubmissionRaw\": 5804, \"acRate\": \"58.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2170","questionFrontendId":"2044","title":"Count Number of Maximum Bitwise-OR Subsets","titleSlug":"count-number-of-maximum-bitwise-or-subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.1K\", \"totalSubmission\": \"26.6K\", \"totalAcceptedRaw\": 20123, \"totalSubmissionRaw\": 26636, \"acRate\": \"75.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2174","questionFrontendId":"2048","title":"Next Greater Numerically Balanced Number","titleSlug":"next-greater-numerically-balanced-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.8K\", \"totalSubmission\": \"22.8K\", \"totalAcceptedRaw\": 10798, \"totalSubmissionRaw\": 22831, \"acRate\": \"47.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2189","questionFrontendId":"2065","title":"Maximum Path Quality of a Graph","titleSlug":"maximum-path-quality-of-a-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.8K\", \"totalSubmission\": \"25.8K\", \"totalAcceptedRaw\": 14791, \"totalSubmissionRaw\": 25819, \"acRate\": \"57.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2272","questionFrontendId":"2151","title":"Maximum Good People Based on Statements","titleSlug":"maximum-good-people-based-on-statements","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.1K\", \"totalSubmission\": \"22.5K\", \"totalAcceptedRaw\": 11058, \"totalSubmissionRaw\": 22463, \"acRate\": \"49.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2279","questionFrontendId":"2178","title":"Maximum Split of Positive Even Integers","titleSlug":"maximum-split-of-positive-even-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.8K\", \"totalSubmission\": \"63.8K\", \"totalAcceptedRaw\": 37818, \"totalSubmissionRaw\": 63780, \"acRate\": \"59.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2287","questionFrontendId":"2152","title":"Minimum Number of Lines to Cover Points","titleSlug":"minimum-number-of-lines-to-cover-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"3K\", \"totalAcceptedRaw\": 1407, \"totalSubmissionRaw\": 3016, \"acRate\": \"46.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2456","questionFrontendId":"2375","title":"Construct Smallest Number From DI String","titleSlug":"construct-smallest-number-from-di-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.6K\", \"totalSubmission\": \"28.9K\", \"totalAcceptedRaw\": 21565, \"totalSubmissionRaw\": 28928, \"acRate\": \"74.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2482","questionFrontendId":"2397","title":"Maximum Rows Covered by Columns","titleSlug":"maximum-rows-covered-by-columns","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"22.2K\", \"totalAcceptedRaw\": 11694, \"totalSubmissionRaw\": 22158, \"acRate\": \"52.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/tmp/binary-indexed-tree-graphql.json b/tmp/binary-indexed-tree-graphql.json
new file mode 100644
index 000000000..1329b8e49
--- /dev/null
+++ b/tmp/binary-indexed-tree-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","questions":[{"status":null,"questionId":"218","questionFrontendId":"218","title":"The Skyline Problem","titleSlug":"the-skyline-problem","translatedTitle":null,"stats":"{\"totalAccepted\": \"261.1K\", \"totalSubmission\": \"624.5K\", \"totalAcceptedRaw\": 261106, \"totalSubmissionRaw\": 624490, \"acRate\": \"41.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Line Sweep","translatedName":null,"slug":"line-sweep","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"307","questionFrontendId":"307","title":"Range Sum Query - Mutable","titleSlug":"range-sum-query-mutable","translatedTitle":null,"stats":"{\"totalAccepted\": \"243.5K\", \"totalSubmission\": \"598.4K\", \"totalAcceptedRaw\": 243470, \"totalSubmissionRaw\": 598370, \"acRate\": \"40.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"308","questionFrontendId":"308","title":"Range Sum Query 2D - Mutable","titleSlug":"range-sum-query-2d-mutable","translatedTitle":null,"stats":"{\"totalAccepted\": \"71.7K\", \"totalSubmission\": \"167.5K\", \"totalAcceptedRaw\": 71691, \"totalSubmissionRaw\": 167536, \"acRate\": \"42.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"315","questionFrontendId":"315","title":"Count of Smaller Numbers After Self","titleSlug":"count-of-smaller-numbers-after-self","translatedTitle":null,"stats":"{\"totalAccepted\": \"288.9K\", \"totalSubmission\": \"678K\", \"totalAcceptedRaw\": 288868, \"totalSubmissionRaw\": 678012, \"acRate\": \"42.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"327","questionFrontendId":"327","title":"Count of Range Sum","titleSlug":"count-of-range-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.8K\", \"totalSubmission\": \"188.6K\", \"totalAcceptedRaw\": 67792, \"totalSubmissionRaw\": 188553, \"acRate\": \"36.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"406","questionFrontendId":"406","title":"Queue Reconstruction by Height","titleSlug":"queue-reconstruction-by-height","translatedTitle":null,"stats":"{\"totalAccepted\": \"280K\", \"totalSubmission\": \"383.9K\", \"totalAcceptedRaw\": 279970, \"totalSubmissionRaw\": 383924, \"acRate\": \"72.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"493","questionFrontendId":"493","title":"Reverse Pairs","titleSlug":"reverse-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"118.3K\", \"totalSubmission\": \"382.9K\", \"totalAcceptedRaw\": 118322, \"totalSubmissionRaw\": 382860, \"acRate\": \"30.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"510","questionFrontendId":"2031","title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.8K\", \"totalSubmission\": \"5.5K\", \"totalAcceptedRaw\": 2837, \"totalSubmissionRaw\": 5470, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"673","questionFrontendId":"673","title":"Number of Longest Increasing Subsequence","titleSlug":"number-of-longest-increasing-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"140.4K\", \"totalSubmission\": \"328.4K\", \"totalAcceptedRaw\": 140435, \"totalSubmissionRaw\": 328435, \"acRate\": \"42.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"683","questionFrontendId":"683","title":"K Empty Slots","titleSlug":"k-empty-slots","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.9K\", \"totalSubmission\": \"159.4K\", \"totalAcceptedRaw\": 58917, \"totalSubmissionRaw\": 159409, \"acRate\": \"37.0%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1262","questionFrontendId":"1157","title":"Online Majority Element In Subarray","titleSlug":"online-majority-element-in-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.5K\", \"totalSubmission\": \"34.8K\", \"totalAcceptedRaw\": 14496, \"totalSubmissionRaw\": 34767, \"acRate\": \"41.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1356","questionFrontendId":"2193","title":"Minimum Number of Moves to Make Palindrome","titleSlug":"minimum-number-of-moves-to-make-palindrome","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.9K\", \"totalSubmission\": \"32.9K\", \"totalAcceptedRaw\": 16895, \"totalSubmissionRaw\": 32935, \"acRate\": \"51.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1511","questionFrontendId":"1395","title":"Count Number of Teams","titleSlug":"count-number-of-teams","translatedTitle":null,"stats":"{\"totalAccepted\": \"99.6K\", \"totalSubmission\": \"147.9K\", \"totalAcceptedRaw\": 99588, \"totalSubmissionRaw\": 147895, \"acRate\": \"67.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1525","questionFrontendId":"1409","title":"Queries on a Permutation With Key","titleSlug":"queries-on-a-permutation-with-key","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.7K\", \"totalSubmission\": \"51.2K\", \"totalAcceptedRaw\": 42685, \"totalSubmissionRaw\": 51172, \"acRate\": \"83.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1629","questionFrontendId":"1505","title":"Minimum Possible Integer After at Most K Adjacent Swaps On Digits","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"22.5K\", \"totalAcceptedRaw\": 8624, \"totalSubmissionRaw\": 22462, \"acRate\": \"38.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1772","questionFrontendId":"1649","title":"Create Sorted Array through Instructions","titleSlug":"create-sorted-array-through-instructions","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"59.6K\", \"totalAcceptedRaw\": 22274, \"totalSubmissionRaw\": 59648, \"acRate\": \"37.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1903","questionFrontendId":"1756","title":"Design Most Recently Used Queue","titleSlug":"design-most-recently-used-queue","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.9K\", \"totalSubmission\": \"11.3K\", \"totalAcceptedRaw\": 8907, \"totalSubmissionRaw\": 11346, \"acRate\": \"78.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2096","questionFrontendId":"1964","title":"Find the Longest Valid Obstacle Course at Each Position","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.1K\", \"totalSubmission\": \"21.4K\", \"totalAcceptedRaw\": 10122, \"totalSubmissionRaw\": 21447, \"acRate\": \"47.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2280","questionFrontendId":"2179","title":"Count Good Triplets in an Array","titleSlug":"count-good-triplets-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"15.3K\", \"totalAcceptedRaw\": 5891, \"totalSubmissionRaw\": 15350, \"acRate\": \"38.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2333","questionFrontendId":"2250","title":"Count Number of Rectangles Containing Each Point","titleSlug":"count-number-of-rectangles-containing-each-point","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.8K\", \"totalSubmission\": \"34.7K\", \"totalAcceptedRaw\": 11822, \"totalSubmissionRaw\": 34677, \"acRate\": \"34.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2380","questionFrontendId":"2286","title":"Booking Concert Tickets in Groups","titleSlug":"booking-concert-tickets-in-groups","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"28.7K\", \"totalAcceptedRaw\": 4400, \"totalSubmissionRaw\": 28665, \"acRate\": \"15.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2512","questionFrontendId":"2424","title":"Longest Uploaded Prefix","titleSlug":"longest-uploaded-prefix","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.9K\", \"totalSubmission\": \"27.6K\", \"totalAcceptedRaw\": 14892, \"totalSubmissionRaw\": 27592, \"acRate\": \"54.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2513","questionFrontendId":"2426","title":"Number of Pairs Satisfying Inequality","titleSlug":"number-of-pairs-satisfying-inequality","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.8K\", \"totalSubmission\": \"20.4K\", \"totalAcceptedRaw\": 8763, \"totalSubmissionRaw\": 20397, \"acRate\": \"43.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2526","questionFrontendId":"2407","title":"Longest Increasing Subsequence II","titleSlug":"longest-increasing-subsequence-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.8K\", \"totalSubmission\": \"36.2K\", \"totalAcceptedRaw\": 7841, \"totalSubmissionRaw\": 36205, \"acRate\": \"21.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2658","questionFrontendId":"2519","title":"Count the Number of K-Big Indices","titleSlug":"count-the-number-of-k-big-indices","translatedTitle":null,"stats":"{\"totalAccepted\": \"565\", \"totalSubmission\": \"879\", \"totalAcceptedRaw\": 565, \"totalSubmissionRaw\": 879, \"acRate\": \"64.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2682","questionFrontendId":"2552","title":"Count Increasing Quadruplets","titleSlug":"count-increasing-quadruplets","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.7K\", \"totalSubmission\": \"15K\", \"totalAcceptedRaw\": 4706, \"totalSubmissionRaw\": 14981, \"acRate\": \"31.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/tmp/binary-search-graphql.json b/tmp/binary-search-graphql.json
new file mode 100644
index 000000000..fb3a6e569
--- /dev/null
+++ b/tmp/binary-search-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"Binary Search","translatedName":null,"slug":"binary-search","questions":[{"status":null,"questionId":"4","questionFrontendId":"4","title":"Median of Two Sorted Arrays","titleSlug":"median-of-two-sorted-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.8M\", \"totalSubmission\": \"5.1M\", \"totalAcceptedRaw\": 1826683, \"totalSubmissionRaw\": 5065626, \"acRate\": \"36.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"33","questionFrontendId":"33","title":"Search in Rotated Sorted Array","titleSlug":"search-in-rotated-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"2M\", \"totalSubmission\": \"5M\", \"totalAcceptedRaw\": 1957790, \"totalSubmissionRaw\": 5027237, \"acRate\": \"38.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"34","questionFrontendId":"34","title":"Find First and Last Position of Element in Sorted Array","titleSlug":"find-first-and-last-position-of-element-in-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5M\", \"totalSubmission\": \"3.5M\", \"totalAcceptedRaw\": 1479128, \"totalSubmissionRaw\": 3535837, \"acRate\": \"41.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"35","questionFrontendId":"35","title":"Search Insert Position","titleSlug":"search-insert-position","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.1M\", \"totalSubmission\": \"4.8M\", \"totalAcceptedRaw\": 2093941, \"totalSubmissionRaw\": 4836990, \"acRate\": \"43.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"69","questionFrontendId":"69","title":"Sqrt(x)","titleSlug":"sqrtx","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"3.8M\", \"totalAcceptedRaw\": 1402903, \"totalSubmissionRaw\": 3754089, \"acRate\": \"37.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"74","questionFrontendId":"74","title":"Search a 2D Matrix","titleSlug":"search-a-2d-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"2.4M\", \"totalAcceptedRaw\": 1162197, \"totalSubmissionRaw\": 2441739, \"acRate\": \"47.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"81","questionFrontendId":"81","title":"Search in Rotated Sorted Array II","titleSlug":"search-in-rotated-sorted-array-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"498.6K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 498598, \"totalSubmissionRaw\": 1395722, \"acRate\": \"35.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"153","questionFrontendId":"153","title":"Find Minimum in Rotated Sorted Array","titleSlug":"find-minimum-in-rotated-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"2.5M\", \"totalAcceptedRaw\": 1242104, \"totalSubmissionRaw\": 2544456, \"acRate\": \"48.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"154","questionFrontendId":"154","title":"Find Minimum in Rotated Sorted Array II","titleSlug":"find-minimum-in-rotated-sorted-array-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"377.6K\", \"totalSubmission\": \"868.4K\", \"totalAcceptedRaw\": 377618, \"totalSubmissionRaw\": 868410, \"acRate\": \"43.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"162","questionFrontendId":"162","title":"Find Peak Element","titleSlug":"find-peak-element","translatedTitle":null,"stats":"{\"totalAccepted\": \"983.2K\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 983234, \"totalSubmissionRaw\": 2135700, \"acRate\": \"46.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"167","questionFrontendId":"167","title":"Two Sum II - Input Array Is Sorted","titleSlug":"two-sum-ii-input-array-is-sorted","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 1398154, \"totalSubmissionRaw\": 2329074, \"acRate\": \"60.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"209","questionFrontendId":"209","title":"Minimum Size Subarray Sum","titleSlug":"minimum-size-subarray-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"673.1K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 673091, \"totalSubmissionRaw\": 1498174, \"acRate\": \"44.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"222","questionFrontendId":"222","title":"Count Complete Tree Nodes","titleSlug":"count-complete-tree-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"534.5K\", \"totalSubmission\": \"884.6K\", \"totalAcceptedRaw\": 534451, \"totalSubmissionRaw\": 884557, \"acRate\": \"60.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"240","questionFrontendId":"240","title":"Search a 2D Matrix II","titleSlug":"search-a-2d-matrix-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"771.1K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 771112, \"totalSubmissionRaw\": 1512862, \"acRate\": \"51.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"259","questionFrontendId":"259","title":"3Sum Smaller","titleSlug":"3sum-smaller","translatedTitle":null,"stats":"{\"totalAccepted\": \"133.4K\", \"totalSubmission\": \"263.2K\", \"totalAcceptedRaw\": 133353, \"totalSubmissionRaw\": 263193, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"268","questionFrontendId":"268","title":"Missing Number","titleSlug":"missing-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 1431785, \"totalSubmissionRaw\": 2293208, \"acRate\": \"62.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"270","questionFrontendId":"270","title":"Closest Binary Search Tree Value","titleSlug":"closest-binary-search-tree-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"281.9K\", \"totalSubmission\": \"515K\", \"totalAcceptedRaw\": 281901, \"totalSubmissionRaw\": 515004, \"acRate\": \"54.7%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"275","questionFrontendId":"275","title":"H-Index II","titleSlug":"h-index-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"173.7K\", \"totalSubmission\": \"462.8K\", \"totalAcceptedRaw\": 173658, \"totalSubmissionRaw\": 462820, \"acRate\": \"37.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"278","questionFrontendId":"278","title":"First Bad Version","titleSlug":"first-bad-version","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"3.3M\", \"totalAcceptedRaw\": 1427001, \"totalSubmissionRaw\": 3299244, \"acRate\": \"43.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"287","questionFrontendId":"287","title":"Find the Duplicate Number","titleSlug":"find-the-duplicate-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 1130742, \"totalSubmissionRaw\": 1913383, \"acRate\": \"59.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"300","questionFrontendId":"300","title":"Longest Increasing Subsequence","titleSlug":"longest-increasing-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 1168749, \"totalSubmissionRaw\": 2245126, \"acRate\": \"52.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"302","questionFrontendId":"302","title":"Smallest Rectangle Enclosing Black Pixels","titleSlug":"smallest-rectangle-enclosing-black-pixels","translatedTitle":null,"stats":"{\"totalAccepted\": \"47.2K\", \"totalSubmission\": \"80.8K\", \"totalAcceptedRaw\": 47233, \"totalSubmissionRaw\": 80818, \"acRate\": \"58.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"315","questionFrontendId":"315","title":"Count of Smaller Numbers After Self","titleSlug":"count-of-smaller-numbers-after-self","translatedTitle":null,"stats":"{\"totalAccepted\": \"288.9K\", \"totalSubmission\": \"678K\", \"totalAcceptedRaw\": 288868, \"totalSubmissionRaw\": 678012, \"acRate\": \"42.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"327","questionFrontendId":"327","title":"Count of Range Sum","titleSlug":"count-of-range-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.8K\", \"totalSubmission\": \"188.6K\", \"totalAcceptedRaw\": 67792, \"totalSubmissionRaw\": 188553, \"acRate\": \"36.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"349","questionFrontendId":"349","title":"Intersection of Two Arrays","titleSlug":"intersection-of-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"824.6K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 824619, \"totalSubmissionRaw\": 1163783, \"acRate\": \"70.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"350","questionFrontendId":"350","title":"Intersection of Two Arrays II","titleSlug":"intersection-of-two-arrays-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"1M\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 1026502, \"totalSubmissionRaw\": 1835394, \"acRate\": \"55.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"352","questionFrontendId":"352","title":"Data Stream as Disjoint Intervals","titleSlug":"data-stream-as-disjoint-intervals","translatedTitle":null,"stats":"{\"totalAccepted\": \"97.7K\", \"totalSubmission\": \"163.6K\", \"totalAcceptedRaw\": 97738, \"totalSubmissionRaw\": 163580, \"acRate\": \"59.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"354","questionFrontendId":"354","title":"Russian Doll Envelopes","titleSlug":"russian-doll-envelopes","translatedTitle":null,"stats":"{\"totalAccepted\": \"185.7K\", \"totalSubmission\": \"488.6K\", \"totalAcceptedRaw\": 185705, \"totalSubmissionRaw\": 488647, \"acRate\": \"38.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"362","questionFrontendId":"362","title":"Design Hit Counter","titleSlug":"design-hit-counter","translatedTitle":null,"stats":"{\"totalAccepted\": \"202K\", \"totalSubmission\": \"295.5K\", \"totalAcceptedRaw\": 202035, \"totalSubmissionRaw\": 295505, \"acRate\": \"68.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"363","questionFrontendId":"363","title":"Max Sum of Rectangle No Larger Than K","titleSlug":"max-sum-of-rectangle-no-larger-than-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"118.1K\", \"totalSubmission\": \"268.2K\", \"totalAcceptedRaw\": 118055, \"totalSubmissionRaw\": 268157, \"acRate\": \"44.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"367","questionFrontendId":"367","title":"Valid Perfect Square","titleSlug":"valid-perfect-square","translatedTitle":null,"stats":"{\"totalAccepted\": \"468.1K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 468099, \"totalSubmissionRaw\": 1080536, \"acRate\": \"43.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"374","questionFrontendId":"374","title":"Guess Number Higher or Lower","titleSlug":"guess-number-higher-or-lower","translatedTitle":null,"stats":"{\"totalAccepted\": \"478.2K\", \"totalSubmission\": \"923.7K\", \"totalAcceptedRaw\": 478183, \"totalSubmissionRaw\": 923674, \"acRate\": \"51.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"378","questionFrontendId":"378","title":"Kth Smallest Element in a Sorted Matrix","titleSlug":"kth-smallest-element-in-a-sorted-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"526.4K\", \"totalSubmission\": \"852.2K\", \"totalAcceptedRaw\": 526380, \"totalSubmissionRaw\": 852230, \"acRate\": \"61.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"400","questionFrontendId":"400","title":"Nth Digit","titleSlug":"nth-digit","translatedTitle":null,"stats":"{\"totalAccepted\": \"84K\", \"totalSubmission\": \"246.1K\", \"totalAcceptedRaw\": 84000, \"totalSubmissionRaw\": 246106, \"acRate\": \"34.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"410","questionFrontendId":"410","title":"Split Array Largest Sum","titleSlug":"split-array-largest-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"256.7K\", \"totalSubmission\": \"479.7K\", \"totalAcceptedRaw\": 256705, \"totalSubmissionRaw\": 479653, \"acRate\": \"53.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"436","questionFrontendId":"436","title":"Find Right Interval","titleSlug":"find-right-interval","translatedTitle":null,"stats":"{\"totalAccepted\": \"91.8K\", \"totalSubmission\": \"180.9K\", \"totalAcceptedRaw\": 91808, \"totalSubmissionRaw\": 180930, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"441","questionFrontendId":"441","title":"Arranging Coins","titleSlug":"arranging-coins","translatedTitle":null,"stats":"{\"totalAccepted\": \"346.2K\", \"totalSubmission\": \"748.9K\", \"totalAcceptedRaw\": 346203, \"totalSubmissionRaw\": 748937, \"acRate\": \"46.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"456","questionFrontendId":"456","title":"132 Pattern","titleSlug":"132-pattern","translatedTitle":null,"stats":"{\"totalAccepted\": \"166.4K\", \"totalSubmission\": \"513.3K\", \"totalAcceptedRaw\": 166379, \"totalSubmissionRaw\": 513300, \"acRate\": \"32.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"475","questionFrontendId":"475","title":"Heaters","titleSlug":"heaters","translatedTitle":null,"stats":"{\"totalAccepted\": \"100.1K\", \"totalSubmission\": \"274.8K\", \"totalAcceptedRaw\": 100072, \"totalSubmissionRaw\": 274829, \"acRate\": \"36.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"483","questionFrontendId":"483","title":"Smallest Good Base","titleSlug":"smallest-good-base","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.8K\", \"totalSubmission\": \"48.6K\", \"totalAcceptedRaw\": 18770, \"totalSubmissionRaw\": 48555, \"acRate\": \"38.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"493","questionFrontendId":"493","title":"Reverse Pairs","titleSlug":"reverse-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"118.3K\", \"totalSubmission\": \"382.9K\", \"totalAcceptedRaw\": 118322, \"totalSubmissionRaw\": 382860, \"acRate\": \"30.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"510","questionFrontendId":"2031","title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.8K\", \"totalSubmission\": \"5.5K\", \"totalAcceptedRaw\": 2837, \"totalSubmissionRaw\": 5470, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"532","questionFrontendId":"532","title":"K-diff Pairs in an Array","titleSlug":"k-diff-pairs-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"287.7K\", \"totalSubmission\": \"699.9K\", \"totalAcceptedRaw\": 287711, \"totalSubmissionRaw\": 699894, \"acRate\": \"41.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"540","questionFrontendId":"540","title":"Single Element in a Sorted Array","titleSlug":"single-element-in-a-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"457.7K\", \"totalSubmission\": \"774K\", \"totalAcceptedRaw\": 457706, \"totalSubmissionRaw\": 774030, \"acRate\": \"59.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"611","questionFrontendId":"611","title":"Valid Triangle Number","titleSlug":"valid-triangle-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"165.9K\", \"totalSubmission\": \"328.4K\", \"totalAcceptedRaw\": 165878, \"totalSubmissionRaw\": 328376, \"acRate\": \"50.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"633","questionFrontendId":"633","title":"Sum of Square Numbers","titleSlug":"sum-of-square-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"166.6K\", \"totalSubmission\": \"484.1K\", \"totalAcceptedRaw\": 166561, \"totalSubmissionRaw\": 484130, \"acRate\": \"34.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"644","questionFrontendId":"644","title":"Maximum Average Subarray II","titleSlug":"maximum-average-subarray-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.6K\", \"totalSubmission\": \"51.9K\", \"totalAcceptedRaw\": 18636, \"totalSubmissionRaw\": 51851, \"acRate\": \"35.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"658","questionFrontendId":"658","title":"Find K Closest Elements","titleSlug":"find-k-closest-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"421.4K\", \"totalSubmission\": \"900.2K\", \"totalAcceptedRaw\": 421412, \"totalSubmissionRaw\": 900220, \"acRate\": \"46.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"668","questionFrontendId":"668","title":"Kth Smallest Number in Multiplication Table","titleSlug":"kth-smallest-number-in-multiplication-table","translatedTitle":null,"stats":"{\"totalAccepted\": \"55.3K\", \"totalSubmission\": \"107.3K\", \"totalAcceptedRaw\": 55306, \"totalSubmissionRaw\": 107319, \"acRate\": \"51.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"718","questionFrontendId":"718","title":"Maximum Length of Repeated Subarray","titleSlug":"maximum-length-of-repeated-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"258.8K\", \"totalSubmission\": \"504.6K\", \"totalAcceptedRaw\": 258775, \"totalSubmissionRaw\": 504577, \"acRate\": \"51.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"719","questionFrontendId":"719","title":"Find K-th Smallest Pair Distance","titleSlug":"find-k-th-smallest-pair-distance","translatedTitle":null,"stats":"{\"totalAccepted\": \"74.1K\", \"totalSubmission\": \"201.8K\", \"totalAcceptedRaw\": 74084, \"totalSubmissionRaw\": 201821, \"acRate\": \"36.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"729","questionFrontendId":"729","title":"My Calendar I","titleSlug":"my-calendar-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"252.8K\", \"totalSubmission\": \"444.3K\", \"totalAcceptedRaw\": 252811, \"totalSubmissionRaw\": 444303, \"acRate\": \"56.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"731","questionFrontendId":"731","title":"My Calendar II","titleSlug":"my-calendar-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"89K\", \"totalSubmission\": \"161.9K\", \"totalAcceptedRaw\": 89017, \"totalSubmissionRaw\": 161870, \"acRate\": \"55.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"732","questionFrontendId":"732","title":"My Calendar III","titleSlug":"my-calendar-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"83K\", \"totalSubmission\": \"116K\", \"totalAcceptedRaw\": 82952, \"totalSubmissionRaw\": 115960, \"acRate\": \"71.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"745","questionFrontendId":"744","title":"Find Smallest Letter Greater Than Target","titleSlug":"find-smallest-letter-greater-than-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"282.4K\", \"totalSubmission\": \"618.8K\", \"totalAcceptedRaw\": 282450, \"totalSubmissionRaw\": 618796, \"acRate\": \"45.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"755","questionFrontendId":"754","title":"Reach a Number","titleSlug":"reach-a-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.2K\", \"totalSubmission\": \"105.8K\", \"totalAcceptedRaw\": 45220, \"totalSubmissionRaw\": 105799, \"acRate\": \"42.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"786","questionFrontendId":"702","title":"Search in a Sorted Array of Unknown Size","titleSlug":"search-in-a-sorted-array-of-unknown-size","translatedTitle":null,"stats":"{\"totalAccepted\": \"85.8K\", \"totalSubmission\": \"120K\", \"totalAcceptedRaw\": 85771, \"totalSubmissionRaw\": 119961, \"acRate\": \"71.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"788","questionFrontendId":"774","title":"Minimize Max Distance to Gas Station","titleSlug":"minimize-max-distance-to-gas-station","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.1K\", \"totalSubmission\": \"54.2K\", \"totalAcceptedRaw\": 28064, \"totalSubmissionRaw\": 54249, \"acRate\": \"51.7%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"792","questionFrontendId":"704","title":"Binary Search","titleSlug":"binary-search","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6M\", \"totalSubmission\": \"2.9M\", \"totalAcceptedRaw\": 1608751, \"totalSubmissionRaw\": 2901593, \"acRate\": \"55.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"794","questionFrontendId":"778","title":"Swim in Rising Water","titleSlug":"swim-in-rising-water","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.1K\", \"totalSubmission\": \"190.7K\", \"totalAcceptedRaw\": 114066, \"totalSubmissionRaw\": 190656, \"acRate\": \"59.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"802","questionFrontendId":"786","title":"K-th Smallest Prime Fraction","titleSlug":"k-th-smallest-prime-fraction","translatedTitle":null,"stats":"{\"totalAccepted\": \"34K\", \"totalSubmission\": \"65.9K\", \"totalAcceptedRaw\": 34000, \"totalSubmissionRaw\": 65946, \"acRate\": \"51.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"809","questionFrontendId":"793","title":"Preimage Size of Factorial Zeroes Function","titleSlug":"preimage-size-of-factorial-zeroes-function","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.1K\", \"totalSubmission\": \"35K\", \"totalAcceptedRaw\": 15114, \"totalSubmissionRaw\": 34992, \"acRate\": \"43.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"852","questionFrontendId":"825","title":"Friends Of Appropriate Ages","titleSlug":"friends-of-appropriate-ages","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.7K\", \"totalSubmission\": \"152.6K\", \"totalAcceptedRaw\": 70689, \"totalSubmissionRaw\": 152584, \"acRate\": \"46.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"853","questionFrontendId":"826","title":"Most Profit Assigning Work","titleSlug":"most-profit-assigning-work","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.8K\", \"totalSubmission\": \"117.8K\", \"totalAcceptedRaw\": 52810, \"totalSubmissionRaw\": 117798, \"acRate\": \"44.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"882","questionFrontendId":"852","title":"Peak Index in a Mountain Array","titleSlug":"peak-index-in-a-mountain-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"530.8K\", \"totalSubmission\": \"768.1K\", \"totalAcceptedRaw\": 530810, \"totalSubmissionRaw\": 768079, \"acRate\": \"69.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"892","questionFrontendId":"862","title":"Shortest Subarray with Sum at Least K","titleSlug":"shortest-subarray-with-sum-at-least-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"84.1K\", \"totalSubmission\": \"322.7K\", \"totalAcceptedRaw\": 84068, \"totalSubmissionRaw\": 322662, \"acRate\": \"26.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"894","questionFrontendId":"710","title":"Random Pick with Blacklist","titleSlug":"random-pick-with-blacklist","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.8K\", \"totalSubmission\": \"106.6K\", \"totalAcceptedRaw\": 35755, \"totalSubmissionRaw\": 106616, \"acRate\": \"33.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"907","questionFrontendId":"875","title":"Koko Eating Bananas","titleSlug":"koko-eating-bananas","translatedTitle":null,"stats":"{\"totalAccepted\": \"340.7K\", \"totalSubmission\": \"651.7K\", \"totalAcceptedRaw\": 340689, \"totalSubmissionRaw\": 651731, \"acRate\": \"52.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"910","questionFrontendId":"878","title":"Nth Magical Number","titleSlug":"nth-magical-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.9K\", \"totalSubmission\": \"93K\", \"totalAcceptedRaw\": 32859, \"totalSubmissionRaw\": 92992, \"acRate\": \"35.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"912","questionFrontendId":"528","title":"Random Pick with Weight","titleSlug":"random-pick-with-weight","translatedTitle":null,"stats":"{\"totalAccepted\": \"357K\", \"totalSubmission\": \"774.5K\", \"totalAcceptedRaw\": 356996, \"totalSubmissionRaw\": 774550, \"acRate\": \"46.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"914","questionFrontendId":"497","title":"Random Point in Non-overlapping Rectangles","titleSlug":"random-point-in-non-overlapping-rectangles","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.7K\", \"totalSubmission\": \"93.2K\", \"totalAcceptedRaw\": 36679, \"totalSubmissionRaw\": 93194, \"acRate\": \"39.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Reservoir Sampling","translatedName":null,"slug":"reservoir-sampling","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"923","questionFrontendId":"887","title":"Super Egg Drop","titleSlug":"super-egg-drop","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.6K\", \"totalSubmission\": \"215.3K\", \"totalAcceptedRaw\": 58572, \"totalSubmissionRaw\": 215331, \"acRate\": \"27.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"924","questionFrontendId":"888","title":"Fair Candy Swap","titleSlug":"fair-candy-swap","translatedTitle":null,"stats":"{\"totalAccepted\": \"99.4K\", \"totalSubmission\": \"163.8K\", \"totalAcceptedRaw\": 99438, \"totalSubmissionRaw\": 163833, \"acRate\": \"60.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"938","questionFrontendId":"902","title":"Numbers At Most N Given Digit Set","titleSlug":"numbers-at-most-n-given-digit-set","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.6K\", \"totalSubmission\": \"95.6K\", \"totalAcceptedRaw\": 39603, \"totalSubmissionRaw\": 95582, \"acRate\": \"41.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"947","questionFrontendId":"911","title":"Online Election","titleSlug":"online-election","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.3K\", \"totalSubmission\": \"92.6K\", \"totalAcceptedRaw\": 48341, \"totalSubmissionRaw\": 92643, \"acRate\": \"52.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1023","questionFrontendId":"981","title":"Time Based Key-Value Store","titleSlug":"time-based-key-value-store","translatedTitle":null,"stats":"{\"totalAccepted\": \"306.6K\", \"totalSubmission\": \"585.3K\", \"totalAcceptedRaw\": 306561, \"totalSubmissionRaw\": 585265, \"acRate\": \"52.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1046","questionFrontendId":"1004","title":"Max Consecutive Ones III","titleSlug":"max-consecutive-ones-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"284.6K\", \"totalSubmission\": \"450K\", \"totalAcceptedRaw\": 284557, \"totalSubmissionRaw\": 449973, \"acRate\": \"63.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1056","questionFrontendId":"1011","title":"Capacity To Ship Packages Within D Days","titleSlug":"capacity-to-ship-packages-within-d-days","translatedTitle":null,"stats":"{\"totalAccepted\": \"260.9K\", \"totalSubmission\": \"385.4K\", \"totalAcceptedRaw\": 260870, \"totalSubmissionRaw\": 385431, \"acRate\": \"67.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1059","questionFrontendId":"1060","title":"Missing Element in Sorted Array","titleSlug":"missing-element-in-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"112.3K\", \"totalSubmission\": \"205.2K\", \"totalAcceptedRaw\": 112270, \"totalSubmissionRaw\": 205218, \"acRate\": \"54.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1060","questionFrontendId":"1062","title":"Longest Repeating Substring","titleSlug":"longest-repeating-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.4K\", \"totalSubmission\": \"54.7K\", \"totalAcceptedRaw\": 32408, \"totalSubmissionRaw\": 54744, \"acRate\": \"59.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Suffix Array","translatedName":null,"slug":"suffix-array","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1066","questionFrontendId":"1064","title":"Fixed Point","titleSlug":"fixed-point","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.4K\", \"totalSubmission\": \"62.9K\", \"totalAcceptedRaw\": 40372, \"totalSubmissionRaw\": 62892, \"acRate\": \"64.2%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1083","questionFrontendId":"1099","title":"Two Sum Less Than K","titleSlug":"two-sum-less-than-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.6K\", \"totalSubmission\": \"187.8K\", \"totalAcceptedRaw\": 114602, \"totalSubmissionRaw\": 187804, \"acRate\": \"61.0%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1087","questionFrontendId":"1027","title":"Longest Arithmetic Subsequence","titleSlug":"longest-arithmetic-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"99.8K\", \"totalSubmission\": \"213.3K\", \"totalAcceptedRaw\": 99805, \"totalSubmissionRaw\": 213286, \"acRate\": \"46.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1102","questionFrontendId":"1150","title":"Check If a Number Is Majority Element in a Sorted Array","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"38K\", \"totalSubmission\": \"66.5K\", \"totalAcceptedRaw\": 38013, \"totalSubmissionRaw\": 66487, \"acRate\": \"57.2%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1122","questionFrontendId":"1044","title":"Longest Duplicate Substring","titleSlug":"longest-duplicate-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"61.2K\", \"totalSubmission\": \"200.2K\", \"totalAcceptedRaw\": 61173, \"totalSubmissionRaw\": 200160, \"acRate\": \"30.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Suffix Array","translatedName":null,"slug":"suffix-array","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1134","questionFrontendId":"1182","title":"Shortest Distance to Target Color","titleSlug":"shortest-distance-to-target-color","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.2K\", \"totalSubmission\": \"60K\", \"totalAcceptedRaw\": 33200, \"totalSubmissionRaw\": 59974, \"acRate\": \"55.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1143","questionFrontendId":"1198","title":"Find Smallest Common Element in All Rows","titleSlug":"find-smallest-common-element-in-all-rows","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.1K\", \"totalSubmission\": \"49.8K\", \"totalAcceptedRaw\": 38137, \"totalSubmissionRaw\": 49777, \"acRate\": \"76.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1149","questionFrontendId":"1213","title":"Intersection of Three Sorted Arrays","titleSlug":"intersection-of-three-sorted-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"76.9K\", \"totalSubmission\": \"96.2K\", \"totalAcceptedRaw\": 76872, \"totalSubmissionRaw\": 96199, \"acRate\": \"79.9%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1150","questionFrontendId":"1214","title":"Two Sum BSTs","titleSlug":"two-sum-bsts","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.8K\", \"totalSubmission\": \"58.8K\", \"totalAcceptedRaw\": 38839, \"totalSubmissionRaw\": 58760, \"acRate\": \"66.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1185","questionFrontendId":"1095","title":"Find in Mountain Array","titleSlug":"find-in-mountain-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.5K\", \"totalSubmission\": \"164.5K\", \"totalAcceptedRaw\": 58462, \"totalSubmissionRaw\": 164456, \"acRate\": \"35.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1192","questionFrontendId":"1231","title":"Divide Chocolate","titleSlug":"divide-chocolate","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.4K\", \"totalSubmission\": \"77.3K\", \"totalAcceptedRaw\": 44380, \"totalSubmissionRaw\": 77335, \"acRate\": \"57.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1232","questionFrontendId":"1300","title":"Sum of Mutated Array Closest to Target","titleSlug":"sum-of-mutated-array-closest-to-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.2K\", \"totalSubmission\": \"73.8K\", \"totalAcceptedRaw\": 32155, \"totalSubmissionRaw\": 73832, \"acRate\": \"43.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1249","questionFrontendId":"1146","title":"Snapshot Array","titleSlug":"snapshot-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"140.6K\", \"totalSubmission\": \"377.7K\", \"totalAcceptedRaw\": 140558, \"totalSubmissionRaw\": 377697, \"acRate\": \"37.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1262","questionFrontendId":"1157","title":"Online Majority Element In Subarray","titleSlug":"online-majority-element-in-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.5K\", \"totalSubmission\": \"34.8K\", \"totalAcceptedRaw\": 14496, \"totalSubmissionRaw\": 34767, \"acRate\": \"41.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1273","questionFrontendId":"1170","title":"Compare Strings by Frequency of the Smallest Character","titleSlug":"compare-strings-by-frequency-of-the-smallest-character","translatedTitle":null,"stats":"{\"totalAccepted\": \"72.1K\", \"totalSubmission\": \"117.3K\", \"totalAcceptedRaw\": 72132, \"totalSubmissionRaw\": 117266, \"acRate\": \"61.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1290","questionFrontendId":"1187","title":"Make Array Strictly Increasing","titleSlug":"make-array-strictly-increasing","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.7K\", \"totalSubmission\": \"30.2K\", \"totalAcceptedRaw\": 13669, \"totalSubmissionRaw\": 30168, \"acRate\": \"45.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1294","questionFrontendId":"2080","title":"Range Frequency Queries","titleSlug":"range-frequency-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.9K\", \"totalSubmission\": \"41.1K\", \"totalAcceptedRaw\": 15852, \"totalSubmissionRaw\": 41081, \"acRate\": \"38.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1295","questionFrontendId":"1954","title":"Minimum Garden Perimeter to Collect Enough Apples","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.6K\", \"totalSubmission\": \"25.4K\", \"totalAcceptedRaw\": 13559, \"totalSubmissionRaw\": 25427, \"acRate\": \"53.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1296","questionFrontendId":"1483","title":"Kth Ancestor of a Tree Node","titleSlug":"kth-ancestor-of-a-tree-node","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.4K\", \"totalSubmission\": \"78.3K\", \"totalAcceptedRaw\": 26449, \"totalSubmissionRaw\": 78345, \"acRate\": \"33.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1307","questionFrontendId":"1201","title":"Ugly Number III","titleSlug":"ugly-number-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.1K\", \"totalSubmission\": \"90.7K\", \"totalAcceptedRaw\": 26098, \"totalSubmissionRaw\": 90713, \"acRate\": \"28.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1321","questionFrontendId":"1208","title":"Get Equal Substrings Within Budget","titleSlug":"get-equal-substrings-within-budget","translatedTitle":null,"stats":"{\"totalAccepted\": \"37K\", \"totalSubmission\": \"76.3K\", \"totalAcceptedRaw\": 36954, \"totalSubmissionRaw\": 76261, \"acRate\": \"48.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1326","questionFrontendId":"1862","title":"Sum of Floored Pairs","titleSlug":"sum-of-floored-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.4K\", \"totalSubmission\": \"26.3K\", \"totalAcceptedRaw\": 7374, \"totalSubmissionRaw\": 26264, \"acRate\": \"28.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1335","questionFrontendId":"2226","title":"Maximum Candies Allocated to K Children","titleSlug":"maximum-candies-allocated-to-k-children","translatedTitle":null,"stats":"{\"totalAccepted\": \"26K\", \"totalSubmission\": \"71K\", \"totalAcceptedRaw\": 25997, \"totalSubmissionRaw\": 71017, \"acRate\": \"36.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1352","questionFrontendId":"1235","title":"Maximum Profit in Job Scheduling","titleSlug":"maximum-profit-in-job-scheduling","translatedTitle":null,"stats":"{\"totalAccepted\": \"178.8K\", \"totalSubmission\": \"334.7K\", \"totalAcceptedRaw\": 178833, \"totalSubmissionRaw\": 334691, \"acRate\": \"53.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1358","questionFrontendId":"1237","title":"Find Positive Integer Solution for a Given Equation","titleSlug":"find-positive-integer-solution-for-a-given-equation","translatedTitle":null,"stats":"{\"totalAccepted\": \"57.2K\", \"totalSubmission\": \"82.6K\", \"totalAcceptedRaw\": 57219, \"totalSubmissionRaw\": 82634, \"acRate\": \"69.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1374","questionFrontendId":"1428","title":"Leftmost Column with at Least a One","titleSlug":"leftmost-column-with-at-least-a-one","translatedTitle":null,"stats":"{\"totalAccepted\": \"164.4K\", \"totalSubmission\": \"307.7K\", \"totalAcceptedRaw\": 164445, \"totalSubmissionRaw\": 307716, \"acRate\": \"53.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1384","questionFrontendId":"1618","title":"Maximum Font to Fit a Sentence in a Screen","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"10.2K\", \"totalAcceptedRaw\": 6103, \"totalSubmissionRaw\": 10219, \"acRate\": \"59.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1408","questionFrontendId":"1283","title":"Find the Smallest Divisor Given a Threshold","titleSlug":"find-the-smallest-divisor-given-a-threshold","translatedTitle":null,"stats":"{\"totalAccepted\": \"105.5K\", \"totalSubmission\": \"188.3K\", \"totalAcceptedRaw\": 105534, \"totalSubmissionRaw\": 188300, \"acRate\": \"56.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1413","questionFrontendId":"1292","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.6K\", \"totalSubmission\": \"55.5K\", \"totalAcceptedRaw\": 29594, \"totalSubmissionRaw\": 55521, \"acRate\": \"53.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1463","questionFrontendId":"1337","title":"The K Weakest Rows in a Matrix","titleSlug":"the-k-weakest-rows-in-a-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"236.7K\", \"totalSubmission\": \"328.2K\", \"totalAcceptedRaw\": 236728, \"totalSubmissionRaw\": 328219, \"acRate\": \"72.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1468","questionFrontendId":"1346","title":"Check If N and Its Double Exist","titleSlug":"check-if-n-and-its-double-exist","translatedTitle":null,"stats":"{\"totalAccepted\": \"272.7K\", \"totalSubmission\": \"746.9K\", \"totalAcceptedRaw\": 272653, \"totalSubmissionRaw\": 746897, \"acRate\": \"36.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1470","questionFrontendId":"1348","title":"Tweet Counts Per Frequency","titleSlug":"tweet-counts-per-frequency","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.9K\", \"totalSubmission\": \"68.2K\", \"totalAcceptedRaw\": 29914, \"totalSubmissionRaw\": 68209, \"acRate\": \"43.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1476","questionFrontendId":"1351","title":"Count Negative Numbers in a Sorted Matrix","titleSlug":"count-negative-numbers-in-a-sorted-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"234.2K\", \"totalSubmission\": \"310.3K\", \"totalAcceptedRaw\": 234177, \"totalSubmissionRaw\": 310323, \"acRate\": \"75.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1486","questionFrontendId":"1385","title":"Find the Distance Value Between Two Arrays","titleSlug":"find-the-distance-value-between-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.5K\", \"totalSubmission\": \"118.2K\", \"totalAcceptedRaw\": 78467, \"totalSubmissionRaw\": 118199, \"acRate\": \"66.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1550","questionFrontendId":"1439","title":"Find the Kth Smallest Sum of a Matrix With Sorted Rows","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.5K\", \"totalSubmission\": \"46.4K\", \"totalAcceptedRaw\": 28480, \"totalSubmissionRaw\": 46387, \"acRate\": \"61.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1573","questionFrontendId":"1477","title":"Find Two Non-overlapping Sub-arrays Each With Target Sum","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.1K\", \"totalSubmission\": \"117.1K\", \"totalAcceptedRaw\": 43129, \"totalSubmissionRaw\": 117109, \"acRate\": \"36.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1605","questionFrontendId":"1482","title":"Minimum Number of Days to Make m Bouquets","titleSlug":"minimum-number-of-days-to-make-m-bouquets","translatedTitle":null,"stats":"{\"totalAccepted\": \"58K\", \"totalSubmission\": \"107K\", \"totalAcceptedRaw\": 57955, \"totalSubmissionRaw\": 106955, \"acRate\": \"54.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1612","questionFrontendId":"1488","title":"Avoid Flood in The City","titleSlug":"avoid-flood-in-the-city","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.1K\", \"totalSubmission\": \"114.2K\", \"totalAcceptedRaw\": 30123, \"totalSubmissionRaw\": 114183, \"acRate\": \"26.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1615","questionFrontendId":"1508","title":"Range Sum of Sorted Subarray Sums","titleSlug":"range-sum-of-sorted-subarray-sums","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.1K\", \"totalSubmission\": \"54.3K\", \"totalAcceptedRaw\": 32070, \"totalSubmissionRaw\": 54333, \"acRate\": \"59.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1621","questionFrontendId":"1498","title":"Number of Subsequences That Satisfy the Given Sum Condition","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.5K\", \"totalSubmission\": \"107.8K\", \"totalAcceptedRaw\": 40464, \"totalSubmissionRaw\": 107781, \"acRate\": \"37.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1645","questionFrontendId":"1521","title":"Find a Value of a Mysterious Function Closest to Target","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"19.8K\", \"totalAcceptedRaw\": 8608, \"totalSubmissionRaw\": 19783, \"acRate\": \"43.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1646","questionFrontendId":"1539","title":"Kth Missing Positive Number","titleSlug":"kth-missing-positive-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"295.6K\", \"totalSubmission\": \"505K\", \"totalAcceptedRaw\": 295648, \"totalSubmissionRaw\": 504955, \"acRate\": \"58.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1672","questionFrontendId":"1533","title":"Find the Index of the Large Integer","titleSlug":"find-the-index-of-the-large-integer","translatedTitle":null,"stats":"{\"totalAccepted\": \"10K\", \"totalSubmission\": \"17.9K\", \"totalAcceptedRaw\": 10022, \"totalSubmissionRaw\": 17909, \"acRate\": \"56.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1675","questionFrontendId":"1552","title":"Magnetic Force Between Two Balls","titleSlug":"magnetic-force-between-two-balls","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.4K\", \"totalSubmission\": \"68K\", \"totalAcceptedRaw\": 39385, \"totalSubmissionRaw\": 67953, \"acRate\": \"58.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1679","questionFrontendId":"1574","title":"Shortest Subarray to be Removed to Make Array Sorted","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.7K\", \"totalSubmission\": \"66.8K\", \"totalAcceptedRaw\": 24721, \"totalSubmissionRaw\": 66827, \"acRate\": \"37.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1684","questionFrontendId":"1562","title":"Find Latest Group of Size M","titleSlug":"find-latest-group-of-size-m","translatedTitle":null,"stats":"{\"totalAccepted\": \"16K\", \"totalSubmission\": \"37.4K\", \"totalAcceptedRaw\": 15978, \"totalSubmissionRaw\": 37352, \"acRate\": \"42.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1730","questionFrontendId":"1608","title":"Special Array With X Elements Greater Than or Equal X","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.5K\", \"totalSubmission\": \"105.1K\", \"totalAcceptedRaw\": 63520, \"totalSubmissionRaw\": 105100, \"acRate\": \"60.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1753","questionFrontendId":"1631","title":"Path With Minimum Effort","titleSlug":"path-with-minimum-effort","translatedTitle":null,"stats":"{\"totalAccepted\": \"140.9K\", \"totalSubmission\": \"253.4K\", \"totalAcceptedRaw\": 140915, \"totalSubmissionRaw\": 253403, \"acRate\": \"55.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1754","questionFrontendId":"10009","title":"Design a Dating System","titleSlug":"design-a-dating-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"227\", \"totalSubmission\": \"613\", \"totalAcceptedRaw\": 227, \"totalSubmissionRaw\": 613, \"acRate\": \"37.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1766","questionFrontendId":"1671","title":"Minimum Number of Removals to Make Mountain Array","titleSlug":"minimum-number-of-removals-to-make-mountain-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.7K\", \"totalSubmission\": \"48.7K\", \"totalAcceptedRaw\": 20674, \"totalSubmissionRaw\": 48695, \"acRate\": \"42.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1771","questionFrontendId":"1648","title":"Sell Diminishing-Valued Colored Balls","titleSlug":"sell-diminishing-valued-colored-balls","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.5K\", \"totalSubmission\": \"113.5K\", \"totalAcceptedRaw\": 34526, \"totalSubmissionRaw\": 113477, \"acRate\": \"30.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1772","questionFrontendId":"1649","title":"Create Sorted Array through Instructions","titleSlug":"create-sorted-array-through-instructions","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"59.6K\", \"totalAcceptedRaw\": 22274, \"totalSubmissionRaw\": 59648, \"acRate\": \"37.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1776","questionFrontendId":"1658","title":"Minimum Operations to Reduce X to Zero","titleSlug":"minimum-operations-to-reduce-x-to-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"109K\", \"totalSubmission\": \"289.9K\", \"totalAcceptedRaw\": 109032, \"totalSubmissionRaw\": 289890, \"acRate\": \"37.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1831","questionFrontendId":"1712","title":"Ways to Split Array Into Three Subarrays","titleSlug":"ways-to-split-array-into-three-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.2K\", \"totalSubmission\": \"83.1K\", \"totalAcceptedRaw\": 27156, \"totalSubmissionRaw\": 83139, \"acRate\": \"32.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1832","questionFrontendId":"1713","title":"Minimum Operations to Make a Subsequence","titleSlug":"minimum-operations-to-make-a-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"18.7K\", \"totalAcceptedRaw\": 9170, \"totalSubmissionRaw\": 18749, \"acRate\": \"48.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1851","questionFrontendId":"1751","title":"Maximum Number of Events That Can Be Attended II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"21K\", \"totalSubmission\": \"36.9K\", \"totalAcceptedRaw\": 20983, \"totalSubmissionRaw\": 36900, \"acRate\": \"56.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1861","questionFrontendId":"1739","title":"Building Boxes","titleSlug":"building-boxes","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"11.3K\", \"totalAcceptedRaw\": 5858, \"totalSubmissionRaw\": 11264, \"acRate\": \"52.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1886","questionFrontendId":"1760","title":"Minimum Limit of Balls in a Bag","titleSlug":"minimum-limit-of-balls-in-a-bag","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.8K\", \"totalSubmission\": \"49.3K\", \"totalAcceptedRaw\": 29786, \"totalSubmissionRaw\": 49340, \"acRate\": \"60.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1891","questionFrontendId":"1782","title":"Count Pairs Of Nodes","titleSlug":"count-pairs-of-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"14K\", \"totalAcceptedRaw\": 5388, \"totalSubmissionRaw\": 14017, \"acRate\": \"38.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1918","questionFrontendId":"1793","title":"Maximum Score of a Good Subarray","titleSlug":"maximum-score-of-a-good-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.4K\", \"totalSubmission\": \"36.3K\", \"totalAcceptedRaw\": 19408, \"totalSubmissionRaw\": 36265, \"acRate\": \"53.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1929","questionFrontendId":"1802","title":"Maximum Value at a Given Index in a Bounded Array","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.9K\", \"totalSubmission\": \"49.2K\", \"totalAcceptedRaw\": 15919, \"totalSubmissionRaw\": 49194, \"acRate\": \"32.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1946","questionFrontendId":"1818","title":"Minimum Absolute Sum Difference","titleSlug":"minimum-absolute-sum-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.4K\", \"totalSubmission\": \"67.1K\", \"totalAcceptedRaw\": 20353, \"totalSubmissionRaw\": 67143, \"acRate\": \"30.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1957","questionFrontendId":"1847","title":"Closest Room","titleSlug":"closest-room","translatedTitle":null,"stats":"{\"totalAccepted\": \"7K\", \"totalSubmission\": \"19.7K\", \"totalAcceptedRaw\": 7004, \"totalSubmissionRaw\": 19690, \"acRate\": \"35.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1966","questionFrontendId":"1838","title":"Frequency of the Most Frequent Element","titleSlug":"frequency-of-the-most-frequent-element","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.9K\", \"totalSubmission\": \"101.8K\", \"totalAcceptedRaw\": 39940, \"totalSubmissionRaw\": 101833, \"acRate\": \"39.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1977","questionFrontendId":"1851","title":"Minimum Interval to Include Each Query","titleSlug":"minimum-interval-to-include-each-query","translatedTitle":null,"stats":"{\"totalAccepted\": \"16K\", \"totalSubmission\": \"33.2K\", \"totalAcceptedRaw\": 16003, \"totalSubmissionRaw\": 33222, \"acRate\": \"48.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Line Sweep","translatedName":null,"slug":"line-sweep","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1984","questionFrontendId":"1855","title":"Maximum Distance Between a Pair of Values","titleSlug":"maximum-distance-between-a-pair-of-values","translatedTitle":null,"stats":"{\"totalAccepted\": \"40K\", \"totalSubmission\": \"75.3K\", \"totalAcceptedRaw\": 39958, \"totalSubmissionRaw\": 75265, \"acRate\": \"53.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2000","questionFrontendId":"1870","title":"Minimum Speed to Arrive on Time","titleSlug":"minimum-speed-to-arrive-on-time","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.7K\", \"totalSubmission\": \"72.1K\", \"totalAcceptedRaw\": 27667, \"totalSubmissionRaw\": 72144, \"acRate\": \"38.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2006","questionFrontendId":"1894","title":"Find the Student that Will Replace the Chalk","titleSlug":"find-the-student-that-will-replace-the-chalk","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.6K\", \"totalSubmission\": \"64.5K\", \"totalAcceptedRaw\": 28619, \"totalSubmissionRaw\": 64539, \"acRate\": \"44.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2018","questionFrontendId":"1889","title":"Minimum Space Wasted From Packaging","titleSlug":"minimum-space-wasted-from-packaging","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.2K\", \"totalSubmission\": \"32.6K\", \"totalAcceptedRaw\": 10157, \"totalSubmissionRaw\": 32556, \"acRate\": \"31.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2027","questionFrontendId":"1898","title":"Maximum Number of Removable Characters","titleSlug":"maximum-number-of-removable-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.1K\", \"totalSubmission\": \"52.2K\", \"totalAcceptedRaw\": 21149, \"totalSubmissionRaw\": 52215, \"acRate\": \"40.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2036","questionFrontendId":"1885","title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"7.5K\", \"totalAcceptedRaw\": 4440, \"totalSubmissionRaw\": 7475, \"acRate\": \"59.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2045","questionFrontendId":"1891","title":"Cutting Ribbons","titleSlug":"cutting-ribbons","translatedTitle":null,"stats":"{\"totalAccepted\": \"50.6K\", \"totalSubmission\": \"104.7K\", \"totalAcceptedRaw\": 50619, \"totalSubmissionRaw\": 104746, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2047","questionFrontendId":"1901","title":"Find a Peak Element II","titleSlug":"find-a-peak-element-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.5K\", \"totalSubmission\": \"67.7K\", \"totalAcceptedRaw\": 35485, \"totalSubmissionRaw\": 67723, \"acRate\": \"52.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2051","questionFrontendId":"1923","title":"Longest Common Subpath","titleSlug":"longest-common-subpath","translatedTitle":null,"stats":"{\"totalAccepted\": \"6K\", \"totalSubmission\": \"21.8K\", \"totalAcceptedRaw\": 6026, \"totalSubmissionRaw\": 21801, \"acRate\": \"27.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Suffix Array","translatedName":null,"slug":"suffix-array","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2060","questionFrontendId":"1932","title":"Merge BSTs to Create Single BST","titleSlug":"merge-bsts-to-create-single-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"17.7K\", \"totalAcceptedRaw\": 6305, \"totalSubmissionRaw\": 17747, \"acRate\": \"35.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2069","questionFrontendId":"1918","title":"Kth Smallest Subarray Sum","titleSlug":"kth-smallest-subarray-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.2K\", \"totalSubmission\": \"6.1K\", \"totalAcceptedRaw\": 3216, \"totalSubmissionRaw\": 6118, \"acRate\": \"52.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2073","questionFrontendId":"1956","title":"Minimum Time For K Virus Variants to Spread","titleSlug":"minimum-time-for-k-virus-variants-to-spread","translatedTitle":null,"stats":"{\"totalAccepted\": \"695\", \"totalSubmission\": \"1.4K\", \"totalAcceptedRaw\": 695, \"totalSubmissionRaw\": 1448, \"acRate\": \"48.0%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2096","questionFrontendId":"1964","title":"Find the Longest Valid Obstacle Course at Each Position","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.1K\", \"totalSubmission\": \"21.4K\", \"totalAcceptedRaw\": 10122, \"totalSubmissionRaw\": 21447, \"acRate\": \"47.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2101","questionFrontendId":"1970","title":"Last Day Where You Can Still Cross","titleSlug":"last-day-where-you-can-still-cross","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.4K\", \"totalSubmission\": \"23K\", \"totalAcceptedRaw\": 11403, \"totalSubmissionRaw\": 22978, \"acRate\": \"49.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2111","questionFrontendId":"1966","title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"3.4K\", \"totalAcceptedRaw\": 2218, \"totalSubmissionRaw\": 3394, \"acRate\": \"65.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2118","questionFrontendId":"2008","title":"Maximum Earnings From Taxi","titleSlug":"maximum-earnings-from-taxi","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.1K\", \"totalSubmission\": \"48.3K\", \"totalAcceptedRaw\": 21055, \"totalSubmissionRaw\": 48338, \"acRate\": \"43.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2119","questionFrontendId":"2009","title":"Minimum Number of Operations to Make Array Continuous","titleSlug":"minimum-number-of-operations-to-make-array-continuous","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"23.2K\", \"totalAcceptedRaw\": 10579, \"totalSubmissionRaw\": 23172, \"acRate\": \"45.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2134","questionFrontendId":"2024","title":"Maximize the Confusion of an Exam","titleSlug":"maximize-the-confusion-of-an-exam","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"40.1K\", \"totalAcceptedRaw\": 24180, \"totalSubmissionRaw\": 40079, \"acRate\": \"60.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2150","questionFrontendId":"2040","title":"Kth Smallest Product of Two Sorted Arrays","titleSlug":"kth-smallest-product-of-two-sorted-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.9K\", \"totalSubmission\": \"30.9K\", \"totalAcceptedRaw\": 8921, \"totalSubmissionRaw\": 30885, \"acRate\": \"28.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2162","questionFrontendId":"2035","title":"Partition Array Into Two Arrays to Minimize Sum Difference","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.1K\", \"totalSubmission\": \"69.8K\", \"totalAcceptedRaw\": 13133, \"totalSubmissionRaw\": 69768, \"acRate\": \"18.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2164","questionFrontendId":"2054","title":"Two Best Non-Overlapping Events","titleSlug":"two-best-non-overlapping-events","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"29.4K\", \"totalAcceptedRaw\": 13290, \"totalSubmissionRaw\": 29383, \"acRate\": \"45.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2165","questionFrontendId":"2055","title":"Plates Between Candles","titleSlug":"plates-between-candles","translatedTitle":null,"stats":"{\"totalAccepted\": \"29K\", \"totalSubmission\": \"65K\", \"totalAcceptedRaw\": 28970, \"totalSubmissionRaw\": 64967, \"acRate\": \"44.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2179","questionFrontendId":"2070","title":"Most Beautiful Item for Each Query","titleSlug":"most-beautiful-item-for-each-query","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.1K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 12139, \"totalSubmissionRaw\": 24501, \"acRate\": \"49.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2180","questionFrontendId":"2071","title":"Maximum Number of Tasks You Can Assign","titleSlug":"maximum-number-of-tasks-you-can-assign","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.5K\", \"totalSubmission\": \"19.2K\", \"totalAcceptedRaw\": 6516, \"totalSubmissionRaw\": 19174, \"acRate\": \"34.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2188","questionFrontendId":"2064","title":"Minimized Maximum of Products Distributed to Any Store","titleSlug":"minimized-maximum-of-products-distributed-to-any-store","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.2K\", \"totalSubmission\": \"38K\", \"totalAcceptedRaw\": 19247, \"totalSubmissionRaw\": 37965, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2210","questionFrontendId":"2089","title":"Find Target Indices After Sorting Array","titleSlug":"find-target-indices-after-sorting-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"109.3K\", \"totalSubmission\": \"143K\", \"totalAcceptedRaw\": 109283, \"totalSubmissionRaw\": 142997, \"acRate\": \"76.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2229","questionFrontendId":"2106","title":"Maximum Fruits Harvested After at Most K Steps","titleSlug":"maximum-fruits-harvested-after-at-most-k-steps","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.4K\", \"totalSubmission\": \"24.1K\", \"totalAcceptedRaw\": 8447, \"totalSubmissionRaw\": 24113, \"acRate\": \"35.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2234","questionFrontendId":"2111","title":"Minimum Operations to Make the Array K-Increasing","titleSlug":"minimum-operations-to-make-the-array-k-increasing","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.7K\", \"totalSubmission\": \"28.5K\", \"totalAcceptedRaw\": 10733, \"totalSubmissionRaw\": 28544, \"acRate\": \"37.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2263","questionFrontendId":"2141","title":"Maximum Running Time of N Computers","titleSlug":"maximum-running-time-of-n-computers","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.1K\", \"totalSubmission\": \"28.2K\", \"totalAcceptedRaw\": 11072, \"totalSubmissionRaw\": 28244, \"acRate\": \"39.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2273","questionFrontendId":"2137","title":"Pour Water Between Buckets to Make Water Levels Equal","titleSlug":"pour-water-between-buckets-to-make-water-levels-equal","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"2.5K\", \"totalAcceptedRaw\": 1696, \"totalSubmissionRaw\": 2528, \"acRate\": \"67.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2280","questionFrontendId":"2179","title":"Count Good Triplets in an Array","titleSlug":"count-good-triplets-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"15.3K\", \"totalAcceptedRaw\": 5891, \"totalSubmissionRaw\": 15350, \"acRate\": \"38.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2294","questionFrontendId":"2187","title":"Minimum Time to Complete Trips","titleSlug":"minimum-time-to-complete-trips","translatedTitle":null,"stats":"{\"totalAccepted\": \"93.1K\", \"totalSubmission\": \"237.5K\", \"totalAcceptedRaw\": 93099, \"totalSubmissionRaw\": 237459, \"acRate\": \"39.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2326","questionFrontendId":"2223","title":"Sum of Scores of Built Strings","titleSlug":"sum-of-scores-of-built-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.2K\", \"totalSubmission\": \"13.9K\", \"totalAcceptedRaw\": 5187, \"totalSubmissionRaw\": 13872, \"acRate\": \"37.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Suffix Array","translatedName":null,"slug":"suffix-array","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2330","questionFrontendId":"2234","title":"Maximum Total Beauty of the Gardens","titleSlug":"maximum-total-beauty-of-the-gardens","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"18.6K\", \"totalAcceptedRaw\": 5305, \"totalSubmissionRaw\": 18638, \"acRate\": \"28.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2333","questionFrontendId":"2250","title":"Count Number of Rectangles Containing Each Point","titleSlug":"count-number-of-rectangles-containing-each-point","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.8K\", \"totalSubmission\": \"34.7K\", \"totalAcceptedRaw\": 11822, \"totalSubmissionRaw\": 34677, \"acRate\": \"34.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2334","questionFrontendId":"2251","title":"Number of Flowers in Full Bloom","titleSlug":"number-of-flowers-in-full-bloom","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.5K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 12546, \"totalSubmissionRaw\": 24455, \"acRate\": \"51.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2344","questionFrontendId":"2258","title":"Escape the Spreading Fire","titleSlug":"escape-the-spreading-fire","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.7K\", \"totalSubmission\": \"19.3K\", \"totalAcceptedRaw\": 6746, \"totalSubmissionRaw\": 19253, \"acRate\": \"35.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2359","questionFrontendId":"2271","title":"Maximum White Tiles Covered by a Carpet","titleSlug":"maximum-white-tiles-covered-by-a-carpet","translatedTitle":null,"stats":"{\"totalAccepted\": \"13K\", \"totalSubmission\": \"39.5K\", \"totalAcceptedRaw\": 13026, \"totalSubmissionRaw\": 39479, \"acRate\": \"33.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2380","questionFrontendId":"2286","title":"Booking Concert Tickets in Groups","titleSlug":"booking-concert-tickets-in-groups","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"28.7K\", \"totalAcceptedRaw\": 4400, \"totalSubmissionRaw\": 28665, \"acRate\": \"15.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2392","questionFrontendId":"2300","title":"Successful Pairs of Spells and Potions","titleSlug":"successful-pairs-of-spells-and-potions","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"68.7K\", \"totalAcceptedRaw\": 22286, \"totalSubmissionRaw\": 68695, \"acRate\": \"32.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2394","questionFrontendId":"2302","title":"Count Subarrays With Score Less Than K","titleSlug":"count-subarrays-with-score-less-than-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.1K\", \"totalSubmission\": \"30.8K\", \"totalAcceptedRaw\": 16066, \"totalSubmissionRaw\": 30757, \"acRate\": \"52.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2417","questionFrontendId":"2332","title":"The Latest Time to Catch a Bus","titleSlug":"the-latest-time-to-catch-a-bus","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.2K\", \"totalSubmission\": \"56.3K\", \"totalAcceptedRaw\": 13185, \"totalSubmissionRaw\": 56331, \"acRate\": \"23.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2430","questionFrontendId":"2354","title":"Number of Excellent Pairs","titleSlug":"number-of-excellent-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.8K\", \"totalSubmission\": \"25.6K\", \"totalAcceptedRaw\": 11797, \"totalSubmissionRaw\": 25639, \"acRate\": \"46.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2437","questionFrontendId":"2358","title":"Maximum Number of Groups Entering a Competition","titleSlug":"maximum-number-of-groups-entering-a-competition","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.5K\", \"totalSubmission\": \"42.2K\", \"totalAcceptedRaw\": 28514, \"totalSubmissionRaw\": 42152, \"acRate\": \"67.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2449","questionFrontendId":"2398","title":"Maximum Number of Robots Within Budget","titleSlug":"maximum-number-of-robots-within-budget","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.6K\", \"totalSubmission\": \"44.3K\", \"totalAcceptedRaw\": 14582, \"totalSubmissionRaw\": 44331, \"acRate\": \"32.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2469","questionFrontendId":"2389","title":"Longest Subsequence With Limited Sum","titleSlug":"longest-subsequence-with-limited-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.6K\", \"totalSubmission\": \"108.3K\", \"totalAcceptedRaw\": 78564, \"totalSubmissionRaw\": 108317, \"acRate\": \"72.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2498","questionFrontendId":"2411","title":"Smallest Subarrays With Maximum Bitwise OR","titleSlug":"smallest-subarrays-with-maximum-bitwise-or","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.4K\", \"totalSubmission\": \"22.5K\", \"totalAcceptedRaw\": 9379, \"totalSubmissionRaw\": 22537, \"acRate\": \"41.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2512","questionFrontendId":"2424","title":"Longest Uploaded Prefix","titleSlug":"longest-uploaded-prefix","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.9K\", \"totalSubmission\": \"27.6K\", \"totalAcceptedRaw\": 14892, \"totalSubmissionRaw\": 27592, \"acRate\": \"54.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2513","questionFrontendId":"2426","title":"Number of Pairs Satisfying Inequality","titleSlug":"number-of-pairs-satisfying-inequality","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.8K\", \"totalSubmission\": \"20.4K\", \"totalAcceptedRaw\": 8763, \"totalSubmissionRaw\": 20397, \"acRate\": \"43.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2522","questionFrontendId":"2387","title":"Median of a Row Wise Sorted Matrix","titleSlug":"median-of-a-row-wise-sorted-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"2K\", \"totalAcceptedRaw\": 1379, \"totalSubmissionRaw\": 2001, \"acRate\": \"68.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2530","questionFrontendId":"2439","title":"Minimize Maximum of Array","titleSlug":"minimize-maximum-of-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.9K\", \"totalSubmission\": \"31.6K\", \"totalAcceptedRaw\": 10855, \"totalSubmissionRaw\": 31573, \"acRate\": \"34.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2538","questionFrontendId":"2448","title":"Minimum Cost to Make Array Equal","titleSlug":"minimum-cost-to-make-array-equal","translatedTitle":null,"stats":"{\"totalAccepted\": \"12K\", \"totalSubmission\": \"34.4K\", \"totalAcceptedRaw\": 11957, \"totalSubmissionRaw\": 34361, \"acRate\": \"34.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2549","questionFrontendId":"2454","title":"Next Greater Element IV","titleSlug":"next-greater-element-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"15.9K\", \"totalAcceptedRaw\": 6338, \"totalSubmissionRaw\": 15923, \"acRate\": \"39.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2563","questionFrontendId":"2468","title":"Split Message Based on Limit","titleSlug":"split-message-based-on-limit","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.7K\", \"totalSubmission\": \"7.9K\", \"totalAcceptedRaw\": 3682, \"totalSubmissionRaw\": 7947, \"acRate\": \"46.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2567","questionFrontendId":"2476","title":"Closest Nodes Queries in a Binary Search Tree","titleSlug":"closest-nodes-queries-in-a-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.7K\", \"totalSubmission\": \"36.2K\", \"totalAcceptedRaw\": 14732, \"totalSubmissionRaw\": 36204, \"acRate\": \"40.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2586","questionFrontendId":"2501","title":"Longest Square Streak in an Array","titleSlug":"longest-square-streak-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"19K\", \"totalSubmission\": \"47.9K\", \"totalAcceptedRaw\": 18961, \"totalSubmissionRaw\": 47944, \"acRate\": \"39.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2591","questionFrontendId":"2498","title":"Frog Jump II","titleSlug":"frog-jump-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.8K\", \"totalSubmission\": \"17.8K\", \"totalAcceptedRaw\": 10835, \"totalSubmissionRaw\": 17763, \"acRate\": \"61.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2600","questionFrontendId":"2517","title":"Maximum Tastiness of Candy Basket","titleSlug":"maximum-tastiness-of-candy-basket","translatedTitle":null,"stats":"{\"totalAccepted\": \"10K\", \"totalSubmission\": \"15.5K\", \"totalAcceptedRaw\": 10013, \"totalSubmissionRaw\": 15511, \"acRate\": \"64.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2614","questionFrontendId":"2529","title":"Maximum Count of Positive Integer and Negative Integer","titleSlug":"maximum-count-of-positive-integer-and-negative-integer","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.3K\", \"totalSubmission\": \"57.8K\", \"totalAcceptedRaw\": 43319, \"totalSubmissionRaw\": 57821, \"acRate\": \"74.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2618","questionFrontendId":"2528","title":"Maximize the Minimum Powered City","titleSlug":"maximize-the-minimum-powered-city","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"13.3K\", \"totalAcceptedRaw\": 4282, \"totalSubmissionRaw\": 13347, \"acRate\": \"32.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2628","questionFrontendId":"2513","title":"Minimize the Maximum of Two Arrays","titleSlug":"minimize-the-maximum-of-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"16.7K\", \"totalAcceptedRaw\": 4438, \"totalSubmissionRaw\": 16714, \"acRate\": \"26.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2634","questionFrontendId":"2540","title":"Minimum Common Value","titleSlug":"minimum-common-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.6K\", \"totalSubmission\": \"57.2K\", \"totalAcceptedRaw\": 29563, \"totalSubmissionRaw\": 57239, \"acRate\": \"51.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2640","questionFrontendId":"2554","title":"Maximum Number of Integers to Choose From a Range I","titleSlug":"maximum-number-of-integers-to-choose-from-a-range-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.7K\", \"totalSubmission\": \"39.5K\", \"totalAcceptedRaw\": 20691, \"totalSubmissionRaw\": 39493, \"acRate\": \"52.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2646","questionFrontendId":"2583","title":"Kth Largest Sum in a Binary Tree","titleSlug":"kth-largest-sum-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.7K\", \"totalSubmission\": \"37.9K\", \"totalAcceptedRaw\": 17651, \"totalSubmissionRaw\": 37902, \"acRate\": \"46.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2657","questionFrontendId":"2589","title":"Minimum Time to Complete All Tasks","titleSlug":"minimum-time-to-complete-all-tasks","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"12.6K\", \"totalAcceptedRaw\": 4351, \"totalSubmissionRaw\": 12553, \"acRate\": \"34.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2658","questionFrontendId":"2519","title":"Count the Number of K-Big Indices","titleSlug":"count-the-number-of-k-big-indices","translatedTitle":null,"stats":"{\"totalAccepted\": \"565\", \"totalSubmission\": \"879\", \"totalAcceptedRaw\": 565, \"totalSubmissionRaw\": 879, \"acRate\": \"64.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2673","questionFrontendId":"2555","title":"Maximize Win From Two Segments","titleSlug":"maximize-win-from-two-segments","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"20.8K\", \"totalAcceptedRaw\": 6279, \"totalSubmissionRaw\": 20844, \"acRate\": \"30.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2690","questionFrontendId":"2560","title":"House Robber IV","titleSlug":"house-robber-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.9K\", \"totalSubmission\": \"25K\", \"totalAcceptedRaw\": 9902, \"totalSubmissionRaw\": 25000, \"acRate\": \"39.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2699","questionFrontendId":"2563","title":"Count the Number of Fair Pairs","titleSlug":"count-the-number-of-fair-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.4K\", \"totalSubmission\": \"51.5K\", \"totalAcceptedRaw\": 16374, \"totalSubmissionRaw\": 51502, \"acRate\": \"31.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2701","questionFrontendId":"2565","title":"Subsequence With the Minimum Score","titleSlug":"subsequence-with-the-minimum-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"13.3K\", \"totalAcceptedRaw\": 4274, \"totalSubmissionRaw\": 13339, \"acRate\": \"32.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2702","questionFrontendId":"2557","title":"Maximum Number of Integers to Choose From a Range II","titleSlug":"maximum-number-of-integers-to-choose-from-a-range-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"682\", \"totalSubmission\": \"1.5K\", \"totalAcceptedRaw\": 682, \"totalSubmissionRaw\": 1491, \"acRate\": \"45.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2712","questionFrontendId":"2576","title":"Find the Maximum Number of Marked Indices","titleSlug":"find-the-maximum-number-of-marked-indices","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.1K\", \"totalSubmission\": \"35.2K\", \"totalAcceptedRaw\": 13091, \"totalSubmissionRaw\": 35197, \"acRate\": \"37.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/tmp/bit-manipulation-graphql.json b/tmp/bit-manipulation-graphql.json
new file mode 100644
index 000000000..ecdf8dfba
--- /dev/null
+++ b/tmp/bit-manipulation-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","questions":[{"status":null,"questionId":"29","questionFrontendId":"29","title":"Divide Two Integers","titleSlug":"divide-two-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"589.1K\", \"totalSubmission\": \"3.4M\", \"totalAcceptedRaw\": 589087, \"totalSubmissionRaw\": 3432280, \"acRate\": \"17.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"67","questionFrontendId":"67","title":"Add Binary","titleSlug":"add-binary","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 1111348, \"totalSubmissionRaw\": 2121846, \"acRate\": \"52.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"78","questionFrontendId":"78","title":"Subsets","titleSlug":"subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 1396111, \"totalSubmissionRaw\": 1866728, \"acRate\": \"74.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"89","questionFrontendId":"89","title":"Gray Code","titleSlug":"gray-code","translatedTitle":null,"stats":"{\"totalAccepted\": \"258.2K\", \"totalSubmission\": \"452.4K\", \"totalAcceptedRaw\": 258170, \"totalSubmissionRaw\": 452378, \"acRate\": \"57.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"90","questionFrontendId":"90","title":"Subsets II","titleSlug":"subsets-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"675.4K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 675418, \"totalSubmissionRaw\": 1210151, \"acRate\": \"55.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"136","questionFrontendId":"136","title":"Single Number","titleSlug":"single-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.1M\", \"totalSubmission\": \"3M\", \"totalAcceptedRaw\": 2091400, \"totalSubmissionRaw\": 2962619, \"acRate\": \"70.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"137","questionFrontendId":"137","title":"Single Number II","titleSlug":"single-number-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"402.5K\", \"totalSubmission\": \"689.3K\", \"totalAcceptedRaw\": 402487, \"totalSubmissionRaw\": 689272, \"acRate\": \"58.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"187","questionFrontendId":"187","title":"Repeated DNA Sequences","titleSlug":"repeated-dna-sequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"317.3K\", \"totalSubmission\": \"676.7K\", \"totalAcceptedRaw\": 317329, \"totalSubmissionRaw\": 676721, \"acRate\": \"46.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"190","questionFrontendId":"190","title":"Reverse Bits","titleSlug":"reverse-bits","translatedTitle":null,"stats":"{\"totalAccepted\": \"607.3K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 607336, \"totalSubmissionRaw\": 1128443, \"acRate\": \"53.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"191","questionFrontendId":"191","title":"Number of 1 Bits","titleSlug":"number-of-1-bits","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"1.6M\", \"totalAcceptedRaw\": 1063190, \"totalSubmissionRaw\": 1600961, \"acRate\": \"66.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"201","questionFrontendId":"201","title":"Bitwise AND of Numbers Range","titleSlug":"bitwise-and-of-numbers-range","translatedTitle":null,"stats":"{\"totalAccepted\": \"237.9K\", \"totalSubmission\": \"559.7K\", \"totalAcceptedRaw\": 237888, \"totalSubmissionRaw\": 559718, \"acRate\": \"42.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"231","questionFrontendId":"231","title":"Power of Two","titleSlug":"power-of-two","translatedTitle":null,"stats":"{\"totalAccepted\": \"854.3K\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 854252, \"totalSubmissionRaw\": 1858107, \"acRate\": \"46.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"260","questionFrontendId":"260","title":"Single Number III","titleSlug":"single-number-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"291.8K\", \"totalSubmission\": \"431.4K\", \"totalAcceptedRaw\": 291819, \"totalSubmissionRaw\": 431415, \"acRate\": \"67.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"266","questionFrontendId":"266","title":"Palindrome Permutation","titleSlug":"palindrome-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"179.8K\", \"totalSubmission\": \"272.3K\", \"totalAcceptedRaw\": 179774, \"totalSubmissionRaw\": 272276, \"acRate\": \"66.0%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"268","questionFrontendId":"268","title":"Missing Number","titleSlug":"missing-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 1431785, \"totalSubmissionRaw\": 2293208, \"acRate\": \"62.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"287","questionFrontendId":"287","title":"Find the Duplicate Number","titleSlug":"find-the-duplicate-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 1130742, \"totalSubmissionRaw\": 1913383, \"acRate\": \"59.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"318","questionFrontendId":"318","title":"Maximum Product of Word Lengths","titleSlug":"maximum-product-of-word-lengths","translatedTitle":null,"stats":"{\"totalAccepted\": \"200.2K\", \"totalSubmission\": \"334.4K\", \"totalAcceptedRaw\": 200248, \"totalSubmissionRaw\": 334389, \"acRate\": \"59.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"320","questionFrontendId":"320","title":"Generalized Abbreviation","titleSlug":"generalized-abbreviation","translatedTitle":null,"stats":"{\"totalAccepted\": \"65K\", \"totalSubmission\": \"112.8K\", \"totalAcceptedRaw\": 65030, \"totalSubmissionRaw\": 112833, \"acRate\": \"57.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"338","questionFrontendId":"338","title":"Counting Bits","titleSlug":"counting-bits","translatedTitle":null,"stats":"{\"totalAccepted\": \"744.1K\", \"totalSubmission\": \"982.9K\", \"totalAcceptedRaw\": 744087, \"totalSubmissionRaw\": 982923, \"acRate\": \"75.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"342","questionFrontendId":"342","title":"Power of Four","titleSlug":"power-of-four","translatedTitle":null,"stats":"{\"totalAccepted\": \"445.7K\", \"totalSubmission\": \"967K\", \"totalAcceptedRaw\": 445660, \"totalSubmissionRaw\": 967022, \"acRate\": \"46.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"371","questionFrontendId":"371","title":"Sum of Two Integers","titleSlug":"sum-of-two-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"372.3K\", \"totalSubmission\": \"734.5K\", \"totalAcceptedRaw\": 372306, \"totalSubmissionRaw\": 734469, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"389","questionFrontendId":"389","title":"Find the Difference","titleSlug":"find-the-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"482.5K\", \"totalSubmission\": \"804.5K\", \"totalAcceptedRaw\": 482524, \"totalSubmissionRaw\": 804520, \"acRate\": \"60.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"393","questionFrontendId":"393","title":"UTF-8 Validation","titleSlug":"utf-8-validation","translatedTitle":null,"stats":"{\"totalAccepted\": \"116.2K\", \"totalSubmission\": \"257.7K\", \"totalAcceptedRaw\": 116171, \"totalSubmissionRaw\": 257712, \"acRate\": \"45.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"397","questionFrontendId":"397","title":"Integer Replacement","titleSlug":"integer-replacement","translatedTitle":null,"stats":"{\"totalAccepted\": \"96.5K\", \"totalSubmission\": \"274.5K\", \"totalAcceptedRaw\": 96515, \"totalSubmissionRaw\": 274519, \"acRate\": \"35.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"401","questionFrontendId":"401","title":"Binary Watch","titleSlug":"binary-watch","translatedTitle":null,"stats":"{\"totalAccepted\": \"122.9K\", \"totalSubmission\": \"235.6K\", \"totalAcceptedRaw\": 122896, \"totalSubmissionRaw\": 235581, \"acRate\": \"52.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"405","questionFrontendId":"405","title":"Convert a Number to Hexadecimal","titleSlug":"convert-a-number-to-hexadecimal","translatedTitle":null,"stats":"{\"totalAccepted\": \"117.5K\", \"totalSubmission\": \"251.8K\", \"totalAcceptedRaw\": 117521, \"totalSubmissionRaw\": 251845, \"acRate\": \"46.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"411","questionFrontendId":"411","title":"Minimum Unique Word Abbreviation","titleSlug":"minimum-unique-word-abbreviation","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"36K\", \"totalAcceptedRaw\": 14181, \"totalSubmissionRaw\": 35994, \"acRate\": \"39.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"421","questionFrontendId":"421","title":"Maximum XOR of Two Numbers in an Array","titleSlug":"maximum-xor-of-two-numbers-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"138.6K\", \"totalSubmission\": \"256.2K\", \"totalAcceptedRaw\": 138621, \"totalSubmissionRaw\": 256228, \"acRate\": \"54.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"461","questionFrontendId":"461","title":"Hamming Distance","titleSlug":"hamming-distance","translatedTitle":null,"stats":"{\"totalAccepted\": \"517.1K\", \"totalSubmission\": \"689.5K\", \"totalAcceptedRaw\": 517070, \"totalSubmissionRaw\": 689478, \"acRate\": \"75.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"464","questionFrontendId":"464","title":"Can I Win","titleSlug":"can-i-win","translatedTitle":null,"stats":"{\"totalAccepted\": \"83.6K\", \"totalSubmission\": \"281.8K\", \"totalAcceptedRaw\": 83628, \"totalSubmissionRaw\": 281764, \"acRate\": \"29.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"465","questionFrontendId":"465","title":"Optimal Account Balancing","titleSlug":"optimal-account-balancing","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.1K\", \"totalSubmission\": \"158.6K\", \"totalAcceptedRaw\": 78082, \"totalSubmissionRaw\": 158560, \"acRate\": \"49.2%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"473","questionFrontendId":"473","title":"Matchsticks to Square","titleSlug":"matchsticks-to-square","translatedTitle":null,"stats":"{\"totalAccepted\": \"139K\", \"totalSubmission\": \"345.8K\", \"totalAcceptedRaw\": 139023, \"totalSubmissionRaw\": 345797, \"acRate\": \"40.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"476","questionFrontendId":"476","title":"Number Complement","titleSlug":"number-complement","translatedTitle":null,"stats":"{\"totalAccepted\": \"292K\", \"totalSubmission\": \"433.6K\", \"totalAcceptedRaw\": 291964, \"totalSubmissionRaw\": 433627, \"acRate\": \"67.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"477","questionFrontendId":"477","title":"Total Hamming Distance","titleSlug":"total-hamming-distance","translatedTitle":null,"stats":"{\"totalAccepted\": \"96.7K\", \"totalSubmission\": \"185.4K\", \"totalAcceptedRaw\": 96698, \"totalSubmissionRaw\": 185426, \"acRate\": \"52.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"491","questionFrontendId":"491","title":"Non-decreasing Subsequences","titleSlug":"non-decreasing-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"146.6K\", \"totalSubmission\": \"243.8K\", \"totalAcceptedRaw\": 146564, \"totalSubmissionRaw\": 243806, \"acRate\": \"60.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"526","questionFrontendId":"526","title":"Beautiful Arrangement","titleSlug":"beautiful-arrangement","translatedTitle":null,"stats":"{\"totalAccepted\": \"149.6K\", \"totalSubmission\": \"232K\", \"totalAcceptedRaw\": 149569, \"totalSubmissionRaw\": 232039, \"acRate\": \"64.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"638","questionFrontendId":"638","title":"Shopping Offers","titleSlug":"shopping-offers","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.1K\", \"totalSubmission\": \"97.6K\", \"totalAcceptedRaw\": 52064, \"totalSubmissionRaw\": 97609, \"acRate\": \"53.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"645","questionFrontendId":"645","title":"Set Mismatch","titleSlug":"set-mismatch","translatedTitle":null,"stats":"{\"totalAccepted\": \"262.8K\", \"totalSubmission\": \"614.7K\", \"totalAcceptedRaw\": 262794, \"totalSubmissionRaw\": 614699, \"acRate\": \"42.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"672","questionFrontendId":"672","title":"Bulb Switcher II","titleSlug":"bulb-switcher-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.2K\", \"totalSubmission\": \"37.9K\", \"totalAcceptedRaw\": 19220, \"totalSubmissionRaw\": 37903, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"691","questionFrontendId":"691","title":"Stickers to Spell Word","titleSlug":"stickers-to-spell-word","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.2K\", \"totalSubmission\": \"80.4K\", \"totalAcceptedRaw\": 37219, \"totalSubmissionRaw\": 80424, \"acRate\": \"46.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"693","questionFrontendId":"693","title":"Binary Number with Alternating Bits","titleSlug":"binary-number-with-alternating-bits","translatedTitle":null,"stats":"{\"totalAccepted\": \"110.7K\", \"totalSubmission\": \"179.8K\", \"totalAcceptedRaw\": 110703, \"totalSubmissionRaw\": 179804, \"acRate\": \"61.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"698","questionFrontendId":"698","title":"Partition to K Equal Sum Subsets","titleSlug":"partition-to-k-equal-sum-subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"232.1K\", \"totalSubmission\": \"579K\", \"totalAcceptedRaw\": 232079, \"totalSubmissionRaw\": 578988, \"acRate\": \"40.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"752","questionFrontendId":"751","title":"IP to CIDR","titleSlug":"ip-to-cidr","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.7K\", \"totalSubmission\": \"32.5K\", \"totalAcceptedRaw\": 17699, \"totalSubmissionRaw\": 32480, \"acRate\": \"54.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"757","questionFrontendId":"756","title":"Pyramid Transition Matrix","titleSlug":"pyramid-transition-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"30K\", \"totalSubmission\": \"56.9K\", \"totalAcceptedRaw\": 30016, \"totalSubmissionRaw\": 56938, \"acRate\": \"52.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"767","questionFrontendId":"762","title":"Prime Number of Set Bits in Binary Representation","titleSlug":"prime-number-of-set-bits-in-binary-representation","translatedTitle":null,"stats":"{\"totalAccepted\": \"80.8K\", \"totalSubmission\": \"118.9K\", \"totalAcceptedRaw\": 80817, \"totalSubmissionRaw\": 118885, \"acRate\": \"68.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"795","questionFrontendId":"779","title":"K-th Symbol in Grammar","titleSlug":"k-th-symbol-in-grammar","translatedTitle":null,"stats":"{\"totalAccepted\": \"111K\", \"totalSubmission\": \"269K\", \"totalAcceptedRaw\": 110976, \"totalSubmissionRaw\": 269039, \"acRate\": \"41.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"798","questionFrontendId":"782","title":"Transform to Chessboard","titleSlug":"transform-to-chessboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.8K\", \"totalSubmission\": \"30.6K\", \"totalAcceptedRaw\": 15836, \"totalSubmissionRaw\": 30625, \"acRate\": \"51.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"800","questionFrontendId":"784","title":"Letter Case Permutation","titleSlug":"letter-case-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"266.4K\", \"totalSubmission\": \"361.1K\", \"totalAcceptedRaw\": 266409, \"totalSubmissionRaw\": 361088, \"acRate\": \"73.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"823","questionFrontendId":"805","title":"Split Array With Same Average","titleSlug":"split-array-with-same-average","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.9K\", \"totalSubmission\": \"116.5K\", \"totalAcceptedRaw\": 29911, \"totalSubmissionRaw\": 116468, \"acRate\": \"25.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"828","questionFrontendId":"810","title":"Chalkboard XOR Game","titleSlug":"chalkboard-xor-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"8K\", \"totalSubmission\": \"14.3K\", \"totalAcceptedRaw\": 8021, \"totalSubmissionRaw\": 14260, \"acRate\": \"56.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"877","questionFrontendId":"847","title":"Shortest Path Visiting All Nodes","titleSlug":"shortest-path-visiting-all-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"68.7K\", \"totalSubmission\": \"112.4K\", \"totalAcceptedRaw\": 68660, \"totalSubmissionRaw\": 112391, \"acRate\": \"61.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"891","questionFrontendId":"861","title":"Score After Flipping Matrix","titleSlug":"score-after-flipping-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.7K\", \"totalSubmission\": \"54.3K\", \"totalAcceptedRaw\": 40694, \"totalSubmissionRaw\": 54294, \"acRate\": \"75.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"895","questionFrontendId":"864","title":"Shortest Path to Get All Keys","titleSlug":"shortest-path-to-get-all-keys","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.5K\", \"totalSubmission\": \"66.9K\", \"totalAcceptedRaw\": 30479, \"totalSubmissionRaw\": 66925, \"acRate\": \"45.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"899","questionFrontendId":"868","title":"Binary Gap","titleSlug":"binary-gap","translatedTitle":null,"stats":"{\"totalAccepted\": \"68.1K\", \"totalSubmission\": \"109.5K\", \"totalAcceptedRaw\": 68070, \"totalSubmissionRaw\": 109497, \"acRate\": \"62.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"934","questionFrontendId":"898","title":"Bitwise ORs of Subarrays","titleSlug":"bitwise-ors-of-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.5K\", \"totalSubmission\": \"81.9K\", \"totalAcceptedRaw\": 30458, \"totalSubmissionRaw\": 81921, \"acRate\": \"37.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"980","questionFrontendId":"943","title":"Find the Shortest Superstring","titleSlug":"find-the-shortest-superstring","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.8K\", \"totalSubmission\": \"58K\", \"totalAcceptedRaw\": 25813, \"totalSubmissionRaw\": 58022, \"acRate\": \"44.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"994","questionFrontendId":"957","title":"Prison Cells After N Days","titleSlug":"prison-cells-after-n-days","translatedTitle":null,"stats":"{\"totalAccepted\": \"151.5K\", \"totalSubmission\": \"387.8K\", \"totalAcceptedRaw\": 151477, \"totalSubmissionRaw\": 387757, \"acRate\": \"39.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1022","questionFrontendId":"980","title":"Unique Paths III","titleSlug":"unique-paths-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"172.2K\", \"totalSubmission\": \"210.3K\", \"totalAcceptedRaw\": 172206, \"totalSubmissionRaw\": 210334, \"acRate\": \"81.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1024","questionFrontendId":"982","title":"Triples with Bitwise AND Equal To Zero","titleSlug":"triples-with-bitwise-and-equal-to-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.7K\", \"totalSubmission\": \"25.5K\", \"totalAcceptedRaw\": 14665, \"totalSubmissionRaw\": 25478, \"acRate\": \"57.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1037","questionFrontendId":"995","title":"Minimum Number of K Consecutive Bit Flips","titleSlug":"minimum-number-of-k-consecutive-bit-flips","translatedTitle":null,"stats":"{\"totalAccepted\": \"30K\", \"totalSubmission\": \"58.7K\", \"totalAcceptedRaw\": 30028, \"totalSubmissionRaw\": 58669, \"acRate\": \"51.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1038","questionFrontendId":"996","title":"Number of Squareful Arrays","titleSlug":"number-of-squareful-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.6K\", \"totalSubmission\": \"62.2K\", \"totalAcceptedRaw\": 30618, \"totalSubmissionRaw\": 62202, \"acRate\": \"49.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1054","questionFrontendId":"1009","title":"Complement of Base 10 Integer","titleSlug":"complement-of-base-10-integer","translatedTitle":null,"stats":"{\"totalAccepted\": \"172.7K\", \"totalSubmission\": \"280.5K\", \"totalAcceptedRaw\": 172717, \"totalSubmissionRaw\": 280544, \"acRate\": \"61.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1067","questionFrontendId":"1066","title":"Campus Bikes II","titleSlug":"campus-bikes-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.4K\", \"totalSubmission\": \"81K\", \"totalAcceptedRaw\": 44444, \"totalSubmissionRaw\": 80995, \"acRate\": \"54.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1189","questionFrontendId":"1256","title":"Encode Number","titleSlug":"encode-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"7K\", \"totalSubmission\": \"10.1K\", \"totalAcceptedRaw\": 7038, \"totalSubmissionRaw\": 10071, \"acRate\": \"69.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1220","questionFrontendId":"1125","title":"Smallest Sufficient Team","titleSlug":"smallest-sufficient-team","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.6K\", \"totalSubmission\": \"39.9K\", \"totalAcceptedRaw\": 18642, \"totalSubmissionRaw\": 39854, \"acRate\": \"46.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1281","questionFrontendId":"1177","title":"Can Make Palindrome from Substring","titleSlug":"can-make-palindrome-from-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.4K\", \"totalSubmission\": \"61.6K\", \"totalAcceptedRaw\": 23400, \"totalSubmissionRaw\": 61594, \"acRate\": \"38.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1282","questionFrontendId":"1178","title":"Number of Valid Words for Each Puzzle","titleSlug":"number-of-valid-words-for-each-puzzle","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.4K\", \"totalSubmission\": \"61.4K\", \"totalAcceptedRaw\": 28445, \"totalSubmissionRaw\": 61429, \"acRate\": \"46.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1359","questionFrontendId":"1238","title":"Circular Permutation in Binary Representation","titleSlug":"circular-permutation-in-binary-representation","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.6K\", \"totalSubmission\": \"21.2K\", \"totalAcceptedRaw\": 14582, \"totalSubmissionRaw\": 21201, \"acRate\": \"68.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1360","questionFrontendId":"1239","title":"Maximum Length of a Concatenated String with Unique Characters","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"170.2K\", \"totalSubmission\": \"326.2K\", \"totalAcceptedRaw\": 170160, \"totalSubmissionRaw\": 326223, \"acRate\": \"52.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1381","questionFrontendId":"1255","title":"Maximum Score Words Formed by Letters","titleSlug":"maximum-score-words-formed-by-letters","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.3K\", \"totalSubmission\": \"40.4K\", \"totalAcceptedRaw\": 29283, \"totalSubmissionRaw\": 40433, \"acRate\": \"72.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1409","questionFrontendId":"1284","title":"Minimum Number of Flips to Convert Binary Matrix to Zero Matrix","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.9K\", \"totalSubmission\": \"40.2K\", \"totalAcceptedRaw\": 28917, \"totalSubmissionRaw\": 40221, \"acRate\": \"71.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1418","questionFrontendId":"2305","title":"Fair Distribution of Cookies","titleSlug":"fair-distribution-of-cookies","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"36K\", \"totalAcceptedRaw\": 22289, \"totalSubmissionRaw\": 36014, \"acRate\": \"61.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1435","questionFrontendId":"1310","title":"XOR Queries of a Subarray","titleSlug":"xor-queries-of-a-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.4K\", \"totalSubmission\": \"64.2K\", \"totalAcceptedRaw\": 46389, \"totalSubmissionRaw\": 64174, \"acRate\": \"72.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1441","questionFrontendId":"1318","title":"Minimum Flips to Make a OR b Equal to c","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.4K\", \"totalSubmission\": \"44.6K\", \"totalAcceptedRaw\": 29448, \"totalSubmissionRaw\": 44646, \"acRate\": \"66.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1444","questionFrontendId":"1342","title":"Number of Steps to Reduce a Number to Zero","titleSlug":"number-of-steps-to-reduce-a-number-to-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"482.6K\", \"totalSubmission\": \"566.6K\", \"totalAcceptedRaw\": 482627, \"totalSubmissionRaw\": 566634, \"acRate\": \"85.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1458","questionFrontendId":"1356","title":"Sort Integers by The Number of 1 Bits","titleSlug":"sort-integers-by-the-number-of-1-bits","translatedTitle":null,"stats":"{\"totalAccepted\": \"106.6K\", \"totalSubmission\": \"146.1K\", \"totalAcceptedRaw\": 106562, \"totalSubmissionRaw\": 146099, \"acRate\": \"72.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1471","questionFrontendId":"1349","title":"Maximum Students Taking Exam","titleSlug":"maximum-students-taking-exam","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.7K\", \"totalSubmission\": \"26K\", \"totalAcceptedRaw\": 12718, \"totalSubmissionRaw\": 25989, \"acRate\": \"48.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1473","questionFrontendId":"1371","title":"Find the Longest Substring Containing Vowels in Even Counts","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.1K\", \"totalSubmission\": \"35K\", \"totalAcceptedRaw\": 22143, \"totalSubmissionRaw\": 35043, \"acRate\": \"63.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1487","questionFrontendId":"1386","title":"Cinema Seat Allocation","titleSlug":"cinema-seat-allocation","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.8K\", \"totalSubmission\": \"92.3K\", \"totalAcceptedRaw\": 37761, \"totalSubmissionRaw\": 92306, \"acRate\": \"40.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1520","questionFrontendId":"1404","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.5K\", \"totalSubmission\": \"63.8K\", \"totalAcceptedRaw\": 33506, \"totalSubmissionRaw\": 63755, \"acRate\": \"52.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1531","questionFrontendId":"1434","title":"Number of Ways to Wear Different Hats to Each Other","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.4K\", \"totalSubmission\": \"26.6K\", \"totalAcceptedRaw\": 11431, \"totalSubmissionRaw\": 26557, \"acRate\": \"43.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1553","questionFrontendId":"1442","title":"Count Triplets That Can Form Two Arrays of Equal XOR","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.4K\", \"totalSubmission\": \"41.3K\", \"totalAcceptedRaw\": 31365, \"totalSubmissionRaw\": 41263, \"acRate\": \"76.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1557","questionFrontendId":"1461","title":"Check If a String Contains All Binary Codes of Size K","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"108.2K\", \"totalSubmission\": \"191.1K\", \"totalAcceptedRaw\": 108224, \"totalSubmissionRaw\": 191129, \"acRate\": \"56.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1568","questionFrontendId":"1457","title":"Pseudo-Palindromic Paths in a Binary Tree","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"113.3K\", \"totalSubmission\": \"167K\", \"totalAcceptedRaw\": 113277, \"totalSubmissionRaw\": 166963, \"acRate\": \"67.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1587","questionFrontendId":"1494","title":"Parallel Courses II","titleSlug":"parallel-courses-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.5K\", \"totalSubmission\": \"44.5K\", \"totalAcceptedRaw\": 13528, \"totalSubmissionRaw\": 44467, \"acRate\": \"30.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1610","questionFrontendId":"1486","title":"XOR Operation in an Array","titleSlug":"xor-operation-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"150.9K\", \"totalSubmission\": \"178.3K\", \"totalAcceptedRaw\": 150895, \"totalSubmissionRaw\": 178344, \"acRate\": \"84.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1632","questionFrontendId":"1525","title":"Number of Good Ways to Split a String","titleSlug":"number-of-good-ways-to-split-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"87.9K\", \"totalSubmission\": \"127.4K\", \"totalAcceptedRaw\": 87869, \"totalSubmissionRaw\": 127374, \"acRate\": \"69.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1645","questionFrontendId":"1521","title":"Find a Value of a Mysterious Function Closest to Target","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"19.8K\", \"totalAcceptedRaw\": 8608, \"totalSubmissionRaw\": 19783, \"acRate\": \"43.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1650","questionFrontendId":"1506","title":"Find Root of N-Ary Tree","titleSlug":"find-root-of-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"29K\", \"totalSubmission\": \"36.9K\", \"totalAcceptedRaw\": 28988, \"totalSubmissionRaw\": 36911, \"acRate\": \"78.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1662","questionFrontendId":"1558","title":"Minimum Numbers of Function Calls to Make Target Array","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"18K\", \"totalSubmission\": \"28.2K\", \"totalAcceptedRaw\": 18001, \"totalSubmissionRaw\": 28183, \"acRate\": \"63.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1668","questionFrontendId":"1542","title":"Find Longest Awesome Substring","titleSlug":"find-longest-awesome-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.1K\", \"totalSubmission\": \"26.9K\", \"totalAcceptedRaw\": 11135, \"totalSubmissionRaw\": 26865, \"acRate\": \"41.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1717","questionFrontendId":"1595","title":"Minimum Cost to Connect Two Groups of Points","titleSlug":"minimum-cost-to-connect-two-groups-of-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.2K\", \"totalSubmission\": \"15.5K\", \"totalAcceptedRaw\": 7189, \"totalSubmissionRaw\": 15474, \"acRate\": \"46.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1723","questionFrontendId":"1601","title":"Maximum Number of Achievable Transfer Requests","titleSlug":"maximum-number-of-achievable-transfer-requests","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"17.9K\", \"totalAcceptedRaw\": 9170, \"totalSubmissionRaw\": 17924, \"acRate\": \"51.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1732","questionFrontendId":"1611","title":"Minimum One Bit Operations to Make Integers Zero","titleSlug":"minimum-one-bit-operations-to-make-integers-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.5K\", \"totalSubmission\": \"19.8K\", \"totalAcceptedRaw\": 12543, \"totalSubmissionRaw\": 19806, \"acRate\": \"63.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1740","questionFrontendId":"1617","title":"Count Subtrees With Max Distance Between Cities","titleSlug":"count-subtrees-with-max-distance-between-cities","translatedTitle":null,"stats":"{\"totalAccepted\": \"8K\", \"totalSubmission\": \"12.1K\", \"totalAcceptedRaw\": 7981, \"totalSubmissionRaw\": 12078, \"acRate\": \"66.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1758","questionFrontendId":"1655","title":"Distribute Repeating Integers","titleSlug":"distribute-repeating-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.2K\", \"totalSubmission\": \"26.1K\", \"totalAcceptedRaw\": 10163, \"totalSubmissionRaw\": 26134, \"acRate\": \"38.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1778","questionFrontendId":"1659","title":"Maximize Grid Happiness","titleSlug":"maximize-grid-happiness","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"11.2K\", \"totalAcceptedRaw\": 4279, \"totalSubmissionRaw\": 11210, \"acRate\": \"38.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1786","questionFrontendId":"1684","title":"Count the Number of Consistent Strings","titleSlug":"count-the-number-of-consistent-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.2K\", \"totalSubmission\": \"151.1K\", \"totalAcceptedRaw\": 124227, \"totalSubmissionRaw\": 151147, \"acRate\": \"82.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1799","questionFrontendId":"1681","title":"Minimum Incompatibility","titleSlug":"minimum-incompatibility","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.7K\", \"totalSubmission\": \"18K\", \"totalAcceptedRaw\": 6735, \"totalSubmissionRaw\": 18002, \"acRate\": \"37.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1800","questionFrontendId":"1680","title":"Concatenation of Consecutive Binary Numbers","titleSlug":"concatenation-of-consecutive-binary-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"86.8K\", \"totalSubmission\": \"152.3K\", \"totalAcceptedRaw\": 86781, \"totalSubmissionRaw\": 152305, \"acRate\": \"57.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1825","questionFrontendId":"1723","title":"Find Minimum Time to Finish All Jobs","titleSlug":"find-minimum-time-to-finish-all-jobs","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.3K\", \"totalSubmission\": \"47.7K\", \"totalAcceptedRaw\": 20251, \"totalSubmissionRaw\": 47657, \"acRate\": \"42.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1826","questionFrontendId":"1707","title":"Maximum XOR With an Element From Array","titleSlug":"maximum-xor-with-an-element-from-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.6K\", \"totalSubmission\": \"30.4K\", \"totalAcceptedRaw\": 13607, \"totalSubmissionRaw\": 30384, \"acRate\": \"44.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1835","questionFrontendId":"1734","title":"Decode XORed Permutation","titleSlug":"decode-xored-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"12K\", \"totalSubmission\": \"19.1K\", \"totalAcceptedRaw\": 12013, \"totalSubmissionRaw\": 19068, \"acRate\": \"63.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1839","questionFrontendId":"1720","title":"Decode XORed Array","titleSlug":"decode-xored-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"107.4K\", \"totalSubmission\": \"125.2K\", \"totalAcceptedRaw\": 107419, \"totalSubmissionRaw\": 125186, \"acRate\": \"85.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1860","questionFrontendId":"1738","title":"Find Kth Largest XOR Coordinate Value","titleSlug":"find-kth-largest-xor-coordinate-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.3K\", \"totalSubmission\": \"29.9K\", \"totalAcceptedRaw\": 18263, \"totalSubmissionRaw\": 29935, \"acRate\": \"61.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Quickselect","translatedName":null,"slug":"quickselect","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1873","questionFrontendId":"1763","title":"Longest Nice Substring","titleSlug":"longest-nice-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.7K\", \"totalSubmission\": \"59.5K\", \"totalAcceptedRaw\": 36653, \"totalSubmissionRaw\": 59499, \"acRate\": \"61.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1881","questionFrontendId":"1755","title":"Closest Subsequence Sum","titleSlug":"closest-subsequence-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"32K\", \"totalAcceptedRaw\": 11748, \"totalSubmissionRaw\": 32027, \"acRate\": \"36.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1906","questionFrontendId":"1799","title":"Maximize Score After N Operations","titleSlug":"maximize-score-after-n-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.9K\", \"totalSubmission\": \"34.5K\", \"totalAcceptedRaw\": 15865, \"totalSubmissionRaw\": 34490, \"acRate\": \"46.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1907","questionFrontendId":"1803","title":"Count Pairs With XOR in a Range","titleSlug":"count-pairs-with-xor-in-a-range","translatedTitle":null,"stats":"{\"totalAccepted\": \"6K\", \"totalSubmission\": \"12.7K\", \"totalAcceptedRaw\": 5970, \"totalSubmissionRaw\": 12705, \"acRate\": \"47.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1913","questionFrontendId":"1787","title":"Make the XOR of All Segments Equal to Zero","titleSlug":"make-the-xor-of-all-segments-equal-to-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"11K\", \"totalAcceptedRaw\": 4345, \"totalSubmissionRaw\": 11026, \"acRate\": \"39.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1924","questionFrontendId":"1815","title":"Maximum Number of Groups Getting Fresh Donuts","titleSlug":"maximum-number-of-groups-getting-fresh-donuts","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"13.4K\", \"totalAcceptedRaw\": 5377, \"totalSubmissionRaw\": 13425, \"acRate\": \"40.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1940","questionFrontendId":"1829","title":"Maximum XOR for Each Query","titleSlug":"maximum-xor-for-each-query","translatedTitle":null,"stats":"{\"totalAccepted\": \"22K\", \"totalSubmission\": \"28.7K\", \"totalAcceptedRaw\": 22011, \"totalSubmissionRaw\": 28677, \"acRate\": \"76.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1963","questionFrontendId":"1835","title":"Find XOR Sum of All Pairs Bitwise AND","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.7K\", \"totalSubmission\": \"24.1K\", \"totalAcceptedRaw\": 14652, \"totalSubmissionRaw\": 24115, \"acRate\": \"60.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1989","questionFrontendId":"1879","title":"Minimum XOR Sum of Two Arrays","titleSlug":"minimum-xor-sum-of-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.4K\", \"totalSubmission\": \"23.1K\", \"totalAcceptedRaw\": 10396, \"totalSubmissionRaw\": 23089, \"acRate\": \"45.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1993","questionFrontendId":"1863","title":"Sum of All Subset XOR Totals","titleSlug":"sum-of-all-subset-xor-totals","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.4K\", \"totalSubmission\": \"64.4K\", \"totalAcceptedRaw\": 51448, \"totalSubmissionRaw\": 64365, \"acRate\": \"79.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2007","questionFrontendId":"2247","title":"Maximum Cost of Trip With K Highways","titleSlug":"maximum-cost-of-trip-with-k-highways","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2K\", \"totalSubmission\": \"2.3K\", \"totalAcceptedRaw\": 1152, \"totalSubmissionRaw\": 2271, \"acRate\": \"50.7%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2044","questionFrontendId":"1915","title":"Number of Wonderful Substrings","titleSlug":"number-of-wonderful-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.8K\", \"totalSubmission\": \"23.9K\", \"totalAcceptedRaw\": 10803, \"totalSubmissionRaw\": 23880, \"acRate\": \"45.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2062","questionFrontendId":"1908","title":"Game of Nim","titleSlug":"game-of-nim","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.8K\", \"totalSubmission\": \"6K\", \"totalAcceptedRaw\": 3849, \"totalSubmissionRaw\": 5963, \"acRate\": \"64.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2068","questionFrontendId":"1938","title":"Maximum Genetic Difference Query","titleSlug":"maximum-genetic-difference-query","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.2K\", \"totalSubmission\": \"10.7K\", \"totalAcceptedRaw\": 4229, \"totalSubmissionRaw\": 10687, \"acRate\": \"39.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2078","questionFrontendId":"1947","title":"Maximum Compatibility Score Sum","titleSlug":"maximum-compatibility-score-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.1K\", \"totalSubmission\": \"31.3K\", \"totalAcceptedRaw\": 19085, \"totalSubmissionRaw\": 31295, \"acRate\": \"61.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2105","questionFrontendId":"1994","title":"The Number of Good Subsets","titleSlug":"the-number-of-good-subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.1K\", \"totalSubmission\": \"14.7K\", \"totalAcceptedRaw\": 5111, \"totalSubmissionRaw\": 14706, \"acRate\": \"34.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2114","questionFrontendId":"1986","title":"Minimum Number of Work Sessions to Finish the Tasks","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.3K\", \"totalSubmission\": \"59.1K\", \"totalAcceptedRaw\": 19336, \"totalSubmissionRaw\": 59096, \"acRate\": \"32.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2130","questionFrontendId":"2002","title":"Maximum Product of the Length of Two Palindromic Subsequences","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.3K\", \"totalSubmission\": \"31.9K\", \"totalAcceptedRaw\": 17337, \"totalSubmissionRaw\": 31860, \"acRate\": \"54.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2162","questionFrontendId":"2035","title":"Partition Array Into Two Arrays to Minimize Sum Difference","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.1K\", \"totalSubmission\": \"69.8K\", \"totalAcceptedRaw\": 13133, \"totalSubmissionRaw\": 69768, \"acRate\": \"18.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2170","questionFrontendId":"2044","title":"Count Number of Maximum Bitwise-OR Subsets","titleSlug":"count-number-of-maximum-bitwise-or-subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.1K\", \"totalSubmission\": \"26.6K\", \"totalAcceptedRaw\": 20123, \"totalSubmissionRaw\": 26636, \"acRate\": \"75.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2256","questionFrontendId":"2135","title":"Count Words Obtained After Adding a Letter","titleSlug":"count-words-obtained-after-adding-a-letter","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.3K\", \"totalSubmission\": \"68.4K\", \"totalAcceptedRaw\": 29298, \"totalSubmissionRaw\": 68420, \"acRate\": \"42.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2268","questionFrontendId":"2128","title":"Remove All Ones With Row and Column Flips","titleSlug":"remove-all-ones-with-row-and-column-flips","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.2K\", \"totalSubmission\": \"39.6K\", \"totalAcceptedRaw\": 30229, \"totalSubmissionRaw\": 39600, \"acRate\": \"76.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2272","questionFrontendId":"2151","title":"Maximum Good People Based on Statements","titleSlug":"maximum-good-people-based-on-statements","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.1K\", \"totalSubmission\": \"22.5K\", \"totalAcceptedRaw\": 11058, \"totalSubmissionRaw\": 22463, \"acRate\": \"49.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2276","questionFrontendId":"2157","title":"Groups of Strings","titleSlug":"groups-of-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.5K\", \"totalSubmission\": \"29.2K\", \"totalAcceptedRaw\": 7509, \"totalSubmissionRaw\": 29246, \"acRate\": \"25.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2287","questionFrontendId":"2152","title":"Minimum Number of Lines to Cover Points","titleSlug":"minimum-number-of-lines-to-cover-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"3K\", \"totalAcceptedRaw\": 1407, \"totalSubmissionRaw\": 3016, \"acRate\": \"46.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2291","questionFrontendId":"2172","title":"Maximum AND Sum of Array","titleSlug":"maximum-and-sum-of-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.5K\", \"totalSubmission\": \"21.7K\", \"totalAcceptedRaw\": 10496, \"totalSubmissionRaw\": 21726, \"acRate\": \"48.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2308","questionFrontendId":"2206","title":"Divide Array Into Equal Pairs","titleSlug":"divide-array-into-equal-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.2K\", \"totalSubmission\": \"69.2K\", \"totalAcceptedRaw\": 51177, \"totalSubmissionRaw\": 69249, \"acRate\": \"73.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2314","questionFrontendId":"2174","title":"Remove All Ones With Row and Column Flips II","titleSlug":"remove-all-ones-with-row-and-column-flips-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.1K\", \"totalSubmission\": \"6K\", \"totalAcceptedRaw\": 4101, \"totalSubmissionRaw\": 6016, \"acRate\": \"68.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2318","questionFrontendId":"2212","title":"Maximum Points in an Archery Competition","titleSlug":"maximum-points-in-an-archery-competition","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.4K\", \"totalSubmission\": \"25.1K\", \"totalAcceptedRaw\": 12415, \"totalSubmissionRaw\": 25067, \"acRate\": \"49.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2322","questionFrontendId":"2184","title":"Number of Ways to Build Sturdy Brick Wall","titleSlug":"number-of-ways-to-build-sturdy-brick-wall","translatedTitle":null,"stats":"{\"totalAccepted\": \"5K\", \"totalSubmission\": \"10K\", \"totalAcceptedRaw\": 5024, \"totalSubmissionRaw\": 10015, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2323","questionFrontendId":"2220","title":"Minimum Bit Flips to Convert Number","titleSlug":"minimum-bit-flips-to-convert-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.5K\", \"totalSubmission\": \"44.3K\", \"totalAcceptedRaw\": 36464, \"totalSubmissionRaw\": 44318, \"acRate\": \"82.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2356","questionFrontendId":"2275","title":"Largest Combination With Bitwise AND Greater Than Zero","titleSlug":"largest-combination-with-bitwise-and-greater-than-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.2K\", \"totalSubmission\": \"27.9K\", \"totalAcceptedRaw\": 20201, \"totalSubmissionRaw\": 27919, \"acRate\": \"72.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2390","questionFrontendId":"2306","title":"Naming a Company","titleSlug":"naming-a-company","translatedTitle":null,"stats":"{\"totalAccepted\": \"54.7K\", \"totalSubmission\": \"116.1K\", \"totalAcceptedRaw\": 54658, \"totalSubmissionRaw\": 116079, \"acRate\": \"47.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2400","questionFrontendId":"2322","title":"Minimum Score After Removals on a Tree","titleSlug":"minimum-score-after-removals-on-a-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"10.6K\", \"totalAcceptedRaw\": 5358, \"totalSubmissionRaw\": 10554, \"acRate\": \"50.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2402","questionFrontendId":"2317","title":"Maximum XOR After Operations ","titleSlug":"maximum-xor-after-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.8K\", \"totalSubmission\": \"21.2K\", \"totalAcceptedRaw\": 16779, \"totalSubmissionRaw\": 21198, \"acRate\": \"79.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2430","questionFrontendId":"2354","title":"Number of Excellent Pairs","titleSlug":"number-of-excellent-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.8K\", \"totalSubmission\": \"25.6K\", \"totalAcceptedRaw\": 11797, \"totalSubmissionRaw\": 25639, \"acRate\": \"46.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2478","questionFrontendId":"2401","title":"Longest Nice Subarray","titleSlug":"longest-nice-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.3K\", \"totalSubmission\": \"41.3K\", \"totalAcceptedRaw\": 20313, \"totalSubmissionRaw\": 41272, \"acRate\": \"49.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2482","questionFrontendId":"2397","title":"Maximum Rows Covered by Columns","titleSlug":"maximum-rows-covered-by-columns","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"22.2K\", \"totalAcceptedRaw\": 11694, \"totalSubmissionRaw\": 22158, \"acRate\": \"52.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2498","questionFrontendId":"2411","title":"Smallest Subarrays With Maximum Bitwise OR","titleSlug":"smallest-subarrays-with-maximum-bitwise-or","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.4K\", \"totalSubmission\": \"22.5K\", \"totalAcceptedRaw\": 9379, \"totalSubmissionRaw\": 22537, \"acRate\": \"41.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2503","questionFrontendId":"2419","title":"Longest Subarray With Maximum Bitwise AND","titleSlug":"longest-subarray-with-maximum-bitwise-and","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"44.2K\", \"totalAcceptedRaw\": 21192, \"totalSubmissionRaw\": 44194, \"acRate\": \"48.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2509","questionFrontendId":"2429","title":"Minimize XOR","titleSlug":"minimize-xor","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.4K\", \"totalSubmission\": \"41K\", \"totalAcceptedRaw\": 17431, \"totalSubmissionRaw\": 41019, \"acRate\": \"42.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2519","questionFrontendId":"2433","title":"Find The Original Array of Prefix Xor","titleSlug":"find-the-original-array-of-prefix-xor","translatedTitle":null,"stats":"{\"totalAccepted\": \"31K\", \"totalSubmission\": \"36.2K\", \"totalAcceptedRaw\": 30954, \"totalSubmissionRaw\": 36158, \"acRate\": \"85.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2529","questionFrontendId":"2438","title":"Range Product Queries of Powers","titleSlug":"range-product-queries-of-powers","translatedTitle":null,"stats":"{\"totalAccepted\": \"13K\", \"totalSubmission\": \"33.5K\", \"totalAcceptedRaw\": 13023, \"totalSubmissionRaw\": 33464, \"acRate\": \"38.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2533","questionFrontendId":"2425","title":"Bitwise XOR of All Pairings","titleSlug":"bitwise-xor-of-all-pairings","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.1K\", \"totalSubmission\": \"24K\", \"totalAcceptedRaw\": 14054, \"totalSubmissionRaw\": 23993, \"acRate\": \"58.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2537","questionFrontendId":"2403","title":"Minimum Time to Kill All Monsters","titleSlug":"minimum-time-to-kill-all-monsters","translatedTitle":null,"stats":"{\"totalAccepted\": \"754\", \"totalSubmission\": \"1.5K\", \"totalAcceptedRaw\": 754, \"totalSubmissionRaw\": 1473, \"acRate\": \"51.2%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2621","questionFrontendId":"2527","title":"Find Xor-Beauty of Array","titleSlug":"find-xor-beauty-of-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.5K\", \"totalSubmission\": \"19.2K\", \"totalAcceptedRaw\": 13480, \"totalSubmissionRaw\": 19234, \"acRate\": \"70.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2632","questionFrontendId":"2546","title":"Apply Bitwise Operations to Make Strings Equal","titleSlug":"apply-bitwise-operations-to-make-strings-equal","translatedTitle":null,"stats":"{\"totalAccepted\": \"15K\", \"totalSubmission\": \"36.9K\", \"totalAcceptedRaw\": 15007, \"totalSubmissionRaw\": 36931, \"acRate\": \"40.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2644","questionFrontendId":"2505","title":"Bitwise OR of All Subsequence Sums","titleSlug":"bitwise-or-of-all-subsequence-sums","translatedTitle":null,"stats":"{\"totalAccepted\": \"555\", \"totalSubmission\": \"930\", \"totalAcceptedRaw\": 555, \"totalSubmissionRaw\": 930, \"acRate\": \"59.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2656","questionFrontendId":"2588","title":"Count the Number of Beautiful Subarrays","titleSlug":"count-the-number-of-beautiful-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.4K\", \"totalSubmission\": \"21.3K\", \"totalAcceptedRaw\": 10382, \"totalSubmissionRaw\": 21331, \"acRate\": \"48.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2700","questionFrontendId":"2564","title":"Substring XOR Queries","titleSlug":"substring-xor-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.3K\", \"totalSubmission\": \"27.8K\", \"totalAcceptedRaw\": 9300, \"totalSubmissionRaw\": 27784, \"acRate\": \"33.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2705","questionFrontendId":"2568","title":"Minimum Impossible OR","titleSlug":"minimum-impossible-or","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.7K\", \"totalSubmission\": \"18.8K\", \"totalAcceptedRaw\": 10737, \"totalSubmissionRaw\": 18771, \"acRate\": \"57.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2710","questionFrontendId":"2571","title":"Minimum Operations to Reduce an Integer to 0","titleSlug":"minimum-operations-to-reduce-an-integer-to-0","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.6K\", \"totalSubmission\": \"29.7K\", \"totalAcceptedRaw\": 14601, \"totalSubmissionRaw\": 29693, \"acRate\": \"49.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/tmp/breadth-first-search-graphql.json b/tmp/breadth-first-search-graphql.json
new file mode 100644
index 000000000..d6618ec89
--- /dev/null
+++ b/tmp/breadth-first-search-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","questions":[{"status":null,"questionId":"100","questionFrontendId":"100","title":"Same Tree","titleSlug":"same-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5M\", \"totalSubmission\": \"2.5M\", \"totalAcceptedRaw\": 1470483, \"totalSubmissionRaw\": 2533188, \"acRate\": \"58.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"101","questionFrontendId":"101","title":"Symmetric Tree","titleSlug":"symmetric-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6M\", \"totalSubmission\": \"2.9M\", \"totalAcceptedRaw\": 1592991, \"totalSubmissionRaw\": 2938030, \"acRate\": \"54.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"102","questionFrontendId":"102","title":"Binary Tree Level Order Traversal","titleSlug":"binary-tree-level-order-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.7M\", \"totalSubmission\": \"2.7M\", \"totalAcceptedRaw\": 1718359, \"totalSubmissionRaw\": 2676223, \"acRate\": \"64.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"103","questionFrontendId":"103","title":"Binary Tree Zigzag Level Order Traversal","titleSlug":"binary-tree-zigzag-level-order-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"934.3K\", \"totalSubmission\": \"1.6M\", \"totalAcceptedRaw\": 934344, \"totalSubmissionRaw\": 1644514, \"acRate\": \"56.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"104","questionFrontendId":"104","title":"Maximum Depth of Binary Tree","titleSlug":"maximum-depth-of-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.3M\", \"totalSubmission\": \"3.1M\", \"totalAcceptedRaw\": 2253172, \"totalSubmissionRaw\": 3050882, \"acRate\": \"73.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"107","questionFrontendId":"107","title":"Binary Tree Level Order Traversal II","titleSlug":"binary-tree-level-order-traversal-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"567.5K\", \"totalSubmission\": \"929.8K\", \"totalAcceptedRaw\": 567505, \"totalSubmissionRaw\": 929759, \"acRate\": \"61.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"111","questionFrontendId":"111","title":"Minimum Depth of Binary Tree","titleSlug":"minimum-depth-of-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"913.6K\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 913642, \"totalSubmissionRaw\": 2061234, \"acRate\": \"44.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"112","questionFrontendId":"112","title":"Path Sum","titleSlug":"path-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"2.4M\", \"totalAcceptedRaw\": 1139599, \"totalSubmissionRaw\": 2365630, \"acRate\": \"48.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"116","questionFrontendId":"116","title":"Populating Next Right Pointers in Each Node","titleSlug":"populating-next-right-pointers-in-each-node","translatedTitle":null,"stats":"{\"totalAccepted\": \"903.7K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 903689, \"totalSubmissionRaw\": 1498826, \"acRate\": \"60.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"117","questionFrontendId":"117","title":"Populating Next Right Pointers in Each Node II","titleSlug":"populating-next-right-pointers-in-each-node-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"539.3K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 539297, \"totalSubmissionRaw\": 1074426, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"126","questionFrontendId":"126","title":"Word Ladder II","titleSlug":"word-ladder-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"339.2K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 339186, \"totalSubmissionRaw\": 1232948, \"acRate\": \"27.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"127","questionFrontendId":"127","title":"Word Ladder","titleSlug":"word-ladder","translatedTitle":null,"stats":"{\"totalAccepted\": \"893.8K\", \"totalSubmission\": \"2.4M\", \"totalAcceptedRaw\": 893822, \"totalSubmissionRaw\": 2409565, \"acRate\": \"37.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"130","questionFrontendId":"130","title":"Surrounded Regions","titleSlug":"surrounded-regions","translatedTitle":null,"stats":"{\"totalAccepted\": \"517.6K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 517587, \"totalSubmissionRaw\": 1412315, \"acRate\": \"36.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"133","questionFrontendId":"133","title":"Clone Graph","titleSlug":"clone-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"913.3K\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 913285, \"totalSubmissionRaw\": 1763510, \"acRate\": \"51.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"199","questionFrontendId":"199","title":"Binary Tree Right Side View","titleSlug":"binary-tree-right-side-view","translatedTitle":null,"stats":"{\"totalAccepted\": \"919.2K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 919154, \"totalSubmissionRaw\": 1492530, \"acRate\": \"61.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"200","questionFrontendId":"200","title":"Number of Islands","titleSlug":"number-of-islands","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.1M\", \"totalSubmission\": \"3.7M\", \"totalAcceptedRaw\": 2091353, \"totalSubmissionRaw\": 3673734, \"acRate\": \"56.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"207","questionFrontendId":"207","title":"Course Schedule","titleSlug":"course-schedule","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"2.5M\", \"totalAcceptedRaw\": 1133122, \"totalSubmissionRaw\": 2497681, \"acRate\": \"45.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"210","questionFrontendId":"210","title":"Course Schedule II","titleSlug":"course-schedule-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"793.3K\", \"totalSubmission\": \"1.6M\", \"totalAcceptedRaw\": 793261, \"totalSubmissionRaw\": 1638289, \"acRate\": \"48.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"226","questionFrontendId":"226","title":"Invert Binary Tree","titleSlug":"invert-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5M\", \"totalSubmission\": \"2M\", \"totalAcceptedRaw\": 1495463, \"totalSubmissionRaw\": 2003910, \"acRate\": \"74.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"261","questionFrontendId":"261","title":"Graph Valid Tree","titleSlug":"graph-valid-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"332.9K\", \"totalSubmission\": \"706.9K\", \"totalAcceptedRaw\": 332851, \"totalSubmissionRaw\": 706936, \"acRate\": \"47.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"269","questionFrontendId":"269","title":"Alien Dictionary","titleSlug":"alien-dictionary","translatedTitle":null,"stats":"{\"totalAccepted\": \"332.5K\", \"totalSubmission\": \"941.2K\", \"totalAcceptedRaw\": 332478, \"totalSubmissionRaw\": 941223, \"acRate\": \"35.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"279","questionFrontendId":"279","title":"Perfect Squares","titleSlug":"perfect-squares","translatedTitle":null,"stats":"{\"totalAccepted\": \"650.4K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 650365, \"totalSubmissionRaw\": 1235514, \"acRate\": \"52.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"286","questionFrontendId":"286","title":"Walls and Gates","titleSlug":"walls-and-gates","translatedTitle":null,"stats":"{\"totalAccepted\": \"265.9K\", \"totalSubmission\": \"440.1K\", \"totalAcceptedRaw\": 265896, \"totalSubmissionRaw\": 440129, \"acRate\": \"60.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"297","questionFrontendId":"297","title":"Serialize and Deserialize Binary Tree","titleSlug":"serialize-and-deserialize-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"727.9K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 727921, \"totalSubmissionRaw\": 1315117, \"acRate\": \"55.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"301","questionFrontendId":"301","title":"Remove Invalid Parentheses","titleSlug":"remove-invalid-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"378.8K\", \"totalSubmission\": \"802.9K\", \"totalAcceptedRaw\": 378847, \"totalSubmissionRaw\": 802924, \"acRate\": \"47.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"302","questionFrontendId":"302","title":"Smallest Rectangle Enclosing Black Pixels","titleSlug":"smallest-rectangle-enclosing-black-pixels","translatedTitle":null,"stats":"{\"totalAccepted\": \"47.2K\", \"totalSubmission\": \"80.8K\", \"totalAcceptedRaw\": 47233, \"totalSubmissionRaw\": 80818, \"acRate\": \"58.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"310","questionFrontendId":"310","title":"Minimum Height Trees","titleSlug":"minimum-height-trees","translatedTitle":null,"stats":"{\"totalAccepted\": \"242.3K\", \"totalSubmission\": \"628.9K\", \"totalAcceptedRaw\": 242343, \"totalSubmissionRaw\": 628885, \"acRate\": \"38.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"314","questionFrontendId":"314","title":"Binary Tree Vertical Order Traversal","titleSlug":"binary-tree-vertical-order-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"318.2K\", \"totalSubmission\": \"608.7K\", \"totalAcceptedRaw\": 318203, \"totalSubmissionRaw\": 608665, \"acRate\": \"52.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"317","questionFrontendId":"317","title":"Shortest Distance from All Buildings","titleSlug":"shortest-distance-from-all-buildings","translatedTitle":null,"stats":"{\"totalAccepted\": \"152.8K\", \"totalSubmission\": \"358.3K\", \"totalAcceptedRaw\": 152751, \"totalSubmissionRaw\": 358294, \"acRate\": \"42.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"322","questionFrontendId":"322","title":"Coin Change","titleSlug":"coin-change","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"3.2M\", \"totalAcceptedRaw\": 1340948, \"totalSubmissionRaw\": 3193269, \"acRate\": \"42.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"323","questionFrontendId":"323","title":"Number of Connected Components in an Undirected Graph","titleSlug":"number-of-connected-components-in-an-undirected-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"326.8K\", \"totalSubmission\": \"525.3K\", \"totalAcceptedRaw\": 326849, \"totalSubmissionRaw\": 525340, \"acRate\": \"62.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"329","questionFrontendId":"329","title":"Longest Increasing Path in a Matrix","titleSlug":"longest-increasing-path-in-a-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"435.8K\", \"totalSubmission\": \"831.3K\", \"totalAcceptedRaw\": 435817, \"totalSubmissionRaw\": 831310, \"acRate\": \"52.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"339","questionFrontendId":"339","title":"Nested List Weight Sum","titleSlug":"nested-list-weight-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"223K\", \"totalSubmission\": \"271K\", \"totalAcceptedRaw\": 222970, \"totalSubmissionRaw\": 271011, \"acRate\": \"82.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"364","questionFrontendId":"364","title":"Nested List Weight Sum II","titleSlug":"nested-list-weight-sum-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"128.9K\", \"totalSubmission\": \"193.5K\", \"totalAcceptedRaw\": 128935, \"totalSubmissionRaw\": 193548, \"acRate\": \"66.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"365","questionFrontendId":"365","title":"Water and Jug Problem","titleSlug":"water-and-jug-problem","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.4K\", \"totalSubmission\": \"209.8K\", \"totalAcceptedRaw\": 78427, \"totalSubmissionRaw\": 209822, \"acRate\": \"37.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"399","questionFrontendId":"399","title":"Evaluate Division","titleSlug":"evaluate-division","translatedTitle":null,"stats":"{\"totalAccepted\": \"328.8K\", \"totalSubmission\": \"551.3K\", \"totalAcceptedRaw\": 328839, \"totalSubmissionRaw\": 551333, \"acRate\": \"59.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"404","questionFrontendId":"404","title":"Sum of Left Leaves","titleSlug":"sum-of-left-leaves","translatedTitle":null,"stats":"{\"totalAccepted\": \"425.3K\", \"totalSubmission\": \"750.7K\", \"totalAcceptedRaw\": 425336, \"totalSubmissionRaw\": 750670, \"acRate\": \"56.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"407","questionFrontendId":"407","title":"Trapping Rain Water II","titleSlug":"trapping-rain-water-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.1K\", \"totalSubmission\": \"164K\", \"totalAcceptedRaw\": 78078, \"totalSubmissionRaw\": 164017, \"acRate\": \"47.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"417","questionFrontendId":"417","title":"Pacific Atlantic Water Flow","titleSlug":"pacific-atlantic-water-flow","translatedTitle":null,"stats":"{\"totalAccepted\": \"346.1K\", \"totalSubmission\": \"636.4K\", \"totalAcceptedRaw\": 346108, \"totalSubmissionRaw\": 636373, \"acRate\": \"54.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"433","questionFrontendId":"433","title":"Minimum Genetic Mutation","titleSlug":"minimum-genetic-mutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.6K\", \"totalSubmission\": \"219K\", \"totalAcceptedRaw\": 114574, \"totalSubmissionRaw\": 218999, \"acRate\": \"52.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"449","questionFrontendId":"449","title":"Serialize and Deserialize BST","titleSlug":"serialize-and-deserialize-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"215.8K\", \"totalSubmission\": \"378.7K\", \"totalAcceptedRaw\": 215815, \"totalSubmissionRaw\": 378697, \"acRate\": \"57.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"463","questionFrontendId":"463","title":"Island Perimeter","titleSlug":"island-perimeter","translatedTitle":null,"stats":"{\"totalAccepted\": \"424.9K\", \"totalSubmission\": \"609.9K\", \"totalAcceptedRaw\": 424868, \"totalSubmissionRaw\": 609909, \"acRate\": \"69.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"488","questionFrontendId":"488","title":"Zuma Game","titleSlug":"zuma-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.3K\", \"totalSubmission\": \"62.8K\", \"totalAcceptedRaw\": 21336, \"totalSubmissionRaw\": 62820, \"acRate\": \"34.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"490","questionFrontendId":"490","title":"The Maze","titleSlug":"the-maze","translatedTitle":null,"stats":"{\"totalAccepted\": \"140K\", \"totalSubmission\": \"251.1K\", \"totalAcceptedRaw\": 139991, \"totalSubmissionRaw\": 251100, \"acRate\": \"55.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"499","questionFrontendId":"499","title":"The Maze III","titleSlug":"the-maze-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"27K\", \"totalSubmission\": \"57K\", \"totalAcceptedRaw\": 26987, \"totalSubmissionRaw\": 57046, \"acRate\": \"47.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"505","questionFrontendId":"505","title":"The Maze II","titleSlug":"the-maze-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"94.4K\", \"totalSubmission\": \"179.9K\", \"totalAcceptedRaw\": 94396, \"totalSubmissionRaw\": 179917, \"acRate\": \"52.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"513","questionFrontendId":"513","title":"Find Bottom Left Tree Value","titleSlug":"find-bottom-left-tree-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"207.9K\", \"totalSubmission\": \"311.1K\", \"totalAcceptedRaw\": 207889, \"totalSubmissionRaw\": 311066, \"acRate\": \"66.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"514","questionFrontendId":"514","title":"Freedom Trail","titleSlug":"freedom-trail","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.6K\", \"totalSubmission\": \"67.2K\", \"totalAcceptedRaw\": 31575, \"totalSubmissionRaw\": 67241, \"acRate\": \"47.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"515","questionFrontendId":"515","title":"Find Largest Value in Each Tree Row","titleSlug":"find-largest-value-in-each-tree-row","translatedTitle":null,"stats":"{\"totalAccepted\": \"223.4K\", \"totalSubmission\": \"345.8K\", \"totalAcceptedRaw\": 223405, \"totalSubmissionRaw\": 345841, \"acRate\": \"64.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"529","questionFrontendId":"529","title":"Minesweeper","titleSlug":"minesweeper","translatedTitle":null,"stats":"{\"totalAccepted\": \"134.5K\", \"totalSubmission\": \"204.6K\", \"totalAcceptedRaw\": 134452, \"totalSubmissionRaw\": 204560, \"acRate\": \"65.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"530","questionFrontendId":"530","title":"Minimum Absolute Difference in BST","titleSlug":"minimum-absolute-difference-in-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"199.9K\", \"totalSubmission\": \"348.9K\", \"totalAcceptedRaw\": 199922, \"totalSubmissionRaw\": 348877, \"acRate\": \"57.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"542","questionFrontendId":"542","title":"01 Matrix","titleSlug":"01-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"364.8K\", \"totalSubmission\": \"816.9K\", \"totalAcceptedRaw\": 364759, \"totalSubmissionRaw\": 816904, \"acRate\": \"44.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"547","questionFrontendId":"547","title":"Number of Provinces","titleSlug":"number-of-provinces","translatedTitle":null,"stats":"{\"totalAccepted\": \"601.4K\", \"totalSubmission\": \"944.4K\", \"totalAcceptedRaw\": 601423, \"totalSubmissionRaw\": 944423, \"acRate\": \"63.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"550","questionFrontendId":"1730","title":"Shortest Path to Get Food","titleSlug":"shortest-path-to-get-food","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.6K\", \"totalSubmission\": \"97.2K\", \"totalAcceptedRaw\": 52597, \"totalSubmissionRaw\": 97187, \"acRate\": \"54.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"582","questionFrontendId":"582","title":"Kill Process","titleSlug":"kill-process","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.4K\", \"totalSubmission\": \"114.1K\", \"totalAcceptedRaw\": 78370, \"totalSubmissionRaw\": 114068, \"acRate\": \"68.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"617","questionFrontendId":"617","title":"Merge Two Binary Trees","titleSlug":"merge-two-binary-trees","translatedTitle":null,"stats":"{\"totalAccepted\": \"669.3K\", \"totalSubmission\": \"851.1K\", \"totalAcceptedRaw\": 669307, \"totalSubmissionRaw\": 851087, \"acRate\": \"78.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"623","questionFrontendId":"623","title":"Add One Row to Tree","titleSlug":"add-one-row-to-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"148.7K\", \"totalSubmission\": \"250K\", \"totalAcceptedRaw\": 148692, \"totalSubmissionRaw\": 250011, \"acRate\": \"59.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"637","questionFrontendId":"637","title":"Average of Levels in Binary Tree","titleSlug":"average-of-levels-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"383.5K\", \"totalSubmission\": \"534.5K\", \"totalAcceptedRaw\": 383532, \"totalSubmissionRaw\": 534499, \"acRate\": \"71.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"653","questionFrontendId":"653","title":"Two Sum IV - Input is a BST","titleSlug":"two-sum-iv-input-is-a-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"445.1K\", \"totalSubmission\": \"729.2K\", \"totalAcceptedRaw\": 445113, \"totalSubmissionRaw\": 729202, \"acRate\": \"61.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"655","questionFrontendId":"655","title":"Print Binary Tree","titleSlug":"print-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.9K\", \"totalSubmission\": \"95.1K\", \"totalAcceptedRaw\": 58874, \"totalSubmissionRaw\": 95071, \"acRate\": \"61.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"662","questionFrontendId":"662","title":"Maximum Width of Binary Tree","titleSlug":"maximum-width-of-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"241.8K\", \"totalSubmission\": \"593.6K\", \"totalAcceptedRaw\": 241778, \"totalSubmissionRaw\": 593560, \"acRate\": \"40.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"672","questionFrontendId":"672","title":"Bulb Switcher II","titleSlug":"bulb-switcher-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.2K\", \"totalSubmission\": \"37.9K\", \"totalAcceptedRaw\": 19220, \"totalSubmissionRaw\": 37903, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"675","questionFrontendId":"675","title":"Cut Off Trees for Golf Event","titleSlug":"cut-off-trees-for-golf-event","translatedTitle":null,"stats":"{\"totalAccepted\": \"61.6K\", \"totalSubmission\": \"180.8K\", \"totalAcceptedRaw\": 61621, \"totalSubmissionRaw\": 180785, \"acRate\": \"34.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"684","questionFrontendId":"684","title":"Redundant Connection","titleSlug":"redundant-connection","translatedTitle":null,"stats":"{\"totalAccepted\": \"264.8K\", \"totalSubmission\": \"425.7K\", \"totalAcceptedRaw\": 264785, \"totalSubmissionRaw\": 425709, \"acRate\": \"62.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"685","questionFrontendId":"685","title":"Redundant Connection II","titleSlug":"redundant-connection-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"60.1K\", \"totalSubmission\": \"176.3K\", \"totalAcceptedRaw\": 60122, \"totalSubmissionRaw\": 176276, \"acRate\": \"34.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"690","questionFrontendId":"690","title":"Employee Importance","titleSlug":"employee-importance","translatedTitle":null,"stats":"{\"totalAccepted\": \"191.9K\", \"totalSubmission\": \"292.8K\", \"totalAcceptedRaw\": 191855, \"totalSubmissionRaw\": 292770, \"acRate\": \"65.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"694","questionFrontendId":"694","title":"Number of Distinct Islands","titleSlug":"number-of-distinct-islands","translatedTitle":null,"stats":"{\"totalAccepted\": \"147.1K\", \"totalSubmission\": \"242.1K\", \"totalAcceptedRaw\": 147068, \"totalSubmissionRaw\": 242132, \"acRate\": \"60.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"695","questionFrontendId":"695","title":"Max Area of Island","titleSlug":"max-area-of-island","translatedTitle":null,"stats":"{\"totalAccepted\": \"689.2K\", \"totalSubmission\": \"960.1K\", \"totalAcceptedRaw\": 689163, \"totalSubmissionRaw\": 960101, \"acRate\": \"71.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"711","questionFrontendId":"711","title":"Number of Distinct Islands II","titleSlug":"number-of-distinct-islands-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"17.8K\", \"totalAcceptedRaw\": 9240, \"totalSubmissionRaw\": 17821, \"acRate\": \"51.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"721","questionFrontendId":"721","title":"Accounts Merge","titleSlug":"accounts-merge","translatedTitle":null,"stats":"{\"totalAccepted\": \"302.4K\", \"totalSubmission\": \"536.7K\", \"totalAcceptedRaw\": 302411, \"totalSubmissionRaw\": 536748, \"acRate\": \"56.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"733","questionFrontendId":"733","title":"Flood Fill","titleSlug":"flood-fill","translatedTitle":null,"stats":"{\"totalAccepted\": \"682.9K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 682854, \"totalSubmissionRaw\": 1104613, \"acRate\": \"61.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"737","questionFrontendId":"737","title":"Sentence Similarity II","titleSlug":"sentence-similarity-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.1K\", \"totalSubmission\": \"132.8K\", \"totalAcceptedRaw\": 65064, \"totalSubmissionRaw\": 132773, \"acRate\": \"49.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"743","questionFrontendId":"742","title":"Closest Leaf in a Binary Tree","titleSlug":"closest-leaf-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"41.8K\", \"totalSubmission\": \"91.2K\", \"totalAcceptedRaw\": 41835, \"totalSubmissionRaw\": 91177, \"acRate\": \"45.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"744","questionFrontendId":"743","title":"Network Delay Time","titleSlug":"network-delay-time","translatedTitle":null,"stats":"{\"totalAccepted\": \"364.4K\", \"totalSubmission\": \"703.4K\", \"totalAcceptedRaw\": 364392, \"totalSubmissionRaw\": 703396, \"acRate\": \"51.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"750","questionFrontendId":"749","title":"Contain Virus","titleSlug":"contain-virus","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.2K\", \"totalSubmission\": \"20.1K\", \"totalAcceptedRaw\": 10239, \"totalSubmissionRaw\": 20051, \"acRate\": \"51.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"753","questionFrontendId":"752","title":"Open the Lock","titleSlug":"open-the-lock","translatedTitle":null,"stats":"{\"totalAccepted\": \"197.6K\", \"totalSubmission\": \"355.3K\", \"totalAcceptedRaw\": 197571, \"totalSubmissionRaw\": 355281, \"acRate\": \"55.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"757","questionFrontendId":"756","title":"Pyramid Transition Matrix","titleSlug":"pyramid-transition-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"30K\", \"totalSubmission\": \"56.9K\", \"totalAcceptedRaw\": 30016, \"totalSubmissionRaw\": 56938, \"acRate\": \"52.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"764","questionFrontendId":"429","title":"N-ary Tree Level Order Traversal","titleSlug":"n-ary-tree-level-order-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"274K\", \"totalSubmission\": \"387.7K\", \"totalAcceptedRaw\": 273967, \"totalSubmissionRaw\": 387664, \"acRate\": \"70.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"765","questionFrontendId":"428","title":"Serialize and Deserialize N-ary Tree","titleSlug":"serialize-and-deserialize-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"77.9K\", \"totalSubmission\": \"118.1K\", \"totalAcceptedRaw\": 77875, \"totalSubmissionRaw\": 118100, \"acRate\": \"65.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"770","questionFrontendId":"765","title":"Couples Holding Hands","titleSlug":"couples-holding-hands","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.9K\", \"totalSubmission\": \"91.3K\", \"totalAcceptedRaw\": 51853, \"totalSubmissionRaw\": 91311, \"acRate\": \"56.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"771","questionFrontendId":"431","title":"Encode N-ary Tree to Binary Tree","titleSlug":"encode-n-ary-tree-to-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.3K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 19349, \"totalSubmissionRaw\": 24526, \"acRate\": \"78.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"774","questionFrontendId":"559","title":"Maximum Depth of N-ary Tree","titleSlug":"maximum-depth-of-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"244.8K\", \"totalSubmission\": \"341.7K\", \"totalAcceptedRaw\": 244823, \"totalSubmissionRaw\": 341672, \"acRate\": \"71.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"787","questionFrontendId":"773","title":"Sliding Puzzle","titleSlug":"sliding-puzzle","translatedTitle":null,"stats":"{\"totalAccepted\": \"83.6K\", \"totalSubmission\": \"130.5K\", \"totalAcceptedRaw\": 83649, \"totalSubmissionRaw\": 130505, \"acRate\": \"64.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"794","questionFrontendId":"778","title":"Swim in Rising Water","titleSlug":"swim-in-rising-water","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.1K\", \"totalSubmission\": \"190.7K\", \"totalAcceptedRaw\": 114066, \"totalSubmissionRaw\": 190656, \"acRate\": \"59.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"799","questionFrontendId":"783","title":"Minimum Distance Between BST Nodes","titleSlug":"minimum-distance-between-bst-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"209.6K\", \"totalSubmission\": \"353.5K\", \"totalAcceptedRaw\": 209595, \"totalSubmissionRaw\": 353523, \"acRate\": \"59.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"801","questionFrontendId":"785","title":"Is Graph Bipartite?","titleSlug":"is-graph-bipartite","translatedTitle":null,"stats":"{\"totalAccepted\": \"390.5K\", \"totalSubmission\": \"736.1K\", \"totalAcceptedRaw\": 390517, \"totalSubmissionRaw\": 736101, \"acRate\": \"53.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"803","questionFrontendId":"787","title":"Cheapest Flights Within K Stops","titleSlug":"cheapest-flights-within-k-stops","translatedTitle":null,"stats":"{\"totalAccepted\": \"358.5K\", \"totalSubmission\": \"968.5K\", \"totalAcceptedRaw\": 358489, \"totalSubmissionRaw\": 968482, \"acRate\": \"37.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"813","questionFrontendId":"797","title":"All Paths From Source to Target","titleSlug":"all-paths-from-source-to-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"425.3K\", \"totalSubmission\": \"517K\", \"totalAcceptedRaw\": 425277, \"totalSubmissionRaw\": 517003, \"acRate\": \"82.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"820","questionFrontendId":"802","title":"Find Eventual Safe States","titleSlug":"find-eventual-safe-states","translatedTitle":null,"stats":"{\"totalAccepted\": \"118.6K\", \"totalSubmission\": \"210.2K\", \"totalAcceptedRaw\": 118561, \"totalSubmissionRaw\": 210193, \"acRate\": \"56.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"833","questionFrontendId":"815","title":"Bus Routes","titleSlug":"bus-routes","translatedTitle":null,"stats":"{\"totalAccepted\": \"120.9K\", \"totalSubmission\": \"264.9K\", \"totalAcceptedRaw\": 120870, \"totalSubmissionRaw\": 264936, \"acRate\": \"45.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"854","questionFrontendId":"827","title":"Making A Large Island","titleSlug":"making-a-large-island","translatedTitle":null,"stats":"{\"totalAccepted\": \"127.6K\", \"totalSubmission\": \"284.4K\", \"totalAcceptedRaw\": 127622, \"totalSubmissionRaw\": 284388, \"acRate\": \"44.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"869","questionFrontendId":"839","title":"Similar String Groups","titleSlug":"similar-string-groups","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.9K\", \"totalSubmission\": \"133.2K\", \"totalAcceptedRaw\": 63879, \"totalSubmissionRaw\": 133184, \"acRate\": \"48.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"871","questionFrontendId":"841","title":"Keys and Rooms","titleSlug":"keys-and-rooms","translatedTitle":null,"stats":"{\"totalAccepted\": \"311.3K\", \"totalSubmission\": \"435.5K\", \"totalAcceptedRaw\": 311304, \"totalSubmissionRaw\": 435511, \"acRate\": \"71.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"877","questionFrontendId":"847","title":"Shortest Path Visiting All Nodes","titleSlug":"shortest-path-visiting-all-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"68.7K\", \"totalSubmission\": \"112.4K\", \"totalAcceptedRaw\": 68660, \"totalSubmissionRaw\": 112391, \"acRate\": \"61.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"884","questionFrontendId":"854","title":"K-Similar Strings","titleSlug":"k-similar-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.6K\", \"totalSubmission\": \"101.2K\", \"totalAcceptedRaw\": 40590, \"totalSubmissionRaw\": 101190, \"acRate\": \"40.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"893","questionFrontendId":"863","title":"All Nodes Distance K in Binary Tree","titleSlug":"all-nodes-distance-k-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"296.6K\", \"totalSubmission\": \"476.4K\", \"totalAcceptedRaw\": 296573, \"totalSubmissionRaw\": 476355, \"acRate\": \"62.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"895","questionFrontendId":"864","title":"Shortest Path to Get All Keys","titleSlug":"shortest-path-to-get-all-keys","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.5K\", \"totalSubmission\": \"66.9K\", \"totalAcceptedRaw\": 30479, \"totalSubmissionRaw\": 66925, \"acRate\": \"45.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"896","questionFrontendId":"865","title":"Smallest Subtree with all the Deepest Nodes","titleSlug":"smallest-subtree-with-all-the-deepest-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"115.3K\", \"totalSubmission\": \"167.4K\", \"totalAcceptedRaw\": 115329, \"totalSubmissionRaw\": 167361, \"acRate\": \"68.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"922","questionFrontendId":"886","title":"Possible Bipartition","titleSlug":"possible-bipartition","translatedTitle":null,"stats":"{\"totalAccepted\": \"178.7K\", \"totalSubmission\": \"357.5K\", \"totalAcceptedRaw\": 178691, \"totalSubmissionRaw\": 357474, \"acRate\": \"50.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"945","questionFrontendId":"909","title":"Snakes and Ladders","titleSlug":"snakes-and-ladders","translatedTitle":null,"stats":"{\"totalAccepted\": \"135.7K\", \"totalSubmission\": \"300.9K\", \"totalAcceptedRaw\": 135731, \"totalSubmissionRaw\": 300906, \"acRate\": \"45.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"955","questionFrontendId":"919","title":"Complete Binary Tree Inserter","titleSlug":"complete-binary-tree-inserter","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.9K\", \"totalSubmission\": \"69K\", \"totalAcceptedRaw\": 44935, \"totalSubmissionRaw\": 68988, \"acRate\": \"65.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"960","questionFrontendId":"924","title":"Minimize Malware Spread","titleSlug":"minimize-malware-spread","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.8K\", \"totalSubmission\": \"101.8K\", \"totalAcceptedRaw\": 42842, \"totalSubmissionRaw\": 101803, \"acRate\": \"42.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"964","questionFrontendId":"928","title":"Minimize Malware Spread II","titleSlug":"minimize-malware-spread-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"42.5K\", \"totalAcceptedRaw\": 18155, \"totalSubmissionRaw\": 42506, \"acRate\": \"42.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"971","questionFrontendId":"934","title":"Shortest Bridge","titleSlug":"shortest-bridge","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.2K\", \"totalSubmission\": \"228.6K\", \"totalAcceptedRaw\": 124184, \"totalSubmissionRaw\": 228584, \"acRate\": \"54.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"998","questionFrontendId":"958","title":"Check Completeness of a Binary Tree","titleSlug":"check-completeness-of-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"178.7K\", \"totalSubmission\": \"321.1K\", \"totalAcceptedRaw\": 178674, \"totalSubmissionRaw\": 321067, \"acRate\": \"55.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"999","questionFrontendId":"959","title":"Regions Cut By Slashes","titleSlug":"regions-cut-by-slashes","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.7K\", \"totalSubmission\": \"64.6K\", \"totalAcceptedRaw\": 44715, \"totalSubmissionRaw\": 64634, \"acRate\": \"69.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1005","questionFrontendId":"965","title":"Univalued Binary Tree","titleSlug":"univalued-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"188K\", \"totalSubmission\": \"270K\", \"totalAcceptedRaw\": 188013, \"totalSubmissionRaw\": 270014, \"acRate\": \"69.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1007","questionFrontendId":"967","title":"Numbers With Same Consecutive Differences","titleSlug":"numbers-with-same-consecutive-differences","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.1K\", \"totalSubmission\": \"207.5K\", \"totalAcceptedRaw\": 119143, \"totalSubmissionRaw\": 207546, \"acRate\": \"57.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1029","questionFrontendId":"987","title":"Vertical Order Traversal of a Binary Tree","titleSlug":"vertical-order-traversal-of-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"324.9K\", \"totalSubmission\": \"721.4K\", \"totalAcceptedRaw\": 324853, \"totalSubmissionRaw\": 721357, \"acRate\": \"45.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1035","questionFrontendId":"993","title":"Cousins in Binary Tree","titleSlug":"cousins-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"238.6K\", \"totalSubmission\": \"437K\", \"totalAcceptedRaw\": 238567, \"totalSubmissionRaw\": 437039, \"acRate\": \"54.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1036","questionFrontendId":"994","title":"Rotting Oranges","titleSlug":"rotting-oranges","translatedTitle":null,"stats":"{\"totalAccepted\": \"574K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 574007, \"totalSubmissionRaw\": 1085286, \"acRate\": \"52.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1073","questionFrontendId":"1020","title":"Number of Enclaves","titleSlug":"number-of-enclaves","translatedTitle":null,"stats":"{\"totalAccepted\": \"96.3K\", \"totalSubmission\": \"147K\", \"totalAcceptedRaw\": 96281, \"totalSubmissionRaw\": 147013, \"acRate\": \"65.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1076","questionFrontendId":"1087","title":"Brace Expansion","titleSlug":"brace-expansion","translatedTitle":null,"stats":"{\"totalAccepted\": \"47.4K\", \"totalSubmission\": \"71.6K\", \"totalAcceptedRaw\": 47375, \"totalSubmissionRaw\": 71592, \"acRate\": \"66.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1099","questionFrontendId":"1102","title":"Path With Maximum Minimum Value","titleSlug":"path-with-maximum-minimum-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"56.1K\", \"totalSubmission\": \"105.3K\", \"totalAcceptedRaw\": 56109, \"totalSubmissionRaw\": 105287, \"acRate\": \"53.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1104","questionFrontendId":"1034","title":"Coloring A Border","titleSlug":"coloring-a-border","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.9K\", \"totalSubmission\": \"58.8K\", \"totalAcceptedRaw\": 28910, \"totalSubmissionRaw\": 58810, \"acRate\": \"49.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1106","questionFrontendId":"1036","title":"Escape a Large Maze","titleSlug":"escape-a-large-maze","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"52.5K\", \"totalAcceptedRaw\": 17925, \"totalSubmissionRaw\": 52548, \"acRate\": \"34.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1116","questionFrontendId":"1161","title":"Maximum Level Sum of a Binary Tree","titleSlug":"maximum-level-sum-of-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"125K\", \"totalSubmission\": \"189.6K\", \"totalAcceptedRaw\": 125050, \"totalSubmissionRaw\": 189556, \"acRate\": \"66.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1117","questionFrontendId":"1162","title":"As Far from Land as Possible","titleSlug":"as-far-from-land-as-possible","translatedTitle":null,"stats":"{\"totalAccepted\": \"135.4K\", \"totalSubmission\": \"260.9K\", \"totalAcceptedRaw\": 135380, \"totalSubmissionRaw\": 260850, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1120","questionFrontendId":"1042","title":"Flower Planting With No Adjacent","titleSlug":"flower-planting-with-no-adjacent","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.4K\", \"totalSubmission\": \"129.4K\", \"totalAcceptedRaw\": 65427, \"totalSubmissionRaw\": 129373, \"acRate\": \"50.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1142","questionFrontendId":"1197","title":"Minimum Knight Moves","titleSlug":"minimum-knight-moves","translatedTitle":null,"stats":"{\"totalAccepted\": \"133.7K\", \"totalSubmission\": \"337K\", \"totalAcceptedRaw\": 133713, \"totalSubmissionRaw\": 337035, \"acRate\": \"39.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1151","questionFrontendId":"1215","title":"Stepping Numbers","titleSlug":"stepping-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.3K\", \"totalSubmission\": \"17.9K\", \"totalAcceptedRaw\": 8270, \"totalSubmissionRaw\": 17899, \"acRate\": \"46.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1171","questionFrontendId":"1091","title":"Shortest Path in Binary Matrix","titleSlug":"shortest-path-in-binary-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"294.9K\", \"totalSubmission\": \"660.6K\", \"totalAcceptedRaw\": 294863, \"totalSubmissionRaw\": 660602, \"acRate\": \"44.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1177","questionFrontendId":"1245","title":"Tree Diameter","titleSlug":"tree-diameter","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.1K\", \"totalSubmission\": \"48.9K\", \"totalAcceptedRaw\": 30079, \"totalSubmissionRaw\": 48889, \"acRate\": \"61.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1188","questionFrontendId":"1096","title":"Brace Expansion II","titleSlug":"brace-expansion-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.1K\", \"totalSubmission\": \"34.8K\", \"totalAcceptedRaw\": 22075, \"totalSubmissionRaw\": 34791, \"acRate\": \"63.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1190","questionFrontendId":"1257","title":"Smallest Common Region","titleSlug":"smallest-common-region","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.5K\", \"totalSubmission\": \"30.3K\", \"totalAcceptedRaw\": 19481, \"totalSubmissionRaw\": 30285, \"acRate\": \"64.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1201","questionFrontendId":"1273","title":"Delete Tree Nodes","titleSlug":"delete-tree-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.3K\", \"totalSubmission\": \"15.3K\", \"totalAcceptedRaw\": 9347, \"totalSubmissionRaw\": 15310, \"acRate\": \"61.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1218","questionFrontendId":"1123","title":"Lowest Common Ancestor of Deepest Leaves","titleSlug":"lowest-common-ancestor-of-deepest-leaves","translatedTitle":null,"stats":"{\"totalAccepted\": \"89.4K\", \"totalSubmission\": \"126.1K\", \"totalAcceptedRaw\": 89406, \"totalSubmissionRaw\": 126096, \"acRate\": \"70.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1229","questionFrontendId":"1129","title":"Shortest Path with Alternating Colors","titleSlug":"shortest-path-with-alternating-colors","translatedTitle":null,"stats":"{\"totalAccepted\": \"94.2K\", \"totalSubmission\": \"194K\", \"totalAcceptedRaw\": 94183, \"totalSubmissionRaw\": 194031, \"acRate\": \"48.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1243","questionFrontendId":"1315","title":"Sum of Nodes with Even-Valued Grandparent","titleSlug":"sum-of-nodes-with-even-valued-grandparent","translatedTitle":null,"stats":"{\"totalAccepted\": \"125.9K\", \"totalSubmission\": \"147.3K\", \"totalAcceptedRaw\": 125912, \"totalSubmissionRaw\": 147306, \"acRate\": \"85.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1254","questionFrontendId":"1302","title":"Deepest Leaves Sum","titleSlug":"deepest-leaves-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"267.8K\", \"totalSubmission\": \"309K\", \"totalAcceptedRaw\": 267793, \"totalSubmissionRaw\": 308959, \"acRate\": \"86.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1271","questionFrontendId":"1236","title":"Web Crawler","titleSlug":"web-crawler","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.8K\", \"totalSubmission\": \"44.9K\", \"totalAcceptedRaw\": 29825, \"totalSubmissionRaw\": 44866, \"acRate\": \"66.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1275","questionFrontendId":"1361","title":"Validate Binary Tree Nodes","titleSlug":"validate-binary-tree-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.3K\", \"totalSubmission\": \"106.1K\", \"totalAcceptedRaw\": 42324, \"totalSubmissionRaw\": 106126, \"acRate\": \"39.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1296","questionFrontendId":"1483","title":"Kth Ancestor of a Tree Node","titleSlug":"kth-ancestor-of-a-tree-node","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.4K\", \"totalSubmission\": \"78.3K\", \"totalAcceptedRaw\": 26449, \"totalSubmissionRaw\": 78345, \"acRate\": \"33.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1308","questionFrontendId":"1202","title":"Smallest String With Swaps","titleSlug":"smallest-string-with-swaps","translatedTitle":null,"stats":"{\"totalAccepted\": \"96.9K\", \"totalSubmission\": \"168.2K\", \"totalAcceptedRaw\": 96903, \"totalSubmissionRaw\": 168244, \"acRate\": \"57.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1309","questionFrontendId":"1203","title":"Sort Items by Groups Respecting Dependencies","titleSlug":"sort-items-by-groups-respecting-dependencies","translatedTitle":null,"stats":"{\"totalAccepted\": \"15K\", \"totalSubmission\": \"29.4K\", \"totalAcceptedRaw\": 15013, \"totalSubmissionRaw\": 29356, \"acRate\": \"51.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1322","questionFrontendId":"1210","title":"Minimum Moves to Reach Target with Rotations","titleSlug":"minimum-moves-to-reach-target-with-rotations","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.3K\", \"totalSubmission\": \"16.8K\", \"totalAcceptedRaw\": 8292, \"totalSubmissionRaw\": 16841, \"acRate\": \"49.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1347","questionFrontendId":"2204","title":"Distance to a Cycle in Undirected Graph","titleSlug":"distance-to-a-cycle-in-undirected-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"2K\", \"totalSubmission\": \"2.8K\", \"totalAcceptedRaw\": 1995, \"totalSubmissionRaw\": 2838, \"acRate\": \"70.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1380","questionFrontendId":"1254","title":"Number of Closed Islands","titleSlug":"number-of-closed-islands","translatedTitle":null,"stats":"{\"totalAccepted\": \"127.9K\", \"totalSubmission\": \"199.5K\", \"totalAcceptedRaw\": 127871, \"totalSubmissionRaw\": 199502, \"acRate\": \"64.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1387","questionFrontendId":"1261","title":"Find Elements in a Contaminated Binary Tree","titleSlug":"find-elements-in-a-contaminated-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"54.3K\", \"totalSubmission\": \"71.1K\", \"totalAcceptedRaw\": 54310, \"totalSubmissionRaw\": 71144, \"acRate\": \"76.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1389","questionFrontendId":"1263","title":"Minimum Moves to Move a Box to Their Target Location","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.6K\", \"totalSubmission\": \"50.3K\", \"totalAcceptedRaw\": 24646, \"totalSubmissionRaw\": 50274, \"acRate\": \"49.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1396","questionFrontendId":"1267","title":"Count Servers that Communicate","titleSlug":"count-servers-that-communicate","translatedTitle":null,"stats":"{\"totalAccepted\": \"50.8K\", \"totalSubmission\": \"85.5K\", \"totalAcceptedRaw\": 50795, \"totalSubmissionRaw\": 85462, \"acRate\": \"59.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1409","questionFrontendId":"1284","title":"Minimum Number of Flips to Convert Binary Matrix to Zero Matrix","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.9K\", \"totalSubmission\": \"40.2K\", \"totalAcceptedRaw\": 28917, \"totalSubmissionRaw\": 40221, \"acRate\": \"71.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1414","questionFrontendId":"1293","title":"Shortest Path in a Grid with Obstacles Elimination","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination","translatedTitle":null,"stats":"{\"totalAccepted\": \"175.1K\", \"totalSubmission\": \"385.8K\", \"totalAcceptedRaw\": 175129, \"totalSubmissionRaw\": 385848, \"acRate\": \"45.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1424","questionFrontendId":"1298","title":"Maximum Candies You Can Get from Boxes","titleSlug":"maximum-candies-you-can-get-from-boxes","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.7K\", \"totalSubmission\": \"21.2K\", \"totalAcceptedRaw\": 12736, \"totalSubmissionRaw\": 21164, \"acRate\": \"60.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1428","questionFrontendId":"1306","title":"Jump Game III","titleSlug":"jump-game-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"184.6K\", \"totalSubmission\": \"290.9K\", \"totalAcceptedRaw\": 184607, \"totalSubmissionRaw\": 290866, \"acRate\": \"63.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1431","questionFrontendId":"2192","title":"All Ancestors of a Node in a Directed Acyclic Graph","titleSlug":"all-ancestors-of-a-node-in-a-directed-acyclic-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.7K\", \"totalSubmission\": \"44.9K\", \"totalAcceptedRaw\": 22740, \"totalSubmissionRaw\": 44890, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1432","questionFrontendId":"1430","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.5K\", \"totalSubmission\": \"91.5K\", \"totalAcceptedRaw\": 42452, \"totalSubmissionRaw\": 91550, \"acRate\": \"46.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1436","questionFrontendId":"1311","title":"Get Watched Videos by Your Friends","titleSlug":"get-watched-videos-by-your-friends","translatedTitle":null,"stats":"{\"totalAccepted\": \"18K\", \"totalSubmission\": \"39.2K\", \"totalAcceptedRaw\": 17986, \"totalSubmissionRaw\": 39164, \"acRate\": \"45.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1442","questionFrontendId":"1319","title":"Number of Operations to Make Network Connected","titleSlug":"number-of-operations-to-make-network-connected","translatedTitle":null,"stats":"{\"totalAccepted\": \"115.7K\", \"totalSubmission\": \"196.5K\", \"totalAcceptedRaw\": 115725, \"totalSubmissionRaw\": 196520, \"acRate\": \"58.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1447","questionFrontendId":"1345","title":"Jump Game IV","titleSlug":"jump-game-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"127.9K\", \"totalSubmission\": \"272.1K\", \"totalAcceptedRaw\": 127949, \"totalSubmissionRaw\": 272108, \"acRate\": \"47.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1484","questionFrontendId":"1367","title":"Linked List in Binary Tree","titleSlug":"linked-list-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.9K\", \"totalSubmission\": \"146.3K\", \"totalAcceptedRaw\": 63913, \"totalSubmissionRaw\": 146330, \"acRate\": \"43.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1485","questionFrontendId":"1368","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.2K\", \"totalSubmission\": \"63.7K\", \"totalAcceptedRaw\": 39165, \"totalSubmissionRaw\": 63654, \"acRate\": \"61.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1492","questionFrontendId":"1376","title":"Time Needed to Inform All Employees","titleSlug":"time-needed-to-inform-all-employees","translatedTitle":null,"stats":"{\"totalAccepted\": \"128K\", \"totalSubmission\": \"219.4K\", \"totalAcceptedRaw\": 127955, \"totalSubmissionRaw\": 219404, \"acRate\": \"58.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1493","questionFrontendId":"1377","title":"Frog Position After T Seconds","titleSlug":"frog-position-after-t-seconds","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"67.7K\", \"totalAcceptedRaw\": 24199, \"totalSubmissionRaw\": 67665, \"acRate\": \"35.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1498","questionFrontendId":"1379","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"187.2K\", \"totalSubmission\": \"215.8K\", \"totalAcceptedRaw\": 187180, \"totalSubmissionRaw\": 215833, \"acRate\": \"86.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1507","questionFrontendId":"1391","title":"Check if There is a Valid Path in a Grid","titleSlug":"check-if-there-is-a-valid-path-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"51.1K\", \"totalAcceptedRaw\": 24159, \"totalSubmissionRaw\": 51128, \"acRate\": \"47.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1544","questionFrontendId":"1448","title":"Count Good Nodes in Binary Tree","titleSlug":"count-good-nodes-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"308.1K\", \"totalSubmission\": \"414.5K\", \"totalAcceptedRaw\": 308098, \"totalSubmissionRaw\": 414510, \"acRate\": \"74.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1554","questionFrontendId":"1443","title":"Minimum Time to Collect All Apples in a Tree","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"97.9K\", \"totalSubmission\": \"156K\", \"totalAcceptedRaw\": 97888, \"totalSubmissionRaw\": 155957, \"acRate\": \"62.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1558","questionFrontendId":"1462","title":"Course Schedule IV","titleSlug":"course-schedule-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"41.6K\", \"totalSubmission\": \"85K\", \"totalAcceptedRaw\": 41639, \"totalSubmissionRaw\": 85014, \"acRate\": \"49.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1568","questionFrontendId":"1457","title":"Pseudo-Palindromic Paths in a Binary Tree","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"113.3K\", \"totalSubmission\": \"167K\", \"totalAcceptedRaw\": 113277, \"totalSubmissionRaw\": 166963, \"acRate\": \"67.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1576","questionFrontendId":"1466","title":"Reorder Routes to Make All Paths Lead to the City Zero","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"74.8K\", \"totalSubmission\": \"121.3K\", \"totalAcceptedRaw\": 74842, \"totalSubmissionRaw\": 121332, \"acRate\": \"61.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1609","questionFrontendId":"1469","title":"Find All The Lonely Nodes","titleSlug":"find-all-the-lonely-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.2K\", \"totalSubmission\": \"52.5K\", \"totalAcceptedRaw\": 43154, \"totalSubmissionRaw\": 52539, \"acRate\": \"82.1%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1624","questionFrontendId":"1485","title":"Clone Binary Tree With Random Pointer","titleSlug":"clone-binary-tree-with-random-pointer","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.9K\", \"totalSubmission\": \"26.3K\", \"totalAcceptedRaw\": 20921, \"totalSubmissionRaw\": 26255, \"acRate\": \"79.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1634","questionFrontendId":"1490","title":"Clone N-ary Tree","titleSlug":"clone-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.7K\", \"totalSubmission\": \"29.6K\", \"totalAcceptedRaw\": 24675, \"totalSubmissionRaw\": 29562, \"acRate\": \"83.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1643","questionFrontendId":"1519","title":"Number of Nodes in the Sub-Tree With the Same Label","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label","translatedTitle":null,"stats":"{\"totalAccepted\": \"77.8K\", \"totalSubmission\": \"140.6K\", \"totalAcceptedRaw\": 77781, \"totalSubmissionRaw\": 140616, \"acRate\": \"55.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1663","questionFrontendId":"1559","title":"Detect Cycles in 2D Grid","titleSlug":"detect-cycles-in-2d-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.9K\", \"totalSubmission\": \"66.6K\", \"totalAcceptedRaw\": 31944, \"totalSubmissionRaw\": 66595, \"acRate\": \"48.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1691","questionFrontendId":"1568","title":"Minimum Number of Days to Disconnect Island","titleSlug":"minimum-number-of-days-to-disconnect-island","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"22.8K\", \"totalAcceptedRaw\": 10619, \"totalSubmissionRaw\": 22816, \"acRate\": \"46.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Strongly Connected Component","translatedName":null,"slug":"strongly-connected-component","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1731","questionFrontendId":"1609","title":"Even Odd Tree","titleSlug":"even-odd-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.6K\", \"totalSubmission\": \"78.6K\", \"totalAcceptedRaw\": 42644, \"totalSubmissionRaw\": 78588, \"acRate\": \"54.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1745","questionFrontendId":"1602","title":"Find Nearest Right Node in Binary Tree","titleSlug":"find-nearest-right-node-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.1K\", \"totalSubmission\": \"27.9K\", \"totalAcceptedRaw\": 21108, \"totalSubmissionRaw\": 27938, \"acRate\": \"75.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1747","questionFrontendId":"1625","title":"Lexicographically Smallest String After Applying Operations","titleSlug":"lexicographically-smallest-string-after-applying-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.2K\", \"totalSubmission\": \"18.7K\", \"totalAcceptedRaw\": 12239, \"totalSubmissionRaw\": 18694, \"acRate\": \"65.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1753","questionFrontendId":"1631","title":"Path With Minimum Effort","titleSlug":"path-with-minimum-effort","translatedTitle":null,"stats":"{\"totalAccepted\": \"140.9K\", \"totalSubmission\": \"253.4K\", \"totalAcceptedRaw\": 140915, \"totalSubmissionRaw\": 253403, \"acRate\": \"55.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1757","questionFrontendId":"1654","title":"Minimum Jumps to Reach Home","titleSlug":"minimum-jumps-to-reach-home","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.6K\", \"totalSubmission\": \"119.2K\", \"totalAcceptedRaw\": 34578, \"totalSubmissionRaw\": 119164, \"acRate\": \"29.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1796","questionFrontendId":"1660","title":"Correct a Binary Tree","titleSlug":"correct-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"19.1K\", \"totalAcceptedRaw\": 13830, \"totalSubmissionRaw\": 19071, \"acRate\": \"72.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1875","questionFrontendId":"1766","title":"Tree of Coprimes","titleSlug":"tree-of-coprimes","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.3K\", \"totalSubmission\": \"18.5K\", \"totalAcceptedRaw\": 7275, \"totalSubmissionRaw\": 18502, \"acRate\": \"39.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1876","questionFrontendId":"1765","title":"Map of Highest Peak","titleSlug":"map-of-highest-peak","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.5K\", \"totalSubmission\": \"34.1K\", \"totalAcceptedRaw\": 20501, \"totalSubmissionRaw\": 34060, \"acRate\": \"60.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1883","questionFrontendId":"1740","title":"Find Distance in a Binary Tree","titleSlug":"find-distance-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"18K\", \"totalSubmission\": \"26.1K\", \"totalAcceptedRaw\": 18041, \"totalSubmissionRaw\": 26093, \"acRate\": \"69.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1931","questionFrontendId":"1778","title":"Shortest Path in a Hidden Grid","titleSlug":"shortest-path-in-a-hidden-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"11.8K\", \"totalAcceptedRaw\": 4605, \"totalSubmissionRaw\": 11769, \"acRate\": \"39.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1959","questionFrontendId":"1810","title":"Minimum Path Cost in a Hidden Grid","titleSlug":"minimum-path-cost-in-a-hidden-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.3K\", \"totalSubmission\": \"4.3K\", \"totalAcceptedRaw\": 2333, \"totalSubmissionRaw\": 4277, \"acRate\": \"54.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2035","questionFrontendId":"1905","title":"Count Sub Islands","titleSlug":"count-sub-islands","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.8K\", \"totalSubmission\": \"94.3K\", \"totalAcceptedRaw\": 63770, \"totalSubmissionRaw\": 94306, \"acRate\": \"67.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2038","questionFrontendId":"1926","title":"Nearest Exit from Entrance in Maze","titleSlug":"nearest-exit-from-entrance-in-maze","translatedTitle":null,"stats":"{\"totalAccepted\": \"76.1K\", \"totalSubmission\": \"156K\", \"totalAcceptedRaw\": 76121, \"totalSubmissionRaw\": 155995, \"acRate\": \"48.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2101","questionFrontendId":"1970","title":"Last Day Where You Can Still Cross","titleSlug":"last-day-where-you-can-still-cross","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.4K\", \"totalSubmission\": \"23K\", \"totalAcceptedRaw\": 11403, \"totalSubmissionRaw\": 22978, \"acRate\": \"49.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2103","questionFrontendId":"1992","title":"Find All Groups of Farmland","titleSlug":"find-all-groups-of-farmland","translatedTitle":null,"stats":"{\"totalAccepted\": \"21K\", \"totalSubmission\": \"30.6K\", \"totalAcceptedRaw\": 21032, \"totalSubmissionRaw\": 30623, \"acRate\": \"68.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2104","questionFrontendId":"1993","title":"Operations on Tree","titleSlug":"operations-on-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.2K\", \"totalSubmission\": \"23.2K\", \"totalAcceptedRaw\": 10242, \"totalSubmissionRaw\": 23237, \"acRate\": \"44.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2121","questionFrontendId":"1971","title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"222.4K\", \"totalSubmission\": \"426.6K\", \"totalAcceptedRaw\": 222365, \"totalSubmissionRaw\": 426631, \"acRate\": \"52.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2151","questionFrontendId":"2039","title":"The Time When the Network Becomes Idle","titleSlug":"the-time-when-the-network-becomes-idle","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.5K\", \"totalSubmission\": \"20.6K\", \"totalAcceptedRaw\": 10516, \"totalSubmissionRaw\": 20615, \"acRate\": \"51.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2171","questionFrontendId":"2045","title":"Second Minimum Time to Reach Destination","titleSlug":"second-minimum-time-to-reach-destination","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"22K\", \"totalAcceptedRaw\": 8608, \"totalSubmissionRaw\": 21967, \"acRate\": \"39.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2183","questionFrontendId":"2059","title":"Minimum Operations to Convert Number","titleSlug":"minimum-operations-to-convert-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"13K\", \"totalSubmission\": \"27.3K\", \"totalAcceptedRaw\": 13010, \"totalSubmissionRaw\": 27255, \"acRate\": \"47.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2206","questionFrontendId":"2101","title":"Detonate the Maximum Bombs","titleSlug":"detonate-the-maximum-bombs","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.4K\", \"totalSubmission\": \"67.7K\", \"totalAcceptedRaw\": 28437, \"totalSubmissionRaw\": 67665, \"acRate\": \"42.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2213","questionFrontendId":"2092","title":"Find All People With Secret","titleSlug":"find-all-people-with-secret","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.4K\", \"totalSubmission\": \"59.7K\", \"totalAcceptedRaw\": 20415, \"totalSubmissionRaw\": 59709, \"acRate\": \"34.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2250","questionFrontendId":"2146","title":"K Highest Ranked Items Within a Price Range","titleSlug":"k-highest-ranked-items-within-a-price-range","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.2K\", \"totalSubmission\": \"29.5K\", \"totalAcceptedRaw\": 12198, \"totalSubmissionRaw\": 29500, \"acRate\": \"41.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2306","questionFrontendId":"2196","title":"Create Binary Tree From Descriptions","titleSlug":"create-binary-tree-from-descriptions","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.7K\", \"totalSubmission\": \"35.5K\", \"totalAcceptedRaw\": 25701, \"totalSubmissionRaw\": 35531, \"acRate\": \"72.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2314","questionFrontendId":"2174","title":"Remove All Ones With Row and Column Flips II","titleSlug":"remove-all-ones-with-row-and-column-flips-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.1K\", \"totalSubmission\": \"6K\", \"totalAcceptedRaw\": 4101, \"totalSubmissionRaw\": 6016, \"acRate\": \"68.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2344","questionFrontendId":"2258","title":"Escape the Spreading Fire","titleSlug":"escape-the-spreading-fire","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.7K\", \"totalSubmission\": \"19.3K\", \"totalAcceptedRaw\": 6746, \"totalSubmissionRaw\": 19253, \"acRate\": \"35.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2375","questionFrontendId":"2290","title":"Minimum Obstacle Removal to Reach Corner","titleSlug":"minimum-obstacle-removal-to-reach-corner","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.8K\", \"totalSubmission\": \"31.9K\", \"totalAcceptedRaw\": 15811, \"totalSubmissionRaw\": 31910, \"acRate\": \"49.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2403","questionFrontendId":"2316","title":"Count Unreachable Pairs of Nodes in an Undirected Graph","titleSlug":"count-unreachable-pairs-of-nodes-in-an-undirected-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.7K\", \"totalSubmission\": \"55.7K\", \"totalAcceptedRaw\": 21659, \"totalSubmissionRaw\": 55710, \"acRate\": \"38.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2409","questionFrontendId":"2328","title":"Number of Increasing Paths in a Grid","titleSlug":"number-of-increasing-paths-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.4K\", \"totalSubmission\": \"34.5K\", \"totalAcceptedRaw\": 16428, \"totalSubmissionRaw\": 34536, \"acRate\": \"47.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2420","questionFrontendId":"2277","title":"Closest Node to Path in Tree","titleSlug":"closest-node-to-path-in-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.5K\", \"totalSubmission\": \"3.9K\", \"totalAcceptedRaw\": 2466, \"totalSubmissionRaw\": 3868, \"acRate\": \"63.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2445","questionFrontendId":"2368","title":"Reachable Nodes With Restrictions","titleSlug":"reachable-nodes-with-restrictions","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.2K\", \"totalSubmission\": \"54K\", \"totalAcceptedRaw\": 31231, \"totalSubmissionRaw\": 54027, \"acRate\": \"57.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2461","questionFrontendId":"2385","title":"Amount of Time for Binary Tree to Be Infected","titleSlug":"amount-of-time-for-binary-tree-to-be-infected","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.9K\", \"totalSubmission\": \"40.5K\", \"totalAcceptedRaw\": 22943, \"totalSubmissionRaw\": 40503, \"acRate\": \"56.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2493","questionFrontendId":"2415","title":"Reverse Odd Levels of Binary Tree","titleSlug":"reverse-odd-levels-of-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.6K\", \"totalSubmission\": \"41.1K\", \"totalAcceptedRaw\": 31554, \"totalSubmissionRaw\": 41145, \"acRate\": \"76.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2545","questionFrontendId":"2458","title":"Height of Binary Tree After Subtree Removal Queries","titleSlug":"height-of-binary-tree-after-subtree-removal-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.4K\", \"totalSubmission\": \"22.6K\", \"totalAcceptedRaw\": 8376, \"totalSubmissionRaw\": 22614, \"acRate\": \"37.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2558","questionFrontendId":"2471","title":"Minimum Number of Operations to Sort a Binary Tree by Level","titleSlug":"minimum-number-of-operations-to-sort-a-binary-tree-by-level","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.2K\", \"totalSubmission\": \"24.4K\", \"totalAcceptedRaw\": 15187, \"totalSubmissionRaw\": 24373, \"acRate\": \"62.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2564","questionFrontendId":"2467","title":"Most Profitable Path in a Tree","titleSlug":"most-profitable-path-in-a-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"14.3K\", \"totalAcceptedRaw\": 6893, \"totalSubmissionRaw\": 14272, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2568","questionFrontendId":"2477","title":"Minimum Fuel Cost to Report to the Capital","titleSlug":"minimum-fuel-cost-to-report-to-the-capital","translatedTitle":null,"stats":"{\"totalAccepted\": \"53.5K\", \"totalSubmission\": \"78.9K\", \"totalAcceptedRaw\": 53461, \"totalSubmissionRaw\": 78854, \"acRate\": \"67.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2582","questionFrontendId":"2492","title":"Minimum Score of a Path Between Two Cities","titleSlug":"minimum-score-of-a-path-between-two-cities","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.7K\", \"totalSubmission\": \"33.7K\", \"totalAcceptedRaw\": 15675, \"totalSubmissionRaw\": 33700, \"acRate\": \"46.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2583","questionFrontendId":"2493","title":"Divide Nodes Into the Maximum Number of Groups","titleSlug":"divide-nodes-into-the-maximum-number-of-groups","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.8K\", \"totalSubmission\": \"13.1K\", \"totalAcceptedRaw\": 4835, \"totalSubmissionRaw\": 13057, \"acRate\": \"37.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2584","questionFrontendId":"2445","title":"Number of Nodes With Value One","titleSlug":"number-of-nodes-with-value-one","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2K\", \"totalSubmission\": \"1.7K\", \"totalAcceptedRaw\": 1204, \"totalSubmissionRaw\": 1702, \"acRate\": \"70.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2588","questionFrontendId":"2503","title":"Maximum Number of Points From Grid Queries","titleSlug":"maximum-number-of-points-from-grid-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.2K\", \"totalSubmission\": \"16.6K\", \"totalAcceptedRaw\": 6160, \"totalSubmissionRaw\": 16650, \"acRate\": \"37.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2641","questionFrontendId":"2556","title":"Disconnect Path in a Binary Matrix by at Most One Flip","titleSlug":"disconnect-path-in-a-binary-matrix-by-at-most-one-flip","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.2K\", \"totalSubmission\": \"28.7K\", \"totalAcceptedRaw\": 8192, \"totalSubmissionRaw\": 28713, \"acRate\": \"28.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2646","questionFrontendId":"2583","title":"Kth Largest Sum in a Binary Tree","titleSlug":"kth-largest-sum-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.7K\", \"totalSubmission\": \"37.9K\", \"totalAcceptedRaw\": 17651, \"totalSubmissionRaw\": 37902, \"acRate\": \"46.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2711","questionFrontendId":"2577","title":"Minimum Time to Visit a Cell In a Grid","titleSlug":"minimum-time-to-visit-a-cell-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"16.6K\", \"totalAcceptedRaw\": 5905, \"totalSubmissionRaw\": 16633, \"acRate\": \"35.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1368","questionFrontendId":"1242","title":"Web Crawler Multithreaded","titleSlug":"web-crawler-multithreaded","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.9K\", \"totalSubmission\": \"83.7K\", \"totalAcceptedRaw\": 40937, \"totalSubmissionRaw\": 83663, \"acRate\": \"48.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Concurrency","translatedName":null,"slug":"concurrency","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/tmp/depth-first-search-graphql.json b/tmp/depth-first-search-graphql.json
new file mode 100644
index 000000000..4f5cf8b26
--- /dev/null
+++ b/tmp/depth-first-search-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","questions":[{"status":null,"questionId":"94","questionFrontendId":"94","title":"Binary Tree Inorder Traversal","titleSlug":"binary-tree-inorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.9M\", \"totalSubmission\": \"2.6M\", \"totalAcceptedRaw\": 1938413, \"totalSubmissionRaw\": 2629905, \"acRate\": \"73.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"98","questionFrontendId":"98","title":"Validate Binary Search Tree","titleSlug":"validate-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.9M\", \"totalSubmission\": \"5.8M\", \"totalAcceptedRaw\": 1863971, \"totalSubmissionRaw\": 5831535, \"acRate\": \"32.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"99","questionFrontendId":"99","title":"Recover Binary Search Tree","titleSlug":"recover-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"385.5K\", \"totalSubmission\": \"757.5K\", \"totalAcceptedRaw\": 385544, \"totalSubmissionRaw\": 757487, \"acRate\": \"50.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"100","questionFrontendId":"100","title":"Same Tree","titleSlug":"same-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5M\", \"totalSubmission\": \"2.5M\", \"totalAcceptedRaw\": 1470483, \"totalSubmissionRaw\": 2533188, \"acRate\": \"58.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"101","questionFrontendId":"101","title":"Symmetric Tree","titleSlug":"symmetric-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6M\", \"totalSubmission\": \"2.9M\", \"totalAcceptedRaw\": 1592991, \"totalSubmissionRaw\": 2938030, \"acRate\": \"54.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"104","questionFrontendId":"104","title":"Maximum Depth of Binary Tree","titleSlug":"maximum-depth-of-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.3M\", \"totalSubmission\": \"3.1M\", \"totalAcceptedRaw\": 2253172, \"totalSubmissionRaw\": 3050882, \"acRate\": \"73.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"110","questionFrontendId":"110","title":"Balanced Binary Tree","titleSlug":"balanced-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 1061177, \"totalSubmissionRaw\": 2169100, \"acRate\": \"48.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"111","questionFrontendId":"111","title":"Minimum Depth of Binary Tree","titleSlug":"minimum-depth-of-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"913.6K\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 913642, \"totalSubmissionRaw\": 2061234, \"acRate\": \"44.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"112","questionFrontendId":"112","title":"Path Sum","titleSlug":"path-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"2.4M\", \"totalAcceptedRaw\": 1139599, \"totalSubmissionRaw\": 2365630, \"acRate\": \"48.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"113","questionFrontendId":"113","title":"Path Sum II","titleSlug":"path-sum-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"730K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 730033, \"totalSubmissionRaw\": 1279923, \"acRate\": \"57.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"114","questionFrontendId":"114","title":"Flatten Binary Tree to Linked List","titleSlug":"flatten-binary-tree-to-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"758K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 757996, \"totalSubmissionRaw\": 1227848, \"acRate\": \"61.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"116","questionFrontendId":"116","title":"Populating Next Right Pointers in Each Node","titleSlug":"populating-next-right-pointers-in-each-node","translatedTitle":null,"stats":"{\"totalAccepted\": \"903.7K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 903689, \"totalSubmissionRaw\": 1498826, \"acRate\": \"60.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"117","questionFrontendId":"117","title":"Populating Next Right Pointers in Each Node II","titleSlug":"populating-next-right-pointers-in-each-node-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"539.3K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 539297, \"totalSubmissionRaw\": 1074426, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"124","questionFrontendId":"124","title":"Binary Tree Maximum Path Sum","titleSlug":"binary-tree-maximum-path-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"949.8K\", \"totalSubmission\": \"2.4M\", \"totalAcceptedRaw\": 949830, \"totalSubmissionRaw\": 2423499, \"acRate\": \"39.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"129","questionFrontendId":"129","title":"Sum Root to Leaf Numbers","titleSlug":"sum-root-to-leaf-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"598K\", \"totalSubmission\": \"981.6K\", \"totalAcceptedRaw\": 597957, \"totalSubmissionRaw\": 981571, \"acRate\": \"60.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"130","questionFrontendId":"130","title":"Surrounded Regions","titleSlug":"surrounded-regions","translatedTitle":null,"stats":"{\"totalAccepted\": \"517.6K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 517587, \"totalSubmissionRaw\": 1412315, \"acRate\": \"36.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"133","questionFrontendId":"133","title":"Clone Graph","titleSlug":"clone-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"913.3K\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 913285, \"totalSubmissionRaw\": 1763510, \"acRate\": \"51.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"144","questionFrontendId":"144","title":"Binary Tree Preorder Traversal","titleSlug":"binary-tree-preorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 1279305, \"totalSubmissionRaw\": 1917628, \"acRate\": \"66.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"145","questionFrontendId":"145","title":"Binary Tree Postorder Traversal","titleSlug":"binary-tree-postorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"924.9K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 924886, \"totalSubmissionRaw\": 1364034, \"acRate\": \"67.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"156","questionFrontendId":"156","title":"Binary Tree Upside Down","titleSlug":"binary-tree-upside-down","translatedTitle":null,"stats":"{\"totalAccepted\": \"96.3K\", \"totalSubmission\": \"155.5K\", \"totalAcceptedRaw\": 96294, \"totalSubmissionRaw\": 155507, \"acRate\": \"61.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"199","questionFrontendId":"199","title":"Binary Tree Right Side View","titleSlug":"binary-tree-right-side-view","translatedTitle":null,"stats":"{\"totalAccepted\": \"919.2K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 919154, \"totalSubmissionRaw\": 1492530, \"acRate\": \"61.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"200","questionFrontendId":"200","title":"Number of Islands","titleSlug":"number-of-islands","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.1M\", \"totalSubmission\": \"3.7M\", \"totalAcceptedRaw\": 2091353, \"totalSubmissionRaw\": 3673734, \"acRate\": \"56.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"207","questionFrontendId":"207","title":"Course Schedule","titleSlug":"course-schedule","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"2.5M\", \"totalAcceptedRaw\": 1133122, \"totalSubmissionRaw\": 2497681, \"acRate\": \"45.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"210","questionFrontendId":"210","title":"Course Schedule II","titleSlug":"course-schedule-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"793.3K\", \"totalSubmission\": \"1.6M\", \"totalAcceptedRaw\": 793261, \"totalSubmissionRaw\": 1638289, \"acRate\": \"48.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"211","questionFrontendId":"211","title":"Design Add and Search Words Data Structure","titleSlug":"design-add-and-search-words-data-structure","translatedTitle":null,"stats":"{\"totalAccepted\": \"471.4K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 471353, \"totalSubmissionRaw\": 1096120, \"acRate\": \"43.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"222","questionFrontendId":"222","title":"Count Complete Tree Nodes","titleSlug":"count-complete-tree-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"534.5K\", \"totalSubmission\": \"884.6K\", \"totalAcceptedRaw\": 534451, \"totalSubmissionRaw\": 884557, \"acRate\": \"60.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"226","questionFrontendId":"226","title":"Invert Binary Tree","titleSlug":"invert-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5M\", \"totalSubmission\": \"2M\", \"totalAcceptedRaw\": 1495463, \"totalSubmissionRaw\": 2003910, \"acRate\": \"74.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"230","questionFrontendId":"230","title":"Kth Smallest Element in a BST","titleSlug":"kth-smallest-element-in-a-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"1M\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 1049141, \"totalSubmissionRaw\": 1497869, \"acRate\": \"70.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"235","questionFrontendId":"235","title":"Lowest Common Ancestor of a Binary Search Tree","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 1134027, \"totalSubmissionRaw\": 1847797, \"acRate\": \"61.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"236","questionFrontendId":"236","title":"Lowest Common Ancestor of a Binary Tree","titleSlug":"lowest-common-ancestor-of-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 1265640, \"totalSubmissionRaw\": 2155910, \"acRate\": \"58.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"250","questionFrontendId":"250","title":"Count Univalue Subtrees","titleSlug":"count-univalue-subtrees","translatedTitle":null,"stats":"{\"totalAccepted\": \"137K\", \"totalSubmission\": \"247.3K\", \"totalAcceptedRaw\": 137043, \"totalSubmissionRaw\": 247334, \"acRate\": \"55.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"257","questionFrontendId":"257","title":"Binary Tree Paths","titleSlug":"binary-tree-paths","translatedTitle":null,"stats":"{\"totalAccepted\": \"603.6K\", \"totalSubmission\": \"984.7K\", \"totalAcceptedRaw\": 603639, \"totalSubmissionRaw\": 984698, \"acRate\": \"61.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"261","questionFrontendId":"261","title":"Graph Valid Tree","titleSlug":"graph-valid-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"332.9K\", \"totalSubmission\": \"706.9K\", \"totalAcceptedRaw\": 332851, \"totalSubmissionRaw\": 706936, \"acRate\": \"47.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"269","questionFrontendId":"269","title":"Alien Dictionary","titleSlug":"alien-dictionary","translatedTitle":null,"stats":"{\"totalAccepted\": \"332.5K\", \"totalSubmission\": \"941.2K\", \"totalAcceptedRaw\": 332478, \"totalSubmissionRaw\": 941223, \"acRate\": \"35.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"270","questionFrontendId":"270","title":"Closest Binary Search Tree Value","titleSlug":"closest-binary-search-tree-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"281.9K\", \"totalSubmission\": \"515K\", \"totalAcceptedRaw\": 281901, \"totalSubmissionRaw\": 515004, \"acRate\": \"54.7%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"272","questionFrontendId":"272","title":"Closest Binary Search Tree Value II","titleSlug":"closest-binary-search-tree-value-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"110K\", \"totalSubmission\": \"188.3K\", \"totalAcceptedRaw\": 109964, \"totalSubmissionRaw\": 188323, \"acRate\": \"58.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"285","questionFrontendId":"285","title":"Inorder Successor in BST","titleSlug":"inorder-successor-in-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"300.1K\", \"totalSubmission\": \"616.1K\", \"totalAcceptedRaw\": 300055, \"totalSubmissionRaw\": 616078, \"acRate\": \"48.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"297","questionFrontendId":"297","title":"Serialize and Deserialize Binary Tree","titleSlug":"serialize-and-deserialize-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"727.9K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 727921, \"totalSubmissionRaw\": 1315117, \"acRate\": \"55.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"298","questionFrontendId":"298","title":"Binary Tree Longest Consecutive Sequence","titleSlug":"binary-tree-longest-consecutive-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"137.1K\", \"totalSubmission\": \"259.9K\", \"totalAcceptedRaw\": 137050, \"totalSubmissionRaw\": 259940, \"acRate\": \"52.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"302","questionFrontendId":"302","title":"Smallest Rectangle Enclosing Black Pixels","titleSlug":"smallest-rectangle-enclosing-black-pixels","translatedTitle":null,"stats":"{\"totalAccepted\": \"47.2K\", \"totalSubmission\": \"80.8K\", \"totalAcceptedRaw\": 47233, \"totalSubmissionRaw\": 80818, \"acRate\": \"58.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"310","questionFrontendId":"310","title":"Minimum Height Trees","titleSlug":"minimum-height-trees","translatedTitle":null,"stats":"{\"totalAccepted\": \"242.3K\", \"totalSubmission\": \"628.9K\", \"totalAcceptedRaw\": 242343, \"totalSubmissionRaw\": 628885, \"acRate\": \"38.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"314","questionFrontendId":"314","title":"Binary Tree Vertical Order Traversal","titleSlug":"binary-tree-vertical-order-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"318.2K\", \"totalSubmission\": \"608.7K\", \"totalAcceptedRaw\": 318203, \"totalSubmissionRaw\": 608665, \"acRate\": \"52.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"323","questionFrontendId":"323","title":"Number of Connected Components in an Undirected Graph","titleSlug":"number-of-connected-components-in-an-undirected-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"326.8K\", \"totalSubmission\": \"525.3K\", \"totalAcceptedRaw\": 326849, \"totalSubmissionRaw\": 525340, \"acRate\": \"62.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"329","questionFrontendId":"329","title":"Longest Increasing Path in a Matrix","titleSlug":"longest-increasing-path-in-a-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"435.8K\", \"totalSubmission\": \"831.3K\", \"totalAcceptedRaw\": 435817, \"totalSubmissionRaw\": 831310, \"acRate\": \"52.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"332","questionFrontendId":"332","title":"Reconstruct Itinerary","titleSlug":"reconstruct-itinerary","translatedTitle":null,"stats":"{\"totalAccepted\": \"323.9K\", \"totalSubmission\": \"785.8K\", \"totalAcceptedRaw\": 323928, \"totalSubmissionRaw\": 785848, \"acRate\": \"41.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Eulerian Circuit","translatedName":null,"slug":"eulerian-circuit","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"333","questionFrontendId":"333","title":"Largest BST Subtree","titleSlug":"largest-bst-subtree","translatedTitle":null,"stats":"{\"totalAccepted\": \"95.4K\", \"totalSubmission\": \"223.2K\", \"totalAcceptedRaw\": 95443, \"totalSubmissionRaw\": 223177, \"acRate\": \"42.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"337","questionFrontendId":"337","title":"House Robber III","titleSlug":"house-robber-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"329.6K\", \"totalSubmission\": \"611.1K\", \"totalAcceptedRaw\": 329595, \"totalSubmissionRaw\": 611056, \"acRate\": \"53.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"339","questionFrontendId":"339","title":"Nested List Weight Sum","titleSlug":"nested-list-weight-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"223K\", \"totalSubmission\": \"271K\", \"totalAcceptedRaw\": 222970, \"totalSubmissionRaw\": 271011, \"acRate\": \"82.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"341","questionFrontendId":"341","title":"Flatten Nested List Iterator","titleSlug":"flatten-nested-list-iterator","translatedTitle":null,"stats":"{\"totalAccepted\": \"358.8K\", \"totalSubmission\": \"580.5K\", \"totalAcceptedRaw\": 358753, \"totalSubmissionRaw\": 580520, \"acRate\": \"61.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Iterator","translatedName":null,"slug":"iterator","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"364","questionFrontendId":"364","title":"Nested List Weight Sum II","titleSlug":"nested-list-weight-sum-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"128.9K\", \"totalSubmission\": \"193.5K\", \"totalAcceptedRaw\": 128935, \"totalSubmissionRaw\": 193548, \"acRate\": \"66.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"365","questionFrontendId":"365","title":"Water and Jug Problem","titleSlug":"water-and-jug-problem","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.4K\", \"totalSubmission\": \"209.8K\", \"totalAcceptedRaw\": 78427, \"totalSubmissionRaw\": 209822, \"acRate\": \"37.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"366","questionFrontendId":"366","title":"Find Leaves of Binary Tree","titleSlug":"find-leaves-of-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"234.6K\", \"totalSubmission\": \"292.2K\", \"totalAcceptedRaw\": 234577, \"totalSubmissionRaw\": 292175, \"acRate\": \"80.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"385","questionFrontendId":"385","title":"Mini Parser","titleSlug":"mini-parser","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.8K\", \"totalSubmission\": \"140.7K\", \"totalAcceptedRaw\": 51848, \"totalSubmissionRaw\": 140662, \"acRate\": \"36.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"386","questionFrontendId":"386","title":"Lexicographical Numbers","titleSlug":"lexicographical-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"99.6K\", \"totalSubmission\": \"161.9K\", \"totalAcceptedRaw\": 99602, \"totalSubmissionRaw\": 161947, \"acRate\": \"61.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"388","questionFrontendId":"388","title":"Longest Absolute File Path","titleSlug":"longest-absolute-file-path","translatedTitle":null,"stats":"{\"totalAccepted\": \"141K\", \"totalSubmission\": \"302.4K\", \"totalAcceptedRaw\": 141011, \"totalSubmissionRaw\": 302371, \"acRate\": \"46.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"399","questionFrontendId":"399","title":"Evaluate Division","titleSlug":"evaluate-division","translatedTitle":null,"stats":"{\"totalAccepted\": \"328.8K\", \"totalSubmission\": \"551.3K\", \"totalAcceptedRaw\": 328839, \"totalSubmissionRaw\": 551333, \"acRate\": \"59.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"404","questionFrontendId":"404","title":"Sum of Left Leaves","titleSlug":"sum-of-left-leaves","translatedTitle":null,"stats":"{\"totalAccepted\": \"425.3K\", \"totalSubmission\": \"750.7K\", \"totalAcceptedRaw\": 425336, \"totalSubmissionRaw\": 750670, \"acRate\": \"56.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"417","questionFrontendId":"417","title":"Pacific Atlantic Water Flow","titleSlug":"pacific-atlantic-water-flow","translatedTitle":null,"stats":"{\"totalAccepted\": \"346.1K\", \"totalSubmission\": \"636.4K\", \"totalAcceptedRaw\": 346108, \"totalSubmissionRaw\": 636373, \"acRate\": \"54.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"419","questionFrontendId":"419","title":"Battleships in a Board","titleSlug":"battleships-in-a-board","translatedTitle":null,"stats":"{\"totalAccepted\": \"178.9K\", \"totalSubmission\": \"239.1K\", \"totalAcceptedRaw\": 178948, \"totalSubmissionRaw\": 239091, \"acRate\": \"74.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"437","questionFrontendId":"437","title":"Path Sum III","titleSlug":"path-sum-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"443.7K\", \"totalSubmission\": \"923.1K\", \"totalAcceptedRaw\": 443748, \"totalSubmissionRaw\": 923150, \"acRate\": \"48.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"449","questionFrontendId":"449","title":"Serialize and Deserialize BST","titleSlug":"serialize-and-deserialize-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"215.8K\", \"totalSubmission\": \"378.7K\", \"totalAcceptedRaw\": 215815, \"totalSubmissionRaw\": 378697, \"acRate\": \"57.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"463","questionFrontendId":"463","title":"Island Perimeter","titleSlug":"island-perimeter","translatedTitle":null,"stats":"{\"totalAccepted\": \"424.9K\", \"totalSubmission\": \"609.9K\", \"totalAcceptedRaw\": 424868, \"totalSubmissionRaw\": 609909, \"acRate\": \"69.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"472","questionFrontendId":"472","title":"Concatenated Words","titleSlug":"concatenated-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"206K\", \"totalSubmission\": \"411.5K\", \"totalAcceptedRaw\": 206044, \"totalSubmissionRaw\": 411541, \"acRate\": \"50.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"490","questionFrontendId":"490","title":"The Maze","titleSlug":"the-maze","translatedTitle":null,"stats":"{\"totalAccepted\": \"140K\", \"totalSubmission\": \"251.1K\", \"totalAcceptedRaw\": 139991, \"totalSubmissionRaw\": 251100, \"acRate\": \"55.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"499","questionFrontendId":"499","title":"The Maze III","titleSlug":"the-maze-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"27K\", \"totalSubmission\": \"57K\", \"totalAcceptedRaw\": 26987, \"totalSubmissionRaw\": 57046, \"acRate\": \"47.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"501","questionFrontendId":"501","title":"Find Mode in Binary Search Tree","titleSlug":"find-mode-in-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"186.1K\", \"totalSubmission\": \"377.9K\", \"totalAcceptedRaw\": 186078, \"totalSubmissionRaw\": 377907, \"acRate\": \"49.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"505","questionFrontendId":"505","title":"The Maze II","titleSlug":"the-maze-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"94.4K\", \"totalSubmission\": \"179.9K\", \"totalAcceptedRaw\": 94396, \"totalSubmissionRaw\": 179917, \"acRate\": \"52.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"508","questionFrontendId":"508","title":"Most Frequent Subtree Sum","titleSlug":"most-frequent-subtree-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.8K\", \"totalSubmission\": \"192.5K\", \"totalAcceptedRaw\": 124782, \"totalSubmissionRaw\": 192529, \"acRate\": \"64.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"511","questionFrontendId":"1059","title":"All Paths from Source Lead to Destination","titleSlug":"all-paths-from-source-lead-to-destination","translatedTitle":null,"stats":"{\"totalAccepted\": \"50.6K\", \"totalSubmission\": \"128.7K\", \"totalAcceptedRaw\": 50557, \"totalSubmissionRaw\": 128660, \"acRate\": \"39.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"513","questionFrontendId":"513","title":"Find Bottom Left Tree Value","titleSlug":"find-bottom-left-tree-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"207.9K\", \"totalSubmission\": \"311.1K\", \"totalAcceptedRaw\": 207889, \"totalSubmissionRaw\": 311066, \"acRate\": \"66.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"514","questionFrontendId":"514","title":"Freedom Trail","titleSlug":"freedom-trail","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.6K\", \"totalSubmission\": \"67.2K\", \"totalAcceptedRaw\": 31575, \"totalSubmissionRaw\": 67241, \"acRate\": \"47.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"515","questionFrontendId":"515","title":"Find Largest Value in Each Tree Row","titleSlug":"find-largest-value-in-each-tree-row","translatedTitle":null,"stats":"{\"totalAccepted\": \"223.4K\", \"totalSubmission\": \"345.8K\", \"totalAcceptedRaw\": 223405, \"totalSubmissionRaw\": 345841, \"acRate\": \"64.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"529","questionFrontendId":"529","title":"Minesweeper","titleSlug":"minesweeper","translatedTitle":null,"stats":"{\"totalAccepted\": \"134.5K\", \"totalSubmission\": \"204.6K\", \"totalAcceptedRaw\": 134452, \"totalSubmissionRaw\": 204560, \"acRate\": \"65.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"530","questionFrontendId":"530","title":"Minimum Absolute Difference in BST","titleSlug":"minimum-absolute-difference-in-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"199.9K\", \"totalSubmission\": \"348.9K\", \"totalAcceptedRaw\": 199922, \"totalSubmissionRaw\": 348877, \"acRate\": \"57.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"536","questionFrontendId":"536","title":"Construct Binary Tree from String","titleSlug":"construct-binary-tree-from-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"82.8K\", \"totalSubmission\": \"147.3K\", \"totalAcceptedRaw\": 82832, \"totalSubmissionRaw\": 147300, \"acRate\": \"56.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"538","questionFrontendId":"538","title":"Convert BST to Greater Tree","titleSlug":"convert-bst-to-greater-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"264.1K\", \"totalSubmission\": \"389.8K\", \"totalAcceptedRaw\": 264101, \"totalSubmissionRaw\": 389825, \"acRate\": \"67.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"543","questionFrontendId":"543","title":"Diameter of Binary Tree","titleSlug":"diameter-of-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"999.3K\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 999277, \"totalSubmissionRaw\": 1762332, \"acRate\": \"56.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"545","questionFrontendId":"545","title":"Boundary of Binary Tree","titleSlug":"boundary-of-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"118.7K\", \"totalSubmission\": \"266.9K\", \"totalAcceptedRaw\": 118735, \"totalSubmissionRaw\": 266859, \"acRate\": \"44.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"547","questionFrontendId":"547","title":"Number of Provinces","titleSlug":"number-of-provinces","translatedTitle":null,"stats":"{\"totalAccepted\": \"601.4K\", \"totalSubmission\": \"944.4K\", \"totalAcceptedRaw\": 601423, \"totalSubmissionRaw\": 944423, \"acRate\": \"63.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"549","questionFrontendId":"549","title":"Binary Tree Longest Consecutive Sequence II","titleSlug":"binary-tree-longest-consecutive-sequence-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"49.8K\", \"totalSubmission\": \"100.7K\", \"totalAcceptedRaw\": 49811, \"totalSubmissionRaw\": 100668, \"acRate\": \"49.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"563","questionFrontendId":"563","title":"Binary Tree Tilt","titleSlug":"binary-tree-tilt","translatedTitle":null,"stats":"{\"totalAccepted\": \"186.7K\", \"totalSubmission\": \"311.4K\", \"totalAcceptedRaw\": 186679, \"totalSubmissionRaw\": 311399, \"acRate\": \"59.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"565","questionFrontendId":"565","title":"Array Nesting","titleSlug":"array-nesting","translatedTitle":null,"stats":"{\"totalAccepted\": \"121.5K\", \"totalSubmission\": \"215.4K\", \"totalAcceptedRaw\": 121479, \"totalSubmissionRaw\": 215403, \"acRate\": \"56.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"572","questionFrontendId":"572","title":"Subtree of Another Tree","titleSlug":"subtree-of-another-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"632.7K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 632674, \"totalSubmissionRaw\": 1365640, \"acRate\": \"46.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"582","questionFrontendId":"582","title":"Kill Process","titleSlug":"kill-process","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.4K\", \"totalSubmission\": \"114.1K\", \"totalAcceptedRaw\": 78370, \"totalSubmissionRaw\": 114068, \"acRate\": \"68.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"606","questionFrontendId":"606","title":"Construct String from Binary Tree","titleSlug":"construct-string-from-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"213.6K\", \"totalSubmission\": \"334K\", \"totalAcceptedRaw\": 213587, \"totalSubmissionRaw\": 333989, \"acRate\": \"64.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"617","questionFrontendId":"617","title":"Merge Two Binary Trees","titleSlug":"merge-two-binary-trees","translatedTitle":null,"stats":"{\"totalAccepted\": \"669.3K\", \"totalSubmission\": \"851.1K\", \"totalAcceptedRaw\": 669307, \"totalSubmissionRaw\": 851087, \"acRate\": \"78.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"623","questionFrontendId":"623","title":"Add One Row to Tree","titleSlug":"add-one-row-to-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"148.7K\", \"totalSubmission\": \"250K\", \"totalAcceptedRaw\": 148692, \"totalSubmissionRaw\": 250011, \"acRate\": \"59.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"637","questionFrontendId":"637","title":"Average of Levels in Binary Tree","titleSlug":"average-of-levels-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"383.5K\", \"totalSubmission\": \"534.5K\", \"totalAcceptedRaw\": 383532, \"totalSubmissionRaw\": 534499, \"acRate\": \"71.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"652","questionFrontendId":"652","title":"Find Duplicate Subtrees","titleSlug":"find-duplicate-subtrees","translatedTitle":null,"stats":"{\"totalAccepted\": \"228.1K\", \"totalSubmission\": \"386.9K\", \"totalAcceptedRaw\": 228142, \"totalSubmissionRaw\": 386902, \"acRate\": \"59.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"653","questionFrontendId":"653","title":"Two Sum IV - Input is a BST","titleSlug":"two-sum-iv-input-is-a-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"445.1K\", \"totalSubmission\": \"729.2K\", \"totalAcceptedRaw\": 445113, \"totalSubmissionRaw\": 729202, \"acRate\": \"61.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"655","questionFrontendId":"655","title":"Print Binary Tree","titleSlug":"print-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.9K\", \"totalSubmission\": \"95.1K\", \"totalAcceptedRaw\": 58874, \"totalSubmissionRaw\": 95071, \"acRate\": \"61.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"662","questionFrontendId":"662","title":"Maximum Width of Binary Tree","titleSlug":"maximum-width-of-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"241.8K\", \"totalSubmission\": \"593.6K\", \"totalAcceptedRaw\": 241778, \"totalSubmissionRaw\": 593560, \"acRate\": \"40.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"663","questionFrontendId":"663","title":"Equal Tree Partition","titleSlug":"equal-tree-partition","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.2K\", \"totalSubmission\": \"70.6K\", \"totalAcceptedRaw\": 29238, \"totalSubmissionRaw\": 70590, \"acRate\": \"41.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"666","questionFrontendId":"666","title":"Path Sum IV","titleSlug":"path-sum-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.4K\", \"totalSubmission\": \"36K\", \"totalAcceptedRaw\": 21382, \"totalSubmissionRaw\": 35965, \"acRate\": \"59.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"669","questionFrontendId":"669","title":"Trim a Binary Search Tree","titleSlug":"trim-a-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"262K\", \"totalSubmission\": \"394.8K\", \"totalAcceptedRaw\": 262037, \"totalSubmissionRaw\": 394835, \"acRate\": \"66.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"671","questionFrontendId":"671","title":"Second Minimum Node In a Binary Tree","titleSlug":"second-minimum-node-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"165.9K\", \"totalSubmission\": \"376.2K\", \"totalAcceptedRaw\": 165853, \"totalSubmissionRaw\": 376220, \"acRate\": \"44.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"672","questionFrontendId":"672","title":"Bulb Switcher II","titleSlug":"bulb-switcher-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.2K\", \"totalSubmission\": \"37.9K\", \"totalAcceptedRaw\": 19220, \"totalSubmissionRaw\": 37903, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"684","questionFrontendId":"684","title":"Redundant Connection","titleSlug":"redundant-connection","translatedTitle":null,"stats":"{\"totalAccepted\": \"264.8K\", \"totalSubmission\": \"425.7K\", \"totalAcceptedRaw\": 264785, \"totalSubmissionRaw\": 425709, \"acRate\": \"62.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"685","questionFrontendId":"685","title":"Redundant Connection II","titleSlug":"redundant-connection-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"60.1K\", \"totalSubmission\": \"176.3K\", \"totalAcceptedRaw\": 60122, \"totalSubmissionRaw\": 176276, \"acRate\": \"34.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"687","questionFrontendId":"687","title":"Longest Univalue Path","titleSlug":"longest-univalue-path","translatedTitle":null,"stats":"{\"totalAccepted\": \"161.2K\", \"totalSubmission\": \"398.9K\", \"totalAcceptedRaw\": 161171, \"totalSubmissionRaw\": 398855, \"acRate\": \"40.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"690","questionFrontendId":"690","title":"Employee Importance","titleSlug":"employee-importance","translatedTitle":null,"stats":"{\"totalAccepted\": \"191.9K\", \"totalSubmission\": \"292.8K\", \"totalAcceptedRaw\": 191855, \"totalSubmissionRaw\": 292770, \"acRate\": \"65.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"694","questionFrontendId":"694","title":"Number of Distinct Islands","titleSlug":"number-of-distinct-islands","translatedTitle":null,"stats":"{\"totalAccepted\": \"147.1K\", \"totalSubmission\": \"242.1K\", \"totalAcceptedRaw\": 147068, \"totalSubmissionRaw\": 242132, \"acRate\": \"60.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"695","questionFrontendId":"695","title":"Max Area of Island","titleSlug":"max-area-of-island","translatedTitle":null,"stats":"{\"totalAccepted\": \"689.2K\", \"totalSubmission\": \"960.1K\", \"totalAcceptedRaw\": 689163, \"totalSubmissionRaw\": 960101, \"acRate\": \"71.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"711","questionFrontendId":"711","title":"Number of Distinct Islands II","titleSlug":"number-of-distinct-islands-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"17.8K\", \"totalAcceptedRaw\": 9240, \"totalSubmissionRaw\": 17821, \"acRate\": \"51.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"721","questionFrontendId":"721","title":"Accounts Merge","titleSlug":"accounts-merge","translatedTitle":null,"stats":"{\"totalAccepted\": \"302.4K\", \"totalSubmission\": \"536.7K\", \"totalAcceptedRaw\": 302411, \"totalSubmissionRaw\": 536748, \"acRate\": \"56.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"733","questionFrontendId":"733","title":"Flood Fill","titleSlug":"flood-fill","translatedTitle":null,"stats":"{\"totalAccepted\": \"682.9K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 682854, \"totalSubmissionRaw\": 1104613, \"acRate\": \"61.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"737","questionFrontendId":"737","title":"Sentence Similarity II","titleSlug":"sentence-similarity-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.1K\", \"totalSubmission\": \"132.8K\", \"totalAcceptedRaw\": 65064, \"totalSubmissionRaw\": 132773, \"acRate\": \"49.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"743","questionFrontendId":"742","title":"Closest Leaf in a Binary Tree","titleSlug":"closest-leaf-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"41.8K\", \"totalSubmission\": \"91.2K\", \"totalAcceptedRaw\": 41835, \"totalSubmissionRaw\": 91177, \"acRate\": \"45.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"744","questionFrontendId":"743","title":"Network Delay Time","titleSlug":"network-delay-time","translatedTitle":null,"stats":"{\"totalAccepted\": \"364.4K\", \"totalSubmission\": \"703.4K\", \"totalAcceptedRaw\": 364392, \"totalSubmissionRaw\": 703396, \"acRate\": \"51.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"750","questionFrontendId":"749","title":"Contain Virus","titleSlug":"contain-virus","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.2K\", \"totalSubmission\": \"20.1K\", \"totalAcceptedRaw\": 10239, \"totalSubmissionRaw\": 20051, \"acRate\": \"51.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"754","questionFrontendId":"753","title":"Cracking the Safe","titleSlug":"cracking-the-safe","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.3K\", \"totalSubmission\": \"93.8K\", \"totalAcceptedRaw\": 52332, \"totalSubmissionRaw\": 93807, \"acRate\": \"55.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Eulerian Circuit","translatedName":null,"slug":"eulerian-circuit","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"757","questionFrontendId":"756","title":"Pyramid Transition Matrix","titleSlug":"pyramid-transition-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"30K\", \"totalSubmission\": \"56.9K\", \"totalAcceptedRaw\": 30016, \"totalSubmissionRaw\": 56938, \"acRate\": \"52.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"758","questionFrontendId":"426","title":"Convert Binary Search Tree to Sorted Doubly Linked List","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"233.7K\", \"totalSubmission\": \"361.5K\", \"totalAcceptedRaw\": 233675, \"totalSubmissionRaw\": 361492, \"acRate\": \"64.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"765","questionFrontendId":"428","title":"Serialize and Deserialize N-ary Tree","titleSlug":"serialize-and-deserialize-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"77.9K\", \"totalSubmission\": \"118.1K\", \"totalAcceptedRaw\": 77875, \"totalSubmissionRaw\": 118100, \"acRate\": \"65.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"766","questionFrontendId":"430","title":"Flatten a Multilevel Doubly Linked List","titleSlug":"flatten-a-multilevel-doubly-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"283.1K\", \"totalSubmission\": \"474.6K\", \"totalAcceptedRaw\": 283077, \"totalSubmissionRaw\": 474643, \"acRate\": \"59.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"770","questionFrontendId":"765","title":"Couples Holding Hands","titleSlug":"couples-holding-hands","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.9K\", \"totalSubmission\": \"91.3K\", \"totalAcceptedRaw\": 51853, \"totalSubmissionRaw\": 91311, \"acRate\": \"56.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"771","questionFrontendId":"431","title":"Encode N-ary Tree to Binary Tree","titleSlug":"encode-n-ary-tree-to-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.3K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 19349, \"totalSubmissionRaw\": 24526, \"acRate\": \"78.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"774","questionFrontendId":"559","title":"Maximum Depth of N-ary Tree","titleSlug":"maximum-depth-of-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"244.8K\", \"totalSubmission\": \"341.7K\", \"totalAcceptedRaw\": 244823, \"totalSubmissionRaw\": 341672, \"acRate\": \"71.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"775","questionFrontendId":"589","title":"N-ary Tree Preorder Traversal","titleSlug":"n-ary-tree-preorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"373.9K\", \"totalSubmission\": \"492.5K\", \"totalAcceptedRaw\": 373899, \"totalSubmissionRaw\": 492501, \"acRate\": \"75.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"776","questionFrontendId":"590","title":"N-ary Tree Postorder Traversal","titleSlug":"n-ary-tree-postorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"220.5K\", \"totalSubmission\": \"284.9K\", \"totalAcceptedRaw\": 220546, \"totalSubmissionRaw\": 284943, \"acRate\": \"77.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"794","questionFrontendId":"778","title":"Swim in Rising Water","titleSlug":"swim-in-rising-water","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.1K\", \"totalSubmission\": \"190.7K\", \"totalAcceptedRaw\": 114066, \"totalSubmissionRaw\": 190656, \"acRate\": \"59.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"799","questionFrontendId":"783","title":"Minimum Distance Between BST Nodes","titleSlug":"minimum-distance-between-bst-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"209.6K\", \"totalSubmission\": \"353.5K\", \"totalAcceptedRaw\": 209595, \"totalSubmissionRaw\": 353523, \"acRate\": \"59.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"801","questionFrontendId":"785","title":"Is Graph Bipartite?","titleSlug":"is-graph-bipartite","translatedTitle":null,"stats":"{\"totalAccepted\": \"390.5K\", \"totalSubmission\": \"736.1K\", \"totalAcceptedRaw\": 390517, \"totalSubmissionRaw\": 736101, \"acRate\": \"53.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"803","questionFrontendId":"787","title":"Cheapest Flights Within K Stops","titleSlug":"cheapest-flights-within-k-stops","translatedTitle":null,"stats":"{\"totalAccepted\": \"358.5K\", \"totalSubmission\": \"968.5K\", \"totalAcceptedRaw\": 358489, \"totalSubmissionRaw\": 968482, \"acRate\": \"37.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"813","questionFrontendId":"797","title":"All Paths From Source to Target","titleSlug":"all-paths-from-source-to-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"425.3K\", \"totalSubmission\": \"517K\", \"totalAcceptedRaw\": 425277, \"totalSubmissionRaw\": 517003, \"acRate\": \"82.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"820","questionFrontendId":"802","title":"Find Eventual Safe States","titleSlug":"find-eventual-safe-states","translatedTitle":null,"stats":"{\"totalAccepted\": \"118.6K\", \"totalSubmission\": \"210.2K\", \"totalAcceptedRaw\": 118561, \"totalSubmissionRaw\": 210193, \"acRate\": \"56.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"832","questionFrontendId":"814","title":"Binary Tree Pruning","titleSlug":"binary-tree-pruning","translatedTitle":null,"stats":"{\"totalAccepted\": \"223.1K\", \"totalSubmission\": \"308.1K\", \"totalAcceptedRaw\": 223095, \"totalSubmissionRaw\": 308113, \"acRate\": \"72.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"854","questionFrontendId":"827","title":"Making A Large Island","titleSlug":"making-a-large-island","translatedTitle":null,"stats":"{\"totalAccepted\": \"127.6K\", \"totalSubmission\": \"284.4K\", \"totalAcceptedRaw\": 127622, \"totalSubmissionRaw\": 284388, \"acRate\": \"44.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"863","questionFrontendId":"834","title":"Sum of Distances in Tree","titleSlug":"sum-of-distances-in-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"80.5K\", \"totalSubmission\": \"135.8K\", \"totalAcceptedRaw\": 80481, \"totalSubmissionRaw\": 135803, \"acRate\": \"59.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"869","questionFrontendId":"839","title":"Similar String Groups","titleSlug":"similar-string-groups","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.9K\", \"totalSubmission\": \"133.2K\", \"totalAcceptedRaw\": 63879, \"totalSubmissionRaw\": 133184, \"acRate\": \"48.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"871","questionFrontendId":"841","title":"Keys and Rooms","titleSlug":"keys-and-rooms","translatedTitle":null,"stats":"{\"totalAccepted\": \"311.3K\", \"totalSubmission\": \"435.5K\", \"totalAcceptedRaw\": 311304, \"totalSubmissionRaw\": 435511, \"acRate\": \"71.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"881","questionFrontendId":"851","title":"Loud and Rich","titleSlug":"loud-and-rich","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.4K\", \"totalSubmission\": \"55.5K\", \"totalAcceptedRaw\": 32382, \"totalSubmissionRaw\": 55452, \"acRate\": \"58.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"893","questionFrontendId":"863","title":"All Nodes Distance K in Binary Tree","titleSlug":"all-nodes-distance-k-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"296.6K\", \"totalSubmission\": \"476.4K\", \"totalAcceptedRaw\": 296573, \"totalSubmissionRaw\": 476355, \"acRate\": \"62.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"896","questionFrontendId":"865","title":"Smallest Subtree with all the Deepest Nodes","titleSlug":"smallest-subtree-with-all-the-deepest-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"115.3K\", \"totalSubmission\": \"167.4K\", \"totalAcceptedRaw\": 115329, \"totalSubmissionRaw\": 167361, \"acRate\": \"68.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"904","questionFrontendId":"872","title":"Leaf-Similar Trees","titleSlug":"leaf-similar-trees","translatedTitle":null,"stats":"{\"totalAccepted\": \"250.5K\", \"totalSubmission\": \"370.5K\", \"totalAcceptedRaw\": 250470, \"totalSubmissionRaw\": 370459, \"acRate\": \"67.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"922","questionFrontendId":"886","title":"Possible Bipartition","titleSlug":"possible-bipartition","translatedTitle":null,"stats":"{\"totalAccepted\": \"178.7K\", \"totalSubmission\": \"357.5K\", \"totalAcceptedRaw\": 178691, \"totalSubmissionRaw\": 357474, \"acRate\": \"50.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"933","questionFrontendId":"897","title":"Increasing Order Search Tree","titleSlug":"increasing-order-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"244.5K\", \"totalSubmission\": \"311.6K\", \"totalAcceptedRaw\": 244474, \"totalSubmissionRaw\": 311624, \"acRate\": \"78.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"960","questionFrontendId":"924","title":"Minimize Malware Spread","titleSlug":"minimize-malware-spread","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.8K\", \"totalSubmission\": \"101.8K\", \"totalAcceptedRaw\": 42842, \"totalSubmissionRaw\": 101803, \"acRate\": \"42.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"964","questionFrontendId":"928","title":"Minimize Malware Spread II","titleSlug":"minimize-malware-spread-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"42.5K\", \"totalAcceptedRaw\": 18155, \"totalSubmissionRaw\": 42506, \"acRate\": \"42.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"971","questionFrontendId":"934","title":"Shortest Bridge","titleSlug":"shortest-bridge","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.2K\", \"totalSubmission\": \"228.6K\", \"totalAcceptedRaw\": 124184, \"totalSubmissionRaw\": 228584, \"acRate\": \"54.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"975","questionFrontendId":"938","title":"Range Sum of BST","titleSlug":"range-sum-of-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"771K\", \"totalSubmission\": \"897.7K\", \"totalAcceptedRaw\": 771015, \"totalSubmissionRaw\": 897745, \"acRate\": \"85.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"984","questionFrontendId":"947","title":"Most Stones Removed with Same Row or Column","titleSlug":"most-stones-removed-with-same-row-or-column","translatedTitle":null,"stats":"{\"totalAccepted\": \"172.2K\", \"totalSubmission\": \"292.4K\", \"totalAcceptedRaw\": 172193, \"totalSubmissionRaw\": 292418, \"acRate\": \"58.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"988","questionFrontendId":"951","title":"Flip Equivalent Binary Trees","titleSlug":"flip-equivalent-binary-trees","translatedTitle":null,"stats":"{\"totalAccepted\": \"127.7K\", \"totalSubmission\": \"191.2K\", \"totalAcceptedRaw\": 127706, \"totalSubmissionRaw\": 191171, \"acRate\": \"66.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"999","questionFrontendId":"959","title":"Regions Cut By Slashes","titleSlug":"regions-cut-by-slashes","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.7K\", \"totalSubmission\": \"64.6K\", \"totalAcceptedRaw\": 44715, \"totalSubmissionRaw\": 64634, \"acRate\": \"69.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1005","questionFrontendId":"965","title":"Univalued Binary Tree","titleSlug":"univalued-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"188K\", \"totalSubmission\": \"270K\", \"totalAcceptedRaw\": 188013, \"totalSubmissionRaw\": 270014, \"acRate\": \"69.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1008","questionFrontendId":"968","title":"Binary Tree Cameras","titleSlug":"binary-tree-cameras","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.1K\", \"totalSubmission\": \"255.1K\", \"totalAcceptedRaw\": 119075, \"totalSubmissionRaw\": 255092, \"acRate\": \"46.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1011","questionFrontendId":"971","title":"Flip Binary Tree To Match Preorder Traversal","titleSlug":"flip-binary-tree-to-match-preorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.3K\", \"totalSubmission\": \"76.5K\", \"totalAcceptedRaw\": 38327, \"totalSubmissionRaw\": 76547, \"acRate\": \"50.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1021","questionFrontendId":"979","title":"Distribute Coins in Binary Tree","titleSlug":"distribute-coins-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"100.5K\", \"totalSubmission\": \"139.2K\", \"totalAcceptedRaw\": 100475, \"totalSubmissionRaw\": 139166, \"acRate\": \"72.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1029","questionFrontendId":"987","title":"Vertical Order Traversal of a Binary Tree","titleSlug":"vertical-order-traversal-of-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"324.9K\", \"totalSubmission\": \"721.4K\", \"totalAcceptedRaw\": 324853, \"totalSubmissionRaw\": 721357, \"acRate\": \"45.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1030","questionFrontendId":"988","title":"Smallest String Starting From Leaf","titleSlug":"smallest-string-starting-from-leaf","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.6K\", \"totalSubmission\": \"130.7K\", \"totalAcceptedRaw\": 65584, \"totalSubmissionRaw\": 130696, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1035","questionFrontendId":"993","title":"Cousins in Binary Tree","titleSlug":"cousins-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"238.6K\", \"totalSubmission\": \"437K\", \"totalAcceptedRaw\": 238567, \"totalSubmissionRaw\": 437039, \"acRate\": \"54.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1073","questionFrontendId":"1020","title":"Number of Enclaves","titleSlug":"number-of-enclaves","translatedTitle":null,"stats":"{\"totalAccepted\": \"96.3K\", \"totalSubmission\": \"147K\", \"totalAcceptedRaw\": 96281, \"totalSubmissionRaw\": 147013, \"acRate\": \"65.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1079","questionFrontendId":"1022","title":"Sum of Root To Leaf Binary Numbers","titleSlug":"sum-of-root-to-leaf-binary-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"186K\", \"totalSubmission\": \"252.8K\", \"totalAcceptedRaw\": 186024, \"totalSubmissionRaw\": 252803, \"acRate\": \"73.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1091","questionFrontendId":"1120","title":"Maximum Average Subtree","titleSlug":"maximum-average-subtree","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.9K\", \"totalSubmission\": \"89.9K\", \"totalAcceptedRaw\": 58935, \"totalSubmissionRaw\": 89896, \"acRate\": \"65.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1092","questionFrontendId":"1026","title":"Maximum Difference Between Node and Ancestor","titleSlug":"maximum-difference-between-node-and-ancestor","translatedTitle":null,"stats":"{\"totalAccepted\": \"200.7K\", \"totalSubmission\": \"265K\", \"totalAcceptedRaw\": 200740, \"totalSubmissionRaw\": 265007, \"acRate\": \"75.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1093","questionFrontendId":"1028","title":"Recover a Tree From Preorder Traversal","titleSlug":"recover-a-tree-from-preorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"41.8K\", \"totalSubmission\": \"57K\", \"totalAcceptedRaw\": 41771, \"totalSubmissionRaw\": 57034, \"acRate\": \"73.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1099","questionFrontendId":"1102","title":"Path With Maximum Minimum Value","titleSlug":"path-with-maximum-minimum-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"56.1K\", \"totalSubmission\": \"105.3K\", \"totalAcceptedRaw\": 56109, \"totalSubmissionRaw\": 105287, \"acRate\": \"53.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1104","questionFrontendId":"1034","title":"Coloring A Border","titleSlug":"coloring-a-border","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.9K\", \"totalSubmission\": \"58.8K\", \"totalAcceptedRaw\": 28910, \"totalSubmissionRaw\": 58810, \"acRate\": \"49.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1106","questionFrontendId":"1036","title":"Escape a Large Maze","titleSlug":"escape-a-large-maze","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"52.5K\", \"totalAcceptedRaw\": 17925, \"totalSubmissionRaw\": 52548, \"acRate\": \"34.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1114","questionFrontendId":"1038","title":"Binary Search Tree to Greater Sum Tree","titleSlug":"binary-search-tree-to-greater-sum-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"147.3K\", \"totalSubmission\": \"172.3K\", \"totalAcceptedRaw\": 147316, \"totalSubmissionRaw\": 172257, \"acRate\": \"85.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1116","questionFrontendId":"1161","title":"Maximum Level Sum of a Binary Tree","titleSlug":"maximum-level-sum-of-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"125K\", \"totalSubmission\": \"189.6K\", \"totalAcceptedRaw\": 125050, \"totalSubmissionRaw\": 189556, \"acRate\": \"66.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1120","questionFrontendId":"1042","title":"Flower Planting With No Adjacent","titleSlug":"flower-planting-with-no-adjacent","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.4K\", \"totalSubmission\": \"129.4K\", \"totalAcceptedRaw\": 65427, \"totalSubmissionRaw\": 129373, \"acRate\": \"50.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1150","questionFrontendId":"1214","title":"Two Sum BSTs","titleSlug":"two-sum-bsts","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.8K\", \"totalSubmission\": \"58.8K\", \"totalAcceptedRaw\": 38839, \"totalSubmissionRaw\": 58760, \"acRate\": \"66.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1157","questionFrontendId":"1080","title":"Insufficient Nodes in Root to Leaf Paths","titleSlug":"insufficient-nodes-in-root-to-leaf-paths","translatedTitle":null,"stats":"{\"totalAccepted\": \"31K\", \"totalSubmission\": \"57.9K\", \"totalAcceptedRaw\": 30953, \"totalSubmissionRaw\": 57919, \"acRate\": \"53.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1177","questionFrontendId":"1245","title":"Tree Diameter","titleSlug":"tree-diameter","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.1K\", \"totalSubmission\": \"48.9K\", \"totalAcceptedRaw\": 30079, \"totalSubmissionRaw\": 48889, \"acRate\": \"61.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1190","questionFrontendId":"1257","title":"Smallest Common Region","titleSlug":"smallest-common-region","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.5K\", \"totalSubmission\": \"30.3K\", \"totalAcceptedRaw\": 19481, \"totalSubmissionRaw\": 30285, \"acRate\": \"64.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1201","questionFrontendId":"1273","title":"Delete Tree Nodes","titleSlug":"delete-tree-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.3K\", \"totalSubmission\": \"15.3K\", \"totalAcceptedRaw\": 9347, \"totalSubmissionRaw\": 15310, \"acRate\": \"61.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1207","questionFrontendId":"1110","title":"Delete Nodes And Return Forest","titleSlug":"delete-nodes-and-return-forest","translatedTitle":null,"stats":"{\"totalAccepted\": \"179.1K\", \"totalSubmission\": \"258.5K\", \"totalAcceptedRaw\": 179088, \"totalSubmissionRaw\": 258478, \"acRate\": \"69.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1218","questionFrontendId":"1123","title":"Lowest Common Ancestor of Deepest Leaves","titleSlug":"lowest-common-ancestor-of-deepest-leaves","translatedTitle":null,"stats":"{\"totalAccepted\": \"89.4K\", \"totalSubmission\": \"126.1K\", \"totalAcceptedRaw\": 89406, \"totalSubmissionRaw\": 126096, \"acRate\": \"70.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1243","questionFrontendId":"1315","title":"Sum of Nodes with Even-Valued Grandparent","titleSlug":"sum-of-nodes-with-even-valued-grandparent","translatedTitle":null,"stats":"{\"totalAccepted\": \"125.9K\", \"totalSubmission\": \"147.3K\", \"totalAcceptedRaw\": 125912, \"totalSubmissionRaw\": 147306, \"acRate\": \"85.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1248","questionFrontendId":"1145","title":"Binary Tree Coloring Game","titleSlug":"binary-tree-coloring-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.6K\", \"totalSubmission\": \"78.5K\", \"totalAcceptedRaw\": 40586, \"totalSubmissionRaw\": 78513, \"acRate\": \"51.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1254","questionFrontendId":"1302","title":"Deepest Leaves Sum","titleSlug":"deepest-leaves-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"267.8K\", \"totalSubmission\": \"309K\", \"totalAcceptedRaw\": 267793, \"totalSubmissionRaw\": 308959, \"acRate\": \"86.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1271","questionFrontendId":"1236","title":"Web Crawler","titleSlug":"web-crawler","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.8K\", \"totalSubmission\": \"44.9K\", \"totalAcceptedRaw\": 29825, \"totalSubmissionRaw\": 44866, \"acRate\": \"66.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1275","questionFrontendId":"1361","title":"Validate Binary Tree Nodes","titleSlug":"validate-binary-tree-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.3K\", \"totalSubmission\": \"106.1K\", \"totalAcceptedRaw\": 42324, \"totalSubmissionRaw\": 106126, \"acRate\": \"39.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1285","questionFrontendId":"1382","title":"Balance a Binary Search Tree","titleSlug":"balance-a-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"115K\", \"totalSubmission\": \"142.5K\", \"totalAcceptedRaw\": 115045, \"totalSubmissionRaw\": 142542, \"acRate\": \"80.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1296","questionFrontendId":"1483","title":"Kth Ancestor of a Tree Node","titleSlug":"kth-ancestor-of-a-tree-node","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.4K\", \"totalSubmission\": \"78.3K\", \"totalAcceptedRaw\": 26449, \"totalSubmissionRaw\": 78345, \"acRate\": \"33.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1300","questionFrontendId":"1192","title":"Critical Connections in a Network","titleSlug":"critical-connections-in-a-network","translatedTitle":null,"stats":"{\"totalAccepted\": \"194.5K\", \"totalSubmission\": \"356K\", \"totalAcceptedRaw\": 194462, \"totalSubmissionRaw\": 356028, \"acRate\": \"54.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Biconnected Component","translatedName":null,"slug":"biconnected-component","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1308","questionFrontendId":"1202","title":"Smallest String With Swaps","titleSlug":"smallest-string-with-swaps","translatedTitle":null,"stats":"{\"totalAccepted\": \"96.9K\", \"totalSubmission\": \"168.2K\", \"totalAcceptedRaw\": 96903, \"totalSubmissionRaw\": 168244, \"acRate\": \"57.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1309","questionFrontendId":"1203","title":"Sort Items by Groups Respecting Dependencies","titleSlug":"sort-items-by-groups-respecting-dependencies","translatedTitle":null,"stats":"{\"totalAccepted\": \"15K\", \"totalSubmission\": \"29.4K\", \"totalAcceptedRaw\": 15013, \"totalSubmissionRaw\": 29356, \"acRate\": \"51.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1324","questionFrontendId":"1706","title":"Where Will the Ball Fall","titleSlug":"where-will-the-ball-fall","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.7K\", \"totalSubmission\": \"174.4K\", \"totalAcceptedRaw\": 124660, \"totalSubmissionRaw\": 174408, \"acRate\": \"71.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1347","questionFrontendId":"2204","title":"Distance to a Cycle in Undirected Graph","titleSlug":"distance-to-a-cycle-in-undirected-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"2K\", \"totalSubmission\": \"2.8K\", \"totalAcceptedRaw\": 1995, \"totalSubmissionRaw\": 2838, \"acRate\": \"70.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1380","questionFrontendId":"1254","title":"Number of Closed Islands","titleSlug":"number-of-closed-islands","translatedTitle":null,"stats":"{\"totalAccepted\": \"127.9K\", \"totalSubmission\": \"199.5K\", \"totalAcceptedRaw\": 127871, \"totalSubmissionRaw\": 199502, \"acRate\": \"64.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1387","questionFrontendId":"1261","title":"Find Elements in a Contaminated Binary Tree","titleSlug":"find-elements-in-a-contaminated-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"54.3K\", \"totalSubmission\": \"71.1K\", \"totalAcceptedRaw\": 54310, \"totalSubmissionRaw\": 71144, \"acRate\": \"76.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1396","questionFrontendId":"1267","title":"Count Servers that Communicate","titleSlug":"count-servers-that-communicate","translatedTitle":null,"stats":"{\"totalAccepted\": \"50.8K\", \"totalSubmission\": \"85.5K\", \"totalAcceptedRaw\": 50795, \"totalSubmissionRaw\": 85462, \"acRate\": \"59.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1427","questionFrontendId":"1305","title":"All Elements in Two Binary Search Trees","titleSlug":"all-elements-in-two-binary-search-trees","translatedTitle":null,"stats":"{\"totalAccepted\": \"186.3K\", \"totalSubmission\": \"233.3K\", \"totalAcceptedRaw\": 186260, \"totalSubmissionRaw\": 233326, \"acRate\": \"79.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1428","questionFrontendId":"1306","title":"Jump Game III","titleSlug":"jump-game-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"184.6K\", \"totalSubmission\": \"290.9K\", \"totalAcceptedRaw\": 184607, \"totalSubmissionRaw\": 290866, \"acRate\": \"63.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1431","questionFrontendId":"2192","title":"All Ancestors of a Node in a Directed Acyclic Graph","titleSlug":"all-ancestors-of-a-node-in-a-directed-acyclic-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.7K\", \"totalSubmission\": \"44.9K\", \"totalAcceptedRaw\": 22740, \"totalSubmissionRaw\": 44890, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1432","questionFrontendId":"1430","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.5K\", \"totalSubmission\": \"91.5K\", \"totalAcceptedRaw\": 42452, \"totalSubmissionRaw\": 91550, \"acRate\": \"46.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1442","questionFrontendId":"1319","title":"Number of Operations to Make Network Connected","titleSlug":"number-of-operations-to-make-network-connected","translatedTitle":null,"stats":"{\"totalAccepted\": \"115.7K\", \"totalSubmission\": \"196.5K\", \"totalAcceptedRaw\": 115725, \"totalSubmissionRaw\": 196520, \"acRate\": \"58.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1450","questionFrontendId":"1325","title":"Delete Leaves With a Given Value","titleSlug":"delete-leaves-with-a-given-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"85.4K\", \"totalSubmission\": \"114.3K\", \"totalAcceptedRaw\": 85413, \"totalSubmissionRaw\": 114336, \"acRate\": \"74.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1465","questionFrontendId":"1339","title":"Maximum Product of Splitted Binary Tree","titleSlug":"maximum-product-of-splitted-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"113K\", \"totalSubmission\": \"236.4K\", \"totalAcceptedRaw\": 113015, \"totalSubmissionRaw\": 236363, \"acRate\": \"47.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1474","questionFrontendId":"1372","title":"Longest ZigZag Path in a Binary Tree","titleSlug":"longest-zigzag-path-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.7K\", \"totalSubmission\": \"75.9K\", \"totalAcceptedRaw\": 45666, \"totalSubmissionRaw\": 75875, \"acRate\": \"60.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1475","questionFrontendId":"1373","title":"Maximum Sum BST in Binary Tree","titleSlug":"maximum-sum-bst-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.9K\", \"totalSubmission\": \"124.1K\", \"totalAcceptedRaw\": 48929, \"totalSubmissionRaw\": 124062, \"acRate\": \"39.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1484","questionFrontendId":"1367","title":"Linked List in Binary Tree","titleSlug":"linked-list-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.9K\", \"totalSubmission\": \"146.3K\", \"totalAcceptedRaw\": 63913, \"totalSubmissionRaw\": 146330, \"acRate\": \"43.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1492","questionFrontendId":"1376","title":"Time Needed to Inform All Employees","titleSlug":"time-needed-to-inform-all-employees","translatedTitle":null,"stats":"{\"totalAccepted\": \"128K\", \"totalSubmission\": \"219.4K\", \"totalAcceptedRaw\": 127955, \"totalSubmissionRaw\": 219404, \"acRate\": \"58.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1493","questionFrontendId":"1377","title":"Frog Position After T Seconds","titleSlug":"frog-position-after-t-seconds","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"67.7K\", \"totalAcceptedRaw\": 24199, \"totalSubmissionRaw\": 67665, \"acRate\": \"35.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1498","questionFrontendId":"1379","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"187.2K\", \"totalSubmission\": \"215.8K\", \"totalAcceptedRaw\": 187180, \"totalSubmissionRaw\": 215833, \"acRate\": \"86.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1507","questionFrontendId":"1391","title":"Check if There is a Valid Path in a Grid","titleSlug":"check-if-there-is-a-valid-path-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"51.1K\", \"totalAcceptedRaw\": 24159, \"totalSubmissionRaw\": 51128, \"acRate\": \"47.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1544","questionFrontendId":"1448","title":"Count Good Nodes in Binary Tree","titleSlug":"count-good-nodes-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"308.1K\", \"totalSubmission\": \"414.5K\", \"totalAcceptedRaw\": 308098, \"totalSubmissionRaw\": 414510, \"acRate\": \"74.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1554","questionFrontendId":"1443","title":"Minimum Time to Collect All Apples in a Tree","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"97.9K\", \"totalSubmission\": \"156K\", \"totalAcceptedRaw\": 97888, \"totalSubmissionRaw\": 155957, \"acRate\": \"62.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1558","questionFrontendId":"1462","title":"Course Schedule IV","titleSlug":"course-schedule-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"41.6K\", \"totalSubmission\": \"85K\", \"totalAcceptedRaw\": 41639, \"totalSubmissionRaw\": 85014, \"acRate\": \"49.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1568","questionFrontendId":"1457","title":"Pseudo-Palindromic Paths in a Binary Tree","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"113.3K\", \"totalSubmission\": \"167K\", \"totalAcceptedRaw\": 113277, \"totalSubmissionRaw\": 166963, \"acRate\": \"67.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1576","questionFrontendId":"1466","title":"Reorder Routes to Make All Paths Lead to the City Zero","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"74.8K\", \"totalSubmission\": \"121.3K\", \"totalAcceptedRaw\": 74842, \"totalSubmissionRaw\": 121332, \"acRate\": \"61.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1609","questionFrontendId":"1469","title":"Find All The Lonely Nodes","titleSlug":"find-all-the-lonely-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.2K\", \"totalSubmission\": \"52.5K\", \"totalAcceptedRaw\": 43154, \"totalSubmissionRaw\": 52539, \"acRate\": \"82.1%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1624","questionFrontendId":"1485","title":"Clone Binary Tree With Random Pointer","titleSlug":"clone-binary-tree-with-random-pointer","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.9K\", \"totalSubmission\": \"26.3K\", \"totalAcceptedRaw\": 20921, \"totalSubmissionRaw\": 26255, \"acRate\": \"79.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1634","questionFrontendId":"1490","title":"Clone N-ary Tree","titleSlug":"clone-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.7K\", \"totalSubmission\": \"29.6K\", \"totalAcceptedRaw\": 24675, \"totalSubmissionRaw\": 29562, \"acRate\": \"83.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1643","questionFrontendId":"1519","title":"Number of Nodes in the Sub-Tree With the Same Label","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label","translatedTitle":null,"stats":"{\"totalAccepted\": \"77.8K\", \"totalSubmission\": \"140.6K\", \"totalAcceptedRaw\": 77781, \"totalSubmissionRaw\": 140616, \"acRate\": \"55.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1650","questionFrontendId":"1506","title":"Find Root of N-Ary Tree","titleSlug":"find-root-of-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"29K\", \"totalSubmission\": \"36.9K\", \"totalAcceptedRaw\": 28988, \"totalSubmissionRaw\": 36911, \"acRate\": \"78.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1653","questionFrontendId":"1530","title":"Number of Good Leaf Nodes Pairs","titleSlug":"number-of-good-leaf-nodes-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"34K\", \"totalSubmission\": \"55.7K\", \"totalAcceptedRaw\": 33987, \"totalSubmissionRaw\": 55652, \"acRate\": \"61.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1655","questionFrontendId":"1516","title":"Move Sub-Tree of N-Ary Tree","titleSlug":"move-sub-tree-of-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"2K\", \"totalSubmission\": \"3.2K\", \"totalAcceptedRaw\": 2000, \"totalSubmissionRaw\": 3155, \"acRate\": \"63.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1663","questionFrontendId":"1559","title":"Detect Cycles in 2D Grid","titleSlug":"detect-cycles-in-2d-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.9K\", \"totalSubmission\": \"66.6K\", \"totalAcceptedRaw\": 31944, \"totalSubmissionRaw\": 66595, \"acRate\": \"48.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1665","questionFrontendId":"1522","title":"Diameter of N-Ary Tree","titleSlug":"diameter-of-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.8K\", \"totalSubmission\": \"51.4K\", \"totalAcceptedRaw\": 37787, \"totalSubmissionRaw\": 51414, \"acRate\": \"73.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1691","questionFrontendId":"1568","title":"Minimum Number of Days to Disconnect Island","titleSlug":"minimum-number-of-days-to-disconnect-island","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"22.8K\", \"totalAcceptedRaw\": 10619, \"totalSubmissionRaw\": 22816, \"acRate\": \"46.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Strongly Connected Component","translatedName":null,"slug":"strongly-connected-component","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1722","questionFrontendId":"1600","title":"Throne Inheritance","titleSlug":"throne-inheritance","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.7K\", \"totalSubmission\": \"21.5K\", \"totalAcceptedRaw\": 13679, \"totalSubmissionRaw\": 21521, \"acRate\": \"63.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1750","questionFrontendId":"1612","title":"Check If Two Expression Trees are Equivalent","titleSlug":"check-if-two-expression-trees-are-equivalent","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.2K\", \"totalSubmission\": \"8.8K\", \"totalAcceptedRaw\": 6189, \"totalSubmissionRaw\": 8810, \"acRate\": \"70.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1753","questionFrontendId":"1631","title":"Path With Minimum Effort","titleSlug":"path-with-minimum-effort","translatedTitle":null,"stats":"{\"totalAccepted\": \"140.9K\", \"totalSubmission\": \"253.4K\", \"totalAcceptedRaw\": 140915, \"totalSubmissionRaw\": 253403, \"acRate\": \"55.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1780","questionFrontendId":"1644","title":"Lowest Common Ancestor of a Binary Tree II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"56.5K\", \"totalSubmission\": \"94.2K\", \"totalAcceptedRaw\": 56460, \"totalSubmissionRaw\": 94230, \"acRate\": \"59.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1796","questionFrontendId":"1660","title":"Correct a Binary Tree","titleSlug":"correct-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"19.1K\", \"totalAcceptedRaw\": 13830, \"totalSubmissionRaw\": 19071, \"acRate\": \"72.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1810","questionFrontendId":"1666","title":"Change the Root of a Binary Tree","titleSlug":"change-the-root-of-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"4.5K\", \"totalAcceptedRaw\": 3314, \"totalSubmissionRaw\": 4535, \"acRate\": \"73.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1816","questionFrontendId":"1676","title":"Lowest Common Ancestor of a Binary Tree IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.3K\", \"totalSubmission\": \"35.6K\", \"totalAcceptedRaw\": 28293, \"totalSubmissionRaw\": 35601, \"acRate\": \"79.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1840","questionFrontendId":"1722","title":"Minimize Hamming Distance After Swap Operations","titleSlug":"minimize-hamming-distance-after-swap-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.1K\", \"totalSubmission\": \"30.9K\", \"totalAcceptedRaw\": 15076, \"totalSubmissionRaw\": 30949, \"acRate\": \"48.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1875","questionFrontendId":"1766","title":"Tree of Coprimes","titleSlug":"tree-of-coprimes","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.3K\", \"totalSubmission\": \"18.5K\", \"totalAcceptedRaw\": 7275, \"totalSubmissionRaw\": 18502, \"acRate\": \"39.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1883","questionFrontendId":"1740","title":"Find Distance in a Binary Tree","titleSlug":"find-distance-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"18K\", \"totalSubmission\": \"26.1K\", \"totalAcceptedRaw\": 18041, \"totalSubmissionRaw\": 26093, \"acRate\": \"69.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1931","questionFrontendId":"1778","title":"Shortest Path in a Hidden Grid","titleSlug":"shortest-path-in-a-hidden-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"11.8K\", \"totalAcceptedRaw\": 4605, \"totalSubmissionRaw\": 11769, \"acRate\": \"39.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1959","questionFrontendId":"1810","title":"Minimum Path Cost in a Hidden Grid","titleSlug":"minimum-path-cost-in-a-hidden-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.3K\", \"totalSubmission\": \"4.3K\", \"totalAcceptedRaw\": 2333, \"totalSubmissionRaw\": 4277, \"acRate\": \"54.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2009","questionFrontendId":"1858","title":"Longest Word With All Prefixes","titleSlug":"longest-word-with-all-prefixes","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.8K\", \"totalSubmission\": \"8.7K\", \"totalAcceptedRaw\": 5835, \"totalSubmissionRaw\": 8699, \"acRate\": \"67.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2035","questionFrontendId":"1905","title":"Count Sub Islands","titleSlug":"count-sub-islands","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.8K\", \"totalSubmission\": \"94.3K\", \"totalAcceptedRaw\": 63770, \"totalSubmissionRaw\": 94306, \"acRate\": \"67.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2060","questionFrontendId":"1932","title":"Merge BSTs to Create Single BST","titleSlug":"merge-bsts-to-create-single-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"17.7K\", \"totalAcceptedRaw\": 6305, \"totalSubmissionRaw\": 17747, \"acRate\": \"35.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2065","questionFrontendId":"2307","title":"Check for Contradictions in Equations","titleSlug":"check-for-contradictions-in-equations","translatedTitle":null,"stats":"{\"totalAccepted\": \"848\", \"totalSubmission\": \"1.9K\", \"totalAcceptedRaw\": 848, \"totalSubmissionRaw\": 1941, \"acRate\": \"43.7%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2101","questionFrontendId":"1970","title":"Last Day Where You Can Still Cross","titleSlug":"last-day-where-you-can-still-cross","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.4K\", \"totalSubmission\": \"23K\", \"totalAcceptedRaw\": 11403, \"totalSubmissionRaw\": 22978, \"acRate\": \"49.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2103","questionFrontendId":"1992","title":"Find All Groups of Farmland","titleSlug":"find-all-groups-of-farmland","translatedTitle":null,"stats":"{\"totalAccepted\": \"21K\", \"totalSubmission\": \"30.6K\", \"totalAcceptedRaw\": 21032, \"totalSubmissionRaw\": 30623, \"acRate\": \"68.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2104","questionFrontendId":"1993","title":"Operations on Tree","titleSlug":"operations-on-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.2K\", \"totalSubmission\": \"23.2K\", \"totalAcceptedRaw\": 10242, \"totalSubmissionRaw\": 23237, \"acRate\": \"44.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2121","questionFrontendId":"1971","title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"222.4K\", \"totalSubmission\": \"426.6K\", \"totalAcceptedRaw\": 222365, \"totalSubmissionRaw\": 426631, \"acRate\": \"52.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2126","questionFrontendId":"1973","title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.6K\", \"totalSubmission\": \"10.2K\", \"totalAcceptedRaw\": 7645, \"totalSubmissionRaw\": 10173, \"acRate\": \"75.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2131","questionFrontendId":"2003","title":"Smallest Missing Genetic Value in Each Subtree","titleSlug":"smallest-missing-genetic-value-in-each-subtree","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.4K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 6435, \"totalSubmissionRaw\": 14412, \"acRate\": \"44.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2175","questionFrontendId":"2049","title":"Count Nodes With the Highest Score","titleSlug":"count-nodes-with-the-highest-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.1K\", \"totalSubmission\": \"33.9K\", \"totalAcceptedRaw\": 16121, \"totalSubmissionRaw\": 33853, \"acRate\": \"47.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2201","questionFrontendId":"2097","title":"Valid Arrangement of Pairs","titleSlug":"valid-arrangement-of-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"7K\", \"totalSubmission\": \"16.9K\", \"totalAcceptedRaw\": 6968, \"totalSubmissionRaw\": 16905, \"acRate\": \"41.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Eulerian Circuit","translatedName":null,"slug":"eulerian-circuit","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2206","questionFrontendId":"2101","title":"Detonate the Maximum Bombs","titleSlug":"detonate-the-maximum-bombs","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.4K\", \"totalSubmission\": \"67.7K\", \"totalAcceptedRaw\": 28437, \"totalSubmissionRaw\": 67665, \"acRate\": \"42.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2213","questionFrontendId":"2092","title":"Find All People With Secret","titleSlug":"find-all-people-with-secret","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.4K\", \"totalSubmission\": \"59.7K\", \"totalAcceptedRaw\": 20415, \"totalSubmissionRaw\": 59709, \"acRate\": \"34.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2217","questionFrontendId":"2096","title":"Step-By-Step Directions From a Binary Tree Node to Another","titleSlug":"step-by-step-directions-from-a-binary-tree-node-to-another","translatedTitle":null,"stats":"{\"totalAccepted\": \"79.5K\", \"totalSubmission\": \"164.1K\", \"totalAcceptedRaw\": 79514, \"totalSubmissionRaw\": 164104, \"acRate\": \"48.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2246","questionFrontendId":"2127","title":"Maximum Employees to Be Invited to a Meeting","titleSlug":"maximum-employees-to-be-invited-to-a-meeting","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.2K\", \"totalSubmission\": \"23.8K\", \"totalAcceptedRaw\": 8239, \"totalSubmissionRaw\": 23833, \"acRate\": \"34.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2306","questionFrontendId":"2196","title":"Create Binary Tree From Descriptions","titleSlug":"create-binary-tree-from-descriptions","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.7K\", \"totalSubmission\": \"35.5K\", \"totalAcceptedRaw\": 25701, \"totalSubmissionRaw\": 35531, \"acRate\": \"72.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2347","questionFrontendId":"2265","title":"Count Nodes Equal to Average of Subtree","titleSlug":"count-nodes-equal-to-average-of-subtree","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.6K\", \"totalSubmission\": \"44.1K\", \"totalAcceptedRaw\": 37551, \"totalSubmissionRaw\": 44055, \"acRate\": \"85.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2364","questionFrontendId":"2246","title":"Longest Path With Different Adjacent Characters","titleSlug":"longest-path-with-different-adjacent-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.1K\", \"totalSubmission\": \"116.7K\", \"totalAcceptedRaw\": 65147, \"totalSubmissionRaw\": 116672, \"acRate\": \"55.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2399","questionFrontendId":"2313","title":"Minimum Flips in Binary Tree to Get Result","titleSlug":"minimum-flips-in-binary-tree-to-get-result","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1K\", \"totalSubmission\": \"1.7K\", \"totalAcceptedRaw\": 1056, \"totalSubmissionRaw\": 1661, \"acRate\": \"63.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2400","questionFrontendId":"2322","title":"Minimum Score After Removals on a Tree","titleSlug":"minimum-score-after-removals-on-a-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"10.6K\", \"totalAcceptedRaw\": 5358, \"totalSubmissionRaw\": 10554, \"acRate\": \"50.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2403","questionFrontendId":"2316","title":"Count Unreachable Pairs of Nodes in an Undirected Graph","titleSlug":"count-unreachable-pairs-of-nodes-in-an-undirected-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.7K\", \"totalSubmission\": \"55.7K\", \"totalAcceptedRaw\": 21659, \"totalSubmissionRaw\": 55710, \"acRate\": \"38.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2409","questionFrontendId":"2328","title":"Number of Increasing Paths in a Grid","titleSlug":"number-of-increasing-paths-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.4K\", \"totalSubmission\": \"34.5K\", \"totalAcceptedRaw\": 16428, \"totalSubmissionRaw\": 34536, \"acRate\": \"47.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2416","questionFrontendId":"2331","title":"Evaluate Boolean Binary Tree","titleSlug":"evaluate-boolean-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.3K\", \"totalSubmission\": \"55.2K\", \"totalAcceptedRaw\": 43317, \"totalSubmissionRaw\": 55158, \"acRate\": \"78.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2420","questionFrontendId":"2277","title":"Closest Node to Path in Tree","titleSlug":"closest-node-to-path-in-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.5K\", \"totalSubmission\": \"3.9K\", \"totalAcceptedRaw\": 2466, \"totalSubmissionRaw\": 3868, \"acRate\": \"63.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2438","questionFrontendId":"2359","title":"Find Closest Node to Given Two Nodes","titleSlug":"find-closest-node-to-given-two-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"66.1K\", \"totalSubmission\": \"143.2K\", \"totalAcceptedRaw\": 66127, \"totalSubmissionRaw\": 143215, \"acRate\": \"46.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2439","questionFrontendId":"2360","title":"Longest Cycle in a Graph","titleSlug":"longest-cycle-in-a-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.6K\", \"totalSubmission\": \"45.2K\", \"totalAcceptedRaw\": 17584, \"totalSubmissionRaw\": 45186, \"acRate\": \"38.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2445","questionFrontendId":"2368","title":"Reachable Nodes With Restrictions","titleSlug":"reachable-nodes-with-restrictions","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.2K\", \"totalSubmission\": \"54K\", \"totalAcceptedRaw\": 31231, \"totalSubmissionRaw\": 54027, \"acRate\": \"57.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2461","questionFrontendId":"2385","title":"Amount of Time for Binary Tree to Be Infected","titleSlug":"amount-of-time-for-binary-tree-to-be-infected","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.9K\", \"totalSubmission\": \"40.5K\", \"totalAcceptedRaw\": 22943, \"totalSubmissionRaw\": 40503, \"acRate\": \"56.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2493","questionFrontendId":"2415","title":"Reverse Odd Levels of Binary Tree","titleSlug":"reverse-odd-levels-of-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.6K\", \"totalSubmission\": \"41.1K\", \"totalAcceptedRaw\": 31554, \"totalSubmissionRaw\": 41145, \"acRate\": \"76.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2517","questionFrontendId":"2378","title":"Choose Edges to Maximize Score in a Tree","titleSlug":"choose-edges-to-maximize-score-in-a-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"860\", \"totalSubmission\": \"1.4K\", \"totalAcceptedRaw\": 860, \"totalSubmissionRaw\": 1426, \"acRate\": \"60.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2531","questionFrontendId":"2440","title":"Create Components With Same Value","titleSlug":"create-components-with-same-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.2K\", \"totalSubmission\": \"7.6K\", \"totalAcceptedRaw\": 4167, \"totalSubmissionRaw\": 7629, \"acRate\": \"54.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2545","questionFrontendId":"2458","title":"Height of Binary Tree After Subtree Removal Queries","titleSlug":"height-of-binary-tree-after-subtree-removal-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.4K\", \"totalSubmission\": \"22.6K\", \"totalAcceptedRaw\": 8376, \"totalSubmissionRaw\": 22614, \"acRate\": \"37.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2564","questionFrontendId":"2467","title":"Most Profitable Path in a Tree","titleSlug":"most-profitable-path-in-a-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"14.3K\", \"totalAcceptedRaw\": 6893, \"totalSubmissionRaw\": 14272, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2567","questionFrontendId":"2476","title":"Closest Nodes Queries in a Binary Search Tree","titleSlug":"closest-nodes-queries-in-a-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.7K\", \"totalSubmission\": \"36.2K\", \"totalAcceptedRaw\": 14732, \"totalSubmissionRaw\": 36204, \"acRate\": \"40.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2568","questionFrontendId":"2477","title":"Minimum Fuel Cost to Report to the Capital","titleSlug":"minimum-fuel-cost-to-report-to-the-capital","translatedTitle":null,"stats":"{\"totalAccepted\": \"53.5K\", \"totalSubmission\": \"78.9K\", \"totalAcceptedRaw\": 53461, \"totalSubmissionRaw\": 78854, \"acRate\": \"67.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2582","questionFrontendId":"2492","title":"Minimum Score of a Path Between Two Cities","titleSlug":"minimum-score-of-a-path-between-two-cities","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.7K\", \"totalSubmission\": \"33.7K\", \"totalAcceptedRaw\": 15675, \"totalSubmissionRaw\": 33700, \"acRate\": \"46.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2584","questionFrontendId":"2445","title":"Number of Nodes With Value One","titleSlug":"number-of-nodes-with-value-one","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2K\", \"totalSubmission\": \"1.7K\", \"totalAcceptedRaw\": 1204, \"totalSubmissionRaw\": 1702, \"acRate\": \"70.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2623","questionFrontendId":"2479","title":"Maximum XOR of Two Non-Overlapping Subtrees","titleSlug":"maximum-xor-of-two-non-overlapping-subtrees","translatedTitle":null,"stats":"{\"totalAccepted\": \"360\", \"totalSubmission\": \"768\", \"totalAcceptedRaw\": 360, \"totalSubmissionRaw\": 768, \"acRate\": \"46.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2641","questionFrontendId":"2556","title":"Disconnect Path in a Binary Matrix by at Most One Flip","titleSlug":"disconnect-path-in-a-binary-matrix-by-at-most-one-flip","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.2K\", \"totalSubmission\": \"28.7K\", \"totalAcceptedRaw\": 8192, \"totalSubmissionRaw\": 28713, \"acRate\": \"28.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2652","questionFrontendId":"2581","title":"Count Number of Possible Root Nodes","titleSlug":"count-number-of-possible-root-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"3K\", \"totalSubmission\": \"6.4K\", \"totalAcceptedRaw\": 3010, \"totalSubmissionRaw\": 6358, \"acRate\": \"47.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1368","questionFrontendId":"1242","title":"Web Crawler Multithreaded","titleSlug":"web-crawler-multithreaded","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.9K\", \"totalSubmission\": \"83.7K\", \"totalAcceptedRaw\": 40937, \"totalSubmissionRaw\": 83663, \"acRate\": \"48.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Concurrency","translatedName":null,"slug":"concurrency","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/tmp/dynamic-programming-graphql.json b/tmp/dynamic-programming-graphql.json
new file mode 100644
index 000000000..bf529fa22
--- /dev/null
+++ b/tmp/dynamic-programming-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","questions":[{"status":null,"questionId":"5","questionFrontendId":"5","title":"Longest Palindromic Substring","titleSlug":"longest-palindromic-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.3M\", \"totalSubmission\": \"7.2M\", \"totalAcceptedRaw\": 2329929, \"totalSubmissionRaw\": 7191327, \"acRate\": \"32.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"10","questionFrontendId":"10","title":"Regular Expression Matching","titleSlug":"regular-expression-matching","translatedTitle":null,"stats":"{\"totalAccepted\": \"794.5K\", \"totalSubmission\": \"2.8M\", \"totalAcceptedRaw\": 794527, \"totalSubmissionRaw\": 2833902, \"acRate\": \"28.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"22","questionFrontendId":"22","title":"Generate Parentheses","titleSlug":"generate-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 1352114, \"totalSubmissionRaw\": 1866646, \"acRate\": \"72.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"32","questionFrontendId":"32","title":"Longest Valid Parentheses","titleSlug":"longest-valid-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"603.2K\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 603209, \"totalSubmissionRaw\": 1839027, \"acRate\": \"32.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"42","questionFrontendId":"42","title":"Trapping Rain Water","titleSlug":"trapping-rain-water","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5M\", \"totalSubmission\": \"2.5M\", \"totalAcceptedRaw\": 1475865, \"totalSubmissionRaw\": 2493706, \"acRate\": \"59.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"44","questionFrontendId":"44","title":"Wildcard Matching","titleSlug":"wildcard-matching","translatedTitle":null,"stats":"{\"totalAccepted\": \"460.3K\", \"totalSubmission\": \"1.7M\", \"totalAcceptedRaw\": 460278, \"totalSubmissionRaw\": 1709983, \"acRate\": \"26.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"45","questionFrontendId":"45","title":"Jump Game II","titleSlug":"jump-game-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"859.9K\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 859881, \"totalSubmissionRaw\": 2160398, \"acRate\": \"39.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"53","questionFrontendId":"53","title":"Maximum Subarray","titleSlug":"maximum-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.1M\", \"totalSubmission\": \"6.1M\", \"totalAcceptedRaw\": 3055862, \"totalSubmissionRaw\": 6092396, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"55","questionFrontendId":"55","title":"Jump Game","titleSlug":"jump-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"3.4M\", \"totalAcceptedRaw\": 1342331, \"totalSubmissionRaw\": 3449858, \"acRate\": \"38.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"62","questionFrontendId":"62","title":"Unique Paths","titleSlug":"unique-paths","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 1326037, \"totalSubmissionRaw\": 2117476, \"acRate\": \"62.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"63","questionFrontendId":"63","title":"Unique Paths II","titleSlug":"unique-paths-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"660.4K\", \"totalSubmission\": \"1.7M\", \"totalAcceptedRaw\": 660407, \"totalSubmissionRaw\": 1677550, \"acRate\": \"39.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"64","questionFrontendId":"64","title":"Minimum Path Sum","titleSlug":"minimum-path-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"858.2K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 858250, \"totalSubmissionRaw\": 1404839, \"acRate\": \"61.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"70","questionFrontendId":"70","title":"Climbing Stairs","titleSlug":"climbing-stairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.3M\", \"totalSubmission\": \"4.3M\", \"totalAcceptedRaw\": 2254076, \"totalSubmissionRaw\": 4320834, \"acRate\": \"52.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"72","questionFrontendId":"72","title":"Edit Distance","titleSlug":"edit-distance","translatedTitle":null,"stats":"{\"totalAccepted\": \"628.6K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 628572, \"totalSubmissionRaw\": 1156657, \"acRate\": \"54.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"85","questionFrontendId":"85","title":"Maximal Rectangle","titleSlug":"maximal-rectangle","translatedTitle":null,"stats":"{\"totalAccepted\": \"338K\", \"totalSubmission\": \"756.6K\", \"totalAcceptedRaw\": 337961, \"totalSubmissionRaw\": 756591, \"acRate\": \"44.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"87","questionFrontendId":"87","title":"Scramble String","titleSlug":"scramble-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"162.5K\", \"totalSubmission\": \"449.5K\", \"totalAcceptedRaw\": 162462, \"totalSubmissionRaw\": 449492, \"acRate\": \"36.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"91","questionFrontendId":"91","title":"Decode Ways","titleSlug":"decode-ways","translatedTitle":null,"stats":"{\"totalAccepted\": \"990K\", \"totalSubmission\": \"3M\", \"totalAcceptedRaw\": 989955, \"totalSubmissionRaw\": 3029902, \"acRate\": \"32.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"95","questionFrontendId":"95","title":"Unique Binary Search Trees II","titleSlug":"unique-binary-search-trees-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"347.9K\", \"totalSubmission\": \"665.5K\", \"totalAcceptedRaw\": 347904, \"totalSubmissionRaw\": 665456, \"acRate\": \"52.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"96","questionFrontendId":"96","title":"Unique Binary Search Trees","titleSlug":"unique-binary-search-trees","translatedTitle":null,"stats":"{\"totalAccepted\": \"559.5K\", \"totalSubmission\": \"938.3K\", \"totalAcceptedRaw\": 559467, \"totalSubmissionRaw\": 938346, \"acRate\": \"59.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"97","questionFrontendId":"97","title":"Interleaving String","titleSlug":"interleaving-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"369K\", \"totalSubmission\": \"988.9K\", \"totalAcceptedRaw\": 368978, \"totalSubmissionRaw\": 988856, \"acRate\": \"37.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"115","questionFrontendId":"115","title":"Distinct Subsequences","titleSlug":"distinct-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"282.7K\", \"totalSubmission\": \"636.8K\", \"totalAcceptedRaw\": 282673, \"totalSubmissionRaw\": 636845, \"acRate\": \"44.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"118","questionFrontendId":"118","title":"Pascal's Triangle","titleSlug":"pascals-triangle","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"1.7M\", \"totalAcceptedRaw\": 1169123, \"totalSubmissionRaw\": 1656698, \"acRate\": \"70.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"119","questionFrontendId":"119","title":"Pascal's Triangle II","titleSlug":"pascals-triangle-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"656.6K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 656555, \"totalSubmissionRaw\": 1083035, \"acRate\": \"60.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"120","questionFrontendId":"120","title":"Triangle","titleSlug":"triangle","translatedTitle":null,"stats":"{\"totalAccepted\": \"572.9K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 572885, \"totalSubmissionRaw\": 1053219, \"acRate\": \"54.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"121","questionFrontendId":"121","title":"Best Time to Buy and Sell Stock","titleSlug":"best-time-to-buy-and-sell-stock","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.2M\", \"totalSubmission\": \"5.8M\", \"totalAcceptedRaw\": 3175535, \"totalSubmissionRaw\": 5843512, \"acRate\": \"54.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"122","questionFrontendId":"122","title":"Best Time to Buy and Sell Stock II","titleSlug":"best-time-to-buy-and-sell-stock-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 1395174, \"totalSubmissionRaw\": 2185706, \"acRate\": \"63.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"123","questionFrontendId":"123","title":"Best Time to Buy and Sell Stock III","titleSlug":"best-time-to-buy-and-sell-stock-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"466.5K\", \"totalSubmission\": \"1M\", \"totalAcceptedRaw\": 466531, \"totalSubmissionRaw\": 1027308, \"acRate\": \"45.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"124","questionFrontendId":"124","title":"Binary Tree Maximum Path Sum","titleSlug":"binary-tree-maximum-path-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"949.8K\", \"totalSubmission\": \"2.4M\", \"totalAcceptedRaw\": 949830, \"totalSubmissionRaw\": 2423499, \"acRate\": \"39.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"131","questionFrontendId":"131","title":"Palindrome Partitioning","titleSlug":"palindrome-partitioning","translatedTitle":null,"stats":"{\"totalAccepted\": \"624.6K\", \"totalSubmission\": \"964.7K\", \"totalAcceptedRaw\": 624593, \"totalSubmissionRaw\": 964712, \"acRate\": \"64.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"132","questionFrontendId":"132","title":"Palindrome Partitioning II","titleSlug":"palindrome-partitioning-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"237K\", \"totalSubmission\": \"702K\", \"totalAcceptedRaw\": 237046, \"totalSubmissionRaw\": 702026, \"acRate\": \"33.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"139","questionFrontendId":"139","title":"Word Break","titleSlug":"word-break","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"2.9M\", \"totalAcceptedRaw\": 1302318, \"totalSubmissionRaw\": 2858470, \"acRate\": \"45.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"140","questionFrontendId":"140","title":"Word Break II","titleSlug":"word-break-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"507.3K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 507264, \"totalSubmissionRaw\": 1122470, \"acRate\": \"45.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"152","questionFrontendId":"152","title":"Maximum Product Subarray","titleSlug":"maximum-product-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"967K\", \"totalSubmission\": \"2.8M\", \"totalAcceptedRaw\": 966950, \"totalSubmissionRaw\": 2773061, \"acRate\": \"34.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"174","questionFrontendId":"174","title":"Dungeon Game","titleSlug":"dungeon-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"195.4K\", \"totalSubmission\": \"521.2K\", \"totalAcceptedRaw\": 195392, \"totalSubmissionRaw\": 521249, \"acRate\": \"37.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"188","questionFrontendId":"188","title":"Best Time to Buy and Sell Stock IV","titleSlug":"best-time-to-buy-and-sell-stock-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"348.9K\", \"totalSubmission\": \"898.9K\", \"totalAcceptedRaw\": 348859, \"totalSubmissionRaw\": 898875, \"acRate\": \"38.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"198","questionFrontendId":"198","title":"House Robber","titleSlug":"house-robber","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6M\", \"totalSubmission\": \"3.2M\", \"totalAcceptedRaw\": 1555677, \"totalSubmissionRaw\": 3150913, \"acRate\": \"49.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"213","questionFrontendId":"213","title":"House Robber II","titleSlug":"house-robber-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"556.2K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 556192, \"totalSubmissionRaw\": 1356795, \"acRate\": \"41.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"221","questionFrontendId":"221","title":"Maximal Square","titleSlug":"maximal-square","translatedTitle":null,"stats":"{\"totalAccepted\": \"570.5K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 570519, \"totalSubmissionRaw\": 1270376, \"acRate\": \"44.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"233","questionFrontendId":"233","title":"Number of Digit One","titleSlug":"number-of-digit-one","translatedTitle":null,"stats":"{\"totalAccepted\": \"75.1K\", \"totalSubmission\": \"221K\", \"totalAcceptedRaw\": 75051, \"totalSubmissionRaw\": 220980, \"acRate\": \"34.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"241","questionFrontendId":"241","title":"Different Ways to Add Parentheses","titleSlug":"different-ways-to-add-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"190.7K\", \"totalSubmission\": \"298.8K\", \"totalAcceptedRaw\": 190714, \"totalSubmissionRaw\": 298836, \"acRate\": \"63.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"256","questionFrontendId":"256","title":"Paint House","titleSlug":"paint-house","translatedTitle":null,"stats":"{\"totalAccepted\": \"184.2K\", \"totalSubmission\": \"301.8K\", \"totalAcceptedRaw\": 184156, \"totalSubmissionRaw\": 301759, \"acRate\": \"61.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"264","questionFrontendId":"264","title":"Ugly Number II","titleSlug":"ugly-number-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"301.3K\", \"totalSubmission\": \"652.4K\", \"totalAcceptedRaw\": 301267, \"totalSubmissionRaw\": 652373, \"acRate\": \"46.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"265","questionFrontendId":"265","title":"Paint House II","titleSlug":"paint-house-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"108.4K\", \"totalSubmission\": \"205K\", \"totalAcceptedRaw\": 108378, \"totalSubmissionRaw\": 204977, \"acRate\": \"52.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"276","questionFrontendId":"276","title":"Paint Fence","titleSlug":"paint-fence","translatedTitle":null,"stats":"{\"totalAccepted\": \"96.9K\", \"totalSubmission\": \"217.9K\", \"totalAcceptedRaw\": 96873, \"totalSubmissionRaw\": 217869, \"acRate\": \"44.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"279","questionFrontendId":"279","title":"Perfect Squares","titleSlug":"perfect-squares","translatedTitle":null,"stats":"{\"totalAccepted\": \"650.4K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 650365, \"totalSubmissionRaw\": 1235514, \"acRate\": \"52.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"294","questionFrontendId":"294","title":"Flip Game II","titleSlug":"flip-game-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.4K\", \"totalSubmission\": \"129.8K\", \"totalAcceptedRaw\": 67351, \"totalSubmissionRaw\": 129839, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"300","questionFrontendId":"300","title":"Longest Increasing Subsequence","titleSlug":"longest-increasing-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 1168749, \"totalSubmissionRaw\": 2245126, \"acRate\": \"52.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"309","questionFrontendId":"309","title":"Best Time to Buy and Sell Stock with Cooldown","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown","translatedTitle":null,"stats":"{\"totalAccepted\": \"393.7K\", \"totalSubmission\": \"700.8K\", \"totalAcceptedRaw\": 393679, \"totalSubmissionRaw\": 700828, \"acRate\": \"56.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"312","questionFrontendId":"312","title":"Burst Balloons","titleSlug":"burst-balloons","translatedTitle":null,"stats":"{\"totalAccepted\": \"222.7K\", \"totalSubmission\": \"390.9K\", \"totalAcceptedRaw\": 222725, \"totalSubmissionRaw\": 390905, \"acRate\": \"57.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"313","questionFrontendId":"313","title":"Super Ugly Number","titleSlug":"super-ugly-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"115.8K\", \"totalSubmission\": \"254.4K\", \"totalAcceptedRaw\": 115792, \"totalSubmissionRaw\": 254382, \"acRate\": \"45.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"322","questionFrontendId":"322","title":"Coin Change","titleSlug":"coin-change","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"3.2M\", \"totalAcceptedRaw\": 1340948, \"totalSubmissionRaw\": 3193269, \"acRate\": \"42.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"329","questionFrontendId":"329","title":"Longest Increasing Path in a Matrix","titleSlug":"longest-increasing-path-in-a-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"435.8K\", \"totalSubmission\": \"831.3K\", \"totalAcceptedRaw\": 435817, \"totalSubmissionRaw\": 831310, \"acRate\": \"52.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"333","questionFrontendId":"333","title":"Largest BST Subtree","titleSlug":"largest-bst-subtree","translatedTitle":null,"stats":"{\"totalAccepted\": \"95.4K\", \"totalSubmission\": \"223.2K\", \"totalAcceptedRaw\": 95442, \"totalSubmissionRaw\": 223176, \"acRate\": \"42.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"337","questionFrontendId":"337","title":"House Robber III","titleSlug":"house-robber-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"329.6K\", \"totalSubmission\": \"611.1K\", \"totalAcceptedRaw\": 329595, \"totalSubmissionRaw\": 611056, \"acRate\": \"53.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"338","questionFrontendId":"338","title":"Counting Bits","titleSlug":"counting-bits","translatedTitle":null,"stats":"{\"totalAccepted\": \"744.1K\", \"totalSubmission\": \"982.9K\", \"totalAcceptedRaw\": 744087, \"totalSubmissionRaw\": 982923, \"acRate\": \"75.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"343","questionFrontendId":"343","title":"Integer Break","titleSlug":"integer-break","translatedTitle":null,"stats":"{\"totalAccepted\": \"226K\", \"totalSubmission\": \"403.9K\", \"totalAcceptedRaw\": 225990, \"totalSubmissionRaw\": 403905, \"acRate\": \"56.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"351","questionFrontendId":"351","title":"Android Unlock Patterns","titleSlug":"android-unlock-patterns","translatedTitle":null,"stats":"{\"totalAccepted\": \"68.8K\", \"totalSubmission\": \"133.6K\", \"totalAcceptedRaw\": 68757, \"totalSubmissionRaw\": 133570, \"acRate\": \"51.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"354","questionFrontendId":"354","title":"Russian Doll Envelopes","titleSlug":"russian-doll-envelopes","translatedTitle":null,"stats":"{\"totalAccepted\": \"185.7K\", \"totalSubmission\": \"488.6K\", \"totalAcceptedRaw\": 185705, \"totalSubmissionRaw\": 488647, \"acRate\": \"38.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"357","questionFrontendId":"357","title":"Count Numbers with Unique Digits","titleSlug":"count-numbers-with-unique-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"115.8K\", \"totalSubmission\": \"223.5K\", \"totalAcceptedRaw\": 115821, \"totalSubmissionRaw\": 223547, \"acRate\": \"51.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"361","questionFrontendId":"361","title":"Bomb Enemy","titleSlug":"bomb-enemy","translatedTitle":null,"stats":"{\"totalAccepted\": \"73.5K\", \"totalSubmission\": \"143.3K\", \"totalAcceptedRaw\": 73468, \"totalSubmissionRaw\": 143326, \"acRate\": \"51.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"368","questionFrontendId":"368","title":"Largest Divisible Subset","titleSlug":"largest-divisible-subset","translatedTitle":null,"stats":"{\"totalAccepted\": \"175.4K\", \"totalSubmission\": \"423K\", \"totalAcceptedRaw\": 175431, \"totalSubmissionRaw\": 422970, \"acRate\": \"41.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"375","questionFrontendId":"375","title":"Guess Number Higher or Lower II","titleSlug":"guess-number-higher-or-lower-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"104.1K\", \"totalSubmission\": \"222.4K\", \"totalAcceptedRaw\": 104135, \"totalSubmissionRaw\": 222390, \"acRate\": \"46.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"376","questionFrontendId":"376","title":"Wiggle Subsequence","titleSlug":"wiggle-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"217K\", \"totalSubmission\": \"448.9K\", \"totalAcceptedRaw\": 216988, \"totalSubmissionRaw\": 448950, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"377","questionFrontendId":"377","title":"Combination Sum IV","titleSlug":"combination-sum-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"351.1K\", \"totalSubmission\": \"672.9K\", \"totalAcceptedRaw\": 351053, \"totalSubmissionRaw\": 672865, \"acRate\": \"52.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"392","questionFrontendId":"392","title":"Is Subsequence","titleSlug":"is-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"791.5K\", \"totalSubmission\": \"1.7M\", \"totalAcceptedRaw\": 791508, \"totalSubmissionRaw\": 1658595, \"acRate\": \"47.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"396","questionFrontendId":"396","title":"Rotate Function","titleSlug":"rotate-function","translatedTitle":null,"stats":"{\"totalAccepted\": \"72.4K\", \"totalSubmission\": \"176.4K\", \"totalAcceptedRaw\": 72429, \"totalSubmissionRaw\": 176379, \"acRate\": \"41.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"397","questionFrontendId":"397","title":"Integer Replacement","titleSlug":"integer-replacement","translatedTitle":null,"stats":"{\"totalAccepted\": \"96.5K\", \"totalSubmission\": \"274.5K\", \"totalAcceptedRaw\": 96515, \"totalSubmissionRaw\": 274519, \"acRate\": \"35.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"403","questionFrontendId":"403","title":"Frog Jump","titleSlug":"frog-jump","translatedTitle":null,"stats":"{\"totalAccepted\": \"177.5K\", \"totalSubmission\": \"411.2K\", \"totalAcceptedRaw\": 177458, \"totalSubmissionRaw\": 411245, \"acRate\": \"43.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"410","questionFrontendId":"410","title":"Split Array Largest Sum","titleSlug":"split-array-largest-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"256.7K\", \"totalSubmission\": \"479.7K\", \"totalAcceptedRaw\": 256705, \"totalSubmissionRaw\": 479653, \"acRate\": \"53.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"413","questionFrontendId":"413","title":"Arithmetic Slices","titleSlug":"arithmetic-slices","translatedTitle":null,"stats":"{\"totalAccepted\": \"269.7K\", \"totalSubmission\": \"414.4K\", \"totalAcceptedRaw\": 269668, \"totalSubmissionRaw\": 414391, \"acRate\": \"65.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"416","questionFrontendId":"416","title":"Partition Equal Subset Sum","titleSlug":"partition-equal-subset-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"601.9K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 601881, \"totalSubmissionRaw\": 1299666, \"acRate\": \"46.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"418","questionFrontendId":"418","title":"Sentence Screen Fitting","titleSlug":"sentence-screen-fitting","translatedTitle":null,"stats":"{\"totalAccepted\": \"92.4K\", \"totalSubmission\": \"259.5K\", \"totalAcceptedRaw\": 92418, \"totalSubmissionRaw\": 259492, \"acRate\": \"35.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"435","questionFrontendId":"435","title":"Non-overlapping Intervals","titleSlug":"non-overlapping-intervals","translatedTitle":null,"stats":"{\"totalAccepted\": \"348.8K\", \"totalSubmission\": \"694.6K\", \"totalAcceptedRaw\": 348777, \"totalSubmissionRaw\": 694562, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"446","questionFrontendId":"446","title":"Arithmetic Slices II - Subsequence","titleSlug":"arithmetic-slices-ii-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"73.5K\", \"totalSubmission\": \"157.5K\", \"totalAcceptedRaw\": 73459, \"totalSubmissionRaw\": 157486, \"acRate\": \"46.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"458","questionFrontendId":"458","title":"Poor Pigs","titleSlug":"poor-pigs","translatedTitle":null,"stats":"{\"totalAccepted\": \"73.5K\", \"totalSubmission\": \"116.8K\", \"totalAcceptedRaw\": 73529, \"totalSubmissionRaw\": 116801, \"acRate\": \"63.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"464","questionFrontendId":"464","title":"Can I Win","titleSlug":"can-i-win","translatedTitle":null,"stats":"{\"totalAccepted\": \"83.6K\", \"totalSubmission\": \"281.8K\", \"totalAcceptedRaw\": 83628, \"totalSubmissionRaw\": 281764, \"acRate\": \"29.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"465","questionFrontendId":"465","title":"Optimal Account Balancing","titleSlug":"optimal-account-balancing","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.1K\", \"totalSubmission\": \"158.6K\", \"totalAcceptedRaw\": 78082, \"totalSubmissionRaw\": 158560, \"acRate\": \"49.2%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"466","questionFrontendId":"466","title":"Count The Repetitions","titleSlug":"count-the-repetitions","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.7K\", \"totalSubmission\": \"53.4K\", \"totalAcceptedRaw\": 15686, \"totalSubmissionRaw\": 53400, \"acRate\": \"29.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"467","questionFrontendId":"467","title":"Unique Substrings in Wraparound String","titleSlug":"unique-substrings-in-wraparound-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.2K\", \"totalSubmission\": \"101.8K\", \"totalAcceptedRaw\": 39233, \"totalSubmissionRaw\": 101834, \"acRate\": \"38.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"471","questionFrontendId":"471","title":"Encode String with Shortest Length","titleSlug":"encode-string-with-shortest-length","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.8K\", \"totalSubmission\": \"58.8K\", \"totalAcceptedRaw\": 29752, \"totalSubmissionRaw\": 58813, \"acRate\": \"50.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"472","questionFrontendId":"472","title":"Concatenated Words","titleSlug":"concatenated-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"206K\", \"totalSubmission\": \"411.5K\", \"totalAcceptedRaw\": 206044, \"totalSubmissionRaw\": 411541, \"acRate\": \"50.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"473","questionFrontendId":"473","title":"Matchsticks to Square","titleSlug":"matchsticks-to-square","translatedTitle":null,"stats":"{\"totalAccepted\": \"139K\", \"totalSubmission\": \"345.8K\", \"totalAcceptedRaw\": 139023, \"totalSubmissionRaw\": 345797, \"acRate\": \"40.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"474","questionFrontendId":"474","title":"Ones and Zeroes","titleSlug":"ones-and-zeroes","translatedTitle":null,"stats":"{\"totalAccepted\": \"166.9K\", \"totalSubmission\": \"357K\", \"totalAcceptedRaw\": 166876, \"totalSubmissionRaw\": 356991, \"acRate\": \"46.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"486","questionFrontendId":"486","title":"Predict the Winner","titleSlug":"predict-the-winner","translatedTitle":null,"stats":"{\"totalAccepted\": \"135.6K\", \"totalSubmission\": \"265.5K\", \"totalAcceptedRaw\": 135618, \"totalSubmissionRaw\": 265549, \"acRate\": \"51.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"487","questionFrontendId":"487","title":"Max Consecutive Ones II","titleSlug":"max-consecutive-ones-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.1K\", \"totalSubmission\": \"240.1K\", \"totalAcceptedRaw\": 119147, \"totalSubmissionRaw\": 240077, \"acRate\": \"49.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"488","questionFrontendId":"488","title":"Zuma Game","titleSlug":"zuma-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.3K\", \"totalSubmission\": \"62.8K\", \"totalAcceptedRaw\": 21336, \"totalSubmissionRaw\": 62820, \"acRate\": \"34.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"489","questionFrontendId":"1643","title":"Kth Smallest Instructions","titleSlug":"kth-smallest-instructions","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.9K\", \"totalSubmission\": \"21K\", \"totalAcceptedRaw\": 9877, \"totalSubmissionRaw\": 21004, \"acRate\": \"47.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"494","questionFrontendId":"494","title":"Target Sum","titleSlug":"target-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"445.3K\", \"totalSubmission\": \"975.3K\", \"totalAcceptedRaw\": 445323, \"totalSubmissionRaw\": 975251, \"acRate\": \"45.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"512","questionFrontendId":"2036","title":"Maximum Alternating Subarray Sum","titleSlug":"maximum-alternating-subarray-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.1K\", \"totalSubmission\": \"5.2K\", \"totalAcceptedRaw\": 2133, \"totalSubmissionRaw\": 5206, \"acRate\": \"41.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"514","questionFrontendId":"514","title":"Freedom Trail","titleSlug":"freedom-trail","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.6K\", \"totalSubmission\": \"67.2K\", \"totalAcceptedRaw\": 31575, \"totalSubmissionRaw\": 67241, \"acRate\": \"47.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"516","questionFrontendId":"516","title":"Longest Palindromic Subsequence","titleSlug":"longest-palindromic-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"324.7K\", \"totalSubmission\": \"532.5K\", \"totalAcceptedRaw\": 324716, \"totalSubmissionRaw\": 532478, \"acRate\": \"61.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"518","questionFrontendId":"518","title":"Coin Change II","titleSlug":"coin-change-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"396.9K\", \"totalSubmission\": \"656.5K\", \"totalAcceptedRaw\": 396919, \"totalSubmissionRaw\": 656522, \"acRate\": \"60.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"526","questionFrontendId":"526","title":"Beautiful Arrangement","titleSlug":"beautiful-arrangement","translatedTitle":null,"stats":"{\"totalAccepted\": \"149.6K\", \"totalSubmission\": \"232K\", \"totalAcceptedRaw\": 149569, \"totalSubmissionRaw\": 232039, \"acRate\": \"64.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"542","questionFrontendId":"542","title":"01 Matrix","titleSlug":"01-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"364.8K\", \"totalSubmission\": \"816.9K\", \"totalAcceptedRaw\": 364759, \"totalSubmissionRaw\": 816904, \"acRate\": \"44.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"546","questionFrontendId":"546","title":"Remove Boxes","titleSlug":"remove-boxes","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.1K\", \"totalSubmission\": \"81.9K\", \"totalAcceptedRaw\": 39103, \"totalSubmissionRaw\": 81900, \"acRate\": \"47.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"552","questionFrontendId":"552","title":"Student Attendance Record II","titleSlug":"student-attendance-record-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.6K\", \"totalSubmission\": \"141.6K\", \"totalAcceptedRaw\": 58620, \"totalSubmissionRaw\": 141594, \"acRate\": \"41.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"553","questionFrontendId":"553","title":"Optimal Division","titleSlug":"optimal-division","translatedTitle":null,"stats":"{\"totalAccepted\": \"35K\", \"totalSubmission\": \"58.5K\", \"totalAcceptedRaw\": 35046, \"totalSubmissionRaw\": 58541, \"acRate\": \"59.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"562","questionFrontendId":"562","title":"Longest Line of Consecutive One in Matrix","titleSlug":"longest-line-of-consecutive-one-in-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"71.7K\", \"totalSubmission\": \"142.8K\", \"totalAcceptedRaw\": 71679, \"totalSubmissionRaw\": 142750, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"568","questionFrontendId":"568","title":"Maximum Vacation Days","titleSlug":"maximum-vacation-days","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.8K\", \"totalSubmission\": \"79.5K\", \"totalAcceptedRaw\": 35821, \"totalSubmissionRaw\": 79537, \"acRate\": \"45.0%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"576","questionFrontendId":"576","title":"Out of Boundary Paths","titleSlug":"out-of-boundary-paths","translatedTitle":null,"stats":"{\"totalAccepted\": \"115.2K\", \"totalSubmission\": \"260.1K\", \"totalAcceptedRaw\": 115162, \"totalSubmissionRaw\": 260142, \"acRate\": \"44.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"583","questionFrontendId":"583","title":"Delete Operation for Two Strings","titleSlug":"delete-operation-for-two-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"199.7K\", \"totalSubmission\": \"334.4K\", \"totalAcceptedRaw\": 199716, \"totalSubmissionRaw\": 334362, \"acRate\": \"59.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"600","questionFrontendId":"600","title":"Non-negative Integers without Consecutive Ones","titleSlug":"non-negative-integers-without-consecutive-ones","translatedTitle":null,"stats":"{\"totalAccepted\": \"34K\", \"totalSubmission\": \"86.9K\", \"totalAcceptedRaw\": 34014, \"totalSubmissionRaw\": 86878, \"acRate\": \"39.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"629","questionFrontendId":"629","title":"K Inverse Pairs Array","titleSlug":"k-inverse-pairs-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"58K\", \"totalSubmission\": \"136K\", \"totalAcceptedRaw\": 58032, \"totalSubmissionRaw\": 136022, \"acRate\": \"42.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"634","questionFrontendId":"634","title":"Find the Derangement of An Array","titleSlug":"find-the-derangement-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.3K\", \"totalSubmission\": \"24.6K\", \"totalAcceptedRaw\": 10324, \"totalSubmissionRaw\": 24593, \"acRate\": \"42.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"638","questionFrontendId":"638","title":"Shopping Offers","titleSlug":"shopping-offers","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.1K\", \"totalSubmission\": \"97.6K\", \"totalAcceptedRaw\": 52064, \"totalSubmissionRaw\": 97609, \"acRate\": \"53.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"639","questionFrontendId":"639","title":"Decode Ways II","titleSlug":"decode-ways-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"66.5K\", \"totalSubmission\": \"218.9K\", \"totalAcceptedRaw\": 66524, \"totalSubmissionRaw\": 218905, \"acRate\": \"30.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"646","questionFrontendId":"646","title":"Maximum Length of Pair Chain","titleSlug":"maximum-length-of-pair-chain","translatedTitle":null,"stats":"{\"totalAccepted\": \"132K\", \"totalSubmission\": \"233.5K\", \"totalAcceptedRaw\": 131968, \"totalSubmissionRaw\": 233467, \"acRate\": \"56.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"647","questionFrontendId":"647","title":"Palindromic Substrings","titleSlug":"palindromic-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"555.4K\", \"totalSubmission\": \"831.1K\", \"totalAcceptedRaw\": 555402, \"totalSubmissionRaw\": 831117, \"acRate\": \"66.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"650","questionFrontendId":"650","title":"2 Keys Keyboard","titleSlug":"2-keys-keyboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.5K\", \"totalSubmission\": \"214.5K\", \"totalAcceptedRaw\": 114525, \"totalSubmissionRaw\": 214527, \"acRate\": \"53.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"651","questionFrontendId":"651","title":"4 Keys Keyboard","titleSlug":"4-keys-keyboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.7K\", \"totalSubmission\": \"43.5K\", \"totalAcceptedRaw\": 23738, \"totalSubmissionRaw\": 43496, \"acRate\": \"54.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"656","questionFrontendId":"656","title":"Coin Path","titleSlug":"coin-path","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"41.9K\", \"totalAcceptedRaw\": 13314, \"totalSubmissionRaw\": 41910, \"acRate\": \"31.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"664","questionFrontendId":"664","title":"Strange Printer","titleSlug":"strange-printer","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.5K\", \"totalSubmission\": \"67.3K\", \"totalAcceptedRaw\": 31524, \"totalSubmissionRaw\": 67274, \"acRate\": \"46.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"673","questionFrontendId":"673","title":"Number of Longest Increasing Subsequence","titleSlug":"number-of-longest-increasing-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"140.4K\", \"totalSubmission\": \"328.4K\", \"totalAcceptedRaw\": 140435, \"totalSubmissionRaw\": 328435, \"acRate\": \"42.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"678","questionFrontendId":"678","title":"Valid Parenthesis String","titleSlug":"valid-parenthesis-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"201.5K\", \"totalSubmission\": \"591.2K\", \"totalAcceptedRaw\": 201452, \"totalSubmissionRaw\": 591200, \"acRate\": \"34.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"688","questionFrontendId":"688","title":"Knight Probability in Chessboard","titleSlug":"knight-probability-in-chessboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"93.5K\", \"totalSubmission\": \"179.5K\", \"totalAcceptedRaw\": 93523, \"totalSubmissionRaw\": 179482, \"acRate\": \"52.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"689","questionFrontendId":"689","title":"Maximum Sum of 3 Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"66.9K\", \"totalSubmission\": \"136.5K\", \"totalAcceptedRaw\": 66861, \"totalSubmissionRaw\": 136474, \"acRate\": \"49.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"691","questionFrontendId":"691","title":"Stickers to Spell Word","titleSlug":"stickers-to-spell-word","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.2K\", \"totalSubmission\": \"80.4K\", \"totalAcceptedRaw\": 37219, \"totalSubmissionRaw\": 80424, \"acRate\": \"46.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"698","questionFrontendId":"698","title":"Partition to K Equal Sum Subsets","titleSlug":"partition-to-k-equal-sum-subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"232.1K\", \"totalSubmission\": \"579K\", \"totalAcceptedRaw\": 232079, \"totalSubmissionRaw\": 578988, \"acRate\": \"40.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"712","questionFrontendId":"712","title":"Minimum ASCII Delete Sum for Two Strings","titleSlug":"minimum-ascii-delete-sum-for-two-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"74.8K\", \"totalSubmission\": \"119.7K\", \"totalAcceptedRaw\": 74836, \"totalSubmissionRaw\": 119682, \"acRate\": \"62.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"714","questionFrontendId":"714","title":"Best Time to Buy and Sell Stock with Transaction Fee","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee","translatedTitle":null,"stats":"{\"totalAccepted\": \"219.8K\", \"totalSubmission\": \"337.9K\", \"totalAcceptedRaw\": 219800, \"totalSubmissionRaw\": 337923, \"acRate\": \"65.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"718","questionFrontendId":"718","title":"Maximum Length of Repeated Subarray","titleSlug":"maximum-length-of-repeated-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"258.8K\", \"totalSubmission\": \"504.6K\", \"totalAcceptedRaw\": 258775, \"totalSubmissionRaw\": 504577, \"acRate\": \"51.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"727","questionFrontendId":"727","title":"Minimum Window Subsequence","titleSlug":"minimum-window-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"82.8K\", \"totalSubmission\": \"193.3K\", \"totalAcceptedRaw\": 82819, \"totalSubmissionRaw\": 193257, \"acRate\": \"42.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"730","questionFrontendId":"730","title":"Count Different Palindromic Subsequences","titleSlug":"count-different-palindromic-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.3K\", \"totalSubmission\": \"72.2K\", \"totalAcceptedRaw\": 32336, \"totalSubmissionRaw\": 72206, \"acRate\": \"44.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"740","questionFrontendId":"740","title":"Delete and Earn","titleSlug":"delete-and-earn","translatedTitle":null,"stats":"{\"totalAccepted\": \"258.9K\", \"totalSubmission\": \"453.5K\", \"totalAcceptedRaw\": 258919, \"totalSubmissionRaw\": 453530, \"acRate\": \"57.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"741","questionFrontendId":"741","title":"Cherry Pickup","titleSlug":"cherry-pickup","translatedTitle":null,"stats":"{\"totalAccepted\": \"64.1K\", \"totalSubmission\": \"176.5K\", \"totalAcceptedRaw\": 64076, \"totalSubmissionRaw\": 176508, \"acRate\": \"36.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"747","questionFrontendId":"746","title":"Min Cost Climbing Stairs","titleSlug":"min-cost-climbing-stairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"773.9K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 773885, \"totalSubmissionRaw\": 1226234, \"acRate\": \"63.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"751","questionFrontendId":"750","title":"Number Of Corner Rectangles","titleSlug":"number-of-corner-rectangles","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.1K\", \"totalSubmission\": \"54.9K\", \"totalAcceptedRaw\": 37100, \"totalSubmissionRaw\": 54937, \"acRate\": \"67.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"769","questionFrontendId":"764","title":"Largest Plus Sign","titleSlug":"largest-plus-sign","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.5K\", \"totalSubmission\": \"108.6K\", \"totalAcceptedRaw\": 52479, \"totalSubmissionRaw\": 108598, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"803","questionFrontendId":"787","title":"Cheapest Flights Within K Stops","titleSlug":"cheapest-flights-within-k-stops","translatedTitle":null,"stats":"{\"totalAccepted\": \"358.5K\", \"totalSubmission\": \"968.5K\", \"totalAcceptedRaw\": 358489, \"totalSubmissionRaw\": 968482, \"acRate\": \"37.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"804","questionFrontendId":"788","title":"Rotated Digits","titleSlug":"rotated-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"95.2K\", \"totalSubmission\": \"167.8K\", \"totalAcceptedRaw\": 95154, \"totalSubmissionRaw\": 167833, \"acRate\": \"56.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"806","questionFrontendId":"790","title":"Domino and Tromino Tiling","titleSlug":"domino-and-tromino-tiling","translatedTitle":null,"stats":"{\"totalAccepted\": \"93.1K\", \"totalSubmission\": \"176K\", \"totalAcceptedRaw\": 93101, \"totalSubmissionRaw\": 176034, \"acRate\": \"52.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"815","questionFrontendId":"799","title":"Champagne Tower","titleSlug":"champagne-tower","translatedTitle":null,"stats":"{\"totalAccepted\": \"83.5K\", \"totalSubmission\": \"162.7K\", \"totalAcceptedRaw\": 83526, \"totalSubmissionRaw\": 162747, \"acRate\": \"51.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"819","questionFrontendId":"801","title":"Minimum Swaps To Make Sequences Increasing","titleSlug":"minimum-swaps-to-make-sequences-increasing","translatedTitle":null,"stats":"{\"totalAccepted\": \"62K\", \"totalSubmission\": \"157.5K\", \"totalAcceptedRaw\": 62015, \"totalSubmissionRaw\": 157543, \"acRate\": \"39.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"823","questionFrontendId":"805","title":"Split Array With Same Average","titleSlug":"split-array-with-same-average","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.9K\", \"totalSubmission\": \"116.5K\", \"totalAcceptedRaw\": 29911, \"totalSubmissionRaw\": 116468, \"acRate\": \"25.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"826","questionFrontendId":"808","title":"Soup Servings","titleSlug":"soup-servings","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.4K\", \"totalSubmission\": \"40.1K\", \"totalAcceptedRaw\": 17420, \"totalSubmissionRaw\": 40123, \"acRate\": \"43.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Probability and Statistics","translatedName":null,"slug":"probability-and-statistics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"831","questionFrontendId":"813","title":"Largest Sum of Averages","titleSlug":"largest-sum-of-averages","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.8K\", \"totalSubmission\": \"86.4K\", \"totalAcceptedRaw\": 45781, \"totalSubmissionRaw\": 86423, \"acRate\": \"53.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"836","questionFrontendId":"818","title":"Race Car","titleSlug":"race-car","translatedTitle":null,"stats":"{\"totalAccepted\": \"74.5K\", \"totalSubmission\": \"172K\", \"totalAcceptedRaw\": 74522, \"totalSubmissionRaw\": 172006, \"acRate\": \"43.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"843","questionFrontendId":"823","title":"Binary Trees With Factors","titleSlug":"binary-trees-with-factors","translatedTitle":null,"stats":"{\"totalAccepted\": \"89.5K\", \"totalSubmission\": \"180K\", \"totalAcceptedRaw\": 89487, \"totalSubmissionRaw\": 180021, \"acRate\": \"49.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"855","questionFrontendId":"828","title":"Count Unique Characters of All Substrings of a Given String","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.4K\", \"totalSubmission\": \"122.4K\", \"totalAcceptedRaw\": 63363, \"totalSubmissionRaw\": 122446, \"acRate\": \"51.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"863","questionFrontendId":"834","title":"Sum of Distances in Tree","titleSlug":"sum-of-distances-in-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"80.5K\", \"totalSubmission\": \"135.8K\", \"totalAcceptedRaw\": 80481, \"totalSubmissionRaw\": 135803, \"acRate\": \"59.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"867","questionFrontendId":"837","title":"New 21 Game","titleSlug":"new-21-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.5K\", \"totalSubmission\": \"95.3K\", \"totalAcceptedRaw\": 34515, \"totalSubmissionRaw\": 95334, \"acRate\": \"36.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Probability and Statistics","translatedName":null,"slug":"probability-and-statistics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"868","questionFrontendId":"838","title":"Push Dominoes","titleSlug":"push-dominoes","translatedTitle":null,"stats":"{\"totalAccepted\": \"111.6K\", \"totalSubmission\": \"195.9K\", \"totalAcceptedRaw\": 111586, \"totalSubmissionRaw\": 195868, \"acRate\": \"57.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"875","questionFrontendId":"845","title":"Longest Mountain in Array","titleSlug":"longest-mountain-in-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"108.4K\", \"totalSubmission\": \"269.6K\", \"totalAcceptedRaw\": 108405, \"totalSubmissionRaw\": 269596, \"acRate\": \"40.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"877","questionFrontendId":"847","title":"Shortest Path Visiting All Nodes","titleSlug":"shortest-path-visiting-all-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"68.7K\", \"totalSubmission\": \"112.4K\", \"totalAcceptedRaw\": 68660, \"totalSubmissionRaw\": 112391, \"acRate\": \"61.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"902","questionFrontendId":"871","title":"Minimum Number of Refueling Stops","titleSlug":"minimum-number-of-refueling-stops","translatedTitle":null,"stats":"{\"totalAccepted\": \"121.8K\", \"totalSubmission\": \"305.8K\", \"totalAcceptedRaw\": 121760, \"totalSubmissionRaw\": 305763, \"acRate\": \"39.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"905","questionFrontendId":"873","title":"Length of Longest Fibonacci Subsequence","titleSlug":"length-of-longest-fibonacci-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"55.4K\", \"totalSubmission\": \"114.6K\", \"totalAcceptedRaw\": 55403, \"totalSubmissionRaw\": 114643, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"909","questionFrontendId":"877","title":"Stone Game","titleSlug":"stone-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"182.4K\", \"totalSubmission\": \"261.7K\", \"totalAcceptedRaw\": 182449, \"totalSubmissionRaw\": 261655, \"acRate\": \"69.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"911","questionFrontendId":"879","title":"Profitable Schemes","titleSlug":"profitable-schemes","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.8K\", \"totalSubmission\": \"43.8K\", \"totalAcceptedRaw\": 17776, \"totalSubmissionRaw\": 43793, \"acRate\": \"40.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"923","questionFrontendId":"887","title":"Super Egg Drop","titleSlug":"super-egg-drop","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.6K\", \"totalSubmission\": \"215.3K\", \"totalAcceptedRaw\": 58572, \"totalSubmissionRaw\": 215331, \"acRate\": \"27.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"930","questionFrontendId":"894","title":"All Possible Full Binary Trees","titleSlug":"all-possible-full-binary-trees","translatedTitle":null,"stats":"{\"totalAccepted\": \"105.6K\", \"totalSubmission\": \"132K\", \"totalAcceptedRaw\": 105605, \"totalSubmissionRaw\": 132049, \"acRate\": \"80.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"934","questionFrontendId":"898","title":"Bitwise ORs of Subarrays","titleSlug":"bitwise-ors-of-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.5K\", \"totalSubmission\": \"81.9K\", \"totalAcceptedRaw\": 30458, \"totalSubmissionRaw\": 81921, \"acRate\": \"37.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"938","questionFrontendId":"902","title":"Numbers At Most N Given Digit Set","titleSlug":"numbers-at-most-n-given-digit-set","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.6K\", \"totalSubmission\": \"95.6K\", \"totalAcceptedRaw\": 39603, \"totalSubmissionRaw\": 95582, \"acRate\": \"41.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"939","questionFrontendId":"903","title":"Valid Permutations for DI Sequence","titleSlug":"valid-permutations-for-di-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.6K\", \"totalSubmission\": \"23.5K\", \"totalAcceptedRaw\": 13560, \"totalSubmissionRaw\": 23454, \"acRate\": \"57.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"943","questionFrontendId":"907","title":"Sum of Subarray Minimums","titleSlug":"sum-of-subarray-minimums","translatedTitle":null,"stats":"{\"totalAccepted\": \"142.4K\", \"totalSubmission\": \"397.8K\", \"totalAcceptedRaw\": 142438, \"totalSubmissionRaw\": 397827, \"acRate\": \"35.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"949","questionFrontendId":"913","title":"Cat and Mouse","titleSlug":"cat-and-mouse","translatedTitle":null,"stats":"{\"totalAccepted\": \"17K\", \"totalSubmission\": \"48.6K\", \"totalAcceptedRaw\": 16977, \"totalSubmissionRaw\": 48648, \"acRate\": \"34.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"954","questionFrontendId":"918","title":"Maximum Sum Circular Subarray","titleSlug":"maximum-sum-circular-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"203.8K\", \"totalSubmission\": \"475.3K\", \"totalAcceptedRaw\": 203775, \"totalSubmissionRaw\": 475269, \"acRate\": \"42.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"956","questionFrontendId":"920","title":"Number of Music Playlists","titleSlug":"number-of-music-playlists","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"44K\", \"totalAcceptedRaw\": 22329, \"totalSubmissionRaw\": 43972, \"acRate\": \"50.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"962","questionFrontendId":"926","title":"Flip String to Monotone Increasing","titleSlug":"flip-string-to-monotone-increasing","translatedTitle":null,"stats":"{\"totalAccepted\": \"173.8K\", \"totalSubmission\": \"282.6K\", \"totalAcceptedRaw\": 173772, \"totalSubmissionRaw\": 282582, \"acRate\": \"61.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"967","questionFrontendId":"931","title":"Minimum Falling Path Sum","titleSlug":"minimum-falling-path-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"235.1K\", \"totalSubmission\": \"340.2K\", \"totalAcceptedRaw\": 235130, \"totalSubmissionRaw\": 340229, \"acRate\": \"69.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"972","questionFrontendId":"935","title":"Knight Dialer","titleSlug":"knight-dialer","translatedTitle":null,"stats":"{\"totalAccepted\": \"98.3K\", \"totalSubmission\": \"194.8K\", \"totalAcceptedRaw\": 98251, \"totalSubmissionRaw\": 194808, \"acRate\": \"50.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"977","questionFrontendId":"940","title":"Distinct Subsequences II","titleSlug":"distinct-subsequences-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.5K\", \"totalSubmission\": \"73.9K\", \"totalAcceptedRaw\": 32490, \"totalSubmissionRaw\": 73863, \"acRate\": \"44.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"980","questionFrontendId":"943","title":"Find the Shortest Superstring","titleSlug":"find-the-shortest-superstring","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.8K\", \"totalSubmission\": \"58K\", \"totalAcceptedRaw\": 25813, \"totalSubmissionRaw\": 58022, \"acRate\": \"44.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"993","questionFrontendId":"956","title":"Tallest Billboard","titleSlug":"tallest-billboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.8K\", \"totalSubmission\": \"39.5K\", \"totalAcceptedRaw\": 15769, \"totalSubmissionRaw\": 39523, \"acRate\": \"39.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1000","questionFrontendId":"960","title":"Delete Columns to Make Sorted III","titleSlug":"delete-columns-to-make-sorted-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"12K\", \"totalSubmission\": \"20.9K\", \"totalAcceptedRaw\": 11983, \"totalSubmissionRaw\": 20933, \"acRate\": \"57.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1004","questionFrontendId":"964","title":"Least Operators to Express Number","titleSlug":"least-operators-to-express-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.8K\", \"totalSubmission\": \"18.3K\", \"totalAcceptedRaw\": 8780, \"totalSubmissionRaw\": 18315, \"acRate\": \"47.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1008","questionFrontendId":"968","title":"Binary Tree Cameras","titleSlug":"binary-tree-cameras","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.1K\", \"totalSubmission\": \"255.1K\", \"totalAcceptedRaw\": 119075, \"totalSubmissionRaw\": 255092, \"acRate\": \"46.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1013","questionFrontendId":"509","title":"Fibonacci Number","titleSlug":"fibonacci-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 1269156, \"totalSubmissionRaw\": 1819531, \"acRate\": \"69.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1017","questionFrontendId":"975","title":"Odd Even Jump","titleSlug":"odd-even-jump","translatedTitle":null,"stats":"{\"totalAccepted\": \"72K\", \"totalSubmission\": \"184.8K\", \"totalAcceptedRaw\": 71998, \"totalSubmissionRaw\": 184811, \"acRate\": \"39.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1020","questionFrontendId":"978","title":"Longest Turbulent Subarray","titleSlug":"longest-turbulent-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"82.3K\", \"totalSubmission\": \"174.4K\", \"totalAcceptedRaw\": 82301, \"totalSubmissionRaw\": 174411, \"acRate\": \"47.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1025","questionFrontendId":"983","title":"Minimum Cost For Tickets","titleSlug":"minimum-cost-for-tickets","translatedTitle":null,"stats":"{\"totalAccepted\": \"187.8K\", \"totalSubmission\": \"292.1K\", \"totalAcceptedRaw\": 187818, \"totalSubmissionRaw\": 292130, \"acRate\": \"64.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1038","questionFrontendId":"996","title":"Number of Squareful Arrays","titleSlug":"number-of-squareful-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.6K\", \"totalSubmission\": \"62.2K\", \"totalAcceptedRaw\": 30618, \"totalSubmissionRaw\": 62202, \"acRate\": \"49.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1042","questionFrontendId":"1000","title":"Minimum Cost to Merge Stones","titleSlug":"minimum-cost-to-merge-stones","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.3K\", \"totalSubmission\": \"78.7K\", \"totalAcceptedRaw\": 33328, \"totalSubmissionRaw\": 78730, \"acRate\": \"42.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1057","questionFrontendId":"1012","title":"Numbers With Repeated Digits","titleSlug":"numbers-with-repeated-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.9K\", \"totalSubmission\": \"29.8K\", \"totalAcceptedRaw\": 11882, \"totalSubmissionRaw\": 29829, \"acRate\": \"39.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1060","questionFrontendId":"1062","title":"Longest Repeating Substring","titleSlug":"longest-repeating-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.4K\", \"totalSubmission\": \"54.7K\", \"totalAcceptedRaw\": 32408, \"totalSubmissionRaw\": 54744, \"acRate\": \"59.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Suffix Array","translatedName":null,"slug":"suffix-array","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1063","questionFrontendId":"1014","title":"Best Sightseeing Pair","titleSlug":"best-sightseeing-pair","translatedTitle":null,"stats":"{\"totalAccepted\": \"82.3K\", \"totalSubmission\": \"138.4K\", \"totalAcceptedRaw\": 82265, \"totalSubmissionRaw\": 138430, \"acRate\": \"59.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1067","questionFrontendId":"1066","title":"Campus Bikes II","titleSlug":"campus-bikes-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.4K\", \"totalSubmission\": \"81K\", \"totalAcceptedRaw\": 44444, \"totalSubmissionRaw\": 80995, \"acRate\": \"54.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1068","questionFrontendId":"1067","title":"Digit Count in Range","titleSlug":"digit-count-in-range","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.4K\", \"totalSubmission\": \"7.5K\", \"totalAcceptedRaw\": 3397, \"totalSubmissionRaw\": 7532, \"acRate\": \"45.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1081","questionFrontendId":"1024","title":"Video Stitching","titleSlug":"video-stitching","translatedTitle":null,"stats":"{\"totalAccepted\": \"56.1K\", \"totalSubmission\": \"111.2K\", \"totalAcceptedRaw\": 56140, \"totalSubmissionRaw\": 111237, \"acRate\": \"50.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1086","questionFrontendId":"1025","title":"Divisor Game","titleSlug":"divisor-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"196.3K\", \"totalSubmission\": \"290.6K\", \"totalAcceptedRaw\": 196288, \"totalSubmissionRaw\": 290607, \"acRate\": \"67.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1087","questionFrontendId":"1027","title":"Longest Arithmetic Subsequence","titleSlug":"longest-arithmetic-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"99.8K\", \"totalSubmission\": \"213.3K\", \"totalAcceptedRaw\": 99805, \"totalSubmissionRaw\": 213286, \"acRate\": \"46.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1096","questionFrontendId":"1031","title":"Maximum Sum of Two Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"61.3K\", \"totalSubmission\": \"102.9K\", \"totalAcceptedRaw\": 61303, \"totalSubmissionRaw\": 102853, \"acRate\": \"59.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1105","questionFrontendId":"1035","title":"Uncrossed Lines","titleSlug":"uncrossed-lines","translatedTitle":null,"stats":"{\"totalAccepted\": \"77.6K\", \"totalSubmission\": \"131.4K\", \"totalAcceptedRaw\": 77628, \"totalSubmissionRaw\": 131390, \"acRate\": \"59.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1111","questionFrontendId":"1039","title":"Minimum Score Triangulation of Polygon","titleSlug":"minimum-score-triangulation-of-polygon","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.6K\", \"totalSubmission\": \"59K\", \"totalAcceptedRaw\": 32615, \"totalSubmissionRaw\": 58973, \"acRate\": \"55.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1117","questionFrontendId":"1162","title":"As Far from Land as Possible","titleSlug":"as-far-from-land-as-possible","translatedTitle":null,"stats":"{\"totalAccepted\": \"135.4K\", \"totalSubmission\": \"260.9K\", \"totalAcceptedRaw\": 135380, \"totalSubmissionRaw\": 260850, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1121","questionFrontendId":"1043","title":"Partition Array for Maximum Sum","titleSlug":"partition-array-for-maximum-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"68.5K\", \"totalSubmission\": \"95.7K\", \"totalAcceptedRaw\": 68457, \"totalSubmissionRaw\": 95699, \"acRate\": \"71.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1129","questionFrontendId":"1048","title":"Longest String Chain","titleSlug":"longest-string-chain","translatedTitle":null,"stats":"{\"totalAccepted\": \"302.1K\", \"totalSubmission\": \"509.9K\", \"totalAcceptedRaw\": 302070, \"totalSubmissionRaw\": 509934, \"acRate\": \"59.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1130","questionFrontendId":"1049","title":"Last Stone Weight II","titleSlug":"last-stone-weight-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.6K\", \"totalSubmission\": \"127.5K\", \"totalAcceptedRaw\": 67649, \"totalSubmissionRaw\": 127491, \"acRate\": \"53.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1134","questionFrontendId":"1182","title":"Shortest Distance to Target Color","titleSlug":"shortest-distance-to-target-color","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.2K\", \"totalSubmission\": \"60K\", \"totalAcceptedRaw\": 33200, \"totalSubmissionRaw\": 59974, \"acRate\": \"55.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1166","questionFrontendId":"1230","title":"Toss Strange Coins","titleSlug":"toss-strange-coins","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"23.3K\", \"totalAcceptedRaw\": 12553, \"totalSubmissionRaw\": 23270, \"acRate\": \"53.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Probability and Statistics","translatedName":null,"slug":"probability-and-statistics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1170","questionFrontendId":"1092","title":"Shortest Common Supersequence ","titleSlug":"shortest-common-supersequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"71.5K\", \"totalSubmission\": \"123.2K\", \"totalAcceptedRaw\": 71491, \"totalSubmissionRaw\": 123230, \"acRate\": \"58.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1178","questionFrontendId":"1216","title":"Valid Palindrome III","titleSlug":"valid-palindrome-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.4K\", \"totalSubmission\": \"86K\", \"totalAcceptedRaw\": 43370, \"totalSubmissionRaw\": 85966, \"acRate\": \"50.5%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1196","questionFrontendId":"1105","title":"Filling Bookcase Shelves","titleSlug":"filling-bookcase-shelves","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.6K\", \"totalSubmission\": \"75.2K\", \"totalAcceptedRaw\": 44608, \"totalSubmissionRaw\": 75185, \"acRate\": \"59.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1202","questionFrontendId":"1246","title":"Palindrome Removal","titleSlug":"palindrome-removal","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.9K\", \"totalSubmission\": \"21.3K\", \"totalAcceptedRaw\": 9868, \"totalSubmissionRaw\": 21348, \"acRate\": \"46.2%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1213","questionFrontendId":"1259","title":"Handshakes That Don't Cross","titleSlug":"handshakes-that-dont-cross","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"15.2K\", \"totalAcceptedRaw\": 9150, \"totalSubmissionRaw\": 15158, \"acRate\": \"60.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1220","questionFrontendId":"1125","title":"Smallest Sufficient Team","titleSlug":"smallest-sufficient-team","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.6K\", \"totalSubmission\": \"39.9K\", \"totalAcceptedRaw\": 18642, \"totalSubmissionRaw\": 39854, \"acRate\": \"46.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1224","questionFrontendId":"1289","title":"Minimum Falling Path Sum II","titleSlug":"minimum-falling-path-sum-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.8K\", \"totalSubmission\": \"68.1K\", \"totalAcceptedRaw\": 39831, \"totalSubmissionRaw\": 68057, \"acRate\": \"58.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1228","questionFrontendId":"1130","title":"Minimum Cost Tree From Leaf Values","titleSlug":"minimum-cost-tree-from-leaf-values","translatedTitle":null,"stats":"{\"totalAccepted\": \"83.5K\", \"totalSubmission\": \"122.2K\", \"totalAcceptedRaw\": 83489, \"totalSubmissionRaw\": 122197, \"acRate\": \"68.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1234","questionFrontendId":"1301","title":"Number of Paths with Max Score","titleSlug":"number-of-paths-with-max-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"11K\", \"totalSubmission\": \"28.3K\", \"totalAcceptedRaw\": 10962, \"totalSubmissionRaw\": 28263, \"acRate\": \"38.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1236","questionFrontendId":"1137","title":"N-th Tribonacci Number","titleSlug":"n-th-tribonacci-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"466.7K\", \"totalSubmission\": \"731.8K\", \"totalAcceptedRaw\": 466651, \"totalSubmissionRaw\": 731750, \"acRate\": \"63.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1239","questionFrontendId":"1139","title":"Largest 1-Bordered Square","titleSlug":"largest-1-bordered-square","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.9K\", \"totalSubmission\": \"43.6K\", \"totalAcceptedRaw\": 21865, \"totalSubmissionRaw\": 43586, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1240","questionFrontendId":"1140","title":"Stone Game II","titleSlug":"stone-game-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.7K\", \"totalSubmission\": \"70.6K\", \"totalAcceptedRaw\": 45741, \"totalSubmissionRaw\": 70629, \"acRate\": \"64.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1250","questionFrontendId":"1143","title":"Longest Common Subsequence","titleSlug":"longest-common-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"662.4K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 662420, \"totalSubmissionRaw\": 1133822, \"acRate\": \"58.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1251","questionFrontendId":"1147","title":"Longest Chunked Palindrome Decomposition","titleSlug":"longest-chunked-palindrome-decomposition","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.8K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 19821, \"totalSubmissionRaw\": 33394, \"acRate\": \"59.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1263","questionFrontendId":"1155","title":"Number of Dice Rolls With Target Sum","titleSlug":"number-of-dice-rolls-with-target-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"177.3K\", \"totalSubmission\": \"329.4K\", \"totalAcceptedRaw\": 177328, \"totalSubmissionRaw\": 329405, \"acRate\": \"53.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1277","questionFrontendId":"1363","title":"Largest Multiple of Three","titleSlug":"largest-multiple-of-three","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.9K\", \"totalSubmission\": \"50.9K\", \"totalAcceptedRaw\": 16942, \"totalSubmissionRaw\": 50921, \"acRate\": \"33.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1286","questionFrontendId":"1425","title":"Constrained Subsequence Sum","titleSlug":"constrained-subsequence-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.7K\", \"totalSubmission\": \"49.9K\", \"totalAcceptedRaw\": 23700, \"totalSubmissionRaw\": 49852, \"acRate\": \"47.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1288","questionFrontendId":"1186","title":"Maximum Subarray Sum with One Deletion","titleSlug":"maximum-subarray-sum-with-one-deletion","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.4K\", \"totalSubmission\": \"92.8K\", \"totalAcceptedRaw\": 38444, \"totalSubmissionRaw\": 92807, \"acRate\": \"41.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1290","questionFrontendId":"1187","title":"Make Array Strictly Increasing","titleSlug":"make-array-strictly-increasing","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.7K\", \"totalSubmission\": \"30.2K\", \"totalAcceptedRaw\": 13669, \"totalSubmissionRaw\": 30168, \"acRate\": \"45.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1296","questionFrontendId":"1483","title":"Kth Ancestor of a Tree Node","titleSlug":"kth-ancestor-of-a-tree-node","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.4K\", \"totalSubmission\": \"78.3K\", \"totalAcceptedRaw\": 26449, \"totalSubmissionRaw\": 78345, \"acRate\": \"33.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1299","questionFrontendId":"1191","title":"K-Concatenation Maximum Sum","titleSlug":"k-concatenation-maximum-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.6K\", \"totalSubmission\": \"124.3K\", \"totalAcceptedRaw\": 29560, \"totalSubmissionRaw\": 124340, \"acRate\": \"23.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1313","questionFrontendId":"1916","title":"Count Ways to Build Rooms in an Ant Colony","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"10.8K\", \"totalAcceptedRaw\": 5323, \"totalSubmissionRaw\": 10780, \"acRate\": \"49.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1324","questionFrontendId":"1706","title":"Where Will the Ball Fall","titleSlug":"where-will-the-ball-fall","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.7K\", \"totalSubmission\": \"174.4K\", \"totalAcceptedRaw\": 124660, \"totalSubmissionRaw\": 174408, \"acRate\": \"71.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1330","questionFrontendId":"1218","title":"Longest Arithmetic Subsequence of Given Difference","titleSlug":"longest-arithmetic-subsequence-of-given-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"59.6K\", \"totalSubmission\": \"114.9K\", \"totalAcceptedRaw\": 59633, \"totalSubmissionRaw\": 114943, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1332","questionFrontendId":"1220","title":"Count Vowels Permutation","titleSlug":"count-vowels-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"102.7K\", \"totalSubmission\": \"170.4K\", \"totalAcceptedRaw\": 102715, \"totalSubmissionRaw\": 170360, \"acRate\": \"60.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1334","questionFrontendId":"2310","title":"Sum of Numbers With Units Digit K","titleSlug":"sum-of-numbers-with-units-digit-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.3K\", \"totalSubmission\": \"82.6K\", \"totalAcceptedRaw\": 21273, \"totalSubmissionRaw\": 82598, \"acRate\": \"25.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1343","questionFrontendId":"1223","title":"Dice Roll Simulation","titleSlug":"dice-roll-simulation","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.2K\", \"totalSubmission\": \"51.8K\", \"totalAcceptedRaw\": 25217, \"totalSubmissionRaw\": 51829, \"acRate\": \"48.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1348","questionFrontendId":"2321","title":"Maximum Score Of Spliced Array","titleSlug":"maximum-score-of-spliced-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.3K\", \"totalSubmission\": \"27.5K\", \"totalAcceptedRaw\": 15345, \"totalSubmissionRaw\": 27516, \"acRate\": \"55.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1352","questionFrontendId":"1235","title":"Maximum Profit in Job Scheduling","titleSlug":"maximum-profit-in-job-scheduling","translatedTitle":null,"stats":"{\"totalAccepted\": \"178.8K\", \"totalSubmission\": \"334.7K\", \"totalAcceptedRaw\": 178833, \"totalSubmissionRaw\": 334691, \"acRate\": \"53.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1361","questionFrontendId":"1240","title":"Tiling a Rectangle with the Fewest Squares","titleSlug":"tiling-a-rectangle-with-the-fewest-squares","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"39.2K\", \"totalAcceptedRaw\": 21172, \"totalSubmissionRaw\": 39214, \"acRate\": \"54.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1362","questionFrontendId":"1227","title":"Airplane Seat Assignment Probability","titleSlug":"airplane-seat-assignment-probability","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.5K\", \"totalSubmission\": \"49.5K\", \"totalAcceptedRaw\": 32505, \"totalSubmissionRaw\": 49546, \"acRate\": \"65.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"},{"name":"Probability and Statistics","translatedName":null,"slug":"probability-and-statistics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1367","questionFrontendId":"1691","title":"Maximum Height by Stacking Cuboids ","titleSlug":"maximum-height-by-stacking-cuboids","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.1K\", \"totalSubmission\": \"31.5K\", \"totalAcceptedRaw\": 17144, \"totalSubmissionRaw\": 31539, \"acRate\": \"54.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1376","questionFrontendId":"2312","title":"Selling Pieces of Wood","titleSlug":"selling-pieces-of-wood","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.7K\", \"totalSubmission\": \"16K\", \"totalAcceptedRaw\": 7731, \"totalSubmissionRaw\": 15963, \"acRate\": \"48.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1381","questionFrontendId":"1255","title":"Maximum Score Words Formed by Letters","titleSlug":"maximum-score-words-formed-by-letters","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.3K\", \"totalSubmission\": \"40.4K\", \"totalAcceptedRaw\": 29283, \"totalSubmissionRaw\": 40433, \"acRate\": \"72.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1385","questionFrontendId":"2189","title":"Number of Ways to Build House of Cards","titleSlug":"number-of-ways-to-build-house-of-cards","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5K\", \"totalSubmission\": \"2.3K\", \"totalAcceptedRaw\": 1469, \"totalSubmissionRaw\": 2344, \"acRate\": \"62.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1388","questionFrontendId":"1262","title":"Greatest Sum Divisible by Three","titleSlug":"greatest-sum-divisible-by-three","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.3K\", \"totalSubmission\": \"89.1K\", \"totalAcceptedRaw\": 45254, \"totalSubmissionRaw\": 89061, \"acRate\": \"50.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1393","questionFrontendId":"2218","title":"Maximum Value of K Coins From Piles","titleSlug":"maximum-value-of-k-coins-from-piles","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"28.6K\", \"totalAcceptedRaw\": 13768, \"totalSubmissionRaw\": 28569, \"acRate\": \"48.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1394","questionFrontendId":"2304","title":"Minimum Path Cost in a Grid","titleSlug":"minimum-path-cost-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.9K\", \"totalSubmission\": \"31.8K\", \"totalAcceptedRaw\": 20909, \"totalSubmissionRaw\": 31800, \"acRate\": \"65.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1398","questionFrontendId":"1269","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.6K\", \"totalSubmission\": \"72.7K\", \"totalAcceptedRaw\": 31639, \"totalSubmissionRaw\": 72703, \"acRate\": \"43.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1402","questionFrontendId":"1277","title":"Count Square Submatrices with All Ones","titleSlug":"count-square-submatrices-with-all-ones","translatedTitle":null,"stats":"{\"totalAccepted\": \"190.8K\", \"totalSubmission\": \"256.2K\", \"totalAcceptedRaw\": 190846, \"totalSubmissionRaw\": 256157, \"acRate\": \"74.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1403","questionFrontendId":"1278","title":"Palindrome Partitioning III","titleSlug":"palindrome-partitioning-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.8K\", \"totalSubmission\": \"37.5K\", \"totalAcceptedRaw\": 22794, \"totalSubmissionRaw\": 37493, \"acRate\": \"60.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1418","questionFrontendId":"2305","title":"Fair Distribution of Cookies","titleSlug":"fair-distribution-of-cookies","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"36K\", \"totalAcceptedRaw\": 22289, \"totalSubmissionRaw\": 36014, \"acRate\": \"61.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1419","questionFrontendId":"2263","title":"Make Array Non-decreasing or Non-increasing","titleSlug":"make-array-non-decreasing-or-non-increasing","translatedTitle":null,"stats":"{\"totalAccepted\": \"950\", \"totalSubmission\": \"1.4K\", \"totalAcceptedRaw\": 950, \"totalSubmissionRaw\": 1412, \"acRate\": \"67.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1437","questionFrontendId":"1312","title":"Minimum Insertion Steps to Make a String Palindrome","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome","translatedTitle":null,"stats":"{\"totalAccepted\": \"74.5K\", \"totalSubmission\": \"112.5K\", \"totalAcceptedRaw\": 74526, \"totalSubmissionRaw\": 112472, \"acRate\": \"66.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1443","questionFrontendId":"1320","title":"Minimum Distance to Type a Word Using Two Fingers","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.4K\", \"totalSubmission\": \"46.1K\", \"totalAcceptedRaw\": 27441, \"totalSubmissionRaw\": 46108, \"acRate\": \"59.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1451","questionFrontendId":"1326","title":"Minimum Number of Taps to Open to Water a Garden","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.5K\", \"totalSubmission\": \"141.8K\", \"totalAcceptedRaw\": 67547, \"totalSubmissionRaw\": 141782, \"acRate\": \"47.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1456","questionFrontendId":"1334","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"59.6K\", \"totalSubmission\": \"109.6K\", \"totalAcceptedRaw\": 59603, \"totalSubmissionRaw\": 109596, \"acRate\": \"54.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1457","questionFrontendId":"1335","title":"Minimum Difficulty of a Job Schedule","titleSlug":"minimum-difficulty-of-a-job-schedule","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.2K\", \"totalSubmission\": \"203.7K\", \"totalAcceptedRaw\": 119247, \"totalSubmissionRaw\": 203668, \"acRate\": \"58.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1461","questionFrontendId":"1359","title":"Count All Valid Pickup and Delivery Options","titleSlug":"count-all-valid-pickup-and-delivery-options","translatedTitle":null,"stats":"{\"totalAccepted\": \"58K\", \"totalSubmission\": \"92.5K\", \"totalAcceptedRaw\": 58021, \"totalSubmissionRaw\": 92515, \"acRate\": \"62.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1466","questionFrontendId":"1340","title":"Jump Game V","titleSlug":"jump-game-v","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.8K\", \"totalSubmission\": \"39.7K\", \"totalAcceptedRaw\": 24845, \"totalSubmissionRaw\": 39736, \"acRate\": \"62.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1471","questionFrontendId":"1349","title":"Maximum Students Taking Exam","titleSlug":"maximum-students-taking-exam","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.7K\", \"totalSubmission\": \"26K\", \"totalAcceptedRaw\": 12718, \"totalSubmissionRaw\": 25989, \"acRate\": \"48.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1474","questionFrontendId":"1372","title":"Longest ZigZag Path in a Binary Tree","titleSlug":"longest-zigzag-path-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.7K\", \"totalSubmission\": \"75.9K\", \"totalAcceptedRaw\": 45666, \"totalSubmissionRaw\": 75875, \"acRate\": \"60.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1475","questionFrontendId":"1373","title":"Maximum Sum BST in Binary Tree","titleSlug":"maximum-sum-bst-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.9K\", \"totalSubmission\": \"124.1K\", \"totalAcceptedRaw\": 48929, \"totalSubmissionRaw\": 124062, \"acRate\": \"39.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1488","questionFrontendId":"1387","title":"Sort Integers by The Power Value","titleSlug":"sort-integers-by-the-power-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"75.6K\", \"totalSubmission\": \"107.9K\", \"totalAcceptedRaw\": 75629, \"totalSubmissionRaw\": 107916, \"acRate\": \"70.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1489","questionFrontendId":"1388","title":"Pizza With 3n Slices","titleSlug":"pizza-with-3n-slices","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"27.5K\", \"totalAcceptedRaw\": 13811, \"totalSubmissionRaw\": 27525, \"acRate\": \"50.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1503","questionFrontendId":"1402","title":"Reducing Dishes","titleSlug":"reducing-dishes","translatedTitle":null,"stats":"{\"totalAccepted\": \"53.8K\", \"totalSubmission\": \"74.8K\", \"totalAcceptedRaw\": 53835, \"totalSubmissionRaw\": 74750, \"acRate\": \"72.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1511","questionFrontendId":"1395","title":"Count Number of Teams","titleSlug":"count-number-of-teams","translatedTitle":null,"stats":"{\"totalAccepted\": \"99.6K\", \"totalSubmission\": \"147.9K\", \"totalAcceptedRaw\": 99588, \"totalSubmissionRaw\": 147895, \"acRate\": \"67.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1513","questionFrontendId":"1397","title":"Find All Good Strings","titleSlug":"find-all-good-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.1K\", \"totalSubmission\": \"12.1K\", \"totalAcceptedRaw\": 5141, \"totalSubmissionRaw\": 12147, \"acRate\": \"42.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1517","questionFrontendId":"1416","title":"Restore The Array","titleSlug":"restore-the-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.6K\", \"totalSubmission\": \"37.9K\", \"totalAcceptedRaw\": 14639, \"totalSubmissionRaw\": 37859, \"acRate\": \"38.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1522","questionFrontendId":"1406","title":"Stone Game III","titleSlug":"stone-game-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.2K\", \"totalSubmission\": \"70.9K\", \"totalAcceptedRaw\": 42223, \"totalSubmissionRaw\": 70908, \"acRate\": \"59.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1527","questionFrontendId":"1411","title":"Number of Ways to Paint N \u00d7 3 Grid","titleSlug":"number-of-ways-to-paint-n-3-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.4K\", \"totalSubmission\": \"45.6K\", \"totalAcceptedRaw\": 28443, \"totalSubmissionRaw\": 45567, \"acRate\": \"62.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1531","questionFrontendId":"1434","title":"Number of Ways to Wear Different Hats to Each Other","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.4K\", \"totalSubmission\": \"26.6K\", \"totalAcceptedRaw\": 11431, \"totalSubmissionRaw\": 26557, \"acRate\": \"43.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1535","questionFrontendId":"1420","title":"Build Array Where You Can Find The Maximum Exactly K Comparisons","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.2K\", \"totalSubmission\": \"17.8K\", \"totalAcceptedRaw\": 11232, \"totalSubmissionRaw\": 17795, \"acRate\": \"63.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1545","questionFrontendId":"1449","title":"Form Largest Integer With Digits That Add up to Target","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.6K\", \"totalSubmission\": \"30.6K\", \"totalAcceptedRaw\": 14621, \"totalSubmissionRaw\": 30640, \"acRate\": \"47.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1555","questionFrontendId":"1444","title":"Number of Ways of Cutting a Pizza","titleSlug":"number-of-ways-of-cutting-a-pizza","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.3K\", \"totalSubmission\": \"45K\", \"totalAcceptedRaw\": 25266, \"totalSubmissionRaw\": 45020, \"acRate\": \"56.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1559","questionFrontendId":"1463","title":"Cherry Pickup II","titleSlug":"cherry-pickup-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.1K\", \"totalSubmission\": \"112.1K\", \"totalAcceptedRaw\": 78080, \"totalSubmissionRaw\": 112093, \"acRate\": \"69.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1569","questionFrontendId":"1458","title":"Max Dot Product of Two Subsequences","titleSlug":"max-dot-product-of-two-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.4K\", \"totalSubmission\": \"41.6K\", \"totalAcceptedRaw\": 19385, \"totalSubmissionRaw\": 41598, \"acRate\": \"46.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1571","questionFrontendId":"1478","title":"Allocate Mailboxes","titleSlug":"allocate-mailboxes","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"35.8K\", \"totalAcceptedRaw\": 19894, \"totalSubmissionRaw\": 35815, \"acRate\": \"55.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1573","questionFrontendId":"1477","title":"Find Two Non-overlapping Sub-arrays Each With Target Sum","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.1K\", \"totalSubmission\": \"117.1K\", \"totalAcceptedRaw\": 43129, \"totalSubmissionRaw\": 117109, \"acRate\": \"36.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1577","questionFrontendId":"1467","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"7K\", \"totalSubmission\": \"11.6K\", \"totalAcceptedRaw\": 7024, \"totalSubmissionRaw\": 11561, \"acRate\": \"60.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Probability and Statistics","translatedName":null,"slug":"probability-and-statistics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1583","questionFrontendId":"1473","title":"Paint House III","titleSlug":"paint-house-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"55K\", \"totalSubmission\": \"89.3K\", \"totalAcceptedRaw\": 55037, \"totalSubmissionRaw\": 89327, \"acRate\": \"61.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1586","questionFrontendId":"1493","title":"Longest Subarray of 1's After Deleting One Element","titleSlug":"longest-subarray-of-1s-after-deleting-one-element","translatedTitle":null,"stats":"{\"totalAccepted\": \"58K\", \"totalSubmission\": \"96.2K\", \"totalAcceptedRaw\": 58044, \"totalSubmissionRaw\": 96214, \"acRate\": \"60.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1587","questionFrontendId":"1494","title":"Parallel Courses II","titleSlug":"parallel-courses-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.5K\", \"totalSubmission\": \"44.5K\", \"totalAcceptedRaw\": 13528, \"totalSubmissionRaw\": 44467, \"acRate\": \"30.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1617","questionFrontendId":"1510","title":"Stone Game IV","titleSlug":"stone-game-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"64.4K\", \"totalSubmission\": \"106.7K\", \"totalAcceptedRaw\": 64411, \"totalSubmissionRaw\": 106676, \"acRate\": \"60.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1628","questionFrontendId":"1504","title":"Count Submatrices With All Ones","titleSlug":"count-submatrices-with-all-ones","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.2K\", \"totalSubmission\": \"75K\", \"totalAcceptedRaw\": 43164, \"totalSubmissionRaw\": 75010, \"acRate\": \"57.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1631","questionFrontendId":"1524","title":"Number of Sub-arrays With Odd Sum","titleSlug":"number-of-sub-arrays-with-odd-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.5K\", \"totalSubmission\": \"72.8K\", \"totalAcceptedRaw\": 31509, \"totalSubmissionRaw\": 72836, \"acRate\": \"43.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1632","questionFrontendId":"1525","title":"Number of Good Ways to Split a String","titleSlug":"number-of-good-ways-to-split-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"87.9K\", \"totalSubmission\": \"127.4K\", \"totalAcceptedRaw\": 87869, \"totalSubmissionRaw\": 127374, \"acRate\": \"69.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1633","questionFrontendId":"1526","title":"Minimum Number of Increments on Subarrays to Form a Target Array","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.6K\", \"totalSubmission\": \"44.7K\", \"totalAcceptedRaw\": 30642, \"totalSubmissionRaw\": 44713, \"acRate\": \"68.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1637","questionFrontendId":"1531","title":"String Compression II","titleSlug":"string-compression-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.2K\", \"totalSubmission\": \"87.2K\", \"totalAcceptedRaw\": 43183, \"totalSubmissionRaw\": 87171, \"acRate\": \"49.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1659","questionFrontendId":"1537","title":"Get the Maximum Score","titleSlug":"get-the-maximum-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.1K\", \"totalSubmission\": \"53.8K\", \"totalAcceptedRaw\": 21144, \"totalSubmissionRaw\": 53756, \"acRate\": \"39.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1669","questionFrontendId":"1547","title":"Minimum Cost to Cut a Stick","titleSlug":"minimum-cost-to-cut-a-stick","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.4K\", \"totalSubmission\": \"79.5K\", \"totalAcceptedRaw\": 45370, \"totalSubmissionRaw\": 79478, \"acRate\": \"57.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1676","questionFrontendId":"1553","title":"Minimum Number of Days to Eat N Oranges","titleSlug":"minimum-number-of-days-to-eat-n-oranges","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.1K\", \"totalSubmission\": \"83.9K\", \"totalAcceptedRaw\": 29132, \"totalSubmissionRaw\": 83866, \"acRate\": \"34.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1680","questionFrontendId":"1575","title":"Count All Possible Routes","titleSlug":"count-all-possible-routes","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"22.2K\", \"totalAcceptedRaw\": 12612, \"totalSubmissionRaw\": 22223, \"acRate\": \"56.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1685","questionFrontendId":"1563","title":"Stone Game V","titleSlug":"stone-game-v","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.5K\", \"totalSubmission\": \"38.4K\", \"totalAcceptedRaw\": 15507, \"totalSubmissionRaw\": 38438, \"acRate\": \"40.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1687","questionFrontendId":"1548","title":"The Most Similar Path in a Graph","titleSlug":"the-most-similar-path-in-a-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.6K\", \"totalSubmission\": \"25.7K\", \"totalAcceptedRaw\": 14649, \"totalSubmissionRaw\": 25670, \"acRate\": \"57.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1690","questionFrontendId":"1567","title":"Maximum Length of Subarray With Positive Product","titleSlug":"maximum-length-of-subarray-with-positive-product","translatedTitle":null,"stats":"{\"totalAccepted\": \"81.7K\", \"totalSubmission\": \"185.6K\", \"totalAcceptedRaw\": 81666, \"totalSubmissionRaw\": 185628, \"acRate\": \"44.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1692","questionFrontendId":"1569","title":"Number of Ways to Reorder Array to Get Same BST","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"24.4K\", \"totalAcceptedRaw\": 11685, \"totalSubmissionRaw\": 24422, \"acRate\": \"47.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1700","questionFrontendId":"1578","title":"Minimum Time to Make Rope Colorful","titleSlug":"minimum-time-to-make-rope-colorful","translatedTitle":null,"stats":"{\"totalAccepted\": \"144.9K\", \"totalSubmission\": \"228.1K\", \"totalAcceptedRaw\": 144852, \"totalSubmissionRaw\": 228129, \"acRate\": \"63.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1716","questionFrontendId":"1594","title":"Maximum Non Negative Product in a Matrix","titleSlug":"maximum-non-negative-product-in-a-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.2K\", \"totalSubmission\": \"61.1K\", \"totalAcceptedRaw\": 20234, \"totalSubmissionRaw\": 61119, \"acRate\": \"33.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1717","questionFrontendId":"1595","title":"Minimum Cost to Connect Two Groups of Points","titleSlug":"minimum-cost-to-connect-two-groups-of-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.2K\", \"totalSubmission\": \"15.5K\", \"totalAcceptedRaw\": 7189, \"totalSubmissionRaw\": 15474, \"acRate\": \"46.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1725","questionFrontendId":"1621","title":"Number of Sets of K Non-Overlapping Line Segments","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.1K\", \"totalSubmission\": \"19.2K\", \"totalAcceptedRaw\": 8144, \"totalSubmissionRaw\": 19239, \"acRate\": \"42.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1727","questionFrontendId":"1728","title":"Cat and Mouse II","titleSlug":"cat-and-mouse-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"14.3K\", \"totalAcceptedRaw\": 5730, \"totalSubmissionRaw\": 14349, \"acRate\": \"39.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1732","questionFrontendId":"1611","title":"Minimum One Bit Operations to Make Integers Zero","titleSlug":"minimum-one-bit-operations-to-make-integers-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.5K\", \"totalSubmission\": \"19.8K\", \"totalAcceptedRaw\": 12543, \"totalSubmissionRaw\": 19806, \"acRate\": \"63.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1740","questionFrontendId":"1617","title":"Count Subtrees With Max Distance Between Cities","titleSlug":"count-subtrees-with-max-distance-between-cities","translatedTitle":null,"stats":"{\"totalAccepted\": \"8K\", \"totalSubmission\": \"12.1K\", \"totalAcceptedRaw\": 7981, \"totalSubmissionRaw\": 12078, \"acRate\": \"66.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1743","questionFrontendId":"1638","title":"Count Substrings That Differ by One Character","titleSlug":"count-substrings-that-differ-by-one-character","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.9K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 23871, \"totalSubmissionRaw\": 33444, \"acRate\": \"71.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1744","questionFrontendId":"1639","title":"Number of Ways to Form a Target String Given a Dictionary","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.4K\", \"totalSubmission\": \"24.1K\", \"totalAcceptedRaw\": 10410, \"totalSubmissionRaw\": 24079, \"acRate\": \"43.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1748","questionFrontendId":"1626","title":"Best Team With No Conflicts","titleSlug":"best-team-with-no-conflicts","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.1K\", \"totalSubmission\": \"137.1K\", \"totalAcceptedRaw\": 70104, \"totalSubmissionRaw\": 137060, \"acRate\": \"51.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1756","questionFrontendId":"1653","title":"Minimum Deletions to Make String Balanced","titleSlug":"minimum-deletions-to-make-string-balanced","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.6K\", \"totalSubmission\": \"56.8K\", \"totalAcceptedRaw\": 33576, \"totalSubmissionRaw\": 56812, \"acRate\": \"59.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1757","questionFrontendId":"1654","title":"Minimum Jumps to Reach Home","titleSlug":"minimum-jumps-to-reach-home","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.6K\", \"totalSubmission\": \"119.2K\", \"totalAcceptedRaw\": 34578, \"totalSubmissionRaw\": 119164, \"acRate\": \"29.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1758","questionFrontendId":"1655","title":"Distribute Repeating Integers","titleSlug":"distribute-repeating-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.2K\", \"totalSubmission\": \"26.1K\", \"totalAcceptedRaw\": 10163, \"totalSubmissionRaw\": 26134, \"acRate\": \"38.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1761","questionFrontendId":"1641","title":"Count Sorted Vowel Strings","titleSlug":"count-sorted-vowel-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"154.2K\", \"totalSubmission\": \"199.3K\", \"totalAcceptedRaw\": 154180, \"totalSubmissionRaw\": 199274, \"acRate\": \"77.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1766","questionFrontendId":"1671","title":"Minimum Number of Removals to Make Mountain Array","titleSlug":"minimum-number-of-removals-to-make-mountain-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.7K\", \"totalSubmission\": \"48.7K\", \"totalAcceptedRaw\": 20674, \"totalSubmissionRaw\": 48695, \"acRate\": \"42.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1769","questionFrontendId":"1646","title":"Get Maximum in Generated Array","titleSlug":"get-maximum-in-generated-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"84.1K\", \"totalSubmission\": \"167.6K\", \"totalAcceptedRaw\": 84069, \"totalSubmissionRaw\": 167598, \"acRate\": \"50.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1778","questionFrontendId":"1659","title":"Maximize Grid Happiness","titleSlug":"maximize-grid-happiness","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"11.2K\", \"totalAcceptedRaw\": 4279, \"totalSubmissionRaw\": 11210, \"acRate\": \"38.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1783","questionFrontendId":"1664","title":"Ways to Make a Fair Array","titleSlug":"ways-to-make-a-fair-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.1K\", \"totalSubmission\": \"47.4K\", \"totalAcceptedRaw\": 30068, \"totalSubmissionRaw\": 47371, \"acRate\": \"63.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1789","questionFrontendId":"1687","title":"Delivering Boxes from Storage to Ports","titleSlug":"delivering-boxes-from-storage-to-ports","translatedTitle":null,"stats":"{\"totalAccepted\": \"5K\", \"totalSubmission\": \"12.8K\", \"totalAcceptedRaw\": 4956, \"totalSubmissionRaw\": 12791, \"acRate\": \"38.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1799","questionFrontendId":"1681","title":"Minimum Incompatibility","titleSlug":"minimum-incompatibility","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.7K\", \"totalSubmission\": \"18K\", \"totalAcceptedRaw\": 6735, \"totalSubmissionRaw\": 18002, \"acRate\": \"37.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1808","questionFrontendId":"1690","title":"Stone Game VII","titleSlug":"stone-game-vii","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.1K\", \"totalSubmission\": \"51.7K\", \"totalAcceptedRaw\": 30081, \"totalSubmissionRaw\": 51720, \"acRate\": \"58.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1809","questionFrontendId":"1714","title":"Sum Of Special Evenly-Spaced Elements In Array","titleSlug":"sum-of-special-evenly-spaced-elements-in-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1K\", \"totalSubmission\": \"2.3K\", \"totalAcceptedRaw\": 1128, \"totalSubmissionRaw\": 2298, \"acRate\": \"49.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1814","questionFrontendId":"1696","title":"Jump Game VI","titleSlug":"jump-game-vi","translatedTitle":null,"stats":"{\"totalAccepted\": \"97.4K\", \"totalSubmission\": \"211.4K\", \"totalAcceptedRaw\": 97397, \"totalSubmissionRaw\": 211365, \"acRate\": \"46.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1822","questionFrontendId":"1682","title":"Longest Palindromic Subsequence II","titleSlug":"longest-palindromic-subsequence-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"9.1K\", \"totalAcceptedRaw\": 4496, \"totalSubmissionRaw\": 9069, \"acRate\": \"49.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1825","questionFrontendId":"1723","title":"Find Minimum Time to Finish All Jobs","titleSlug":"find-minimum-time-to-finish-all-jobs","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.3K\", \"totalSubmission\": \"47.7K\", \"totalAcceptedRaw\": 20251, \"totalSubmissionRaw\": 47657, \"acRate\": \"42.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1828","questionFrontendId":"1692","title":"Count Ways to Distribute Candies","titleSlug":"count-ways-to-distribute-candies","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.1K\", \"totalSubmission\": \"3.3K\", \"totalAcceptedRaw\": 2051, \"totalSubmissionRaw\": 3296, \"acRate\": \"62.2%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1836","questionFrontendId":"1735","title":"Count Ways to Make Array With Product","titleSlug":"count-ways-to-make-array-with-product","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"8.9K\", \"totalAcceptedRaw\": 4456, \"totalSubmissionRaw\": 8862, \"acRate\": \"50.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1841","questionFrontendId":"10002","title":"Design Log Aggregation System","titleSlug":"design-log-aggregation-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5K\", \"totalSubmission\": \"3.1K\", \"totalAcceptedRaw\": 1498, \"totalSubmissionRaw\": 3126, \"acRate\": \"47.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1846","questionFrontendId":"10003","title":"Design Consistent Hashing Algorithm","titleSlug":"design-consistent-hashing-algorithm","translatedTitle":null,"stats":"{\"totalAccepted\": \"313\", \"totalSubmission\": \"2.2K\", \"totalAcceptedRaw\": 313, \"totalSubmissionRaw\": 2230, \"acRate\": \"14.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1849","questionFrontendId":"1749","title":"Maximum Absolute Sum of Any Subarray","titleSlug":"maximum-absolute-sum-of-any-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.2K\", \"totalSubmission\": \"51.6K\", \"totalAcceptedRaw\": 30175, \"totalSubmissionRaw\": 51647, \"acRate\": \"58.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1851","questionFrontendId":"1751","title":"Maximum Number of Events That Can Be Attended II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"21K\", \"totalSubmission\": \"36.9K\", \"totalAcceptedRaw\": 20983, \"totalSubmissionRaw\": 36900, \"acRate\": \"56.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1871","questionFrontendId":"1745","title":"Palindrome Partitioning IV","titleSlug":"palindrome-partitioning-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.4K\", \"totalSubmission\": \"42.6K\", \"totalAcceptedRaw\": 19370, \"totalSubmissionRaw\": 42621, \"acRate\": \"45.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1881","questionFrontendId":"1755","title":"Closest Subsequence Sum","titleSlug":"closest-subsequence-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"32K\", \"totalAcceptedRaw\": 11748, \"totalSubmissionRaw\": 32027, \"acRate\": \"36.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1893","questionFrontendId":"1746","title":"Maximum Subarray Sum After One Operation","titleSlug":"maximum-subarray-sum-after-one-operation","translatedTitle":null,"stats":"{\"totalAccepted\": \"8K\", \"totalSubmission\": \"12.9K\", \"totalAcceptedRaw\": 8019, \"totalSubmissionRaw\": 12881, \"acRate\": \"62.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1896","questionFrontendId":"1770","title":"Maximum Score from Performing Multiplication Operations","titleSlug":"maximum-score-from-performing-multiplication-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"91.9K\", \"totalSubmission\": \"246.1K\", \"totalAcceptedRaw\": 91931, \"totalSubmissionRaw\": 246128, \"acRate\": \"37.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1897","questionFrontendId":"1771","title":"Maximize Palindrome Length From Subsequences","titleSlug":"maximize-palindrome-length-from-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"9K\", \"totalSubmission\": \"25.6K\", \"totalAcceptedRaw\": 9048, \"totalSubmissionRaw\": 25647, \"acRate\": \"35.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1900","questionFrontendId":"1774","title":"Closest Dessert Cost","titleSlug":"closest-dessert-cost","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.5K\", \"totalSubmission\": \"51.8K\", \"totalAcceptedRaw\": 24532, \"totalSubmissionRaw\": 51757, \"acRate\": \"47.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1906","questionFrontendId":"1799","title":"Maximize Score After N Operations","titleSlug":"maximize-score-after-n-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.9K\", \"totalSubmission\": \"34.5K\", \"totalAcceptedRaw\": 15865, \"totalSubmissionRaw\": 34490, \"acRate\": \"46.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1912","questionFrontendId":"1786","title":"Number of Restricted Paths From First to Last Node","titleSlug":"number-of-restricted-paths-from-first-to-last-node","translatedTitle":null,"stats":"{\"totalAccepted\": \"18K\", \"totalSubmission\": \"45.8K\", \"totalAcceptedRaw\": 18013, \"totalSubmissionRaw\": 45808, \"acRate\": \"39.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1913","questionFrontendId":"1787","title":"Make the XOR of All Segments Equal to Zero","titleSlug":"make-the-xor-of-all-segments-equal-to-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"11K\", \"totalAcceptedRaw\": 4345, \"totalSubmissionRaw\": 11026, \"acRate\": \"39.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1924","questionFrontendId":"1815","title":"Maximum Number of Groups Getting Fresh Donuts","titleSlug":"maximum-number-of-groups-getting-fresh-donuts","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"13.4K\", \"totalAcceptedRaw\": 5377, \"totalSubmissionRaw\": 13425, \"acRate\": \"40.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1952","questionFrontendId":"1824","title":"Minimum Sideway Jumps","titleSlug":"minimum-sideway-jumps","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.3K\", \"totalSubmission\": \"53.3K\", \"totalAcceptedRaw\": 26347, \"totalSubmissionRaw\": 53309, \"acRate\": \"49.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1986","questionFrontendId":"1857","title":"Largest Color Value in a Directed Graph","titleSlug":"largest-color-value-in-a-directed-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.9K\", \"totalSubmission\": \"36.5K\", \"totalAcceptedRaw\": 14891, \"totalSubmissionRaw\": 36525, \"acRate\": \"40.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1989","questionFrontendId":"1879","title":"Minimum XOR Sum of Two Arrays","titleSlug":"minimum-xor-sum-of-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.4K\", \"totalSubmission\": \"23.1K\", \"totalAcceptedRaw\": 10396, \"totalSubmissionRaw\": 23089, \"acRate\": \"45.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1996","questionFrontendId":"1866","title":"Number of Ways to Rearrange Sticks With K Sticks Visible","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.7K\", \"totalSubmission\": \"19.2K\", \"totalAcceptedRaw\": 10701, \"totalSubmissionRaw\": 19239, \"acRate\": \"55.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2002","questionFrontendId":"1872","title":"Stone Game VIII","titleSlug":"stone-game-viii","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.2K\", \"totalSubmission\": \"13.7K\", \"totalAcceptedRaw\": 7203, \"totalSubmissionRaw\": 13677, \"acRate\": \"52.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2007","questionFrontendId":"2247","title":"Maximum Cost of Trip With K Highways","titleSlug":"maximum-cost-of-trip-with-k-highways","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2K\", \"totalSubmission\": \"2.3K\", \"totalAcceptedRaw\": 1152, \"totalSubmissionRaw\": 2271, \"acRate\": \"50.7%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2008","questionFrontendId":"1896","title":"Minimum Cost to Change the Final Value of Expression","titleSlug":"minimum-cost-to-change-the-final-value-of-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"6K\", \"totalAcceptedRaw\": 3268, \"totalSubmissionRaw\": 5971, \"acRate\": \"54.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2013","questionFrontendId":"1883","title":"Minimum Skips to Arrive at Meeting On Time","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.5K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 5494, \"totalSubmissionRaw\": 14365, \"acRate\": \"38.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2017","questionFrontendId":"1888","title":"Minimum Number of Flips to Make the Binary String Alternating","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"46.1K\", \"totalAcceptedRaw\": 17862, \"totalSubmissionRaw\": 46074, \"acRate\": \"38.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2022","questionFrontendId":"1911","title":"Maximum Alternating Subsequence Sum","titleSlug":"maximum-alternating-subsequence-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.8K\", \"totalSubmission\": \"40.1K\", \"totalAcceptedRaw\": 23763, \"totalSubmissionRaw\": 40089, \"acRate\": \"59.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2028","questionFrontendId":"1900","title":"The Earliest and Latest Rounds Where Players Compete","titleSlug":"the-earliest-and-latest-rounds-where-players-compete","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"9K\", \"totalAcceptedRaw\": 4634, \"totalSubmissionRaw\": 8956, \"acRate\": \"51.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2031","questionFrontendId":"1884","title":"Egg Drop With 2 Eggs and N Floors","titleSlug":"egg-drop-with-2-eggs-and-n-floors","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.1K\", \"totalSubmission\": \"46.7K\", \"totalAcceptedRaw\": 33072, \"totalSubmissionRaw\": 46714, \"acRate\": \"70.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2040","questionFrontendId":"1928","title":"Minimum Cost to Reach Destination in Time","titleSlug":"minimum-cost-to-reach-destination-in-time","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.3K\", \"totalSubmission\": \"37.9K\", \"totalAcceptedRaw\": 14299, \"totalSubmissionRaw\": 37855, \"acRate\": \"37.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2056","questionFrontendId":"2297","title":"Jump Game VIII","titleSlug":"jump-game-viii","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"2.5K\", \"totalAcceptedRaw\": 1423, \"totalSubmissionRaw\": 2536, \"acRate\": \"56.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2061","questionFrontendId":"1931","title":"Painting a Grid With Three Different Colors","titleSlug":"painting-a-grid-with-three-different-colors","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.5K\", \"totalSubmission\": \"13.2K\", \"totalAcceptedRaw\": 7538, \"totalSubmissionRaw\": 13195, \"acRate\": \"57.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2062","questionFrontendId":"1908","title":"Game of Nim","titleSlug":"game-of-nim","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.8K\", \"totalSubmission\": \"6K\", \"totalAcceptedRaw\": 3849, \"totalSubmissionRaw\": 5963, \"acRate\": \"64.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2067","questionFrontendId":"1937","title":"Maximum Number of Points with Cost","titleSlug":"maximum-number-of-points-with-cost","translatedTitle":null,"stats":"{\"totalAccepted\": \"53.8K\", \"totalSubmission\": \"149K\", \"totalAcceptedRaw\": 53796, \"totalSubmissionRaw\": 148959, \"acRate\": \"36.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2078","questionFrontendId":"1947","title":"Maximum Compatibility Score Sum","titleSlug":"maximum-compatibility-score-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.1K\", \"totalSubmission\": \"31.3K\", \"totalAcceptedRaw\": 19085, \"totalSubmissionRaw\": 31295, \"acRate\": \"61.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2081","questionFrontendId":"1959","title":"Minimum Total Space Wasted With K Resizing Operations","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.8K\", \"totalSubmission\": \"16K\", \"totalAcceptedRaw\": 6753, \"totalSubmissionRaw\": 15957, \"acRate\": \"42.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2082","questionFrontendId":"2052","title":"Minimum Cost to Separate Sentence Into Rows","titleSlug":"minimum-cost-to-separate-sentence-into-rows","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"2.7K\", \"totalAcceptedRaw\": 1366, \"totalSubmissionRaw\": 2724, \"acRate\": \"50.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2086","questionFrontendId":"1955","title":"Count Number of Special Subsequences","titleSlug":"count-number-of-special-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"18K\", \"totalAcceptedRaw\": 9243, \"totalSubmissionRaw\": 18037, \"acRate\": \"51.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2090","questionFrontendId":"1976","title":"Number of Ways to Arrive at Destination","titleSlug":"number-of-ways-to-arrive-at-destination","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.3K\", \"totalSubmission\": \"91.4K\", \"totalAcceptedRaw\": 28338, \"totalSubmissionRaw\": 91413, \"acRate\": \"31.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2091","questionFrontendId":"1977","title":"Number of Ways to Separate Numbers","titleSlug":"number-of-ways-to-separate-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"21K\", \"totalAcceptedRaw\": 4391, \"totalSubmissionRaw\": 20956, \"acRate\": \"21.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Suffix Array","translatedName":null,"slug":"suffix-array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2105","questionFrontendId":"1994","title":"The Number of Good Subsets","titleSlug":"the-number-of-good-subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.1K\", \"totalSubmission\": \"14.7K\", \"totalAcceptedRaw\": 5111, \"totalSubmissionRaw\": 14706, \"acRate\": \"34.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2108","questionFrontendId":"1981","title":"Minimize the Difference Between Target and Chosen Elements","titleSlug":"minimize-the-difference-between-target-and-chosen-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"20K\", \"totalSubmission\": \"61.8K\", \"totalAcceptedRaw\": 20038, \"totalSubmissionRaw\": 61839, \"acRate\": \"32.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2114","questionFrontendId":"1986","title":"Minimum Number of Work Sessions to Finish the Tasks","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.3K\", \"totalSubmission\": \"59.1K\", \"totalAcceptedRaw\": 19336, \"totalSubmissionRaw\": 59096, \"acRate\": \"32.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2115","questionFrontendId":"1987","title":"Number of Unique Good Subsequences","titleSlug":"number-of-unique-good-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"17.5K\", \"totalAcceptedRaw\": 9159, \"totalSubmissionRaw\": 17536, \"acRate\": \"52.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2118","questionFrontendId":"2008","title":"Maximum Earnings From Taxi","titleSlug":"maximum-earnings-from-taxi","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.1K\", \"totalSubmission\": \"48.3K\", \"totalAcceptedRaw\": 21055, \"totalSubmissionRaw\": 48338, \"acRate\": \"43.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2124","questionFrontendId":"1997","title":"First Day Where You Have Been in All the Rooms","titleSlug":"first-day-where-you-have-been-in-all-the-rooms","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.5K\", \"totalSubmission\": \"20.3K\", \"totalAcceptedRaw\": 7519, \"totalSubmissionRaw\": 20341, \"acRate\": \"37.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2130","questionFrontendId":"2002","title":"Maximum Product of the Length of Two Palindromic Subsequences","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.3K\", \"totalSubmission\": \"31.9K\", \"totalAcceptedRaw\": 17337, \"totalSubmissionRaw\": 31860, \"acRate\": \"54.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2131","questionFrontendId":"2003","title":"Smallest Missing Genetic Value in Each Subtree","titleSlug":"smallest-missing-genetic-value-in-each-subtree","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.4K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 6435, \"totalSubmissionRaw\": 14412, \"acRate\": \"44.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2147","questionFrontendId":"2019","title":"The Score of Students Solving Math Expression","titleSlug":"the-score-of-students-solving-math-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"16.8K\", \"totalAcceptedRaw\": 5676, \"totalSubmissionRaw\": 16803, \"acRate\": \"33.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2153","questionFrontendId":"2005","title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"466\", \"totalSubmission\": \"734\", \"totalAcceptedRaw\": 466, \"totalSubmissionRaw\": 734, \"acRate\": \"63.5%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2162","questionFrontendId":"2035","title":"Partition Array Into Two Arrays to Minimize Sum Difference","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.1K\", \"totalSubmission\": \"69.8K\", \"totalAcceptedRaw\": 13133, \"totalSubmissionRaw\": 69768, \"acRate\": \"18.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2164","questionFrontendId":"2054","title":"Two Best Non-Overlapping Events","titleSlug":"two-best-non-overlapping-events","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"29.4K\", \"totalAcceptedRaw\": 13290, \"totalSubmissionRaw\": 29383, \"acRate\": \"45.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2176","questionFrontendId":"2050","title":"Parallel Courses III","titleSlug":"parallel-courses-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.5K\", \"totalSubmission\": \"29.6K\", \"totalAcceptedRaw\": 17524, \"totalSubmissionRaw\": 29572, \"acRate\": \"59.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2184","questionFrontendId":"2060","title":"Check if an Original String Exists Given Two Encoded Strings","titleSlug":"check-if-an-original-string-exists-given-two-encoded-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.1K\", \"totalSubmission\": \"22.1K\", \"totalAcceptedRaw\": 9063, \"totalSubmissionRaw\": 22150, \"acRate\": \"40.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2187","questionFrontendId":"2063","title":"Vowels of All Substrings","titleSlug":"vowels-of-all-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"38.7K\", \"totalAcceptedRaw\": 21164, \"totalSubmissionRaw\": 38658, \"acRate\": \"54.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2191","questionFrontendId":"2086","title":"Minimum Number of Food Buckets to Feed the Hamsters","titleSlug":"minimum-number-of-food-buckets-to-feed-the-hamsters","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"31.5K\", \"totalAcceptedRaw\": 14155, \"totalSubmissionRaw\": 31540, \"acRate\": \"44.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2193","questionFrontendId":"2088","title":"Count Fertile Pyramids in a Land","titleSlug":"count-fertile-pyramids-in-a-land","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"9K\", \"totalAcceptedRaw\": 5723, \"totalSubmissionRaw\": 8983, \"acRate\": \"63.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2205","questionFrontendId":"2100","title":"Find Good Days to Rob the Bank","titleSlug":"find-good-days-to-rob-the-bank","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"40.5K\", \"totalAcceptedRaw\": 19922, \"totalSubmissionRaw\": 40479, \"acRate\": \"49.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2233","questionFrontendId":"2110","title":"Number of Smooth Descent Periods of a Stock","titleSlug":"number-of-smooth-descent-periods-of-a-stock","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.6K\", \"totalSubmission\": \"47.9K\", \"totalAcceptedRaw\": 27618, \"totalSubmissionRaw\": 47892, \"acRate\": \"57.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2251","questionFrontendId":"2147","title":"Number of Ways to Divide a Long Corridor","titleSlug":"number-of-ways-to-divide-a-long-corridor","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.5K\", \"totalSubmission\": \"23.7K\", \"totalAcceptedRaw\": 9476, \"totalSubmissionRaw\": 23736, \"acRate\": \"39.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2262","questionFrontendId":"2140","title":"Solving Questions With Brainpower","titleSlug":"solving-questions-with-brainpower","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.8K\", \"totalSubmission\": \"53.4K\", \"totalAcceptedRaw\": 24770, \"totalSubmissionRaw\": 53428, \"acRate\": \"46.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2267","questionFrontendId":"2163","title":"Minimum Difference in Sums After Removal of Elements","titleSlug":"minimum-difference-in-sums-after-removal-of-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.5K\", \"totalSubmission\": \"15.7K\", \"totalAcceptedRaw\": 7472, \"totalSubmissionRaw\": 15701, \"acRate\": \"47.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2282","questionFrontendId":"2143","title":"Choose Numbers From Two Arrays in Range","titleSlug":"choose-numbers-from-two-arrays-in-range","translatedTitle":null,"stats":"{\"totalAccepted\": \"783\", \"totalSubmission\": \"1.5K\", \"totalAcceptedRaw\": 783, \"totalSubmissionRaw\": 1498, \"acRate\": \"52.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2286","questionFrontendId":"2167","title":"Minimum Time to Remove All Cars Containing Illegal Goods","titleSlug":"minimum-time-to-remove-all-cars-containing-illegal-goods","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.3K\", \"totalSubmission\": \"25.2K\", \"totalAcceptedRaw\": 10271, \"totalSubmissionRaw\": 25214, \"acRate\": \"40.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2287","questionFrontendId":"2152","title":"Minimum Number of Lines to Cover Points","titleSlug":"minimum-number-of-lines-to-cover-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"3K\", \"totalAcceptedRaw\": 1407, \"totalSubmissionRaw\": 3016, \"acRate\": \"46.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2291","questionFrontendId":"2172","title":"Maximum AND Sum of Array","titleSlug":"maximum-and-sum-of-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.5K\", \"totalSubmission\": \"21.7K\", \"totalAcceptedRaw\": 10496, \"totalSubmissionRaw\": 21726, \"acRate\": \"48.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2295","questionFrontendId":"2188","title":"Minimum Time to Finish the Race","titleSlug":"minimum-time-to-finish-the-race","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.7K\", \"totalSubmission\": \"23.3K\", \"totalAcceptedRaw\": 9730, \"totalSubmissionRaw\": 23321, \"acRate\": \"41.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2311","questionFrontendId":"2209","title":"Minimum White Tiles After Covering With Carpets","titleSlug":"minimum-white-tiles-after-covering-with-carpets","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.6K\", \"totalSubmission\": \"28.1K\", \"totalAcceptedRaw\": 9600, \"totalSubmissionRaw\": 28094, \"acRate\": \"34.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2322","questionFrontendId":"2184","title":"Number of Ways to Build Sturdy Brick Wall","titleSlug":"number-of-ways-to-build-sturdy-brick-wall","translatedTitle":null,"stats":"{\"totalAccepted\": \"5K\", \"totalSubmission\": \"10K\", \"totalAcceptedRaw\": 5024, \"totalSubmissionRaw\": 10015, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2325","questionFrontendId":"2222","title":"Number of Ways to Select Buildings","titleSlug":"number-of-ways-to-select-buildings","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.6K\", \"totalSubmission\": \"49.9K\", \"totalAcceptedRaw\": 25586, \"totalSubmissionRaw\": 49879, \"acRate\": \"51.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2340","questionFrontendId":"2262","title":"Total Appeal of A String","titleSlug":"total-appeal-of-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.5K\", \"totalSubmission\": \"39.6K\", \"totalAcceptedRaw\": 22470, \"totalSubmissionRaw\": 39559, \"acRate\": \"56.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2348","questionFrontendId":"2266","title":"Count Number of Texts","titleSlug":"count-number-of-texts","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.9K\", \"totalSubmission\": \"31.7K\", \"totalAcceptedRaw\": 14906, \"totalSubmissionRaw\": 31670, \"acRate\": \"47.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2349","questionFrontendId":"2267","title":" Check if There Is a Valid Parentheses String Path","titleSlug":"check-if-there-is-a-valid-parentheses-string-path","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.4K\", \"totalSubmission\": \"32.6K\", \"totalAcceptedRaw\": 12378, \"totalSubmissionRaw\": 32557, \"acRate\": \"38.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2360","questionFrontendId":"2272","title":"Substring With Largest Variance","titleSlug":"substring-with-largest-variance","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.4K\", \"totalSubmission\": \"63.2K\", \"totalAcceptedRaw\": 23372, \"totalSubmissionRaw\": 63160, \"acRate\": \"37.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2395","questionFrontendId":"2311","title":"Longest Binary Subsequence Less Than or Equal to K","titleSlug":"longest-binary-subsequence-less-than-or-equal-to-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"49K\", \"totalAcceptedRaw\": 18189, \"totalSubmissionRaw\": 48985, \"acRate\": \"37.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2397","questionFrontendId":"2320","title":"Count Number of Ways to Place Houses","titleSlug":"count-number-of-ways-to-place-houses","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.7K\", \"totalSubmission\": \"53.5K\", \"totalAcceptedRaw\": 21735, \"totalSubmissionRaw\": 53490, \"acRate\": \"40.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2399","questionFrontendId":"2313","title":"Minimum Flips in Binary Tree to Get Result","titleSlug":"minimum-flips-in-binary-tree-to-get-result","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1K\", \"totalSubmission\": \"1.7K\", \"totalAcceptedRaw\": 1056, \"totalSubmissionRaw\": 1661, \"acRate\": \"63.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2404","questionFrontendId":"2318","title":"Number of Distinct Roll Sequences","titleSlug":"number-of-distinct-roll-sequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.3K\", \"totalSubmission\": \"14.7K\", \"totalAcceptedRaw\": 8301, \"totalSubmissionRaw\": 14749, \"acRate\": \"56.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2408","questionFrontendId":"2327","title":"Number of People Aware of a Secret","titleSlug":"number-of-people-aware-of-a-secret","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.8K\", \"totalSubmission\": \"37.4K\", \"totalAcceptedRaw\": 16762, \"totalSubmissionRaw\": 37388, \"acRate\": \"44.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2409","questionFrontendId":"2328","title":"Number of Increasing Paths in a Grid","titleSlug":"number-of-increasing-paths-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.4K\", \"totalSubmission\": \"34.5K\", \"totalAcceptedRaw\": 16428, \"totalSubmissionRaw\": 34536, \"acRate\": \"47.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2415","questionFrontendId":"2338","title":"Count the Number of Ideal Arrays","titleSlug":"count-the-number-of-ideal-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.7K\", \"totalSubmission\": \"17.9K\", \"totalAcceptedRaw\": 4695, \"totalSubmissionRaw\": 17875, \"acRate\": \"26.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2426","questionFrontendId":"2291","title":"Maximum Profit From Trading Stocks","titleSlug":"maximum-profit-from-trading-stocks","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.4K\", \"totalSubmission\": \"7.6K\", \"totalAcceptedRaw\": 3440, \"totalSubmissionRaw\": 7564, \"acRate\": \"45.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2443","questionFrontendId":"2369","title":"Check if There is a Valid Partition For The Array","titleSlug":"check-if-there-is-a-valid-partition-for-the-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.9K\", \"totalSubmission\": \"47.2K\", \"totalAcceptedRaw\": 18934, \"totalSubmissionRaw\": 47180, \"acRate\": \"40.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2444","questionFrontendId":"2370","title":"Longest Ideal Subsequence","titleSlug":"longest-ideal-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.6K\", \"totalSubmission\": \"49.3K\", \"totalAcceptedRaw\": 18607, \"totalSubmissionRaw\": 49261, \"acRate\": \"37.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2457","questionFrontendId":"2376","title":"Count Special Integers","titleSlug":"count-special-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"23.5K\", \"totalAcceptedRaw\": 8603, \"totalSubmissionRaw\": 23487, \"acRate\": \"36.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2464","questionFrontendId":"2380","title":"Time Needed to Rearrange a Binary String","titleSlug":"time-needed-to-rearrange-a-binary-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.1K\", \"totalSubmission\": \"45.1K\", \"totalAcceptedRaw\": 22101, \"totalSubmissionRaw\": 45121, \"acRate\": \"49.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2477","questionFrontendId":"2400","title":"Number of Ways to Reach a Position After Exactly k Steps","titleSlug":"number-of-ways-to-reach-a-position-after-exactly-k-steps","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.1K\", \"totalSubmission\": \"64K\", \"totalAcceptedRaw\": 21099, \"totalSubmissionRaw\": 64032, \"acRate\": \"33.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2490","questionFrontendId":"2355","title":"Maximum Number of Books You Can Take","titleSlug":"maximum-number-of-books-you-can-take","translatedTitle":null,"stats":"{\"totalAccepted\": \"4K\", \"totalSubmission\": \"9K\", \"totalAcceptedRaw\": 3986, \"totalSubmissionRaw\": 9042, \"acRate\": \"44.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2500","questionFrontendId":"2361","title":"Minimum Costs Using the Train Line","titleSlug":"minimum-costs-using-the-train-line","translatedTitle":null,"stats":"{\"totalAccepted\": \"4K\", \"totalSubmission\": \"5.3K\", \"totalAcceptedRaw\": 4015, \"totalSubmissionRaw\": 5279, \"acRate\": \"76.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2504","questionFrontendId":"2420","title":"Find All Good Indices","titleSlug":"find-all-good-indices","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.1K\", \"totalSubmission\": \"48.3K\", \"totalAcceptedRaw\": 18121, \"totalSubmissionRaw\": 48303, \"acRate\": \"37.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2510","questionFrontendId":"2430","title":"Maximum Deletions on a String","titleSlug":"maximum-deletions-on-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.3K\", \"totalSubmission\": \"31.8K\", \"totalAcceptedRaw\": 10254, \"totalSubmissionRaw\": 31840, \"acRate\": \"32.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2511","questionFrontendId":"2522","title":"Partition String Into Substrings With Values at Most K","titleSlug":"partition-string-into-substrings-with-values-at-most-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.4K\", \"totalSubmission\": \"33.1K\", \"totalAcceptedRaw\": 15447, \"totalSubmissionRaw\": 33068, \"acRate\": \"46.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2517","questionFrontendId":"2378","title":"Choose Edges to Maximize Score in a Tree","titleSlug":"choose-edges-to-maximize-score-in-a-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"860\", \"totalSubmission\": \"1.4K\", \"totalAcceptedRaw\": 860, \"totalSubmissionRaw\": 1426, \"acRate\": \"60.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2521","questionFrontendId":"2435","title":"Paths in Matrix Whose Sum Is Divisible by K","titleSlug":"paths-in-matrix-whose-sum-is-divisible-by-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"15K\", \"totalSubmission\": \"36K\", \"totalAcceptedRaw\": 14952, \"totalSubmissionRaw\": 35995, \"acRate\": \"41.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2526","questionFrontendId":"2407","title":"Longest Increasing Subsequence II","titleSlug":"longest-increasing-subsequence-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.8K\", \"totalSubmission\": \"36.2K\", \"totalAcceptedRaw\": 7841, \"totalSubmissionRaw\": 36205, \"acRate\": \"21.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2530","questionFrontendId":"2439","title":"Minimize Maximum of Array","titleSlug":"minimize-maximum-of-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.9K\", \"totalSubmission\": \"31.6K\", \"totalAcceptedRaw\": 10855, \"totalSubmissionRaw\": 31573, \"acRate\": \"34.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2535","questionFrontendId":"2393","title":"Count Strictly Increasing Subarrays","titleSlug":"count-strictly-increasing-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"3K\", \"totalAcceptedRaw\": 2193, \"totalSubmissionRaw\": 3007, \"acRate\": \"72.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2537","questionFrontendId":"2403","title":"Minimum Time to Kill All Monsters","titleSlug":"minimum-time-to-kill-all-monsters","translatedTitle":null,"stats":"{\"totalAccepted\": \"754\", \"totalSubmission\": \"1.5K\", \"totalAcceptedRaw\": 754, \"totalSubmissionRaw\": 1473, \"acRate\": \"51.2%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2554","questionFrontendId":"2463","title":"Minimum Total Distance Traveled","titleSlug":"minimum-total-distance-traveled","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 5861, \"totalSubmissionRaw\": 14423, \"acRate\": \"40.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2559","questionFrontendId":"2472","title":"Maximum Number of Non-overlapping Palindrome Substrings","titleSlug":"maximum-number-of-non-overlapping-palindrome-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.1K\", \"totalSubmission\": \"24K\", \"totalAcceptedRaw\": 9129, \"totalSubmissionRaw\": 24002, \"acRate\": \"38.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2562","questionFrontendId":"2466","title":"Count Ways To Build Good Strings","titleSlug":"count-ways-to-build-good-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.2K\", \"totalSubmission\": \"26.5K\", \"totalAcceptedRaw\": 11177, \"totalSubmissionRaw\": 26543, \"acRate\": \"42.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2569","questionFrontendId":"2478","title":"Number of Beautiful Partitions","titleSlug":"number-of-beautiful-partitions","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.2K\", \"totalSubmission\": \"23.6K\", \"totalAcceptedRaw\": 7241, \"totalSubmissionRaw\": 23552, \"acRate\": \"30.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2570","questionFrontendId":"2431","title":"Maximize Total Tastiness of Purchased Fruits","titleSlug":"maximize-total-tastiness-of-purchased-fruits","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"1.9K\", \"totalAcceptedRaw\": 1303, \"totalSubmissionRaw\": 1928, \"acRate\": \"67.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2577","questionFrontendId":"2484","title":"Count Palindromic Subsequences","titleSlug":"count-palindromic-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.8K\", \"totalSubmission\": \"14.6K\", \"totalAcceptedRaw\": 4801, \"totalSubmissionRaw\": 14556, \"acRate\": \"33.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2579","questionFrontendId":"2436","title":"Minimum Split Into Subarrays With GCD Greater Than One","titleSlug":"minimum-split-into-subarrays-with-gcd-greater-than-one","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"1.8K\", \"totalAcceptedRaw\": 1339, \"totalSubmissionRaw\": 1805, \"acRate\": \"74.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2586","questionFrontendId":"2501","title":"Longest Square Streak in an Array","titleSlug":"longest-square-streak-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"19K\", \"totalSubmission\": \"47.9K\", \"totalAcceptedRaw\": 18961, \"totalSubmissionRaw\": 47944, \"acRate\": \"39.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2601","questionFrontendId":"2518","title":"Number of Great Partitions","titleSlug":"number-of-great-partitions","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.1K\", \"totalSubmission\": \"15.5K\", \"totalAcceptedRaw\": 5107, \"totalSubmissionRaw\": 15514, \"acRate\": \"32.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2607","questionFrontendId":"2464","title":"Minimum Subarrays in a Valid Split","titleSlug":"minimum-subarrays-in-a-valid-split","translatedTitle":null,"stats":"{\"totalAccepted\": \"665\", \"totalSubmission\": \"1.2K\", \"totalAcceptedRaw\": 665, \"totalSubmissionRaw\": 1187, \"acRate\": \"56.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2627","questionFrontendId":"2538","title":"Difference Between Maximum and Minimum Price Sum","titleSlug":"difference-between-maximum-and-minimum-price-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.9K\", \"totalSubmission\": \"14.1K\", \"totalAcceptedRaw\": 4922, \"totalSubmissionRaw\": 14131, \"acRate\": \"34.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2633","questionFrontendId":"2547","title":"Minimum Cost to Split an Array","titleSlug":"minimum-cost-to-split-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.3K\", \"totalSubmission\": \"21.5K\", \"totalAcceptedRaw\": 8326, \"totalSubmissionRaw\": 21453, \"acRate\": \"38.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2638","questionFrontendId":"2495","title":"Number of Subarrays Having Even Product","titleSlug":"number-of-subarrays-having-even-product","translatedTitle":null,"stats":"{\"totalAccepted\": \"930\", \"totalSubmission\": \"1.4K\", \"totalAcceptedRaw\": 930, \"totalSubmissionRaw\": 1419, \"acRate\": \"65.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2641","questionFrontendId":"2556","title":"Disconnect Path in a Binary Matrix by at Most One Flip","titleSlug":"disconnect-path-in-a-binary-matrix-by-at-most-one-flip","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.2K\", \"totalSubmission\": \"28.7K\", \"totalAcceptedRaw\": 8192, \"totalSubmissionRaw\": 28713, \"acRate\": \"28.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2648","questionFrontendId":"2585","title":"Number of Ways to Earn Points","titleSlug":"number-of-ways-to-earn-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 8627, \"totalSubmissionRaw\": 14387, \"acRate\": \"60.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2652","questionFrontendId":"2581","title":"Count Number of Possible Root Nodes","titleSlug":"count-number-of-possible-root-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"3K\", \"totalSubmission\": \"6.4K\", \"totalAcceptedRaw\": 3010, \"totalSubmissionRaw\": 6358, \"acRate\": \"47.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2653","questionFrontendId":"2510","title":"Check if There is a Path With Equal Number of 0's And 1's","titleSlug":"check-if-there-is-a-path-with-equal-number-of-0s-and-1s","translatedTitle":null,"stats":"{\"totalAccepted\": \"952\", \"totalSubmission\": \"1.7K\", \"totalAcceptedRaw\": 952, \"totalSubmissionRaw\": 1717, \"acRate\": \"55.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2672","questionFrontendId":"2533","title":"Number of Good Binary Strings","titleSlug":"number-of-good-binary-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"514\", \"totalSubmission\": \"795\", \"totalAcceptedRaw\": 514, \"totalSubmissionRaw\": 795, \"acRate\": \"64.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2682","questionFrontendId":"2552","title":"Count Increasing Quadruplets","titleSlug":"count-increasing-quadruplets","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.7K\", \"totalSubmission\": \"15K\", \"totalAcceptedRaw\": 4706, \"totalSubmissionRaw\": 14981, \"acRate\": \"31.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2708","questionFrontendId":"2573","title":"Find the String with LCP","titleSlug":"find-the-string-with-lcp","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.6K\", \"totalSubmission\": \"7.3K\", \"totalAcceptedRaw\": 2584, \"totalSubmissionRaw\": 7349, \"acRate\": \"35.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2709","questionFrontendId":"2572","title":"Count the Number of Square-Free Subsets","titleSlug":"count-the-number-of-square-free-subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"22.7K\", \"totalAcceptedRaw\": 4600, \"totalSubmissionRaw\": 22696, \"acRate\": \"20.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2710","questionFrontendId":"2571","title":"Minimum Operations to Reduce an Integer to 0","titleSlug":"minimum-operations-to-reduce-an-integer-to-0","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.6K\", \"totalSubmission\": \"29.7K\", \"totalAcceptedRaw\": 14601, \"totalSubmissionRaw\": 29693, \"acRate\": \"49.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/tmp/hash-table-graphql.json b/tmp/hash-table-graphql.json
new file mode 100644
index 000000000..bd76033a0
--- /dev/null
+++ b/tmp/hash-table-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"Hash Table","translatedName":null,"slug":"hash-table","questions":[{"status":null,"questionId":"1","questionFrontendId":"1","title":"Two Sum","titleSlug":"two-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2M\", \"totalSubmission\": \"18.5M\", \"totalAcceptedRaw\": 9176711, \"totalSubmissionRaw\": 18503038, \"acRate\": \"49.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"3","questionFrontendId":"3","title":"Longest Substring Without Repeating Characters","titleSlug":"longest-substring-without-repeating-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.3M\", \"totalSubmission\": \"12.8M\", \"totalAcceptedRaw\": 4334592, \"totalSubmissionRaw\": 12815178, \"acRate\": \"33.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"12","questionFrontendId":"12","title":"Integer to Roman","titleSlug":"integer-to-roman","translatedTitle":null,"stats":"{\"totalAccepted\": \"955K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 954997, \"totalSubmissionRaw\": 1541977, \"acRate\": \"61.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"13","questionFrontendId":"13","title":"Roman to Integer","titleSlug":"roman-to-integer","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.5M\", \"totalSubmission\": \"4.3M\", \"totalAcceptedRaw\": 2497238, \"totalSubmissionRaw\": 4272457, \"acRate\": \"58.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"17","questionFrontendId":"17","title":"Letter Combinations of a Phone Number","titleSlug":"letter-combinations-of-a-phone-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5M\", \"totalSubmission\": \"2.7M\", \"totalAcceptedRaw\": 1503848, \"totalSubmissionRaw\": 2665165, \"acRate\": \"56.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"30","questionFrontendId":"30","title":"Substring with Concatenation of All Words","titleSlug":"substring-with-concatenation-of-all-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"338.7K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 338689, \"totalSubmissionRaw\": 1086628, \"acRate\": \"31.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"36","questionFrontendId":"36","title":"Valid Sudoku","titleSlug":"valid-sudoku","translatedTitle":null,"stats":"{\"totalAccepted\": \"1M\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 1049236, \"totalSubmissionRaw\": 1808029, \"acRate\": \"58.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"37","questionFrontendId":"37","title":"Sudoku Solver","titleSlug":"sudoku-solver","translatedTitle":null,"stats":"{\"totalAccepted\": \"444.1K\", \"totalSubmission\": \"771.6K\", \"totalAcceptedRaw\": 444094, \"totalSubmissionRaw\": 771588, \"acRate\": \"57.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"41","questionFrontendId":"41","title":"First Missing Positive","titleSlug":"first-missing-positive","translatedTitle":null,"stats":"{\"totalAccepted\": \"850.3K\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 850288, \"totalSubmissionRaw\": 2318305, \"acRate\": \"36.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"49","questionFrontendId":"49","title":"Group Anagrams","titleSlug":"group-anagrams","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.9M\", \"totalSubmission\": \"2.8M\", \"totalAcceptedRaw\": 1881058, \"totalSubmissionRaw\": 2819376, \"acRate\": \"66.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"73","questionFrontendId":"73","title":"Set Matrix Zeroes","titleSlug":"set-matrix-zeroes","translatedTitle":null,"stats":"{\"totalAccepted\": \"945.3K\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 945320, \"totalSubmissionRaw\": 1850835, \"acRate\": \"51.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"76","questionFrontendId":"76","title":"Minimum Window Substring","titleSlug":"minimum-window-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"980.5K\", \"totalSubmission\": \"2.4M\", \"totalAcceptedRaw\": 980539, \"totalSubmissionRaw\": 2399464, \"acRate\": \"40.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"105","questionFrontendId":"105","title":"Construct Binary Tree from Preorder and Inorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"936.4K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 936442, \"totalSubmissionRaw\": 1524460, \"acRate\": \"61.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"106","questionFrontendId":"106","title":"Construct Binary Tree from Inorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"465K\", \"totalSubmission\": \"800.1K\", \"totalAcceptedRaw\": 465028, \"totalSubmissionRaw\": 800148, \"acRate\": \"58.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"126","questionFrontendId":"126","title":"Word Ladder II","titleSlug":"word-ladder-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"339.2K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 339186, \"totalSubmissionRaw\": 1232948, \"acRate\": \"27.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"127","questionFrontendId":"127","title":"Word Ladder","titleSlug":"word-ladder","translatedTitle":null,"stats":"{\"totalAccepted\": \"893.8K\", \"totalSubmission\": \"2.4M\", \"totalAcceptedRaw\": 893822, \"totalSubmissionRaw\": 2409565, \"acRate\": \"37.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"128","questionFrontendId":"128","title":"Longest Consecutive Sequence","titleSlug":"longest-consecutive-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 1061067, \"totalSubmissionRaw\": 2184758, \"acRate\": \"48.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"133","questionFrontendId":"133","title":"Clone Graph","titleSlug":"clone-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"913.3K\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 913285, \"totalSubmissionRaw\": 1763510, \"acRate\": \"51.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"138","questionFrontendId":"138","title":"Copy List with Random Pointer","titleSlug":"copy-list-with-random-pointer","translatedTitle":null,"stats":"{\"totalAccepted\": \"929.3K\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 929251, \"totalSubmissionRaw\": 1813168, \"acRate\": \"51.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"139","questionFrontendId":"139","title":"Word Break","titleSlug":"word-break","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"2.9M\", \"totalAcceptedRaw\": 1302318, \"totalSubmissionRaw\": 2858470, \"acRate\": \"45.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"140","questionFrontendId":"140","title":"Word Break II","titleSlug":"word-break-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"507.3K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 507267, \"totalSubmissionRaw\": 1122473, \"acRate\": \"45.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"141","questionFrontendId":"141","title":"Linked List Cycle","titleSlug":"linked-list-cycle","translatedTitle":null,"stats":"{\"totalAccepted\": \"2M\", \"totalSubmission\": \"4.1M\", \"totalAcceptedRaw\": 1966418, \"totalSubmissionRaw\": 4148573, \"acRate\": \"47.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"142","questionFrontendId":"142","title":"Linked List Cycle II","titleSlug":"linked-list-cycle-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"1M\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 1020051, \"totalSubmissionRaw\": 2099589, \"acRate\": \"48.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"146","questionFrontendId":"146","title":"LRU Cache","titleSlug":"lru-cache","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"3.1M\", \"totalAcceptedRaw\": 1277203, \"totalSubmissionRaw\": 3143178, \"acRate\": \"40.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"149","questionFrontendId":"149","title":"Max Points on a Line","titleSlug":"max-points-on-a-line","translatedTitle":null,"stats":"{\"totalAccepted\": \"333K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 332986, \"totalSubmissionRaw\": 1328049, \"acRate\": \"25.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"159","questionFrontendId":"159","title":"Longest Substring with At Most Two Distinct Characters","titleSlug":"longest-substring-with-at-most-two-distinct-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"224.5K\", \"totalSubmission\": \"417.4K\", \"totalAcceptedRaw\": 224494, \"totalSubmissionRaw\": 417416, \"acRate\": \"53.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"160","questionFrontendId":"160","title":"Intersection of Two Linked Lists","titleSlug":"intersection-of-two-linked-lists","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 1232521, \"totalSubmissionRaw\": 2273657, \"acRate\": \"54.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"166","questionFrontendId":"166","title":"Fraction to Recurring Decimal","titleSlug":"fraction-to-recurring-decimal","translatedTitle":null,"stats":"{\"totalAccepted\": \"204.3K\", \"totalSubmission\": \"841.2K\", \"totalAcceptedRaw\": 204326, \"totalSubmissionRaw\": 841187, \"acRate\": \"24.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"169","questionFrontendId":"169","title":"Majority Element","titleSlug":"majority-element","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6M\", \"totalSubmission\": \"2.6M\", \"totalAcceptedRaw\": 1646153, \"totalSubmissionRaw\": 2575601, \"acRate\": \"63.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"170","questionFrontendId":"170","title":"Two Sum III - Data structure design","titleSlug":"two-sum-iii-data-structure-design","translatedTitle":null,"stats":"{\"totalAccepted\": \"139.9K\", \"totalSubmission\": \"374.1K\", \"totalAcceptedRaw\": 139886, \"totalSubmissionRaw\": 374090, \"acRate\": \"37.4%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"187","questionFrontendId":"187","title":"Repeated DNA Sequences","titleSlug":"repeated-dna-sequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"317.3K\", \"totalSubmission\": \"676.7K\", \"totalAcceptedRaw\": 317329, \"totalSubmissionRaw\": 676721, \"acRate\": \"46.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"202","questionFrontendId":"202","title":"Happy Number","titleSlug":"happy-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"2M\", \"totalAcceptedRaw\": 1103717, \"totalSubmissionRaw\": 2015361, \"acRate\": \"54.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"205","questionFrontendId":"205","title":"Isomorphic Strings","titleSlug":"isomorphic-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"836.5K\", \"totalSubmission\": \"2M\", \"totalAcceptedRaw\": 836459, \"totalSubmissionRaw\": 1952344, \"acRate\": \"42.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"208","questionFrontendId":"208","title":"Implement Trie (Prefix Tree)","titleSlug":"implement-trie-prefix-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"746.8K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 746839, \"totalSubmissionRaw\": 1211271, \"acRate\": \"61.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"217","questionFrontendId":"217","title":"Contains Duplicate","titleSlug":"contains-duplicate","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.6M\", \"totalSubmission\": \"4.2M\", \"totalAcceptedRaw\": 2571766, \"totalSubmissionRaw\": 4187672, \"acRate\": \"61.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"219","questionFrontendId":"219","title":"Contains Duplicate II","titleSlug":"contains-duplicate-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"649K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 649025, \"totalSubmissionRaw\": 1526488, \"acRate\": \"42.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"229","questionFrontendId":"229","title":"Majority Element II","titleSlug":"majority-element-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"385.4K\", \"totalSubmission\": \"857.4K\", \"totalAcceptedRaw\": 385433, \"totalSubmissionRaw\": 857447, \"acRate\": \"45.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"242","questionFrontendId":"242","title":"Valid Anagram","titleSlug":"valid-anagram","translatedTitle":null,"stats":"{\"totalAccepted\": \"2M\", \"totalSubmission\": \"3.2M\", \"totalAcceptedRaw\": 2033389, \"totalSubmissionRaw\": 3226600, \"acRate\": \"63.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"244","questionFrontendId":"244","title":"Shortest Word Distance II","titleSlug":"shortest-word-distance-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"146.1K\", \"totalSubmission\": \"240.2K\", \"totalAcceptedRaw\": 146141, \"totalSubmissionRaw\": 240211, \"acRate\": \"60.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"246","questionFrontendId":"246","title":"Strobogrammatic Number","titleSlug":"strobogrammatic-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"158.3K\", \"totalSubmission\": \"331.7K\", \"totalAcceptedRaw\": 158338, \"totalSubmissionRaw\": 331655, \"acRate\": \"47.7%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"249","questionFrontendId":"249","title":"Group Shifted Strings","titleSlug":"group-shifted-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"189.4K\", \"totalSubmission\": \"294.5K\", \"totalAcceptedRaw\": 189449, \"totalSubmissionRaw\": 294518, \"acRate\": \"64.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"264","questionFrontendId":"264","title":"Ugly Number II","titleSlug":"ugly-number-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"301.3K\", \"totalSubmission\": \"652.4K\", \"totalAcceptedRaw\": 301267, \"totalSubmissionRaw\": 652373, \"acRate\": \"46.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"266","questionFrontendId":"266","title":"Palindrome Permutation","titleSlug":"palindrome-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"179.8K\", \"totalSubmission\": \"272.3K\", \"totalAcceptedRaw\": 179774, \"totalSubmissionRaw\": 272276, \"acRate\": \"66.0%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"267","questionFrontendId":"267","title":"Palindrome Permutation II","titleSlug":"palindrome-permutation-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"60.9K\", \"totalSubmission\": \"149.7K\", \"totalAcceptedRaw\": 60906, \"totalSubmissionRaw\": 149659, \"acRate\": \"40.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"268","questionFrontendId":"268","title":"Missing Number","titleSlug":"missing-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 1431785, \"totalSubmissionRaw\": 2293208, \"acRate\": \"62.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"288","questionFrontendId":"288","title":"Unique Word Abbreviation","titleSlug":"unique-word-abbreviation","translatedTitle":null,"stats":"{\"totalAccepted\": \"69.1K\", \"totalSubmission\": \"270.3K\", \"totalAcceptedRaw\": 69088, \"totalSubmissionRaw\": 270277, \"acRate\": \"25.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"290","questionFrontendId":"290","title":"Word Pattern","titleSlug":"word-pattern","translatedTitle":null,"stats":"{\"totalAccepted\": \"510K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 509998, \"totalSubmissionRaw\": 1223933, \"acRate\": \"41.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"291","questionFrontendId":"291","title":"Word Pattern II","titleSlug":"word-pattern-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"67K\", \"totalSubmission\": \"142.3K\", \"totalAcceptedRaw\": 66973, \"totalSubmissionRaw\": 142304, \"acRate\": \"47.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"299","questionFrontendId":"299","title":"Bulls and Cows","titleSlug":"bulls-and-cows","translatedTitle":null,"stats":"{\"totalAccepted\": \"336.7K\", \"totalSubmission\": \"682.4K\", \"totalAcceptedRaw\": 336715, \"totalSubmissionRaw\": 682426, \"acRate\": \"49.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"311","questionFrontendId":"311","title":"Sparse Matrix Multiplication","titleSlug":"sparse-matrix-multiplication","translatedTitle":null,"stats":"{\"totalAccepted\": \"170.3K\", \"totalSubmission\": \"252.9K\", \"totalAcceptedRaw\": 170286, \"totalSubmissionRaw\": 252912, \"acRate\": \"67.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"314","questionFrontendId":"314","title":"Binary Tree Vertical Order Traversal","titleSlug":"binary-tree-vertical-order-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"318.2K\", \"totalSubmission\": \"608.7K\", \"totalAcceptedRaw\": 318204, \"totalSubmissionRaw\": 608666, \"acRate\": \"52.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"325","questionFrontendId":"325","title":"Maximum Size Subarray Sum Equals k","titleSlug":"maximum-size-subarray-sum-equals-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"171.2K\", \"totalSubmission\": \"347.6K\", \"totalAcceptedRaw\": 171198, \"totalSubmissionRaw\": 347609, \"acRate\": \"49.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"336","questionFrontendId":"336","title":"Palindrome Pairs","titleSlug":"palindrome-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"191.2K\", \"totalSubmission\": \"545.9K\", \"totalAcceptedRaw\": 191190, \"totalSubmissionRaw\": 545949, \"acRate\": \"35.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"340","questionFrontendId":"340","title":"Longest Substring with At Most K Distinct Characters","titleSlug":"longest-substring-with-at-most-k-distinct-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"307.7K\", \"totalSubmission\": \"641.4K\", \"totalAcceptedRaw\": 307714, \"totalSubmissionRaw\": 641394, \"acRate\": \"48.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"347","questionFrontendId":"347","title":"Top K Frequent Elements","titleSlug":"top-k-frequent-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 1345636, \"totalSubmissionRaw\": 2093537, \"acRate\": \"64.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Bucket Sort","translatedName":null,"slug":"bucket-sort","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Quickselect","translatedName":null,"slug":"quickselect","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"348","questionFrontendId":"348","title":"Design Tic-Tac-Toe","titleSlug":"design-tic-tac-toe","translatedTitle":null,"stats":"{\"totalAccepted\": \"208.5K\", \"totalSubmission\": \"362.3K\", \"totalAcceptedRaw\": 208546, \"totalSubmissionRaw\": 362331, \"acRate\": \"57.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"349","questionFrontendId":"349","title":"Intersection of Two Arrays","titleSlug":"intersection-of-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"824.6K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 824619, \"totalSubmissionRaw\": 1163783, \"acRate\": \"70.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"350","questionFrontendId":"350","title":"Intersection of Two Arrays II","titleSlug":"intersection-of-two-arrays-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"1M\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 1026502, \"totalSubmissionRaw\": 1835394, \"acRate\": \"55.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"355","questionFrontendId":"355","title":"Design Twitter","titleSlug":"design-twitter","translatedTitle":null,"stats":"{\"totalAccepted\": \"117.6K\", \"totalSubmission\": \"316K\", \"totalAcceptedRaw\": 117589, \"totalSubmissionRaw\": 315999, \"acRate\": \"37.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"356","questionFrontendId":"356","title":"Line Reflection","titleSlug":"line-reflection","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.4K\", \"totalSubmission\": \"99K\", \"totalAcceptedRaw\": 34413, \"totalSubmissionRaw\": 98964, \"acRate\": \"34.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"358","questionFrontendId":"358","title":"Rearrange String k Distance Apart","titleSlug":"rearrange-string-k-distance-apart","translatedTitle":null,"stats":"{\"totalAccepted\": \"57.4K\", \"totalSubmission\": \"152K\", \"totalAcceptedRaw\": 57395, \"totalSubmissionRaw\": 152041, \"acRate\": \"37.7%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"359","questionFrontendId":"359","title":"Logger Rate Limiter","titleSlug":"logger-rate-limiter","translatedTitle":null,"stats":"{\"totalAccepted\": \"272.9K\", \"totalSubmission\": \"360.9K\", \"totalAcceptedRaw\": 272859, \"totalSubmissionRaw\": 360885, \"acRate\": \"75.6%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"362","questionFrontendId":"362","title":"Design Hit Counter","titleSlug":"design-hit-counter","translatedTitle":null,"stats":"{\"totalAccepted\": \"202K\", \"totalSubmission\": \"295.5K\", \"totalAcceptedRaw\": 202035, \"totalSubmissionRaw\": 295505, \"acRate\": \"68.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"379","questionFrontendId":"379","title":"Design Phone Directory","titleSlug":"design-phone-directory","translatedTitle":null,"stats":"{\"totalAccepted\": \"61.2K\", \"totalSubmission\": \"119.7K\", \"totalAcceptedRaw\": 61211, \"totalSubmissionRaw\": 119653, \"acRate\": \"51.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"380","questionFrontendId":"380","title":"Insert Delete GetRandom O(1)","titleSlug":"insert-delete-getrandom-o1","translatedTitle":null,"stats":"{\"totalAccepted\": \"611.5K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 611513, \"totalSubmissionRaw\": 1158158, \"acRate\": \"52.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"381","questionFrontendId":"381","title":"Insert Delete GetRandom O(1) - Duplicates allowed","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed","translatedTitle":null,"stats":"{\"totalAccepted\": \"125.3K\", \"totalSubmission\": \"352.7K\", \"totalAcceptedRaw\": 125334, \"totalSubmissionRaw\": 352713, \"acRate\": \"35.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"383","questionFrontendId":"383","title":"Ransom Note","titleSlug":"ransom-note","translatedTitle":null,"stats":"{\"totalAccepted\": \"719.9K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 719913, \"totalSubmissionRaw\": 1237820, \"acRate\": \"58.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"387","questionFrontendId":"387","title":"First Unique Character in a String","titleSlug":"first-unique-character-in-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 1362161, \"totalSubmissionRaw\": 2288838, \"acRate\": \"59.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"389","questionFrontendId":"389","title":"Find the Difference","titleSlug":"find-the-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"482.5K\", \"totalSubmission\": \"804.5K\", \"totalAcceptedRaw\": 482524, \"totalSubmissionRaw\": 804520, \"acRate\": \"60.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"395","questionFrontendId":"395","title":"Longest Substring with At Least K Repeating Characters","titleSlug":"longest-substring-with-at-least-k-repeating-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"184.9K\", \"totalSubmission\": \"412.9K\", \"totalAcceptedRaw\": 184867, \"totalSubmissionRaw\": 412866, \"acRate\": \"44.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"398","questionFrontendId":"398","title":"Random Pick Index","titleSlug":"random-pick-index","translatedTitle":null,"stats":"{\"totalAccepted\": \"187.6K\", \"totalSubmission\": \"300K\", \"totalAcceptedRaw\": 187635, \"totalSubmissionRaw\": 299982, \"acRate\": \"62.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Reservoir Sampling","translatedName":null,"slug":"reservoir-sampling","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"409","questionFrontendId":"409","title":"Longest Palindrome","titleSlug":"longest-palindrome","translatedTitle":null,"stats":"{\"totalAccepted\": \"487.3K\", \"totalSubmission\": \"898.1K\", \"totalAcceptedRaw\": 487322, \"totalSubmissionRaw\": 898065, \"acRate\": \"54.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"421","questionFrontendId":"421","title":"Maximum XOR of Two Numbers in an Array","titleSlug":"maximum-xor-of-two-numbers-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"138.6K\", \"totalSubmission\": \"256.2K\", \"totalAcceptedRaw\": 138621, \"totalSubmissionRaw\": 256228, \"acRate\": \"54.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"423","questionFrontendId":"423","title":"Reconstruct Original Digits from English","titleSlug":"reconstruct-original-digits-from-english","translatedTitle":null,"stats":"{\"totalAccepted\": \"71.5K\", \"totalSubmission\": \"139.4K\", \"totalAcceptedRaw\": 71468, \"totalSubmissionRaw\": 139416, \"acRate\": \"51.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"424","questionFrontendId":"424","title":"Longest Repeating Character Replacement","titleSlug":"longest-repeating-character-replacement","translatedTitle":null,"stats":"{\"totalAccepted\": \"423.3K\", \"totalSubmission\": \"816.3K\", \"totalAcceptedRaw\": 423254, \"totalSubmissionRaw\": 816265, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"432","questionFrontendId":"432","title":"All O`one Data Structure","titleSlug":"all-oone-data-structure","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.6K\", \"totalSubmission\": \"185.1K\", \"totalAcceptedRaw\": 67644, \"totalSubmissionRaw\": 185050, \"acRate\": \"36.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"433","questionFrontendId":"433","title":"Minimum Genetic Mutation","titleSlug":"minimum-genetic-mutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.6K\", \"totalSubmission\": \"219K\", \"totalAcceptedRaw\": 114574, \"totalSubmissionRaw\": 218999, \"acRate\": \"52.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"438","questionFrontendId":"438","title":"Find All Anagrams in a String","titleSlug":"find-all-anagrams-in-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"742.2K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 742156, \"totalSubmissionRaw\": 1479640, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"442","questionFrontendId":"442","title":"Find All Duplicates in an Array","titleSlug":"find-all-duplicates-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"502.2K\", \"totalSubmission\": \"683.8K\", \"totalAcceptedRaw\": 502214, \"totalSubmissionRaw\": 683759, \"acRate\": \"73.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"447","questionFrontendId":"447","title":"Number of Boomerangs","titleSlug":"number-of-boomerangs","translatedTitle":null,"stats":"{\"totalAccepted\": \"92.6K\", \"totalSubmission\": \"168.8K\", \"totalAcceptedRaw\": 92629, \"totalSubmissionRaw\": 168788, \"acRate\": \"54.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"448","questionFrontendId":"448","title":"Find All Numbers Disappeared in an Array","titleSlug":"find-all-numbers-disappeared-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"706.5K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 706526, \"totalSubmissionRaw\": 1179227, \"acRate\": \"59.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"451","questionFrontendId":"451","title":"Sort Characters By Frequency","titleSlug":"sort-characters-by-frequency","translatedTitle":null,"stats":"{\"totalAccepted\": \"494.3K\", \"totalSubmission\": \"705.6K\", \"totalAcceptedRaw\": 494256, \"totalSubmissionRaw\": 705582, \"acRate\": \"70.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Bucket Sort","translatedName":null,"slug":"bucket-sort","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"454","questionFrontendId":"454","title":"4Sum II","titleSlug":"4sum-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"288.5K\", \"totalSubmission\": \"504.2K\", \"totalAcceptedRaw\": 288547, \"totalSubmissionRaw\": 504197, \"acRate\": \"57.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"457","questionFrontendId":"457","title":"Circular Array Loop","titleSlug":"circular-array-loop","translatedTitle":null,"stats":"{\"totalAccepted\": \"68.6K\", \"totalSubmission\": \"210.5K\", \"totalAcceptedRaw\": 68568, \"totalSubmissionRaw\": 210473, \"acRate\": \"32.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"460","questionFrontendId":"460","title":"LFU Cache","titleSlug":"lfu-cache","translatedTitle":null,"stats":"{\"totalAccepted\": \"213.6K\", \"totalSubmission\": \"497K\", \"totalAcceptedRaw\": 213605, \"totalSubmissionRaw\": 497001, \"acRate\": \"43.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"480","questionFrontendId":"480","title":"Sliding Window Median","titleSlug":"sliding-window-median","translatedTitle":null,"stats":"{\"totalAccepted\": \"125.3K\", \"totalSubmission\": \"303.1K\", \"totalAcceptedRaw\": 125261, \"totalSubmissionRaw\": 303079, \"acRate\": \"41.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"491","questionFrontendId":"491","title":"Non-decreasing Subsequences","titleSlug":"non-decreasing-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"146.6K\", \"totalSubmission\": \"243.8K\", \"totalAcceptedRaw\": 146564, \"totalSubmissionRaw\": 243806, \"acRate\": \"60.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"496","questionFrontendId":"496","title":"Next Greater Element I","titleSlug":"next-greater-element-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"503.4K\", \"totalSubmission\": \"704.5K\", \"totalAcceptedRaw\": 503374, \"totalSubmissionRaw\": 704509, \"acRate\": \"71.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"500","questionFrontendId":"500","title":"Keyboard Row","titleSlug":"keyboard-row","translatedTitle":null,"stats":"{\"totalAccepted\": \"181K\", \"totalSubmission\": \"260.4K\", \"totalAcceptedRaw\": 180999, \"totalSubmissionRaw\": 260416, \"acRate\": \"69.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"508","questionFrontendId":"508","title":"Most Frequent Subtree Sum","titleSlug":"most-frequent-subtree-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.8K\", \"totalSubmission\": \"192.5K\", \"totalAcceptedRaw\": 124782, \"totalSubmissionRaw\": 192529, \"acRate\": \"64.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"519","questionFrontendId":"1983","title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.8K\", \"totalSubmission\": \"3.4K\", \"totalAcceptedRaw\": 1827, \"totalSubmissionRaw\": 3370, \"acRate\": \"54.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"522","questionFrontendId":"522","title":"Longest Uncommon Subsequence II","titleSlug":"longest-uncommon-subsequence-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.8K\", \"totalSubmission\": \"115.7K\", \"totalAcceptedRaw\": 46844, \"totalSubmissionRaw\": 115706, \"acRate\": \"40.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"523","questionFrontendId":"523","title":"Continuous Subarray Sum","titleSlug":"continuous-subarray-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"386.9K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 386950, \"totalSubmissionRaw\": 1357202, \"acRate\": \"28.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"525","questionFrontendId":"525","title":"Contiguous Array","titleSlug":"contiguous-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"292.2K\", \"totalSubmission\": \"623.9K\", \"totalAcceptedRaw\": 292190, \"totalSubmissionRaw\": 623885, \"acRate\": \"46.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"531","questionFrontendId":"531","title":"Lonely Pixel I","titleSlug":"lonely-pixel-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.8K\", \"totalSubmission\": \"62.4K\", \"totalAcceptedRaw\": 38823, \"totalSubmissionRaw\": 62445, \"acRate\": \"62.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"532","questionFrontendId":"532","title":"K-diff Pairs in an Array","titleSlug":"k-diff-pairs-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"287.7K\", \"totalSubmission\": \"699.9K\", \"totalAcceptedRaw\": 287711, \"totalSubmissionRaw\": 699894, \"acRate\": \"41.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"533","questionFrontendId":"533","title":"Lonely Pixel II","titleSlug":"lonely-pixel-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.7K\", \"totalSubmission\": \"26.2K\", \"totalAcceptedRaw\": 12706, \"totalSubmissionRaw\": 26206, \"acRate\": \"48.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"535","questionFrontendId":"535","title":"Encode and Decode TinyURL","titleSlug":"encode-and-decode-tinyurl","translatedTitle":null,"stats":"{\"totalAccepted\": \"225.6K\", \"totalSubmission\": \"262.6K\", \"totalAcceptedRaw\": 225605, \"totalSubmissionRaw\": 262567, \"acRate\": \"85.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"554","questionFrontendId":"554","title":"Brick Wall","titleSlug":"brick-wall","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.3K\", \"totalSubmission\": \"213.7K\", \"totalAcceptedRaw\": 114337, \"totalSubmissionRaw\": 213694, \"acRate\": \"53.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"560","questionFrontendId":"560","title":"Subarray Sum Equals K","titleSlug":"subarray-sum-equals-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"944.3K\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 944334, \"totalSubmissionRaw\": 2160003, \"acRate\": \"43.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"567","questionFrontendId":"567","title":"Permutation in String","titleSlug":"permutation-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"624.7K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 624728, \"totalSubmissionRaw\": 1408151, \"acRate\": \"44.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"575","questionFrontendId":"575","title":"Distribute Candies","titleSlug":"distribute-candies","translatedTitle":null,"stats":"{\"totalAccepted\": \"237.2K\", \"totalSubmission\": \"357.1K\", \"totalAcceptedRaw\": 237170, \"totalSubmissionRaw\": 357053, \"acRate\": \"66.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"582","questionFrontendId":"582","title":"Kill Process","titleSlug":"kill-process","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.4K\", \"totalSubmission\": \"114.1K\", \"totalAcceptedRaw\": 78370, \"totalSubmissionRaw\": 114068, \"acRate\": \"68.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"588","questionFrontendId":"588","title":"Design In-Memory File System","titleSlug":"design-in-memory-file-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"84K\", \"totalSubmission\": \"172.6K\", \"totalAcceptedRaw\": 83961, \"totalSubmissionRaw\": 172639, \"acRate\": \"48.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"594","questionFrontendId":"594","title":"Longest Harmonious Subsequence","titleSlug":"longest-harmonious-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"132.5K\", \"totalSubmission\": \"247.8K\", \"totalAcceptedRaw\": 132474, \"totalSubmissionRaw\": 247770, \"acRate\": \"53.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"599","questionFrontendId":"599","title":"Minimum Index Sum of Two Lists","titleSlug":"minimum-index-sum-of-two-lists","translatedTitle":null,"stats":"{\"totalAccepted\": \"185.2K\", \"totalSubmission\": \"347.6K\", \"totalAcceptedRaw\": 185174, \"totalSubmissionRaw\": 347554, \"acRate\": \"53.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"604","questionFrontendId":"604","title":"Design Compressed String Iterator","titleSlug":"design-compressed-string-iterator","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.3K\", \"totalSubmission\": \"74.2K\", \"totalAcceptedRaw\": 29303, \"totalSubmissionRaw\": 74168, \"acRate\": \"39.5%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Iterator","translatedName":null,"slug":"iterator","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"609","questionFrontendId":"609","title":"Find Duplicate File in System","titleSlug":"find-duplicate-file-in-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"143.6K\", \"totalSubmission\": \"211.9K\", \"totalAcceptedRaw\": 143589, \"totalSubmissionRaw\": 211868, \"acRate\": \"67.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"616","questionFrontendId":"616","title":"Add Bold Tag in String","titleSlug":"add-bold-tag-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"82.1K\", \"totalSubmission\": \"168.2K\", \"totalAcceptedRaw\": 82101, \"totalSubmissionRaw\": 168183, \"acRate\": \"48.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"621","questionFrontendId":"621","title":"Task Scheduler","titleSlug":"task-scheduler","translatedTitle":null,"stats":"{\"totalAccepted\": \"418.7K\", \"totalSubmission\": \"744K\", \"totalAcceptedRaw\": 418729, \"totalSubmissionRaw\": 743960, \"acRate\": \"56.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"632","questionFrontendId":"632","title":"Smallest Range Covering Elements from K Lists","titleSlug":"smallest-range-covering-elements-from-k-lists","translatedTitle":null,"stats":"{\"totalAccepted\": \"83.1K\", \"totalSubmission\": \"136.4K\", \"totalAcceptedRaw\": 83143, \"totalSubmissionRaw\": 136412, \"acRate\": \"60.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"635","questionFrontendId":"635","title":"Design Log Storage System","titleSlug":"design-log-storage-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.1K\", \"totalSubmission\": \"52.7K\", \"totalAcceptedRaw\": 33081, \"totalSubmissionRaw\": 52688, \"acRate\": \"62.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"645","questionFrontendId":"645","title":"Set Mismatch","titleSlug":"set-mismatch","translatedTitle":null,"stats":"{\"totalAccepted\": \"262.8K\", \"totalSubmission\": \"614.7K\", \"totalAcceptedRaw\": 262794, \"totalSubmissionRaw\": 614699, \"acRate\": \"42.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"648","questionFrontendId":"648","title":"Replace Words","titleSlug":"replace-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"116.5K\", \"totalSubmission\": \"185.8K\", \"totalAcceptedRaw\": 116539, \"totalSubmissionRaw\": 185827, \"acRate\": \"62.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"652","questionFrontendId":"652","title":"Find Duplicate Subtrees","titleSlug":"find-duplicate-subtrees","translatedTitle":null,"stats":"{\"totalAccepted\": \"228.1K\", \"totalSubmission\": \"386.9K\", \"totalAcceptedRaw\": 228142, \"totalSubmissionRaw\": 386902, \"acRate\": \"59.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"653","questionFrontendId":"653","title":"Two Sum IV - Input is a BST","titleSlug":"two-sum-iv-input-is-a-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"445.1K\", \"totalSubmission\": \"729.2K\", \"totalAcceptedRaw\": 445113, \"totalSubmissionRaw\": 729202, \"acRate\": \"61.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"659","questionFrontendId":"659","title":"Split Array into Consecutive Subsequences","titleSlug":"split-array-into-consecutive-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"122.2K\", \"totalSubmission\": \"240.5K\", \"totalAcceptedRaw\": 122188, \"totalSubmissionRaw\": 240480, \"acRate\": \"50.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"676","questionFrontendId":"676","title":"Implement Magic Dictionary","titleSlug":"implement-magic-dictionary","translatedTitle":null,"stats":"{\"totalAccepted\": \"71K\", \"totalSubmission\": \"124.7K\", \"totalAcceptedRaw\": 70984, \"totalSubmissionRaw\": 124652, \"acRate\": \"56.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"677","questionFrontendId":"677","title":"Map Sum Pairs","titleSlug":"map-sum-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"101.7K\", \"totalSubmission\": \"179K\", \"totalAcceptedRaw\": 101720, \"totalSubmissionRaw\": 179038, \"acRate\": \"56.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"690","questionFrontendId":"690","title":"Employee Importance","titleSlug":"employee-importance","translatedTitle":null,"stats":"{\"totalAccepted\": \"191.9K\", \"totalSubmission\": \"292.8K\", \"totalAcceptedRaw\": 191855, \"totalSubmissionRaw\": 292770, \"acRate\": \"65.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"692","questionFrontendId":"692","title":"Top K Frequent Words","titleSlug":"top-k-frequent-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"532.5K\", \"totalSubmission\": \"932.1K\", \"totalAcceptedRaw\": 532489, \"totalSubmissionRaw\": 932140, \"acRate\": \"57.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Bucket Sort","translatedName":null,"slug":"bucket-sort","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"694","questionFrontendId":"694","title":"Number of Distinct Islands","titleSlug":"number-of-distinct-islands","translatedTitle":null,"stats":"{\"totalAccepted\": \"147.1K\", \"totalSubmission\": \"242.1K\", \"totalAcceptedRaw\": 147068, \"totalSubmissionRaw\": 242132, \"acRate\": \"60.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"697","questionFrontendId":"697","title":"Degree of an Array","titleSlug":"degree-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"177.5K\", \"totalSubmission\": \"317.3K\", \"totalAcceptedRaw\": 177468, \"totalSubmissionRaw\": 317303, \"acRate\": \"55.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"711","questionFrontendId":"711","title":"Number of Distinct Islands II","titleSlug":"number-of-distinct-islands-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"17.8K\", \"totalAcceptedRaw\": 9240, \"totalSubmissionRaw\": 17821, \"acRate\": \"51.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"720","questionFrontendId":"720","title":"Longest Word in Dictionary","titleSlug":"longest-word-in-dictionary","translatedTitle":null,"stats":"{\"totalAccepted\": \"134.4K\", \"totalSubmission\": \"258.7K\", \"totalAcceptedRaw\": 134388, \"totalSubmissionRaw\": 258746, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"726","questionFrontendId":"726","title":"Number of Atoms","titleSlug":"number-of-atoms","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.4K\", \"totalSubmission\": \"100.6K\", \"totalAcceptedRaw\": 52417, \"totalSubmissionRaw\": 100570, \"acRate\": \"52.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"734","questionFrontendId":"734","title":"Sentence Similarity","titleSlug":"sentence-similarity","translatedTitle":null,"stats":"{\"totalAccepted\": \"60K\", \"totalSubmission\": \"136.4K\", \"totalAcceptedRaw\": 59975, \"totalSubmissionRaw\": 136387, \"acRate\": \"44.0%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"736","questionFrontendId":"736","title":"Parse Lisp Expression","titleSlug":"parse-lisp-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.1K\", \"totalSubmission\": \"39K\", \"totalAcceptedRaw\": 20132, \"totalSubmissionRaw\": 39027, \"acRate\": \"51.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"737","questionFrontendId":"737","title":"Sentence Similarity II","titleSlug":"sentence-similarity-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.1K\", \"totalSubmission\": \"132.8K\", \"totalAcceptedRaw\": 65064, \"totalSubmissionRaw\": 132773, \"acRate\": \"49.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"740","questionFrontendId":"740","title":"Delete and Earn","titleSlug":"delete-and-earn","translatedTitle":null,"stats":"{\"totalAccepted\": \"258.9K\", \"totalSubmission\": \"453.5K\", \"totalAcceptedRaw\": 258919, \"totalSubmissionRaw\": 453530, \"acRate\": \"57.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"746","questionFrontendId":"745","title":"Prefix and Suffix Search","titleSlug":"prefix-and-suffix-search","translatedTitle":null,"stats":"{\"totalAccepted\": \"89.3K\", \"totalSubmission\": \"216.5K\", \"totalAcceptedRaw\": 89321, \"totalSubmissionRaw\": 216530, \"acRate\": \"41.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"749","questionFrontendId":"748","title":"Shortest Completing Word","titleSlug":"shortest-completing-word","translatedTitle":null,"stats":"{\"totalAccepted\": \"59.9K\", \"totalSubmission\": \"101.2K\", \"totalAcceptedRaw\": 59934, \"totalSubmissionRaw\": 101198, \"acRate\": \"59.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"753","questionFrontendId":"752","title":"Open the Lock","titleSlug":"open-the-lock","translatedTitle":null,"stats":"{\"totalAccepted\": \"197.6K\", \"totalSubmission\": \"355.3K\", \"totalAcceptedRaw\": 197571, \"totalSubmissionRaw\": 355281, \"acRate\": \"55.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"760","questionFrontendId":"758","title":"Bold Words in String","titleSlug":"bold-words-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.8K\", \"totalSubmission\": \"35K\", \"totalAcceptedRaw\": 17751, \"totalSubmissionRaw\": 34957, \"acRate\": \"50.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"762","questionFrontendId":"760","title":"Find Anagram Mappings","titleSlug":"find-anagram-mappings","translatedTitle":null,"stats":"{\"totalAccepted\": \"88K\", \"totalSubmission\": \"106K\", \"totalAcceptedRaw\": 87956, \"totalSubmissionRaw\": 106046, \"acRate\": \"82.9%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"768","questionFrontendId":"763","title":"Partition Labels","titleSlug":"partition-labels","translatedTitle":null,"stats":"{\"totalAccepted\": \"456.9K\", \"totalSubmission\": \"572.9K\", \"totalAcceptedRaw\": 456930, \"totalSubmissionRaw\": 572908, \"acRate\": \"79.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"778","questionFrontendId":"767","title":"Reorganize String","titleSlug":"reorganize-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"258.4K\", \"totalSubmission\": \"488.8K\", \"totalAcceptedRaw\": 258385, \"totalSubmissionRaw\": 488764, \"acRate\": \"52.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"781","questionFrontendId":"770","title":"Basic Calculator IV","titleSlug":"basic-calculator-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"16.4K\", \"totalAcceptedRaw\": 9186, \"totalSubmissionRaw\": 16435, \"acRate\": \"55.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"782","questionFrontendId":"771","title":"Jewels and Stones","titleSlug":"jewels-and-stones","translatedTitle":null,"stats":"{\"totalAccepted\": \"852.8K\", \"totalSubmission\": \"967K\", \"totalAcceptedRaw\": 852777, \"totalSubmissionRaw\": 967042, \"acRate\": \"88.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"797","questionFrontendId":"781","title":"Rabbits in Forest","titleSlug":"rabbits-in-forest","translatedTitle":null,"stats":"{\"totalAccepted\": \"45K\", \"totalSubmission\": \"82K\", \"totalAcceptedRaw\": 44962, \"totalSubmissionRaw\": 81989, \"acRate\": \"54.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"807","questionFrontendId":"791","title":"Custom Sort String","titleSlug":"custom-sort-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"210.9K\", \"totalSubmission\": \"304.9K\", \"totalAcceptedRaw\": 210867, \"totalSubmissionRaw\": 304922, \"acRate\": \"69.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"808","questionFrontendId":"792","title":"Number of Matching Subsequences","titleSlug":"number-of-matching-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"208K\", \"totalSubmission\": \"402.6K\", \"totalAcceptedRaw\": 207969, \"totalSubmissionRaw\": 402573, \"acRate\": \"51.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"816","questionFrontendId":"705","title":"Design HashSet","titleSlug":"design-hashset","translatedTitle":null,"stats":"{\"totalAccepted\": \"278.3K\", \"totalSubmission\": \"423.8K\", \"totalAcceptedRaw\": 278251, \"totalSubmissionRaw\": 423827, \"acRate\": \"65.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"817","questionFrontendId":"706","title":"Design HashMap","titleSlug":"design-hashmap","translatedTitle":null,"stats":"{\"totalAccepted\": \"401.9K\", \"totalSubmission\": \"620.9K\", \"totalAcceptedRaw\": 401878, \"totalSubmissionRaw\": 620861, \"acRate\": \"64.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"822","questionFrontendId":"804","title":"Unique Morse Code Words","titleSlug":"unique-morse-code-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"310.5K\", \"totalSubmission\": \"375.8K\", \"totalAcceptedRaw\": 310457, \"totalSubmissionRaw\": 375758, \"acRate\": \"82.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"829","questionFrontendId":"811","title":"Subdomain Visit Count","titleSlug":"subdomain-visit-count","translatedTitle":null,"stats":"{\"totalAccepted\": \"206.8K\", \"totalSubmission\": \"273.9K\", \"totalAcceptedRaw\": 206801, \"totalSubmissionRaw\": 273946, \"acRate\": \"75.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"833","questionFrontendId":"815","title":"Bus Routes","titleSlug":"bus-routes","translatedTitle":null,"stats":"{\"totalAccepted\": \"120.9K\", \"totalSubmission\": \"264.9K\", \"totalAcceptedRaw\": 120870, \"totalSubmissionRaw\": 264936, \"acRate\": \"45.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"835","questionFrontendId":"817","title":"Linked List Components","titleSlug":"linked-list-components","translatedTitle":null,"stats":"{\"totalAccepted\": \"79.3K\", \"totalSubmission\": \"137.3K\", \"totalAcceptedRaw\": 79272, \"totalSubmissionRaw\": 137291, \"acRate\": \"57.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"837","questionFrontendId":"819","title":"Most Common Word","titleSlug":"most-common-word","translatedTitle":null,"stats":"{\"totalAccepted\": \"322K\", \"totalSubmission\": \"719.2K\", \"totalAcceptedRaw\": 321984, \"totalSubmissionRaw\": 719249, \"acRate\": \"44.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"839","questionFrontendId":"820","title":"Short Encoding of Words","titleSlug":"short-encoding-of-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"91.4K\", \"totalSubmission\": \"150.8K\", \"totalAcceptedRaw\": 91354, \"totalSubmissionRaw\": 150755, \"acRate\": \"60.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"842","questionFrontendId":"822","title":"Card Flipping Game","titleSlug":"card-flipping-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.2K\", \"totalSubmission\": \"33K\", \"totalAcceptedRaw\": 15176, \"totalSubmissionRaw\": 33041, \"acRate\": \"45.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"843","questionFrontendId":"823","title":"Binary Trees With Factors","titleSlug":"binary-trees-with-factors","translatedTitle":null,"stats":"{\"totalAccepted\": \"89.5K\", \"totalSubmission\": \"180K\", \"totalAcceptedRaw\": 89487, \"totalSubmissionRaw\": 180021, \"acRate\": \"49.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"855","questionFrontendId":"828","title":"Count Unique Characters of All Substrings of a Given String","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.4K\", \"totalSubmission\": \"122.4K\", \"totalAcceptedRaw\": 63363, \"totalSubmissionRaw\": 122446, \"acRate\": \"51.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"876","questionFrontendId":"846","title":"Hand of Straights","titleSlug":"hand-of-straights","translatedTitle":null,"stats":"{\"totalAccepted\": \"113.5K\", \"totalSubmission\": \"201.8K\", \"totalAcceptedRaw\": 113453, \"totalSubmissionRaw\": 201770, \"acRate\": \"56.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"889","questionFrontendId":"859","title":"Buddy Strings","titleSlug":"buddy-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"144.1K\", \"totalSubmission\": \"494.2K\", \"totalAcceptedRaw\": 144115, \"totalSubmissionRaw\": 494218, \"acRate\": \"29.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"894","questionFrontendId":"710","title":"Random Pick with Blacklist","titleSlug":"random-pick-with-blacklist","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.8K\", \"totalSubmission\": \"106.6K\", \"totalAcceptedRaw\": 35755, \"totalSubmissionRaw\": 106616, \"acRate\": \"33.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"896","questionFrontendId":"865","title":"Smallest Subtree with all the Deepest Nodes","titleSlug":"smallest-subtree-with-all-the-deepest-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"115.3K\", \"totalSubmission\": \"167.4K\", \"totalAcceptedRaw\": 115329, \"totalSubmissionRaw\": 167361, \"acRate\": \"68.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"905","questionFrontendId":"873","title":"Length of Longest Fibonacci Subsequence","titleSlug":"length-of-longest-fibonacci-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"55.4K\", \"totalSubmission\": \"114.6K\", \"totalAcceptedRaw\": 55403, \"totalSubmissionRaw\": 114643, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"913","questionFrontendId":"519","title":"Random Flip Matrix","titleSlug":"random-flip-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.1K\", \"totalSubmission\": \"40.1K\", \"totalAcceptedRaw\": 16058, \"totalSubmissionRaw\": 40131, \"acRate\": \"40.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Reservoir Sampling","translatedName":null,"slug":"reservoir-sampling","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"920","questionFrontendId":"884","title":"Uncommon Words from Two Sentences","titleSlug":"uncommon-words-from-two-sentences","translatedTitle":null,"stats":"{\"totalAccepted\": \"115.6K\", \"totalSubmission\": \"174.3K\", \"totalAcceptedRaw\": 115606, \"totalSubmissionRaw\": 174297, \"acRate\": \"66.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"924","questionFrontendId":"888","title":"Fair Candy Swap","titleSlug":"fair-candy-swap","translatedTitle":null,"stats":"{\"totalAccepted\": \"99.4K\", \"totalSubmission\": \"163.8K\", \"totalAcceptedRaw\": 99438, \"totalSubmissionRaw\": 163833, \"acRate\": \"60.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"925","questionFrontendId":"889","title":"Construct Binary Tree from Preorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"86.7K\", \"totalSubmission\": \"122.2K\", \"totalAcceptedRaw\": 86717, \"totalSubmissionRaw\": 122198, \"acRate\": \"71.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"926","questionFrontendId":"890","title":"Find and Replace Pattern","titleSlug":"find-and-replace-pattern","translatedTitle":null,"stats":"{\"totalAccepted\": \"167.9K\", \"totalSubmission\": \"216.3K\", \"totalAcceptedRaw\": 167899, \"totalSubmissionRaw\": 216350, \"acRate\": \"77.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"929","questionFrontendId":"893","title":"Groups of Special-Equivalent Strings","titleSlug":"groups-of-special-equivalent-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.6K\", \"totalSubmission\": \"62.7K\", \"totalAcceptedRaw\": 44551, \"totalSubmissionRaw\": 62696, \"acRate\": \"71.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"931","questionFrontendId":"895","title":"Maximum Frequency Stack","titleSlug":"maximum-frequency-stack","translatedTitle":null,"stats":"{\"totalAccepted\": \"150K\", \"totalSubmission\": \"225.1K\", \"totalAcceptedRaw\": 149960, \"totalSubmissionRaw\": 225114, \"acRate\": \"66.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"940","questionFrontendId":"904","title":"Fruit Into Baskets","titleSlug":"fruit-into-baskets","translatedTitle":null,"stats":"{\"totalAccepted\": \"327K\", \"totalSubmission\": \"747.8K\", \"totalAcceptedRaw\": 326964, \"totalSubmissionRaw\": 747764, \"acRate\": \"43.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"947","questionFrontendId":"911","title":"Online Election","titleSlug":"online-election","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.3K\", \"totalSubmission\": \"92.6K\", \"totalAcceptedRaw\": 48341, \"totalSubmissionRaw\": 92644, \"acRate\": \"52.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"950","questionFrontendId":"914","title":"X of a Kind in a Deck of Cards","titleSlug":"x-of-a-kind-in-a-deck-of-cards","translatedTitle":null,"stats":"{\"totalAccepted\": \"102.7K\", \"totalSubmission\": \"328.4K\", \"totalAcceptedRaw\": 102721, \"totalSubmissionRaw\": 328393, \"acRate\": \"31.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"952","questionFrontendId":"916","title":"Word Subsets","titleSlug":"word-subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"107.7K\", \"totalSubmission\": \"200.3K\", \"totalAcceptedRaw\": 107678, \"totalSubmissionRaw\": 200341, \"acRate\": \"53.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"959","questionFrontendId":"923","title":"3Sum With Multiplicity","titleSlug":"3sum-with-multiplicity","translatedTitle":null,"stats":"{\"totalAccepted\": \"95.4K\", \"totalSubmission\": \"210.5K\", \"totalAcceptedRaw\": 95352, \"totalSubmissionRaw\": 210469, \"acRate\": \"45.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"965","questionFrontendId":"929","title":"Unique Email Addresses","titleSlug":"unique-email-addresses","translatedTitle":null,"stats":"{\"totalAccepted\": \"415.2K\", \"totalSubmission\": \"618.4K\", \"totalAcceptedRaw\": 415205, \"totalSubmissionRaw\": 618445, \"acRate\": \"67.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"966","questionFrontendId":"930","title":"Binary Subarrays With Sum","titleSlug":"binary-subarrays-with-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"64.7K\", \"totalSubmission\": \"124.5K\", \"totalAcceptedRaw\": 64720, \"totalSubmissionRaw\": 124513, \"acRate\": \"52.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"976","questionFrontendId":"939","title":"Minimum Area Rectangle","titleSlug":"minimum-area-rectangle","translatedTitle":null,"stats":"{\"totalAccepted\": \"121.1K\", \"totalSubmission\": \"228.9K\", \"totalAcceptedRaw\": 121134, \"totalSubmissionRaw\": 228875, \"acRate\": \"52.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"990","questionFrontendId":"953","title":"Verifying an Alien Dictionary","titleSlug":"verifying-an-alien-dictionary","translatedTitle":null,"stats":"{\"totalAccepted\": \"453.7K\", \"totalSubmission\": \"833.1K\", \"totalAcceptedRaw\": 453731, \"totalSubmissionRaw\": 833145, \"acRate\": \"54.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"991","questionFrontendId":"954","title":"Array of Doubled Pairs","titleSlug":"array-of-doubled-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"80.4K\", \"totalSubmission\": \"205.8K\", \"totalAcceptedRaw\": 80389, \"totalSubmissionRaw\": 205809, \"acRate\": \"39.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"994","questionFrontendId":"957","title":"Prison Cells After N Days","titleSlug":"prison-cells-after-n-days","translatedTitle":null,"stats":"{\"totalAccepted\": \"151.5K\", \"totalSubmission\": \"387.8K\", \"totalAcceptedRaw\": 151477, \"totalSubmissionRaw\": 387757, \"acRate\": \"39.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1001","questionFrontendId":"961","title":"N-Repeated Element in Size 2N Array","titleSlug":"n-repeated-element-in-size-2n-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"202.1K\", \"totalSubmission\": \"265.8K\", \"totalAcceptedRaw\": 202059, \"totalSubmissionRaw\": 265773, \"acRate\": \"76.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1006","questionFrontendId":"966","title":"Vowel Spellchecker","titleSlug":"vowel-spellchecker","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.2K\", \"totalSubmission\": \"74.2K\", \"totalAcceptedRaw\": 38161, \"totalSubmissionRaw\": 74214, \"acRate\": \"51.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1010","questionFrontendId":"970","title":"Powerful Integers","titleSlug":"powerful-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"49.9K\", \"totalSubmission\": \"114.5K\", \"totalAcceptedRaw\": 49916, \"totalSubmissionRaw\": 114454, \"acRate\": \"43.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1016","questionFrontendId":"974","title":"Subarray Sums Divisible by K","titleSlug":"subarray-sums-divisible-by-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"193.3K\", \"totalSubmission\": \"355.2K\", \"totalAcceptedRaw\": 193321, \"totalSubmissionRaw\": 355154, \"acRate\": \"54.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1023","questionFrontendId":"981","title":"Time Based Key-Value Store","titleSlug":"time-based-key-value-store","translatedTitle":null,"stats":"{\"totalAccepted\": \"306.6K\", \"totalSubmission\": \"585.3K\", \"totalAcceptedRaw\": 306561, \"totalSubmissionRaw\": 585265, \"acRate\": \"52.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1024","questionFrontendId":"982","title":"Triples with Bitwise AND Equal To Zero","titleSlug":"triples-with-bitwise-and-equal-to-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.7K\", \"totalSubmission\": \"25.5K\", \"totalAcceptedRaw\": 14665, \"totalSubmissionRaw\": 25478, \"acRate\": \"57.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1029","questionFrontendId":"987","title":"Vertical Order Traversal of a Binary Tree","titleSlug":"vertical-order-traversal-of-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"324.9K\", \"totalSubmission\": \"721.4K\", \"totalAcceptedRaw\": 324853, \"totalSubmissionRaw\": 721357, \"acRate\": \"45.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1034","questionFrontendId":"992","title":"Subarrays with K Different Integers","titleSlug":"subarrays-with-k-different-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"90.2K\", \"totalSubmission\": \"165K\", \"totalAcceptedRaw\": 90236, \"totalSubmissionRaw\": 165019, \"acRate\": \"54.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1039","questionFrontendId":"997","title":"Find the Town Judge","titleSlug":"find-the-town-judge","translatedTitle":null,"stats":"{\"totalAccepted\": \"401.3K\", \"totalSubmission\": \"809.5K\", \"totalAcceptedRaw\": 401329, \"totalSubmissionRaw\": 809533, \"acRate\": \"49.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1043","questionFrontendId":"1001","title":"Grid Illumination","titleSlug":"grid-illumination","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.6K\", \"totalSubmission\": \"48.6K\", \"totalAcceptedRaw\": 17587, \"totalSubmissionRaw\": 48627, \"acRate\": \"36.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1044","questionFrontendId":"1002","title":"Find Common Characters","titleSlug":"find-common-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"174.1K\", \"totalSubmission\": \"254.4K\", \"totalAcceptedRaw\": 174136, \"totalSubmissionRaw\": 254382, \"acRate\": \"68.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1055","questionFrontendId":"1010","title":"Pairs of Songs With Total Durations Divisible by 60","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60","translatedTitle":null,"stats":"{\"totalAccepted\": \"236.5K\", \"totalSubmission\": \"448.1K\", \"totalAcceptedRaw\": 236487, \"totalSubmissionRaw\": 448062, \"acRate\": \"52.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1064","questionFrontendId":"1015","title":"Smallest Integer Divisible by K","titleSlug":"smallest-integer-divisible-by-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.7K\", \"totalSubmission\": \"125.2K\", \"totalAcceptedRaw\": 58667, \"totalSubmissionRaw\": 125245, \"acRate\": \"46.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1074","questionFrontendId":"1086","title":"High Five","titleSlug":"high-five","translatedTitle":null,"stats":"{\"totalAccepted\": \"93.2K\", \"totalSubmission\": \"124.1K\", \"totalAcceptedRaw\": 93171, \"totalSubmissionRaw\": 124138, \"acRate\": \"75.1%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1084","questionFrontendId":"1100","title":"Find K-Length Substrings With No Repeated Characters","titleSlug":"find-k-length-substrings-with-no-repeated-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.3K\", \"totalSubmission\": \"45.9K\", \"totalAcceptedRaw\": 34284, \"totalSubmissionRaw\": 45921, \"acRate\": \"74.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1087","questionFrontendId":"1027","title":"Longest Arithmetic Subsequence","titleSlug":"longest-arithmetic-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"99.8K\", \"totalSubmission\": \"213.3K\", \"totalAcceptedRaw\": 99805, \"totalSubmissionRaw\": 213286, \"acRate\": \"46.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1098","questionFrontendId":"1133","title":"Largest Unique Number","titleSlug":"largest-unique-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.8K\", \"totalSubmission\": \"56K\", \"totalAcceptedRaw\": 37833, \"totalSubmissionRaw\": 55972, \"acRate\": \"67.6%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1106","questionFrontendId":"1036","title":"Escape a Large Maze","titleSlug":"escape-a-large-maze","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"52.5K\", \"totalAcceptedRaw\": 17925, \"totalSubmissionRaw\": 52548, \"acRate\": \"34.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1108","questionFrontendId":"1152","title":"Analyze User Website Visit Pattern","titleSlug":"analyze-user-website-visit-pattern","translatedTitle":null,"stats":"{\"totalAccepted\": \"86.8K\", \"totalSubmission\": \"201.2K\", \"totalAcceptedRaw\": 86798, \"totalSubmissionRaw\": 201226, \"acRate\": \"43.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1112","questionFrontendId":"1160","title":"Find Words That Can Be Formed by Characters","titleSlug":"find-words-that-can-be-formed-by-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"142.2K\", \"totalSubmission\": \"210.5K\", \"totalAcceptedRaw\": 142183, \"totalSubmissionRaw\": 210516, \"acRate\": \"67.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1123","questionFrontendId":"1165","title":"Single-Row Keyboard","titleSlug":"single-row-keyboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"71.1K\", \"totalSubmission\": \"82.2K\", \"totalAcceptedRaw\": 71145, \"totalSubmissionRaw\": 82203, \"acRate\": \"86.5%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1124","questionFrontendId":"1153","title":"String Transforms Into Another String","titleSlug":"string-transforms-into-another-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"50.4K\", \"totalSubmission\": \"142.9K\", \"totalAcceptedRaw\": 50427, \"totalSubmissionRaw\": 142874, \"acRate\": \"35.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1125","questionFrontendId":"1166","title":"Design File System","titleSlug":"design-file-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"41.6K\", \"totalSubmission\": \"66.9K\", \"totalAcceptedRaw\": 41551, \"totalSubmissionRaw\": 66918, \"acRate\": \"62.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1129","questionFrontendId":"1048","title":"Longest String Chain","titleSlug":"longest-string-chain","translatedTitle":null,"stats":"{\"totalAccepted\": \"302.1K\", \"totalSubmission\": \"509.9K\", \"totalAcceptedRaw\": 302070, \"totalSubmissionRaw\": 509934, \"acRate\": \"59.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1132","questionFrontendId":"1181","title":"Before and After Puzzle","titleSlug":"before-and-after-puzzle","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"20.4K\", \"totalAcceptedRaw\": 9235, \"totalSubmissionRaw\": 20399, \"acRate\": \"45.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1140","questionFrontendId":"1054","title":"Distant Barcodes","titleSlug":"distant-barcodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.1K\", \"totalSubmission\": \"78.8K\", \"totalAcceptedRaw\": 36058, \"totalSubmissionRaw\": 78752, \"acRate\": \"45.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1143","questionFrontendId":"1198","title":"Find Smallest Common Element in All Rows","titleSlug":"find-smallest-common-element-in-all-rows","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.1K\", \"totalSubmission\": \"49.8K\", \"totalAcceptedRaw\": 38137, \"totalSubmissionRaw\": 49777, \"acRate\": \"76.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1145","questionFrontendId":"1074","title":"Number of Submatrices That Sum to Target","titleSlug":"number-of-submatrices-that-sum-to-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"86.2K\", \"totalSubmission\": \"123.7K\", \"totalAcceptedRaw\": 86236, \"totalSubmissionRaw\": 123654, \"acRate\": \"69.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1147","questionFrontendId":"1072","title":"Flip Columns For Maximum Number of Equal Rows","titleSlug":"flip-columns-for-maximum-number-of-equal-rows","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.7K\", \"totalSubmission\": \"31.1K\", \"totalAcceptedRaw\": 19689, \"totalSubmissionRaw\": 31096, \"acRate\": \"63.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1149","questionFrontendId":"1213","title":"Intersection of Three Sorted Arrays","titleSlug":"intersection-of-three-sorted-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"76.9K\", \"totalSubmission\": \"96.2K\", \"totalAcceptedRaw\": 76872, \"totalSubmissionRaw\": 96199, \"acRate\": \"79.9%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1160","questionFrontendId":"1079","title":"Letter Tile Possibilities","titleSlug":"letter-tile-possibilities","translatedTitle":null,"stats":"{\"totalAccepted\": \"83.1K\", \"totalSubmission\": \"109.3K\", \"totalAcceptedRaw\": 83056, \"totalSubmissionRaw\": 109302, \"acRate\": \"76.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1169","questionFrontendId":"1090","title":"Largest Values From Labels","titleSlug":"largest-values-from-labels","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.6K\", \"totalSubmission\": \"53.4K\", \"totalAcceptedRaw\": 32604, \"totalSubmissionRaw\": 53384, \"acRate\": \"61.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1176","questionFrontendId":"1244","title":"Design A Leaderboard","titleSlug":"design-a-leaderboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"60.1K\", \"totalSubmission\": \"87.5K\", \"totalAcceptedRaw\": 60121, \"totalSubmissionRaw\": 87539, \"acRate\": \"68.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1190","questionFrontendId":"1257","title":"Smallest Common Region","titleSlug":"smallest-common-region","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.5K\", \"totalSubmission\": \"30.3K\", \"totalAcceptedRaw\": 19481, \"totalSubmissionRaw\": 30285, \"acRate\": \"64.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1191","questionFrontendId":"1258","title":"Synonymous Sentences","titleSlug":"synonymous-sentences","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.9K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 18944, \"totalSubmissionRaw\": 33431, \"acRate\": \"56.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1217","questionFrontendId":"1122","title":"Relative Sort Array","titleSlug":"relative-sort-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"152.5K\", \"totalSubmission\": \"222.3K\", \"totalAcceptedRaw\": 152506, \"totalSubmissionRaw\": 222307, \"acRate\": \"68.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting Sort","translatedName":null,"slug":"counting-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1218","questionFrontendId":"1123","title":"Lowest Common Ancestor of Deepest Leaves","titleSlug":"lowest-common-ancestor-of-deepest-leaves","translatedTitle":null,"stats":"{\"totalAccepted\": \"89.4K\", \"totalSubmission\": \"126.1K\", \"totalAcceptedRaw\": 89406, \"totalSubmissionRaw\": 126096, \"acRate\": \"70.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1219","questionFrontendId":"1124","title":"Longest Well-Performing Interval","titleSlug":"longest-well-performing-interval","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.3K\", \"totalSubmission\": \"75.8K\", \"totalAcceptedRaw\": 26256, \"totalSubmissionRaw\": 75782, \"acRate\": \"34.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1227","questionFrontendId":"1128","title":"Number of Equivalent Domino Pairs","titleSlug":"number-of-equivalent-domino-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"56.7K\", \"totalSubmission\": \"120.4K\", \"totalAcceptedRaw\": 56721, \"totalSubmissionRaw\": 120429, \"acRate\": \"47.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1238","questionFrontendId":"1138","title":"Alphabet Board Path","titleSlug":"alphabet-board-path","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.3K\", \"totalSubmission\": \"89.1K\", \"totalAcceptedRaw\": 46330, \"totalSubmissionRaw\": 89086, \"acRate\": \"52.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1249","questionFrontendId":"1146","title":"Snapshot Array","titleSlug":"snapshot-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"140.6K\", \"totalSubmission\": \"377.7K\", \"totalAcceptedRaw\": 140558, \"totalSubmissionRaw\": 377697, \"acRate\": \"37.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1256","questionFrontendId":"1331","title":"Rank Transform of an Array","titleSlug":"rank-transform-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"81.3K\", \"totalSubmission\": \"137.2K\", \"totalAcceptedRaw\": 81289, \"totalSubmissionRaw\": 137244, \"acRate\": \"59.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1264","questionFrontendId":"1935","title":"Maximum Number of Words You Can Type","titleSlug":"maximum-number-of-words-you-can-type","translatedTitle":null,"stats":"{\"totalAccepted\": \"42K\", \"totalSubmission\": \"58.7K\", \"totalAcceptedRaw\": 41982, \"totalSubmissionRaw\": 58737, \"acRate\": \"71.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1267","questionFrontendId":"1171","title":"Remove Zero Sum Consecutive Nodes from Linked List","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.8K\", \"totalSubmission\": \"103.8K\", \"totalAcceptedRaw\": 44819, \"totalSubmissionRaw\": 103762, \"acRate\": \"43.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1270","questionFrontendId":"1172","title":"Dinner Plate Stacks","titleSlug":"dinner-plate-stacks","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.6K\", \"totalSubmission\": \"47K\", \"totalAcceptedRaw\": 15571, \"totalSubmissionRaw\": 47011, \"acRate\": \"33.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1272","questionFrontendId":"1169","title":"Invalid Transactions","titleSlug":"invalid-transactions","translatedTitle":null,"stats":"{\"totalAccepted\": \"60.2K\", \"totalSubmission\": \"192.9K\", \"totalAcceptedRaw\": 60216, \"totalSubmissionRaw\": 192888, \"acRate\": \"31.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1273","questionFrontendId":"1170","title":"Compare Strings by Frequency of the Smallest Character","titleSlug":"compare-strings-by-frequency-of-the-smallest-character","translatedTitle":null,"stats":"{\"totalAccepted\": \"72.1K\", \"totalSubmission\": \"117.3K\", \"totalAcceptedRaw\": 72132, \"totalSubmissionRaw\": 117266, \"acRate\": \"61.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1281","questionFrontendId":"1177","title":"Can Make Palindrome from Substring","titleSlug":"can-make-palindrome-from-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.4K\", \"totalSubmission\": \"61.6K\", \"totalAcceptedRaw\": 23400, \"totalSubmissionRaw\": 61594, \"acRate\": \"38.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1282","questionFrontendId":"1178","title":"Number of Valid Words for Each Puzzle","titleSlug":"number-of-valid-words-for-each-puzzle","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.4K\", \"totalSubmission\": \"61.4K\", \"totalAcceptedRaw\": 28445, \"totalSubmissionRaw\": 61429, \"acRate\": \"46.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1294","questionFrontendId":"2080","title":"Range Frequency Queries","titleSlug":"range-frequency-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.9K\", \"totalSubmission\": \"41.1K\", \"totalAcceptedRaw\": 15852, \"totalSubmissionRaw\": 41081, \"acRate\": \"38.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1297","questionFrontendId":"1189","title":"Maximum Number of Balloons","titleSlug":"maximum-number-of-balloons","translatedTitle":null,"stats":"{\"totalAccepted\": \"141.5K\", \"totalSubmission\": \"231.5K\", \"totalAcceptedRaw\": 141536, \"totalSubmissionRaw\": 231498, \"acRate\": \"61.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1308","questionFrontendId":"1202","title":"Smallest String With Swaps","titleSlug":"smallest-string-with-swaps","translatedTitle":null,"stats":"{\"totalAccepted\": \"96.9K\", \"totalSubmission\": \"168.2K\", \"totalAcceptedRaw\": 96903, \"totalSubmissionRaw\": 168244, \"acRate\": \"57.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1312","questionFrontendId":"2201","title":"Count Artifacts That Can Be Extracted","titleSlug":"count-artifacts-that-can-be-extracted","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.9K\", \"totalSubmission\": \"30.5K\", \"totalAcceptedRaw\": 16859, \"totalSubmissionRaw\": 30482, \"acRate\": \"55.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1319","questionFrontendId":"1207","title":"Unique Number of Occurrences","titleSlug":"unique-number-of-occurrences","translatedTitle":null,"stats":"{\"totalAccepted\": \"257.9K\", \"totalSubmission\": \"350.8K\", \"totalAcceptedRaw\": 257863, \"totalSubmissionRaw\": 350754, \"acRate\": \"73.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1330","questionFrontendId":"1218","title":"Longest Arithmetic Subsequence of Given Difference","titleSlug":"longest-arithmetic-subsequence-of-given-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"59.6K\", \"totalSubmission\": \"114.9K\", \"totalAcceptedRaw\": 59633, \"totalSubmissionRaw\": 114943, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1344","questionFrontendId":"1224","title":"Maximum Equal Frequency","titleSlug":"maximum-equal-frequency","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.8K\", \"totalSubmission\": \"34.7K\", \"totalAcceptedRaw\": 12838, \"totalSubmissionRaw\": 34698, \"acRate\": \"37.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1353","questionFrontendId":"2273","title":"Find Resultant Array After Removing Anagrams","titleSlug":"find-resultant-array-after-removing-anagrams","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.4K\", \"totalSubmission\": \"65.7K\", \"totalAcceptedRaw\": 38388, \"totalSubmissionRaw\": 65727, \"acRate\": \"58.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1354","questionFrontendId":"2225","title":"Find Players With Zero or One Losses","titleSlug":"find-players-with-zero-or-one-losses","translatedTitle":null,"stats":"{\"totalAccepted\": \"89K\", \"totalSubmission\": \"122.4K\", \"totalAcceptedRaw\": 88955, \"totalSubmissionRaw\": 122438, \"acRate\": \"72.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1363","questionFrontendId":"2309","title":"Greatest English Letter in Upper and Lower Case","titleSlug":"greatest-english-letter-in-upper-and-lower-case","translatedTitle":null,"stats":"{\"totalAccepted\": \"38K\", \"totalSubmission\": \"55.2K\", \"totalAcceptedRaw\": 37952, \"totalSubmissionRaw\": 55162, \"acRate\": \"68.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1364","questionFrontendId":"1726","title":"Tuple with Same Product","titleSlug":"tuple-with-same-product","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.1K\", \"totalSubmission\": \"38K\", \"totalAcceptedRaw\": 23084, \"totalSubmissionRaw\": 37994, \"acRate\": \"60.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1366","questionFrontendId":"1429","title":"First Unique Number","titleSlug":"first-unique-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"77.7K\", \"totalSubmission\": \"146.8K\", \"totalAcceptedRaw\": 77708, \"totalSubmissionRaw\": 146809, \"acRate\": \"52.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1370","questionFrontendId":"1248","title":"Count Number of Nice Subarrays","titleSlug":"count-number-of-nice-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.1K\", \"totalSubmission\": \"128.4K\", \"totalAcceptedRaw\": 78097, \"totalSubmissionRaw\": 128353, \"acRate\": \"60.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1387","questionFrontendId":"1261","title":"Find Elements in a Contaminated Binary Tree","titleSlug":"find-elements-in-a-contaminated-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"54.3K\", \"totalSubmission\": \"71.1K\", \"totalAcceptedRaw\": 54310, \"totalSubmissionRaw\": 71144, \"acRate\": \"76.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1391","questionFrontendId":"1426","title":"Counting Elements","titleSlug":"counting-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"98.8K\", \"totalSubmission\": \"165.4K\", \"totalAcceptedRaw\": 98759, \"totalSubmissionRaw\": 165438, \"acRate\": \"59.7%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1392","questionFrontendId":"2215","title":"Find the Difference of Two Arrays","titleSlug":"find-the-difference-of-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"49.4K\", \"totalSubmission\": \"70.1K\", \"totalAcceptedRaw\": 49416, \"totalSubmissionRaw\": 70064, \"acRate\": \"70.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1400","questionFrontendId":"1275","title":"Find Winner on a Tic Tac Toe Game","titleSlug":"find-winner-on-a-tic-tac-toe-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"99.7K\", \"totalSubmission\": \"183.9K\", \"totalAcceptedRaw\": 99725, \"totalSubmissionRaw\": 183898, \"acRate\": \"54.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1407","questionFrontendId":"1282","title":"Group the People Given the Group Size They Belong To","titleSlug":"group-the-people-given-the-group-size-they-belong-to","translatedTitle":null,"stats":"{\"totalAccepted\": \"99.3K\", \"totalSubmission\": \"116.1K\", \"totalAcceptedRaw\": 99347, \"totalSubmissionRaw\": 116065, \"acRate\": \"85.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1417","questionFrontendId":"10005","title":"Design a Load Distributor","titleSlug":"design-a-load-distributor","translatedTitle":null,"stats":"{\"totalAccepted\": \"444\", \"totalSubmission\": \"2.4K\", \"totalAcceptedRaw\": 444, \"totalSubmissionRaw\": 2387, \"acRate\": \"18.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1422","questionFrontendId":"1296","title":"Divide Array in Sets of K Consecutive Numbers","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.9K\", \"totalSubmission\": \"125.6K\", \"totalAcceptedRaw\": 70940, \"totalSubmissionRaw\": 125609, \"acRate\": \"56.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1423","questionFrontendId":"1297","title":"Maximum Number of Occurrences of a Substring","titleSlug":"maximum-number-of-occurrences-of-a-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.3K\", \"totalSubmission\": \"77.6K\", \"totalAcceptedRaw\": 40266, \"totalSubmissionRaw\": 77602, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1433","questionFrontendId":"2227","title":"Encrypt and Decrypt Strings","titleSlug":"encrypt-and-decrypt-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.8K\", \"totalSubmission\": \"25K\", \"totalAcceptedRaw\": 9848, \"totalSubmissionRaw\": 25014, \"acRate\": \"39.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1436","questionFrontendId":"1311","title":"Get Watched Videos by Your Friends","titleSlug":"get-watched-videos-by-your-friends","translatedTitle":null,"stats":"{\"totalAccepted\": \"18K\", \"totalSubmission\": \"39.2K\", \"totalAcceptedRaw\": 17986, \"totalSubmissionRaw\": 39164, \"acRate\": \"45.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1447","questionFrontendId":"1345","title":"Jump Game IV","titleSlug":"jump-game-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"127.9K\", \"totalSubmission\": \"272.1K\", \"totalAcceptedRaw\": 127949, \"totalSubmissionRaw\": 272108, \"acRate\": \"47.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1459","questionFrontendId":"1357","title":"Apply Discount Every n Orders","titleSlug":"apply-discount-every-n-orders","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.6K\", \"totalSubmission\": \"25.1K\", \"totalAcceptedRaw\": 17581, \"totalSubmissionRaw\": 25150, \"acRate\": \"69.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1460","questionFrontendId":"1358","title":"Number of Substrings Containing All Three Characters","titleSlug":"number-of-substrings-containing-all-three-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"54.1K\", \"totalSubmission\": \"85.5K\", \"totalAcceptedRaw\": 54132, \"totalSubmissionRaw\": 85473, \"acRate\": \"63.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1464","questionFrontendId":"1338","title":"Reduce Array Size to The Half","titleSlug":"reduce-array-size-to-the-half","translatedTitle":null,"stats":"{\"totalAccepted\": \"169.1K\", \"totalSubmission\": \"243.5K\", \"totalAcceptedRaw\": 169119, \"totalSubmissionRaw\": 243543, \"acRate\": \"69.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1468","questionFrontendId":"1346","title":"Check If N and Its Double Exist","titleSlug":"check-if-n-and-its-double-exist","translatedTitle":null,"stats":"{\"totalAccepted\": \"272.7K\", \"totalSubmission\": \"746.9K\", \"totalAcceptedRaw\": 272653, \"totalSubmissionRaw\": 746897, \"acRate\": \"36.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1469","questionFrontendId":"1347","title":"Minimum Number of Steps to Make Two Strings Anagram","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram","translatedTitle":null,"stats":"{\"totalAccepted\": \"125.3K\", \"totalSubmission\": \"161.1K\", \"totalAcceptedRaw\": 125278, \"totalSubmissionRaw\": 161099, \"acRate\": \"77.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1470","questionFrontendId":"1348","title":"Tweet Counts Per Frequency","titleSlug":"tweet-counts-per-frequency","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.9K\", \"totalSubmission\": \"68.2K\", \"totalAcceptedRaw\": 29914, \"totalSubmissionRaw\": 68209, \"acRate\": \"43.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1472","questionFrontendId":"1370","title":"Increasing Decreasing String","titleSlug":"increasing-decreasing-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"64.3K\", \"totalSubmission\": \"83.3K\", \"totalAcceptedRaw\": 64296, \"totalSubmissionRaw\": 83270, \"acRate\": \"77.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1473","questionFrontendId":"1371","title":"Find the Longest Substring Containing Vowels in Even Counts","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.1K\", \"totalSubmission\": \"35K\", \"totalAcceptedRaw\": 22143, \"totalSubmissionRaw\": 35043, \"acRate\": \"63.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1482","questionFrontendId":"1365","title":"How Many Numbers Are Smaller Than the Current Number","titleSlug":"how-many-numbers-are-smaller-than-the-current-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"414.7K\", \"totalSubmission\": \"478.5K\", \"totalAcceptedRaw\": 414663, \"totalSubmissionRaw\": 478465, \"acRate\": \"86.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1483","questionFrontendId":"1366","title":"Rank Teams by Votes","titleSlug":"rank-teams-by-votes","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.6K\", \"totalSubmission\": \"89.1K\", \"totalAcceptedRaw\": 51621, \"totalSubmissionRaw\": 89105, \"acRate\": \"57.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1487","questionFrontendId":"1386","title":"Cinema Seat Allocation","titleSlug":"cinema-seat-allocation","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.8K\", \"totalSubmission\": \"92.3K\", \"totalAcceptedRaw\": 37761, \"totalSubmissionRaw\": 92306, \"acRate\": \"40.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1500","questionFrontendId":"1399","title":"Count Largest Group","titleSlug":"count-largest-group","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.2K\", \"totalSubmission\": \"55.5K\", \"totalAcceptedRaw\": 37196, \"totalSubmissionRaw\": 55521, \"acRate\": \"67.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1502","questionFrontendId":"1400","title":"Construct K Palindrome Strings","titleSlug":"construct-k-palindrome-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.4K\", \"totalSubmission\": \"70.5K\", \"totalAcceptedRaw\": 44364, \"totalSubmissionRaw\": 70490, \"acRate\": \"62.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1510","questionFrontendId":"1394","title":"Find Lucky Integer in an Array","titleSlug":"find-lucky-integer-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"90.1K\", \"totalSubmission\": \"140K\", \"totalAcceptedRaw\": 90129, \"totalSubmissionRaw\": 140029, \"acRate\": \"64.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1512","questionFrontendId":"1396","title":"Design Underground System","titleSlug":"design-underground-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"163.1K\", \"totalSubmission\": \"221.7K\", \"totalAcceptedRaw\": 163114, \"totalSubmissionRaw\": 221716, \"acRate\": \"73.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1526","questionFrontendId":"1410","title":"HTML Entity Parser","titleSlug":"html-entity-parser","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"40.9K\", \"totalAcceptedRaw\": 21160, \"totalSubmissionRaw\": 40928, \"acRate\": \"51.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1533","questionFrontendId":"1418","title":"Display Table of Food Orders in a Restaurant","titleSlug":"display-table-of-food-orders-in-a-restaurant","translatedTitle":null,"stats":"{\"totalAccepted\": \"23K\", \"totalSubmission\": \"31K\", \"totalAcceptedRaw\": 22977, \"totalSubmissionRaw\": 31012, \"acRate\": \"74.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1547","questionFrontendId":"1436","title":"Destination City","titleSlug":"destination-city","translatedTitle":null,"stats":"{\"totalAccepted\": \"122K\", \"totalSubmission\": \"157.4K\", \"totalAcceptedRaw\": 122013, \"totalSubmissionRaw\": 157449, \"acRate\": \"77.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1553","questionFrontendId":"1442","title":"Count Triplets That Can Form Two Arrays of Equal XOR","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.4K\", \"totalSubmission\": \"41.3K\", \"totalAcceptedRaw\": 31365, \"totalSubmissionRaw\": 41263, \"acRate\": \"76.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1554","questionFrontendId":"1443","title":"Minimum Time to Collect All Apples in a Tree","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"97.9K\", \"totalSubmission\": \"156K\", \"totalAcceptedRaw\": 97888, \"totalSubmissionRaw\": 155957, \"acRate\": \"62.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1556","questionFrontendId":"1460","title":"Make Two Arrays Equal by Reversing Subarrays","titleSlug":"make-two-arrays-equal-by-reversing-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"103.9K\", \"totalSubmission\": \"143.9K\", \"totalAcceptedRaw\": 103880, \"totalSubmissionRaw\": 143902, \"acRate\": \"72.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1557","questionFrontendId":"1461","title":"Check If a String Contains All Binary Codes of Size K","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"108.2K\", \"totalSubmission\": \"191.1K\", \"totalAcceptedRaw\": 108224, \"totalSubmissionRaw\": 191129, \"acRate\": \"56.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1562","questionFrontendId":"1452","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"21K\", \"totalSubmission\": \"36.9K\", \"totalAcceptedRaw\": 20987, \"totalSubmissionRaw\": 36938, \"acRate\": \"56.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1573","questionFrontendId":"1477","title":"Find Two Non-overlapping Sub-arrays Each With Target Sum","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.1K\", \"totalSubmission\": \"117.1K\", \"totalAcceptedRaw\": 43129, \"totalSubmissionRaw\": 117109, \"acRate\": \"36.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1604","questionFrontendId":"1481","title":"Least Number of Unique Integers after K Removals","titleSlug":"least-number-of-unique-integers-after-k-removals","translatedTitle":null,"stats":"{\"totalAccepted\": \"93.8K\", \"totalSubmission\": \"168.3K\", \"totalAcceptedRaw\": 93784, \"totalSubmissionRaw\": 168316, \"acRate\": \"55.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1611","questionFrontendId":"1487","title":"Making File Names Unique","titleSlug":"making-file-names-unique","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.6K\", \"totalSubmission\": \"81.8K\", \"totalAcceptedRaw\": 29598, \"totalSubmissionRaw\": 81809, \"acRate\": \"36.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1612","questionFrontendId":"1488","title":"Avoid Flood in The City","titleSlug":"avoid-flood-in-the-city","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.1K\", \"totalSubmission\": \"114.2K\", \"totalAcceptedRaw\": 30123, \"totalSubmissionRaw\": 114183, \"acRate\": \"26.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1619","questionFrontendId":"1496","title":"Path Crossing","titleSlug":"path-crossing","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.4K\", \"totalSubmission\": \"79.2K\", \"totalAcceptedRaw\": 44382, \"totalSubmissionRaw\": 79196, \"acRate\": \"56.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1620","questionFrontendId":"1497","title":"Check If Array Pairs Are Divisible by k","titleSlug":"check-if-array-pairs-are-divisible-by-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"40K\", \"totalSubmission\": \"102.1K\", \"totalAcceptedRaw\": 39973, \"totalSubmissionRaw\": 102091, \"acRate\": \"39.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1624","questionFrontendId":"1485","title":"Clone Binary Tree With Random Pointer","titleSlug":"clone-binary-tree-with-random-pointer","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.9K\", \"totalSubmission\": \"26.3K\", \"totalAcceptedRaw\": 20921, \"totalSubmissionRaw\": 26255, \"acRate\": \"79.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1634","questionFrontendId":"1490","title":"Clone N-ary Tree","titleSlug":"clone-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.7K\", \"totalSubmission\": \"29.6K\", \"totalAcceptedRaw\": 24675, \"totalSubmissionRaw\": 29562, \"acRate\": \"83.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1635","questionFrontendId":"1512","title":"Number of Good Pairs","titleSlug":"number-of-good-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"419.9K\", \"totalSubmission\": \"475.9K\", \"totalAcceptedRaw\": 419870, \"totalSubmissionRaw\": 475867, \"acRate\": \"88.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1640","questionFrontendId":"1500","title":"Design a File Sharing System","titleSlug":"design-a-file-sharing-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"7.8K\", \"totalAcceptedRaw\": 3489, \"totalSubmissionRaw\": 7826, \"acRate\": \"44.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1643","questionFrontendId":"1519","title":"Number of Nodes in the Sub-Tree With the Same Label","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label","translatedTitle":null,"stats":"{\"totalAccepted\": \"77.8K\", \"totalSubmission\": \"140.6K\", \"totalAcceptedRaw\": 77781, \"totalSubmissionRaw\": 140616, \"acRate\": \"55.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1647","questionFrontendId":"1540","title":"Can Convert String in K Moves","titleSlug":"can-convert-string-in-k-moves","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.9K\", \"totalSubmission\": \"47.7K\", \"totalAcceptedRaw\": 15934, \"totalSubmissionRaw\": 47699, \"acRate\": \"33.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1649","questionFrontendId":"1546","title":"Maximum Number of Non-Overlapping Subarrays With Sum Equals Target","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.3K\", \"totalSubmission\": \"51.3K\", \"totalAcceptedRaw\": 24273, \"totalSubmissionRaw\": 51263, \"acRate\": \"47.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1650","questionFrontendId":"1506","title":"Find Root of N-Ary Tree","titleSlug":"find-root-of-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"29K\", \"totalSubmission\": \"36.9K\", \"totalAcceptedRaw\": 28988, \"totalSubmissionRaw\": 36911, \"acRate\": \"78.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1668","questionFrontendId":"1542","title":"Find Longest Awesome Substring","titleSlug":"find-longest-awesome-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.1K\", \"totalSubmission\": \"26.9K\", \"totalAcceptedRaw\": 11135, \"totalSubmissionRaw\": 26865, \"acRate\": \"41.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1694","questionFrontendId":"1590","title":"Make Sum Divisible by P","titleSlug":"make-sum-divisible-by-p","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"75.7K\", \"totalAcceptedRaw\": 21235, \"totalSubmissionRaw\": 75674, \"acRate\": \"28.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1697","questionFrontendId":"1554","title":"Strings Differ by One Character","titleSlug":"strings-differ-by-one-character","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.9K\", \"totalSubmission\": \"51.4K\", \"totalAcceptedRaw\": 21909, \"totalSubmissionRaw\": 51392, \"acRate\": \"42.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1699","questionFrontendId":"1577","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"44.6K\", \"totalAcceptedRaw\": 17874, \"totalSubmissionRaw\": 44569, \"acRate\": \"40.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1709","questionFrontendId":"1604","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.1K\", \"totalSubmission\": \"61.9K\", \"totalAcceptedRaw\": 29087, \"totalSubmissionRaw\": 61891, \"acRate\": \"47.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1713","questionFrontendId":"1570","title":"Dot Product of Two Sparse Vectors","titleSlug":"dot-product-of-two-sparse-vectors","translatedTitle":null,"stats":"{\"totalAccepted\": \"183K\", \"totalSubmission\": \"202.6K\", \"totalAcceptedRaw\": 183016, \"totalSubmissionRaw\": 202582, \"acRate\": \"90.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1715","questionFrontendId":"1593","title":"Split a String Into the Max Number of Unique Substrings","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.3K\", \"totalSubmission\": \"45.8K\", \"totalAcceptedRaw\": 25313, \"totalSubmissionRaw\": 45758, \"acRate\": \"55.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1722","questionFrontendId":"1600","title":"Throne Inheritance","titleSlug":"throne-inheritance","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.7K\", \"totalSubmission\": \"21.5K\", \"totalAcceptedRaw\": 13679, \"totalSubmissionRaw\": 21521, \"acRate\": \"63.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1741","questionFrontendId":"1636","title":"Sort Array by Increasing Frequency","titleSlug":"sort-array-by-increasing-frequency","translatedTitle":null,"stats":"{\"totalAccepted\": \"91.4K\", \"totalSubmission\": \"131.6K\", \"totalAcceptedRaw\": 91396, \"totalSubmissionRaw\": 131557, \"acRate\": \"69.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1743","questionFrontendId":"1638","title":"Count Substrings That Differ by One Character","titleSlug":"count-substrings-that-differ-by-one-character","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.9K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 23871, \"totalSubmissionRaw\": 33444, \"acRate\": \"71.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1746","questionFrontendId":"1624","title":"Largest Substring Between Two Equal Characters","titleSlug":"largest-substring-between-two-equal-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"41K\", \"totalSubmission\": \"69.3K\", \"totalAcceptedRaw\": 40956, \"totalSubmissionRaw\": 69289, \"acRate\": \"59.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1760","questionFrontendId":"1640","title":"Check Array Formation Through Concatenation","titleSlug":"check-array-formation-through-concatenation","translatedTitle":null,"stats":"{\"totalAccepted\": \"74K\", \"totalSubmission\": \"131.6K\", \"totalAcceptedRaw\": 73987, \"totalSubmissionRaw\": 131593, \"acRate\": \"56.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1770","questionFrontendId":"1647","title":"Minimum Deletions to Make Character Frequencies Unique","titleSlug":"minimum-deletions-to-make-character-frequencies-unique","translatedTitle":null,"stats":"{\"totalAccepted\": \"169.5K\", \"totalSubmission\": \"286.8K\", \"totalAcceptedRaw\": 169527, \"totalSubmissionRaw\": 286787, \"acRate\": \"59.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1775","questionFrontendId":"1656","title":"Design an Ordered Stream","titleSlug":"design-an-ordered-stream","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.4K\", \"totalSubmission\": \"76.7K\", \"totalAcceptedRaw\": 65427, \"totalSubmissionRaw\": 76735, \"acRate\": \"85.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1776","questionFrontendId":"1658","title":"Minimum Operations to Reduce X to Zero","titleSlug":"minimum-operations-to-reduce-x-to-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"109K\", \"totalSubmission\": \"289.9K\", \"totalAcceptedRaw\": 109032, \"totalSubmissionRaw\": 289890, \"acRate\": \"37.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1777","questionFrontendId":"1657","title":"Determine if Two Strings Are Close","titleSlug":"determine-if-two-strings-are-close","translatedTitle":null,"stats":"{\"totalAccepted\": \"105.3K\", \"totalSubmission\": \"186.9K\", \"totalAcceptedRaw\": 105273, \"totalSubmissionRaw\": 186937, \"acRate\": \"56.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1786","questionFrontendId":"1684","title":"Count the Number of Consistent Strings","titleSlug":"count-the-number-of-consistent-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.2K\", \"totalSubmission\": \"151.1K\", \"totalAcceptedRaw\": 124227, \"totalSubmissionRaw\": 151147, \"acRate\": \"82.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1790","questionFrontendId":"1650","title":"Lowest Common Ancestor of a Binary Tree III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"157.4K\", \"totalSubmission\": \"203.4K\", \"totalAcceptedRaw\": 157431, \"totalSubmissionRaw\": 203380, \"acRate\": \"77.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1793","questionFrontendId":"1674","title":"Minimum Moves to Make Array Complementary","titleSlug":"minimum-moves-to-make-array-complementary","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.3K\", \"totalSubmission\": \"18.9K\", \"totalAcceptedRaw\": 7305, \"totalSubmissionRaw\": 18936, \"acRate\": \"38.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1796","questionFrontendId":"1660","title":"Correct a Binary Tree","titleSlug":"correct-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"19.1K\", \"totalAcceptedRaw\": 13830, \"totalSubmissionRaw\": 19071, \"acRate\": \"72.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1798","questionFrontendId":"1679","title":"Max Number of K-Sum Pairs","titleSlug":"max-number-of-k-sum-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"121.5K\", \"totalSubmission\": \"212.1K\", \"totalAcceptedRaw\": 121487, \"totalSubmissionRaw\": 212103, \"acRate\": \"57.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1813","questionFrontendId":"1695","title":"Maximum Erasure Value","titleSlug":"maximum-erasure-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"107.8K\", \"totalSubmission\": \"187.3K\", \"totalAcceptedRaw\": 107766, \"totalSubmissionRaw\": 187253, \"acRate\": \"57.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1830","questionFrontendId":"1711","title":"Count Good Meals","titleSlug":"count-good-meals","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.7K\", \"totalSubmission\": \"108.3K\", \"totalAcceptedRaw\": 31666, \"totalSubmissionRaw\": 108282, \"acRate\": \"29.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1832","questionFrontendId":"1713","title":"Minimum Operations to Make a Subsequence","titleSlug":"minimum-operations-to-make-a-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"18.7K\", \"totalAcceptedRaw\": 9170, \"totalSubmissionRaw\": 18749, \"acRate\": \"48.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1844","questionFrontendId":"1742","title":"Maximum Number of Balls in a Box","titleSlug":"maximum-number-of-balls-in-a-box","translatedTitle":null,"stats":"{\"totalAccepted\": \"50.3K\", \"totalSubmission\": \"68.2K\", \"totalAcceptedRaw\": 50273, \"totalSubmissionRaw\": 68194, \"acRate\": \"73.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1848","questionFrontendId":"1748","title":"Sum of Unique Elements","titleSlug":"sum-of-unique-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"111.1K\", \"totalSubmission\": \"145.7K\", \"totalAcceptedRaw\": 111059, \"totalSubmissionRaw\": 145702, \"acRate\": \"76.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1859","questionFrontendId":"1737","title":"Change Minimum Characters to Satisfy One of Three Conditions","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.4K\", \"totalSubmission\": \"32.2K\", \"totalAcceptedRaw\": 11365, \"totalSubmissionRaw\": 32179, \"acRate\": \"35.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1866","questionFrontendId":"1743","title":"Restore the Array From Adjacent Pairs","titleSlug":"restore-the-array-from-adjacent-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.1K\", \"totalSubmission\": \"49.7K\", \"totalAcceptedRaw\": 34086, \"totalSubmissionRaw\": 49712, \"acRate\": \"68.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1873","questionFrontendId":"1763","title":"Longest Nice Substring","titleSlug":"longest-nice-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.7K\", \"totalSubmission\": \"59.5K\", \"totalAcceptedRaw\": 36653, \"totalSubmissionRaw\": 59499, \"acRate\": \"61.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1883","questionFrontendId":"1740","title":"Find Distance in a Binary Tree","titleSlug":"find-distance-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"18K\", \"totalSubmission\": \"26.1K\", \"totalAcceptedRaw\": 18041, \"totalSubmissionRaw\": 26093, \"acRate\": \"69.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1890","questionFrontendId":"1781","title":"Sum of Beauty of All Substrings","titleSlug":"sum-of-beauty-of-all-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"32.7K\", \"totalAcceptedRaw\": 19850, \"totalSubmissionRaw\": 32658, \"acRate\": \"60.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1901","questionFrontendId":"1775","title":"Equal Sum Arrays With Minimum Number of Operations","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"45.7K\", \"totalAcceptedRaw\": 24240, \"totalSubmissionRaw\": 45709, \"acRate\": \"53.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1903","questionFrontendId":"1756","title":"Design Most Recently Used Queue","titleSlug":"design-most-recently-used-queue","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.9K\", \"totalSubmission\": \"11.3K\", \"totalAcceptedRaw\": 8907, \"totalSubmissionRaw\": 11346, \"acRate\": \"78.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1904","questionFrontendId":"1796","title":"Second Largest Digit in a String","titleSlug":"second-largest-digit-in-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"38K\", \"totalSubmission\": \"77.1K\", \"totalAcceptedRaw\": 38013, \"totalSubmissionRaw\": 77069, \"acRate\": \"49.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1905","questionFrontendId":"1797","title":"Design Authentication Manager","titleSlug":"design-authentication-manager","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.3K\", \"totalSubmission\": \"28.7K\", \"totalAcceptedRaw\": 16344, \"totalSubmissionRaw\": 28725, \"acRate\": \"56.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1915","questionFrontendId":"1790","title":"Check if One String Swap Can Make Strings Equal","titleSlug":"check-if-one-string-swap-can-make-strings-equal","translatedTitle":null,"stats":"{\"totalAccepted\": \"81.1K\", \"totalSubmission\": \"178.7K\", \"totalAcceptedRaw\": 81083, \"totalSubmissionRaw\": 178706, \"acRate\": \"45.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1919","questionFrontendId":"1772","title":"Sort Features by Popularity","titleSlug":"sort-features-by-popularity","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.9K\", \"totalSubmission\": \"7.5K\", \"totalAcceptedRaw\": 4874, \"totalSubmissionRaw\": 7485, \"acRate\": \"65.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1925","questionFrontendId":"1814","title":"Count Nice Pairs in an Array","titleSlug":"count-nice-pairs-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.8K\", \"totalSubmission\": \"56.8K\", \"totalAcceptedRaw\": 23836, \"totalSubmissionRaw\": 56790, \"acRate\": \"42.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1933","questionFrontendId":"1805","title":"Number of Different Integers in a String","titleSlug":"number-of-different-integers-in-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.7K\", \"totalSubmission\": \"97.7K\", \"totalAcceptedRaw\": 35735, \"totalSubmissionRaw\": 97692, \"acRate\": \"36.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1934","questionFrontendId":"1807","title":"Evaluate the Bracket Pairs of a String","titleSlug":"evaluate-the-bracket-pairs-of-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.4K\", \"totalSubmission\": \"36.6K\", \"totalAcceptedRaw\": 24367, \"totalSubmissionRaw\": 36577, \"acRate\": \"66.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1943","questionFrontendId":"1794","title":"Count Pairs of Equal Substrings With Minimum Difference","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6K\", \"totalSubmission\": \"2.4K\", \"totalAcceptedRaw\": 1550, \"totalSubmissionRaw\": 2382, \"acRate\": \"65.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1945","questionFrontendId":"1817","title":"Finding the Users Active Minutes","titleSlug":"finding-the-users-active-minutes","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.9K\", \"totalSubmission\": \"57.1K\", \"totalAcceptedRaw\": 45917, \"totalSubmissionRaw\": 57087, \"acRate\": \"80.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1949","questionFrontendId":"1804","title":"Implement Trie II (Prefix Tree)","titleSlug":"implement-trie-ii-prefix-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.5K\", \"totalSubmission\": \"19.3K\", \"totalAcceptedRaw\": 11539, \"totalSubmissionRaw\": 19328, \"acRate\": \"59.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1960","questionFrontendId":"1832","title":"Check if the Sentence Is Pangram","titleSlug":"check-if-the-sentence-is-pangram","translatedTitle":null,"stats":"{\"totalAccepted\": \"220.6K\", \"totalSubmission\": \"263.9K\", \"totalAcceptedRaw\": 220593, \"totalSubmissionRaw\": 263947, \"acRate\": \"83.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1982","questionFrontendId":"1836","title":"Remove Duplicates From an Unsorted Linked List","titleSlug":"remove-duplicates-from-an-unsorted-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.9K\", \"totalSubmission\": \"32.5K\", \"totalAcceptedRaw\": 22876, \"totalSubmissionRaw\": 32467, \"acRate\": \"70.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1986","questionFrontendId":"1857","title":"Largest Color Value in a Directed Graph","titleSlug":"largest-color-value-in-a-directed-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.9K\", \"totalSubmission\": \"36.5K\", \"totalAcceptedRaw\": 14891, \"totalSubmissionRaw\": 36525, \"acRate\": \"40.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1987","questionFrontendId":"1876","title":"Substrings of Size Three with Distinct Characters","titleSlug":"substrings-of-size-three-with-distinct-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"73K\", \"totalSubmission\": \"102.8K\", \"totalAcceptedRaw\": 73030, \"totalSubmissionRaw\": 102751, \"acRate\": \"71.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1995","questionFrontendId":"1865","title":"Finding Pairs With a Certain Sum","titleSlug":"finding-pairs-with-a-certain-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.1K\", \"totalSubmission\": \"39.9K\", \"totalAcceptedRaw\": 20067, \"totalSubmissionRaw\": 39874, \"acRate\": \"50.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2003","questionFrontendId":"1852","title":"Distinct Numbers in Each Subarray","titleSlug":"distinct-numbers-in-each-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"7.8K\", \"totalAcceptedRaw\": 5574, \"totalSubmissionRaw\": 7831, \"acRate\": \"71.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2005","questionFrontendId":"1893","title":"Check if All the Integers in a Range Are Covered","titleSlug":"check-if-all-the-integers-in-a-range-are-covered","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.5K\", \"totalSubmission\": \"60.4K\", \"totalAcceptedRaw\": 30488, \"totalSubmissionRaw\": 60441, \"acRate\": \"50.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2023","questionFrontendId":"1912","title":"Design Movie Rental System","titleSlug":"design-movie-rental-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.9K\", \"totalSubmission\": \"12.3K\", \"totalAcceptedRaw\": 4897, \"totalSubmissionRaw\": 12270, \"acRate\": \"39.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2025","questionFrontendId":"1897","title":"Redistribute Characters to Make All Strings Equal","titleSlug":"redistribute-characters-to-make-all-strings-equal","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.2K\", \"totalSubmission\": \"47.3K\", \"totalAcceptedRaw\": 28207, \"totalSubmissionRaw\": 47319, \"acRate\": \"59.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2034","questionFrontendId":"1906","title":"Minimum Absolute Difference Queries","titleSlug":"minimum-absolute-difference-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.4K\", \"totalSubmission\": \"21.3K\", \"totalAcceptedRaw\": 9354, \"totalSubmissionRaw\": 21321, \"acRate\": \"43.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2044","questionFrontendId":"1915","title":"Number of Wonderful Substrings","titleSlug":"number-of-wonderful-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.8K\", \"totalSubmission\": \"23.9K\", \"totalAcceptedRaw\": 10803, \"totalSubmissionRaw\": 23880, \"acRate\": \"45.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2053","questionFrontendId":"1941","title":"Check if All Characters Have Equal Number of Occurrences","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences","translatedTitle":null,"stats":"{\"totalAccepted\": \"59.4K\", \"totalSubmission\": \"77.3K\", \"totalAcceptedRaw\": 59398, \"totalSubmissionRaw\": 77306, \"acRate\": \"76.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2059","questionFrontendId":"1930","title":"Unique Length-3 Palindromic Subsequences","titleSlug":"unique-length-3-palindromic-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.9K\", \"totalSubmission\": \"44K\", \"totalAcceptedRaw\": 22879, \"totalSubmissionRaw\": 44026, \"acRate\": \"52.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2060","questionFrontendId":"1932","title":"Merge BSTs to Create Single BST","titleSlug":"merge-bsts-to-create-single-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"17.7K\", \"totalAcceptedRaw\": 6305, \"totalSubmissionRaw\": 17747, \"acRate\": \"35.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2071","questionFrontendId":"1940","title":"Longest Common Subsequence Between Sorted Arrays","titleSlug":"longest-common-subsequence-between-sorted-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"5K\", \"totalSubmission\": \"6.3K\", \"totalAcceptedRaw\": 5013, \"totalSubmissionRaw\": 6341, \"acRate\": \"79.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2079","questionFrontendId":"1948","title":"Delete Duplicate Folders in System","titleSlug":"delete-duplicate-folders-in-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.1K\", \"totalSubmission\": \"12.5K\", \"totalAcceptedRaw\": 7054, \"totalSubmissionRaw\": 12452, \"acRate\": \"56.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2104","questionFrontendId":"1993","title":"Operations on Tree","titleSlug":"operations-on-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.2K\", \"totalSubmission\": \"23.2K\", \"totalAcceptedRaw\": 10242, \"totalSubmissionRaw\": 23237, \"acRate\": \"44.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2116","questionFrontendId":"2006","title":"Count Number of Pairs With Absolute Difference K","titleSlug":"count-number-of-pairs-with-absolute-difference-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"90.5K\", \"totalSubmission\": \"109.5K\", \"totalAcceptedRaw\": 90547, \"totalSubmissionRaw\": 109460, \"acRate\": \"82.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2117","questionFrontendId":"2007","title":"Find Original Array From Doubled Array","titleSlug":"find-original-array-from-doubled-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"117.3K\", \"totalSubmission\": \"288.1K\", \"totalAcceptedRaw\": 117298, \"totalSubmissionRaw\": 288074, \"acRate\": \"40.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2129","questionFrontendId":"2001","title":"Number of Pairs of Interchangeable Rectangles","titleSlug":"number-of-pairs-of-interchangeable-rectangles","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.7K\", \"totalSubmission\": \"51.5K\", \"totalAcceptedRaw\": 23699, \"totalSubmissionRaw\": 51498, \"acRate\": \"46.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2135","questionFrontendId":"2025","title":"Maximum Number of Ways to Partition an Array","titleSlug":"maximum-number-of-ways-to-partition-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"21K\", \"totalAcceptedRaw\": 6873, \"totalSubmissionRaw\": 20959, \"acRate\": \"32.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2139","questionFrontendId":"2013","title":"Detect Squares","titleSlug":"detect-squares","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.2K\", \"totalSubmission\": \"87.9K\", \"totalAcceptedRaw\": 44217, \"totalSubmissionRaw\": 87914, \"acRate\": \"50.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2159","questionFrontendId":"2032","title":"Two Out of Three","titleSlug":"two-out-of-three","translatedTitle":null,"stats":"{\"totalAccepted\": \"45K\", \"totalSubmission\": \"61.2K\", \"totalAcceptedRaw\": 44995, \"totalSubmissionRaw\": 61240, \"acRate\": \"73.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2161","questionFrontendId":"2034","title":"Stock Price Fluctuation ","titleSlug":"stock-price-fluctuation","translatedTitle":null,"stats":"{\"totalAccepted\": \"55.5K\", \"totalSubmission\": \"113.6K\", \"totalAcceptedRaw\": 55509, \"totalSubmissionRaw\": 113602, \"acRate\": \"48.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2163","questionFrontendId":"2053","title":"Kth Distinct String in an Array","titleSlug":"kth-distinct-string-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.1K\", \"totalSubmission\": \"58.4K\", \"totalAcceptedRaw\": 42058, \"totalSubmissionRaw\": 58367, \"acRate\": \"72.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2169","questionFrontendId":"2043","title":"Simple Bank System","titleSlug":"simple-bank-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"18K\", \"totalSubmission\": \"27.6K\", \"totalAcceptedRaw\": 18020, \"totalSubmissionRaw\": 27592, \"acRate\": \"65.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2177","questionFrontendId":"2068","title":"Check Whether Two Strings are Almost Equivalent","titleSlug":"check-whether-two-strings-are-almost-equivalent","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.1K\", \"totalSubmission\": \"49.8K\", \"totalAcceptedRaw\": 32084, \"totalSubmissionRaw\": 49840, \"acRate\": \"64.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2186","questionFrontendId":"2062","title":"Count Vowel Substrings of a String","titleSlug":"count-vowel-substrings-of-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.8K\", \"totalSubmission\": \"40.6K\", \"totalAcceptedRaw\": 26807, \"totalSubmissionRaw\": 40621, \"acRate\": \"66.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2190","questionFrontendId":"2085","title":"Count Common Words With One Occurrence","titleSlug":"count-common-words-with-one-occurrence","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.1K\", \"totalSubmission\": \"61.6K\", \"totalAcceptedRaw\": 43123, \"totalSubmissionRaw\": 61599, \"acRate\": \"70.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2204","questionFrontendId":"2099","title":"Find Subsequence of Length K With the Largest Sum","titleSlug":"find-subsequence-of-length-k-with-the-largest-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"32K\", \"totalSubmission\": \"74.7K\", \"totalAcceptedRaw\": 31997, \"totalSubmissionRaw\": 74653, \"acRate\": \"42.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2215","questionFrontendId":"2094","title":"Finding 3-Digit Even Numbers","titleSlug":"finding-3-digit-even-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"38.7K\", \"totalAcceptedRaw\": 22314, \"totalSubmissionRaw\": 38660, \"acRate\": \"57.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2220","questionFrontendId":"2115","title":"Find All Possible Recipes from Given Supplies","titleSlug":"find-all-possible-recipes-from-given-supplies","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.9K\", \"totalSubmission\": \"131.8K\", \"totalAcceptedRaw\": 63897, \"totalSubmissionRaw\": 131785, \"acRate\": \"48.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2225","questionFrontendId":"2083","title":"Substrings That Begin and End With the Same Letter","titleSlug":"substrings-that-begin-and-end-with-the-same-letter","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.1K\", \"totalSubmission\": \"7.5K\", \"totalAcceptedRaw\": 5121, \"totalSubmissionRaw\": 7549, \"acRate\": \"67.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2226","questionFrontendId":"2103","title":"Rings and Rods","titleSlug":"rings-and-rods","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.5K\", \"totalSubmission\": \"63.3K\", \"totalAcceptedRaw\": 51491, \"totalSubmissionRaw\": 63310, \"acRate\": \"81.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2237","questionFrontendId":"2131","title":"Longest Palindrome by Concatenating Two Letter Words","titleSlug":"longest-palindrome-by-concatenating-two-letter-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"98K\", \"totalSubmission\": \"201.9K\", \"totalAcceptedRaw\": 97963, \"totalSubmissionRaw\": 201949, \"acRate\": \"48.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2240","questionFrontendId":"2121","title":"Intervals Between Identical Elements","titleSlug":"intervals-between-identical-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.2K\", \"totalSubmission\": \"35.1K\", \"totalAcceptedRaw\": 15152, \"totalSubmissionRaw\": 35087, \"acRate\": \"43.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2241","questionFrontendId":"2122","title":"Recover the Original Array","titleSlug":"recover-the-original-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.7K\", \"totalSubmission\": \"22.6K\", \"totalAcceptedRaw\": 8715, \"totalSubmissionRaw\": 22649, \"acRate\": \"38.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2247","questionFrontendId":"2107","title":"Number of Unique Flavors After Sharing K Candies","titleSlug":"number-of-unique-flavors-after-sharing-k-candies","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"4K\", \"totalAcceptedRaw\": 2229, \"totalSubmissionRaw\": 3966, \"acRate\": \"56.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2254","questionFrontendId":"2133","title":"Check if Every Row and Column Contains All Numbers","titleSlug":"check-if-every-row-and-column-contains-all-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"50.7K\", \"totalSubmission\": \"96.6K\", \"totalAcceptedRaw\": 50684, \"totalSubmissionRaw\": 96636, \"acRate\": \"52.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2256","questionFrontendId":"2135","title":"Count Words Obtained After Adding a Letter","titleSlug":"count-words-obtained-after-adding-a-letter","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.3K\", \"totalSubmission\": \"68.4K\", \"totalAcceptedRaw\": 29298, \"totalSubmissionRaw\": 68420, \"acRate\": \"42.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2270","questionFrontendId":"2150","title":"Find All Lonely Numbers in the Array","titleSlug":"find-all-lonely-numbers-in-the-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.6K\", \"totalSubmission\": \"55.4K\", \"totalAcceptedRaw\": 33570, \"totalSubmissionRaw\": 55408, \"acRate\": \"60.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2274","questionFrontendId":"2154","title":"Keep Multiplying Found Values by Two","titleSlug":"keep-multiplying-found-values-by-two","translatedTitle":null,"stats":"{\"totalAccepted\": \"62.5K\", \"totalSubmission\": \"86K\", \"totalAcceptedRaw\": 62522, \"totalSubmissionRaw\": 86045, \"acRate\": \"72.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2285","questionFrontendId":"2166","title":"Design Bitset","titleSlug":"design-bitset","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.5K\", \"totalSubmission\": \"58.3K\", \"totalAcceptedRaw\": 18481, \"totalSubmissionRaw\": 58262, \"acRate\": \"31.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2287","questionFrontendId":"2152","title":"Minimum Number of Lines to Cover Points","titleSlug":"minimum-number-of-lines-to-cover-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"3K\", \"totalAcceptedRaw\": 1407, \"totalSubmissionRaw\": 3016, \"acRate\": \"46.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2289","questionFrontendId":"2170","title":"Minimum Operations to Make the Array Alternating","titleSlug":"minimum-operations-to-make-the-array-alternating","translatedTitle":null,"stats":"{\"totalAccepted\": \"19K\", \"totalSubmission\": \"57.3K\", \"totalAcceptedRaw\": 19007, \"totalSubmissionRaw\": 57269, \"acRate\": \"33.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2293","questionFrontendId":"2186","title":"Minimum Number of Steps to Make Two Strings Anagram II","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"31K\", \"totalSubmission\": \"43K\", \"totalAcceptedRaw\": 31006, \"totalSubmissionRaw\": 43040, \"acRate\": \"72.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2303","questionFrontendId":"2168","title":"Unique Substrings With Equal Digit Frequency","titleSlug":"unique-substrings-with-equal-digit-frequency","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"2.8K\", \"totalAcceptedRaw\": 1680, \"totalSubmissionRaw\": 2833, \"acRate\": \"59.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2306","questionFrontendId":"2196","title":"Create Binary Tree From Descriptions","titleSlug":"create-binary-tree-from-descriptions","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.7K\", \"totalSubmission\": \"35.5K\", \"totalAcceptedRaw\": 25701, \"totalSubmissionRaw\": 35531, \"acRate\": \"72.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2308","questionFrontendId":"2206","title":"Divide Array Into Equal Pairs","titleSlug":"divide-array-into-equal-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.2K\", \"totalSubmission\": \"69.2K\", \"totalAcceptedRaw\": 51177, \"totalSubmissionRaw\": 69249, \"acRate\": \"73.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2312","questionFrontendId":"2190","title":"Most Frequent Number Following Key In an Array","titleSlug":"most-frequent-number-following-key-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.1K\", \"totalSubmission\": \"43.5K\", \"totalAcceptedRaw\": 26107, \"totalSubmissionRaw\": 43492, \"acRate\": \"60.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2331","questionFrontendId":"2248","title":"Intersection of Multiple Arrays","titleSlug":"intersection-of-multiple-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.4K\", \"totalSubmission\": \"67.5K\", \"totalAcceptedRaw\": 46431, \"totalSubmissionRaw\": 67533, \"acRate\": \"68.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2332","questionFrontendId":"2249","title":"Count Lattice Points Inside a Circle","titleSlug":"count-lattice-points-inside-a-circle","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"36K\", \"totalAcceptedRaw\": 18182, \"totalSubmissionRaw\": 35992, \"acRate\": \"50.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2334","questionFrontendId":"2251","title":"Number of Flowers in Full Bloom","titleSlug":"number-of-flowers-in-full-bloom","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.5K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 12546, \"totalSubmissionRaw\": 24455, \"acRate\": \"51.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2338","questionFrontendId":"2260","title":"Minimum Consecutive Cards to Pick Up","titleSlug":"minimum-consecutive-cards-to-pick-up","translatedTitle":null,"stats":"{\"totalAccepted\": \"40K\", \"totalSubmission\": \"78K\", \"totalAcceptedRaw\": 39971, \"totalSubmissionRaw\": 78007, \"acRate\": \"51.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2339","questionFrontendId":"2261","title":"K Divisible Elements Subarrays","titleSlug":"k-divisible-elements-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.4K\", \"totalSubmission\": \"42.5K\", \"totalAcceptedRaw\": 20442, \"totalSubmissionRaw\": 42548, \"acRate\": \"48.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2340","questionFrontendId":"2262","title":"Total Appeal of A String","titleSlug":"total-appeal-of-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.5K\", \"totalSubmission\": \"39.6K\", \"totalAcceptedRaw\": 22470, \"totalSubmissionRaw\": 39559, \"acRate\": \"56.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2348","questionFrontendId":"2266","title":"Count Number of Texts","titleSlug":"count-number-of-texts","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.9K\", \"totalSubmission\": \"31.7K\", \"totalAcceptedRaw\": 14906, \"totalSubmissionRaw\": 31670, \"acRate\": \"47.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2356","questionFrontendId":"2275","title":"Largest Combination With Bitwise AND Greater Than Zero","titleSlug":"largest-combination-with-bitwise-and-greater-than-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.2K\", \"totalSubmission\": \"27.9K\", \"totalAcceptedRaw\": 20201, \"totalSubmissionRaw\": 27919, \"acRate\": \"72.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2362","questionFrontendId":"2244","title":"Minimum Rounds to Complete All Tasks","titleSlug":"minimum-rounds-to-complete-all-tasks","translatedTitle":null,"stats":"{\"totalAccepted\": \"130.1K\", \"totalSubmission\": \"206.7K\", \"totalAcceptedRaw\": 130080, \"totalSubmissionRaw\": 206731, \"acRate\": \"62.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2372","questionFrontendId":"2287","title":"Rearrange Characters to Make Target String","titleSlug":"rearrange-characters-to-make-target-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"30K\", \"totalSubmission\": \"51.7K\", \"totalAcceptedRaw\": 29996, \"totalSubmissionRaw\": 51687, \"acRate\": \"58.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2377","questionFrontendId":"2283","title":"Check if Number Has Equal Digit Count and Digit Value","titleSlug":"check-if-number-has-equal-digit-count-and-digit-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.5K\", \"totalSubmission\": \"51.2K\", \"totalAcceptedRaw\": 37496, \"totalSubmissionRaw\": 51184, \"acRate\": \"73.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2378","questionFrontendId":"2284","title":"Sender With Largest Word Count","titleSlug":"sender-with-largest-word-count","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.8K\", \"totalSubmission\": \"46K\", \"totalAcceptedRaw\": 25769, \"totalSubmissionRaw\": 45959, \"acRate\": \"56.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2388","questionFrontendId":"2295","title":"Replace Elements in an Array","titleSlug":"replace-elements-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.5K\", \"totalSubmission\": \"47.8K\", \"totalAcceptedRaw\": 27489, \"totalSubmissionRaw\": 47770, \"acRate\": \"57.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2390","questionFrontendId":"2306","title":"Naming a Company","titleSlug":"naming-a-company","translatedTitle":null,"stats":"{\"totalAccepted\": \"54.7K\", \"totalSubmission\": \"116.1K\", \"totalAcceptedRaw\": 54658, \"totalSubmissionRaw\": 116079, \"acRate\": \"47.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2393","questionFrontendId":"2301","title":"Match Substring After Replacement","titleSlug":"match-substring-after-replacement","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.1K\", \"totalSubmission\": \"28.2K\", \"totalAcceptedRaw\": 11110, \"totalSubmissionRaw\": 28169, \"acRate\": \"39.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2396","questionFrontendId":"2254","title":"Design Video Sharing Platform","titleSlug":"design-video-sharing-platform","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"2.1K\", \"totalAcceptedRaw\": 1349, \"totalSubmissionRaw\": 2071, \"acRate\": \"65.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2406","questionFrontendId":"2325","title":"Decode the Message","titleSlug":"decode-the-message","translatedTitle":null,"stats":"{\"totalAccepted\": \"53.4K\", \"totalSubmission\": \"63K\", \"totalAcceptedRaw\": 53380, \"totalSubmissionRaw\": 63003, \"acRate\": \"84.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2413","questionFrontendId":"2336","title":"Smallest Number in Infinite Set","titleSlug":"smallest-number-in-infinite-set","translatedTitle":null,"stats":"{\"totalAccepted\": \"28K\", \"totalSubmission\": \"39.3K\", \"totalAcceptedRaw\": 28029, \"totalSubmissionRaw\": 39301, \"acRate\": \"71.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2421","questionFrontendId":"2341","title":"Maximum Number of Pairs in Array","titleSlug":"maximum-number-of-pairs-in-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.2K\", \"totalSubmission\": \"60.8K\", \"totalAcceptedRaw\": 46179, \"totalSubmissionRaw\": 60778, \"acRate\": \"76.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2427","questionFrontendId":"2351","title":"First Letter to Appear Twice","titleSlug":"first-letter-to-appear-twice","translatedTitle":null,"stats":"{\"totalAccepted\": \"67K\", \"totalSubmission\": \"89.3K\", \"totalAcceptedRaw\": 66982, \"totalSubmissionRaw\": 89312, \"acRate\": \"75.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2428","questionFrontendId":"2352","title":"Equal Row and Column Pairs","titleSlug":"equal-row-and-column-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.5K\", \"totalSubmission\": \"47.4K\", \"totalAcceptedRaw\": 33502, \"totalSubmissionRaw\": 47389, \"acRate\": \"70.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2429","questionFrontendId":"2353","title":"Design a Food Rating System","titleSlug":"design-a-food-rating-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.1K\", \"totalSubmission\": \"46.5K\", \"totalAcceptedRaw\": 16127, \"totalSubmissionRaw\": 46532, \"acRate\": \"34.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2430","questionFrontendId":"2354","title":"Number of Excellent Pairs","titleSlug":"number-of-excellent-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.8K\", \"totalSubmission\": \"25.6K\", \"totalAcceptedRaw\": 11797, \"totalSubmissionRaw\": 25639, \"acRate\": \"46.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2433","questionFrontendId":"2347","title":"Best Poker Hand","titleSlug":"best-poker-hand","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.5K\", \"totalSubmission\": \"48.6K\", \"totalAcceptedRaw\": 29504, \"totalSubmissionRaw\": 48626, \"acRate\": \"60.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2434","questionFrontendId":"2349","title":"Design a Number Container System","titleSlug":"design-a-number-container-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"39.7K\", \"totalAcceptedRaw\": 18241, \"totalSubmissionRaw\": 39697, \"acRate\": \"46.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2435","questionFrontendId":"2350","title":"Shortest Impossible Sequence of Rolls","titleSlug":"shortest-impossible-sequence-of-rolls","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.5K\", \"totalSubmission\": \"16.9K\", \"totalAcceptedRaw\": 11526, \"totalSubmissionRaw\": 16874, \"acRate\": \"68.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2436","questionFrontendId":"2357","title":"Make Array Zero by Subtracting Equal Amounts","titleSlug":"make-array-zero-by-subtracting-equal-amounts","translatedTitle":null,"stats":"{\"totalAccepted\": \"62.3K\", \"totalSubmission\": \"85.7K\", \"totalAcceptedRaw\": 62276, \"totalSubmissionRaw\": 85663, \"acRate\": \"72.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2442","questionFrontendId":"2367","title":"Number of Arithmetic Triplets","titleSlug":"number-of-arithmetic-triplets","translatedTitle":null,"stats":"{\"totalAccepted\": \"65K\", \"totalSubmission\": \"77.7K\", \"totalAcceptedRaw\": 64961, \"totalSubmissionRaw\": 77674, \"acRate\": \"83.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2444","questionFrontendId":"2370","title":"Longest Ideal Subsequence","titleSlug":"longest-ideal-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.6K\", \"totalSubmission\": \"49.3K\", \"totalAcceptedRaw\": 18607, \"totalSubmissionRaw\": 49261, \"acRate\": \"37.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2445","questionFrontendId":"2368","title":"Reachable Nodes With Restrictions","titleSlug":"reachable-nodes-with-restrictions","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.2K\", \"totalSubmission\": \"54K\", \"totalAcceptedRaw\": 31231, \"totalSubmissionRaw\": 54027, \"acRate\": \"57.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2447","questionFrontendId":"2363","title":"Merge Similar Items","titleSlug":"merge-similar-items","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.8K\", \"totalSubmission\": \"46.1K\", \"totalAcceptedRaw\": 34843, \"totalSubmissionRaw\": 46123, \"acRate\": \"75.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2448","questionFrontendId":"2364","title":"Count Number of Bad Pairs","titleSlug":"count-number-of-bad-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.4K\", \"totalSubmission\": \"54.5K\", \"totalAcceptedRaw\": 22391, \"totalSubmissionRaw\": 54452, \"acRate\": \"41.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2455","questionFrontendId":"2374","title":"Node With Highest Edge Score","titleSlug":"node-with-highest-edge-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.4K\", \"totalSubmission\": \"54.7K\", \"totalAcceptedRaw\": 25402, \"totalSubmissionRaw\": 54653, \"acRate\": \"46.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2473","questionFrontendId":"2342","title":"Max Sum of a Pair With Equal Sum of Digits","titleSlug":"max-sum-of-a-pair-with-equal-sum-of-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.4K\", \"totalSubmission\": \"58.9K\", \"totalAcceptedRaw\": 31426, \"totalSubmissionRaw\": 58890, \"acRate\": \"53.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2475","questionFrontendId":"2384","title":"Largest Palindromic Number","titleSlug":"largest-palindromic-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.2K\", \"totalSubmission\": \"64.8K\", \"totalAcceptedRaw\": 20153, \"totalSubmissionRaw\": 64762, \"acRate\": \"31.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2476","questionFrontendId":"2399","title":"Check Distances Between Same Letters","titleSlug":"check-distances-between-same-letters","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.8K\", \"totalSubmission\": \"47.9K\", \"totalAcceptedRaw\": 33840, \"totalSubmissionRaw\": 47949, \"acRate\": \"70.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2480","questionFrontendId":"2395","title":"Find Subarrays With Equal Sum","titleSlug":"find-subarrays-with-equal-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.8K\", \"totalSubmission\": \"52.5K\", \"totalAcceptedRaw\": 33845, \"totalSubmissionRaw\": 52517, \"acRate\": \"64.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2483","questionFrontendId":"2365","title":"Task Scheduler II","titleSlug":"task-scheduler-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.6K\", \"totalSubmission\": \"37.7K\", \"totalAcceptedRaw\": 17604, \"totalSubmissionRaw\": 37654, \"acRate\": \"46.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2486","questionFrontendId":"2404","title":"Most Frequent Even Element","titleSlug":"most-frequent-even-element","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.4K\", \"totalSubmission\": \"89.1K\", \"totalAcceptedRaw\": 45370, \"totalSubmissionRaw\": 89081, \"acRate\": \"50.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2487","questionFrontendId":"2405","title":"Optimal Partition of String","titleSlug":"optimal-partition-of-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.2K\", \"totalSubmission\": \"44.1K\", \"totalAcceptedRaw\": 33162, \"totalSubmissionRaw\": 44116, \"acRate\": \"75.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2502","questionFrontendId":"2418","title":"Sort the People","titleSlug":"sort-the-people","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.9K\", \"totalSubmission\": \"81.3K\", \"totalAcceptedRaw\": 65943, \"totalSubmissionRaw\": 81260, \"acRate\": \"81.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2520","questionFrontendId":"2434","title":"Using a Robot to Print the Lexicographically Smallest String","titleSlug":"using-a-robot-to-print-the-lexicographically-smallest-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"35.9K\", \"totalAcceptedRaw\": 13842, \"totalSubmissionRaw\": 35919, \"acRate\": \"38.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2524","questionFrontendId":"2441","title":"Largest Positive Integer That Exists With Its Negative","titleSlug":"largest-positive-integer-that-exists-with-its-negative","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.9K\", \"totalSubmission\": \"54.2K\", \"totalAcceptedRaw\": 36894, \"totalSubmissionRaw\": 54228, \"acRate\": \"68.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2525","questionFrontendId":"2442","title":"Count Number of Distinct Integers After Reverse Operations","titleSlug":"count-number-of-distinct-integers-after-reverse-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"35K\", \"totalSubmission\": \"44.5K\", \"totalAcceptedRaw\": 35027, \"totalSubmissionRaw\": 44509, \"acRate\": \"78.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2532","questionFrontendId":"2423","title":"Remove Letter To Equalize Frequency","titleSlug":"remove-letter-to-equalize-frequency","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.3K\", \"totalSubmission\": \"134.6K\", \"totalAcceptedRaw\": 24276, \"totalSubmissionRaw\": 134550, \"acRate\": \"18.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2543","questionFrontendId":"2456","title":"Most Popular Video Creator","titleSlug":"most-popular-video-creator","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.6K\", \"totalSubmission\": \"40.2K\", \"totalAcceptedRaw\": 17613, \"totalSubmissionRaw\": 40196, \"acRate\": \"43.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2547","questionFrontendId":"2451","title":"Odd String Difference","titleSlug":"odd-string-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"33.1K\", \"totalAcceptedRaw\": 19903, \"totalSubmissionRaw\": 33093, \"acRate\": \"60.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2548","questionFrontendId":"2453","title":"Destroy Sequential Targets","titleSlug":"destroy-sequential-targets","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.3K\", \"totalSubmission\": \"30.1K\", \"totalAcceptedRaw\": 11343, \"totalSubmissionRaw\": 30064, \"acRate\": \"37.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2552","questionFrontendId":"2461","title":"Maximum Sum of Distinct Subarrays With Length K","titleSlug":"maximum-sum-of-distinct-subarrays-with-length-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.5K\", \"totalSubmission\": \"65.8K\", \"totalAcceptedRaw\": 22536, \"totalSubmissionRaw\": 65770, \"acRate\": \"34.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2555","questionFrontendId":"2408","title":"Design SQL","titleSlug":"design-sql","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2K\", \"totalSubmission\": \"1.5K\", \"totalAcceptedRaw\": 1230, \"totalSubmissionRaw\": 1464, \"acRate\": \"84.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2561","questionFrontendId":"2465","title":"Number of Distinct Averages","titleSlug":"number-of-distinct-averages","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.3K\", \"totalSubmission\": \"43.3K\", \"totalAcceptedRaw\": 25253, \"totalSubmissionRaw\": 43315, \"acRate\": \"58.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2566","questionFrontendId":"2475","title":"Number of Unequal Triplets in Array","titleSlug":"number-of-unequal-triplets-in-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.1K\", \"totalSubmission\": \"35.5K\", \"totalAcceptedRaw\": 25135, \"totalSubmissionRaw\": 35479, \"acRate\": \"70.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2574","questionFrontendId":"2488","title":"Count Subarrays With Median K","titleSlug":"count-subarrays-with-median-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.9K\", \"totalSubmission\": \"18.7K\", \"totalAcceptedRaw\": 7918, \"totalSubmissionRaw\": 18733, \"acRate\": \"42.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2581","questionFrontendId":"2491","title":"Divide Players Into Teams of Equal Skill","titleSlug":"divide-players-into-teams-of-equal-skill","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.5K\", \"totalSubmission\": \"38.3K\", \"totalAcceptedRaw\": 22498, \"totalSubmissionRaw\": 38254, \"acRate\": \"58.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2586","questionFrontendId":"2501","title":"Longest Square Streak in an Array","titleSlug":"longest-square-streak-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"19K\", \"totalSubmission\": \"47.9K\", \"totalAcceptedRaw\": 18961, \"totalSubmissionRaw\": 47944, \"acRate\": \"39.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2587","questionFrontendId":"2502","title":"Design Memory Allocator","titleSlug":"design-memory-allocator","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.8K\", \"totalSubmission\": \"20.6K\", \"totalAcceptedRaw\": 10786, \"totalSubmissionRaw\": 20650, \"acRate\": \"52.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2592","questionFrontendId":"2499","title":"Minimum Total Cost to Make Arrays Unequal","titleSlug":"minimum-total-cost-to-make-arrays-unequal","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.7K\", \"totalSubmission\": \"6.1K\", \"totalAcceptedRaw\": 2671, \"totalSubmissionRaw\": 6054, \"acRate\": \"44.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2594","questionFrontendId":"2506","title":"Count Pairs Of Similar Strings","titleSlug":"count-pairs-of-similar-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.8K\", \"totalSubmission\": \"35.1K\", \"totalAcceptedRaw\": 24786, \"totalSubmissionRaw\": 35146, \"acRate\": \"70.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2596","questionFrontendId":"2508","title":"Add Edges to Make Degrees of All Nodes Even","titleSlug":"add-edges-to-make-degrees-of-all-nodes-even","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.9K\", \"totalSubmission\": \"27.6K\", \"totalAcceptedRaw\": 8918, \"totalSubmissionRaw\": 27588, \"acRate\": \"32.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2599","questionFrontendId":"2516","title":"Take K of Each Character From Left and Right","titleSlug":"take-k-of-each-character-from-left-and-right","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.5K\", \"totalSubmission\": \"30.9K\", \"totalAcceptedRaw\": 10457, \"totalSubmissionRaw\": 30850, \"acRate\": \"33.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2603","questionFrontendId":"2512","title":"Reward Top K Students","titleSlug":"reward-top-k-students","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.3K\", \"totalSubmission\": \"26.5K\", \"totalAcceptedRaw\": 12320, \"totalSubmissionRaw\": 26513, \"acRate\": \"46.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2605","questionFrontendId":"2514","title":"Count Anagrams","titleSlug":"count-anagrams","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.5K\", \"totalSubmission\": \"16.3K\", \"totalAcceptedRaw\": 5550, \"totalSubmissionRaw\": 16254, \"acRate\": \"34.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2609","questionFrontendId":"2521","title":"Distinct Prime Factors of Product of Array","titleSlug":"distinct-prime-factors-of-product-of-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.5K\", \"totalSubmission\": \"39.1K\", \"totalAcceptedRaw\": 19548, \"totalSubmissionRaw\": 39054, \"acRate\": \"50.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2615","questionFrontendId":"2531","title":"Make Number of Distinct Characters Equal","titleSlug":"make-number-of-distinct-characters-equal","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"52K\", \"totalAcceptedRaw\": 13275, \"totalSubmissionRaw\": 51994, \"acRate\": \"25.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2620","questionFrontendId":"2526","title":"Find Consecutive Integers from a Data Stream","titleSlug":"find-consecutive-integers-from-a-data-stream","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.6K\", \"totalSubmission\": \"34.6K\", \"totalAcceptedRaw\": 15580, \"totalSubmissionRaw\": 34616, \"acRate\": \"45.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2626","questionFrontendId":"2537","title":"Count the Number of Good Subarrays","titleSlug":"count-the-number-of-good-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 11735, \"totalSubmissionRaw\": 24498, \"acRate\": \"47.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2629","questionFrontendId":"2489","title":"Number of Substrings With Fixed Ratio","titleSlug":"number-of-substrings-with-fixed-ratio","translatedTitle":null,"stats":"{\"totalAccepted\": \"495\", \"totalSubmission\": \"843\", \"totalAcceptedRaw\": 495, \"totalSubmissionRaw\": 843, \"acRate\": \"58.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2633","questionFrontendId":"2547","title":"Minimum Cost to Split an Array","titleSlug":"minimum-cost-to-split-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.3K\", \"totalSubmission\": \"21.5K\", \"totalAcceptedRaw\": 8326, \"totalSubmissionRaw\": 21453, \"acRate\": \"38.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2634","questionFrontendId":"2540","title":"Minimum Common Value","titleSlug":"minimum-common-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.6K\", \"totalSubmission\": \"57.2K\", \"totalAcceptedRaw\": 29563, \"totalSubmissionRaw\": 57239, \"acRate\": \"51.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2640","questionFrontendId":"2554","title":"Maximum Number of Integers to Choose From a Range I","titleSlug":"maximum-number-of-integers-to-choose-from-a-range-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.7K\", \"totalSubmission\": \"39.5K\", \"totalAcceptedRaw\": 20691, \"totalSubmissionRaw\": 39493, \"acRate\": \"52.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2647","questionFrontendId":"2584","title":"Split the Array to Make Coprime Products","titleSlug":"split-the-array-to-make-coprime-products","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.9K\", \"totalSubmission\": \"36.2K\", \"totalAcceptedRaw\": 7936, \"totalSubmissionRaw\": 36249, \"acRate\": \"21.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2652","questionFrontendId":"2581","title":"Count Number of Possible Root Nodes","titleSlug":"count-number-of-possible-root-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"3K\", \"totalSubmission\": \"6.4K\", \"totalAcceptedRaw\": 3010, \"totalSubmissionRaw\": 6358, \"acRate\": \"47.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2656","questionFrontendId":"2588","title":"Count the Number of Beautiful Subarrays","titleSlug":"count-the-number-of-beautiful-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.4K\", \"totalSubmission\": \"21.3K\", \"totalAcceptedRaw\": 10382, \"totalSubmissionRaw\": 21331, \"acRate\": \"48.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2667","questionFrontendId":"2524","title":"Maximum Frequency Score of a Subarray","titleSlug":"maximum-frequency-score-of-a-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"530\", \"totalSubmission\": \"1.3K\", \"totalAcceptedRaw\": 530, \"totalSubmissionRaw\": 1318, \"acRate\": \"40.2%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2679","questionFrontendId":"2549","title":"Count Distinct Numbers on Board","titleSlug":"count-distinct-numbers-on-board","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.9K\", \"totalSubmission\": \"43.3K\", \"totalAcceptedRaw\": 25882, \"totalSubmissionRaw\": 43263, \"acRate\": \"59.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2683","questionFrontendId":"2539","title":"Count the Number of Good Subsequences","titleSlug":"count-the-number-of-good-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"1.6K\", \"totalAcceptedRaw\": 1274, \"totalSubmissionRaw\": 1647, \"acRate\": \"77.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2689","questionFrontendId":"2561","title":"Rearranging Fruits","titleSlug":"rearranging-fruits","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"18K\", \"totalAcceptedRaw\": 6138, \"totalSubmissionRaw\": 17961, \"acRate\": \"34.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2700","questionFrontendId":"2564","title":"Substring XOR Queries","titleSlug":"substring-xor-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.3K\", \"totalSubmission\": \"27.8K\", \"totalAcceptedRaw\": 9300, \"totalSubmissionRaw\": 27784, \"acRate\": \"33.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2707","questionFrontendId":"2570","title":"Merge Two 2D Arrays by Summing Values","titleSlug":"merge-two-2d-arrays-by-summing-values","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.7K\", \"totalSubmission\": \"29.7K\", \"totalAcceptedRaw\": 21656, \"totalSubmissionRaw\": 29667, \"acRate\": \"73.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/tmp/linked-list-graphql.json b/tmp/linked-list-graphql.json
new file mode 100644
index 000000000..71482dea5
--- /dev/null
+++ b/tmp/linked-list-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"Linked List","translatedName":null,"slug":"linked-list","questions":[{"status":null,"questionId":"2","questionFrontendId":"2","title":"Add Two Numbers","titleSlug":"add-two-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.5M\", \"totalSubmission\": \"8.7M\", \"totalAcceptedRaw\": 3487709, \"totalSubmissionRaw\": 8658379, \"acRate\": \"40.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"19","questionFrontendId":"19","title":"Remove Nth Node From End of List","titleSlug":"remove-nth-node-from-end-of-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.9M\", \"totalSubmission\": \"4.7M\", \"totalAcceptedRaw\": 1939250, \"totalSubmissionRaw\": 4740229, \"acRate\": \"40.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"21","questionFrontendId":"21","title":"Merge Two Sorted Lists","titleSlug":"merge-two-sorted-lists","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.1M\", \"totalSubmission\": \"4.9M\", \"totalAcceptedRaw\": 3073999, \"totalSubmissionRaw\": 4922475, \"acRate\": \"62.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"23","questionFrontendId":"23","title":"Merge k Sorted Lists","titleSlug":"merge-k-sorted-lists","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6M\", \"totalSubmission\": \"3.2M\", \"totalAcceptedRaw\": 1594136, \"totalSubmissionRaw\": 3207408, \"acRate\": \"49.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"24","questionFrontendId":"24","title":"Swap Nodes in Pairs","titleSlug":"swap-nodes-in-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"1.7M\", \"totalAcceptedRaw\": 1062297, \"totalSubmissionRaw\": 1735108, \"acRate\": \"61.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"25","questionFrontendId":"25","title":"Reverse Nodes in k-Group","titleSlug":"reverse-nodes-in-k-group","translatedTitle":null,"stats":"{\"totalAccepted\": \"668.9K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 668886, \"totalSubmissionRaw\": 1226723, \"acRate\": \"54.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"61","questionFrontendId":"61","title":"Rotate List","titleSlug":"rotate-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"697.6K\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 697553, \"totalSubmissionRaw\": 1935129, \"acRate\": \"36.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"82","questionFrontendId":"82","title":"Remove Duplicates from Sorted List II","titleSlug":"remove-duplicates-from-sorted-list-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"585.6K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 585603, \"totalSubmissionRaw\": 1276983, \"acRate\": \"45.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"83","questionFrontendId":"83","title":"Remove Duplicates from Sorted List","titleSlug":"remove-duplicates-from-sorted-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 1132249, \"totalSubmissionRaw\": 2241645, \"acRate\": \"50.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"86","questionFrontendId":"86","title":"Partition List","titleSlug":"partition-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"441.2K\", \"totalSubmission\": \"849.9K\", \"totalAcceptedRaw\": 441207, \"totalSubmissionRaw\": 849915, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"92","questionFrontendId":"92","title":"Reverse Linked List II","titleSlug":"reverse-linked-list-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"618.2K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 618245, \"totalSubmissionRaw\": 1360979, \"acRate\": \"45.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"109","questionFrontendId":"109","title":"Convert Sorted List to Binary Search Tree","titleSlug":"convert-sorted-list-to-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"468.6K\", \"totalSubmission\": \"779.7K\", \"totalAcceptedRaw\": 468618, \"totalSubmissionRaw\": 779716, \"acRate\": \"60.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"114","questionFrontendId":"114","title":"Flatten Binary Tree to Linked List","titleSlug":"flatten-binary-tree-to-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"758K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 757996, \"totalSubmissionRaw\": 1227848, \"acRate\": \"61.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"116","questionFrontendId":"116","title":"Populating Next Right Pointers in Each Node","titleSlug":"populating-next-right-pointers-in-each-node","translatedTitle":null,"stats":"{\"totalAccepted\": \"903.7K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 903689, \"totalSubmissionRaw\": 1498826, \"acRate\": \"60.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"117","questionFrontendId":"117","title":"Populating Next Right Pointers in Each Node II","titleSlug":"populating-next-right-pointers-in-each-node-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"539.3K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 539297, \"totalSubmissionRaw\": 1074426, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"138","questionFrontendId":"138","title":"Copy List with Random Pointer","titleSlug":"copy-list-with-random-pointer","translatedTitle":null,"stats":"{\"totalAccepted\": \"929.3K\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 929251, \"totalSubmissionRaw\": 1813168, \"acRate\": \"51.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"141","questionFrontendId":"141","title":"Linked List Cycle","titleSlug":"linked-list-cycle","translatedTitle":null,"stats":"{\"totalAccepted\": \"2M\", \"totalSubmission\": \"4.1M\", \"totalAcceptedRaw\": 1966418, \"totalSubmissionRaw\": 4148573, \"acRate\": \"47.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"142","questionFrontendId":"142","title":"Linked List Cycle II","titleSlug":"linked-list-cycle-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"1M\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 1020051, \"totalSubmissionRaw\": 2099589, \"acRate\": \"48.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"143","questionFrontendId":"143","title":"Reorder List","titleSlug":"reorder-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"645.1K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 645075, \"totalSubmissionRaw\": 1232075, \"acRate\": \"52.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"146","questionFrontendId":"146","title":"LRU Cache","titleSlug":"lru-cache","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"3.1M\", \"totalAcceptedRaw\": 1277203, \"totalSubmissionRaw\": 3143178, \"acRate\": \"40.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"147","questionFrontendId":"147","title":"Insertion Sort List","titleSlug":"insertion-sort-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"317.7K\", \"totalSubmission\": \"623.9K\", \"totalAcceptedRaw\": 317709, \"totalSubmissionRaw\": 623891, \"acRate\": \"50.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"148","questionFrontendId":"148","title":"Sort List","titleSlug":"sort-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"611.2K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 611213, \"totalSubmissionRaw\": 1110991, \"acRate\": \"55.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"160","questionFrontendId":"160","title":"Intersection of Two Linked Lists","titleSlug":"intersection-of-two-linked-lists","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 1232521, \"totalSubmissionRaw\": 2273657, \"acRate\": \"54.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"203","questionFrontendId":"203","title":"Remove Linked List Elements","titleSlug":"remove-linked-list-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"899.7K\", \"totalSubmission\": \"2M\", \"totalAcceptedRaw\": 899738, \"totalSubmissionRaw\": 1963231, \"acRate\": \"45.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"206","questionFrontendId":"206","title":"Reverse Linked List","titleSlug":"reverse-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"3M\", \"totalSubmission\": \"4M\", \"totalAcceptedRaw\": 2953248, \"totalSubmissionRaw\": 4021750, \"acRate\": \"73.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"234","questionFrontendId":"234","title":"Palindrome Linked List","titleSlug":"palindrome-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.8M\", \"totalAcceptedRaw\": 1393619, \"totalSubmissionRaw\": 2779640, \"acRate\": \"50.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"237","questionFrontendId":"237","title":"Delete Node in a Linked List","titleSlug":"delete-node-in-a-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"1M\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 1039160, \"totalSubmissionRaw\": 1368628, \"acRate\": \"75.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"328","questionFrontendId":"328","title":"Odd Even Linked List","titleSlug":"odd-even-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"703.7K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 703708, \"totalSubmissionRaw\": 1149151, \"acRate\": \"61.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"355","questionFrontendId":"355","title":"Design Twitter","titleSlug":"design-twitter","translatedTitle":null,"stats":"{\"totalAccepted\": \"117.6K\", \"totalSubmission\": \"316K\", \"totalAcceptedRaw\": 117589, \"totalSubmissionRaw\": 315999, \"acRate\": \"37.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"369","questionFrontendId":"369","title":"Plus One Linked List","titleSlug":"plus-one-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"74K\", \"totalSubmission\": \"121.3K\", \"totalAcceptedRaw\": 73987, \"totalSubmissionRaw\": 121304, \"acRate\": \"61.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"379","questionFrontendId":"379","title":"Design Phone Directory","titleSlug":"design-phone-directory","translatedTitle":null,"stats":"{\"totalAccepted\": \"61.2K\", \"totalSubmission\": \"119.7K\", \"totalAcceptedRaw\": 61211, \"totalSubmissionRaw\": 119653, \"acRate\": \"51.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"382","questionFrontendId":"382","title":"Linked List Random Node","titleSlug":"linked-list-random-node","translatedTitle":null,"stats":"{\"totalAccepted\": \"222K\", \"totalSubmission\": \"353.8K\", \"totalAcceptedRaw\": 221995, \"totalSubmissionRaw\": 353776, \"acRate\": \"62.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Reservoir Sampling","translatedName":null,"slug":"reservoir-sampling","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"432","questionFrontendId":"432","title":"All O`one Data Structure","titleSlug":"all-oone-data-structure","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.6K\", \"totalSubmission\": \"185.1K\", \"totalAcceptedRaw\": 67644, \"totalSubmissionRaw\": 185050, \"acRate\": \"36.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"445","questionFrontendId":"445","title":"Add Two Numbers II","titleSlug":"add-two-numbers-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"361.8K\", \"totalSubmission\": \"606.8K\", \"totalAcceptedRaw\": 361771, \"totalSubmissionRaw\": 606794, \"acRate\": \"59.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"460","questionFrontendId":"460","title":"LFU Cache","titleSlug":"lfu-cache","translatedTitle":null,"stats":"{\"totalAccepted\": \"213.6K\", \"totalSubmission\": \"497K\", \"totalAcceptedRaw\": 213605, \"totalSubmissionRaw\": 497001, \"acRate\": \"43.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"528","questionFrontendId":"1721","title":"Swapping Nodes in a Linked List","titleSlug":"swapping-nodes-in-a-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"205K\", \"totalSubmission\": \"305.1K\", \"totalAcceptedRaw\": 205032, \"totalSubmissionRaw\": 305077, \"acRate\": \"67.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"716","questionFrontendId":"716","title":"Max Stack","titleSlug":"max-stack","translatedTitle":null,"stats":"{\"totalAccepted\": \"140.5K\", \"totalSubmission\": \"310.8K\", \"totalAcceptedRaw\": 140509, \"totalSubmissionRaw\": 310797, \"acRate\": \"45.2%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"725","questionFrontendId":"725","title":"Split Linked List in Parts","titleSlug":"split-linked-list-in-parts","translatedTitle":null,"stats":"{\"totalAccepted\": \"111.5K\", \"totalSubmission\": \"194.9K\", \"totalAcceptedRaw\": 111481, \"totalSubmissionRaw\": 194920, \"acRate\": \"57.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"758","questionFrontendId":"426","title":"Convert Binary Search Tree to Sorted Doubly Linked List","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"233.7K\", \"totalSubmission\": \"361.5K\", \"totalAcceptedRaw\": 233675, \"totalSubmissionRaw\": 361492, \"acRate\": \"64.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"766","questionFrontendId":"430","title":"Flatten a Multilevel Doubly Linked List","titleSlug":"flatten-a-multilevel-doubly-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"283.1K\", \"totalSubmission\": \"474.6K\", \"totalAcceptedRaw\": 283077, \"totalSubmissionRaw\": 474643, \"acRate\": \"59.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"816","questionFrontendId":"705","title":"Design HashSet","titleSlug":"design-hashset","translatedTitle":null,"stats":"{\"totalAccepted\": \"278.3K\", \"totalSubmission\": \"423.8K\", \"totalAcceptedRaw\": 278251, \"totalSubmissionRaw\": 423827, \"acRate\": \"65.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"817","questionFrontendId":"706","title":"Design HashMap","titleSlug":"design-hashmap","translatedTitle":null,"stats":"{\"totalAccepted\": \"401.9K\", \"totalSubmission\": \"620.9K\", \"totalAcceptedRaw\": 401878, \"totalSubmissionRaw\": 620861, \"acRate\": \"64.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"835","questionFrontendId":"817","title":"Linked List Components","titleSlug":"linked-list-components","translatedTitle":null,"stats":"{\"totalAccepted\": \"79.3K\", \"totalSubmission\": \"137.3K\", \"totalAcceptedRaw\": 79272, \"totalSubmissionRaw\": 137291, \"acRate\": \"57.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"838","questionFrontendId":"707","title":"Design Linked List","titleSlug":"design-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"250K\", \"totalSubmission\": \"905.4K\", \"totalAcceptedRaw\": 250001, \"totalSubmissionRaw\": 905380, \"acRate\": \"27.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"850","questionFrontendId":"708","title":"Insert into a Sorted Circular Linked List","titleSlug":"insert-into-a-sorted-circular-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"129.3K\", \"totalSubmission\": \"374.4K\", \"totalAcceptedRaw\": 129252, \"totalSubmissionRaw\": 374361, \"acRate\": \"34.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"859","questionFrontendId":"641","title":"Design Circular Deque","titleSlug":"design-circular-deque","translatedTitle":null,"stats":"{\"totalAccepted\": \"54.6K\", \"totalSubmission\": \"95.1K\", \"totalAcceptedRaw\": 54578, \"totalSubmissionRaw\": 95094, \"acRate\": \"57.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"860","questionFrontendId":"622","title":"Design Circular Queue","titleSlug":"design-circular-queue","translatedTitle":null,"stats":"{\"totalAccepted\": \"259.1K\", \"totalSubmission\": \"502.2K\", \"totalAcceptedRaw\": 259088, \"totalSubmissionRaw\": 502197, \"acRate\": \"51.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"908","questionFrontendId":"876","title":"Middle of the Linked List","titleSlug":"middle-of-the-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"1.7M\", \"totalAcceptedRaw\": 1247484, \"totalSubmissionRaw\": 1652734, \"acRate\": \"75.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1072","questionFrontendId":"1019","title":"Next Greater Node In Linked List","titleSlug":"next-greater-node-in-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.5K\", \"totalSubmission\": \"207.9K\", \"totalAcceptedRaw\": 124540, \"totalSubmissionRaw\": 207923, \"acRate\": \"59.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1267","questionFrontendId":"1171","title":"Remove Zero Sum Consecutive Nodes from Linked List","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.8K\", \"totalSubmission\": \"103.8K\", \"totalAcceptedRaw\": 44819, \"totalSubmissionRaw\": 103762, \"acRate\": \"43.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1337","questionFrontendId":"1206","title":"Design Skiplist","titleSlug":"design-skiplist","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.6K\", \"totalSubmission\": \"27.5K\", \"totalAcceptedRaw\": 16620, \"totalSubmissionRaw\": 27500, \"acRate\": \"60.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1404","questionFrontendId":"1265","title":"Print Immutable Linked List in Reverse","titleSlug":"print-immutable-linked-list-in-reverse","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.6K\", \"totalSubmission\": \"51.6K\", \"totalAcceptedRaw\": 48606, \"totalSubmissionRaw\": 51580, \"acRate\": \"94.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1411","questionFrontendId":"1290","title":"Convert Binary Number in a Linked List to Integer","titleSlug":"convert-binary-number-in-a-linked-list-to-integer","translatedTitle":null,"stats":"{\"totalAccepted\": \"370.7K\", \"totalSubmission\": \"451K\", \"totalAcceptedRaw\": 370696, \"totalSubmissionRaw\": 450965, \"acRate\": \"82.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1484","questionFrontendId":"1367","title":"Linked List in Binary Tree","titleSlug":"linked-list-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.9K\", \"totalSubmission\": \"146.3K\", \"totalAcceptedRaw\": 63913, \"totalSubmissionRaw\": 146330, \"acRate\": \"43.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1582","questionFrontendId":"1472","title":"Design Browser History","titleSlug":"design-browser-history","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.9K\", \"totalSubmission\": \"157.3K\", \"totalAcceptedRaw\": 119865, \"totalSubmissionRaw\": 157289, \"acRate\": \"76.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1618","questionFrontendId":"1474","title":"Delete N Nodes After M Nodes of a Linked List","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.9K\", \"totalSubmission\": \"34K\", \"totalAcceptedRaw\": 24946, \"totalSubmissionRaw\": 33980, \"acRate\": \"73.4%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1765","questionFrontendId":"1669","title":"Merge In Between Linked Lists","titleSlug":"merge-in-between-linked-lists","translatedTitle":null,"stats":"{\"totalAccepted\": \"68.6K\", \"totalSubmission\": \"92.9K\", \"totalAcceptedRaw\": 68621, \"totalSubmissionRaw\": 92934, \"acRate\": \"73.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1767","questionFrontendId":"1670","title":"Design Front Middle Back Queue","titleSlug":"design-front-middle-back-queue","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.5K\", \"totalSubmission\": \"35.9K\", \"totalAcceptedRaw\": 20547, \"totalSubmissionRaw\": 35853, \"acRate\": \"57.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1774","questionFrontendId":"1634","title":"Add Two Polynomials Represented as Linked Lists","titleSlug":"add-two-polynomials-represented-as-linked-lists","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.7K\", \"totalSubmission\": \"16K\", \"totalAcceptedRaw\": 8687, \"totalSubmissionRaw\": 15967, \"acRate\": \"54.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1982","questionFrontendId":"1836","title":"Remove Duplicates From an Unsorted Linked List","titleSlug":"remove-duplicates-from-an-unsorted-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.9K\", \"totalSubmission\": \"32.5K\", \"totalAcceptedRaw\": 22876, \"totalSubmissionRaw\": 32467, \"acRate\": \"70.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1992","questionFrontendId":"2046","title":"Sort Linked List Already Sorted Using Absolute Values","titleSlug":"sort-linked-list-already-sorted-using-absolute-values","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.8K\", \"totalSubmission\": \"7K\", \"totalAcceptedRaw\": 4766, \"totalSubmissionRaw\": 6950, \"acRate\": \"68.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2182","questionFrontendId":"2058","title":"Find the Minimum and Maximum Number of Nodes Between Critical Points","titleSlug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.6K\", \"totalSubmission\": \"39.5K\", \"totalAcceptedRaw\": 22586, \"totalSubmissionRaw\": 39545, \"acRate\": \"57.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2196","questionFrontendId":"2074","title":"Reverse Nodes in Even Length Groups","titleSlug":"reverse-nodes-in-even-length-groups","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.5K\", \"totalSubmission\": \"29K\", \"totalAcceptedRaw\": 15477, \"totalSubmissionRaw\": 28986, \"acRate\": \"53.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2216","questionFrontendId":"2095","title":"Delete the Middle Node of a Linked List","titleSlug":"delete-the-middle-node-of-a-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"178K\", \"totalSubmission\": \"298.8K\", \"totalAcceptedRaw\": 177962, \"totalSubmissionRaw\": 298767, \"acRate\": \"59.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2236","questionFrontendId":"2130","title":"Maximum Twin Sum of a Linked List","titleSlug":"maximum-twin-sum-of-a-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"86.6K\", \"totalSubmission\": \"107.4K\", \"totalAcceptedRaw\": 86606, \"totalSubmissionRaw\": 107385, \"acRate\": \"80.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2299","questionFrontendId":"2181","title":"Merge Nodes in Between Zeros","titleSlug":"merge-nodes-in-between-zeros","translatedTitle":null,"stats":"{\"totalAccepted\": \"69.5K\", \"totalSubmission\": \"80.5K\", \"totalAcceptedRaw\": 69514, \"totalSubmissionRaw\": 80486, \"acRate\": \"86.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2374","questionFrontendId":"2289","title":"Steps to Make Array Non-decreasing","titleSlug":"steps-to-make-array-non-decreasing","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.1K\", \"totalSubmission\": \"67K\", \"totalAcceptedRaw\": 14120, \"totalSubmissionRaw\": 66974, \"acRate\": \"21.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2389","questionFrontendId":"2296","title":"Design a Text Editor","titleSlug":"design-a-text-editor","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.7K\", \"totalSubmission\": \"38.5K\", \"totalAcceptedRaw\": 15665, \"totalSubmissionRaw\": 38510, \"acRate\": \"40.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2411","questionFrontendId":"2326","title":"Spiral Matrix IV","titleSlug":"spiral-matrix-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"26K\", \"totalSubmission\": \"34.8K\", \"totalAcceptedRaw\": 25971, \"totalSubmissionRaw\": 34761, \"acRate\": \"74.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2573","questionFrontendId":"2487","title":"Remove Nodes From Linked List","titleSlug":"remove-nodes-from-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.3K\", \"totalSubmission\": \"36.8K\", \"totalAcceptedRaw\": 25295, \"totalSubmissionRaw\": 36770, \"acRate\": \"68.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/tmp/math-graphql.json b/tmp/math-graphql.json
new file mode 100644
index 000000000..d986f3692
--- /dev/null
+++ b/tmp/math-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"Math","translatedName":null,"slug":"math","questions":[{"status":null,"questionId":"2","questionFrontendId":"2","title":"Add Two Numbers","titleSlug":"add-two-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.5M\", \"totalSubmission\": \"8.7M\", \"totalAcceptedRaw\": 3487709, \"totalSubmissionRaw\": 8658379, \"acRate\": \"40.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"7","questionFrontendId":"7","title":"Reverse Integer","titleSlug":"reverse-integer","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.5M\", \"totalSubmission\": \"9.1M\", \"totalAcceptedRaw\": 2502976, \"totalSubmissionRaw\": 9130555, \"acRate\": \"27.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"9","questionFrontendId":"9","title":"Palindrome Number","titleSlug":"palindrome-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"3M\", \"totalSubmission\": \"5.6M\", \"totalAcceptedRaw\": 3001073, \"totalSubmissionRaw\": 5613711, \"acRate\": \"53.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"12","questionFrontendId":"12","title":"Integer to Roman","titleSlug":"integer-to-roman","translatedTitle":null,"stats":"{\"totalAccepted\": \"955K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 954997, \"totalSubmissionRaw\": 1541977, \"acRate\": \"61.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"13","questionFrontendId":"13","title":"Roman to Integer","titleSlug":"roman-to-integer","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.5M\", \"totalSubmission\": \"4.3M\", \"totalAcceptedRaw\": 2497238, \"totalSubmissionRaw\": 4272457, \"acRate\": \"58.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"29","questionFrontendId":"29","title":"Divide Two Integers","titleSlug":"divide-two-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"589.1K\", \"totalSubmission\": \"3.4M\", \"totalAcceptedRaw\": 589087, \"totalSubmissionRaw\": 3432280, \"acRate\": \"17.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"43","questionFrontendId":"43","title":"Multiply Strings","titleSlug":"multiply-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"641.9K\", \"totalSubmission\": \"1.6M\", \"totalAcceptedRaw\": 641869, \"totalSubmissionRaw\": 1640866, \"acRate\": \"39.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"48","questionFrontendId":"48","title":"Rotate Image","titleSlug":"rotate-image","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"1.7M\", \"totalAcceptedRaw\": 1232625, \"totalSubmissionRaw\": 1739071, \"acRate\": \"70.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"50","questionFrontendId":"50","title":"Pow(x, n)","titleSlug":"powx-n","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"3.5M\", \"totalAcceptedRaw\": 1159147, \"totalSubmissionRaw\": 3513382, \"acRate\": \"33.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"60","questionFrontendId":"60","title":"Permutation Sequence","titleSlug":"permutation-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"319.2K\", \"totalSubmission\": \"720.1K\", \"totalAcceptedRaw\": 319175, \"totalSubmissionRaw\": 720141, \"acRate\": \"44.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"62","questionFrontendId":"62","title":"Unique Paths","titleSlug":"unique-paths","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 1326037, \"totalSubmissionRaw\": 2117476, \"acRate\": \"62.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"66","questionFrontendId":"66","title":"Plus One","titleSlug":"plus-one","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6M\", \"totalSubmission\": \"3.7M\", \"totalAcceptedRaw\": 1605878, \"totalSubmissionRaw\": 3679056, \"acRate\": \"43.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"67","questionFrontendId":"67","title":"Add Binary","titleSlug":"add-binary","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 1111348, \"totalSubmissionRaw\": 2121846, \"acRate\": \"52.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"69","questionFrontendId":"69","title":"Sqrt(x)","titleSlug":"sqrtx","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"3.8M\", \"totalAcceptedRaw\": 1402903, \"totalSubmissionRaw\": 3754089, \"acRate\": \"37.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"70","questionFrontendId":"70","title":"Climbing Stairs","titleSlug":"climbing-stairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.3M\", \"totalSubmission\": \"4.3M\", \"totalAcceptedRaw\": 2254076, \"totalSubmissionRaw\": 4320834, \"acRate\": \"52.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"89","questionFrontendId":"89","title":"Gray Code","titleSlug":"gray-code","translatedTitle":null,"stats":"{\"totalAccepted\": \"258.2K\", \"totalSubmission\": \"452.4K\", \"totalAcceptedRaw\": 258170, \"totalSubmissionRaw\": 452378, \"acRate\": \"57.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"96","questionFrontendId":"96","title":"Unique Binary Search Trees","titleSlug":"unique-binary-search-trees","translatedTitle":null,"stats":"{\"totalAccepted\": \"559.5K\", \"totalSubmission\": \"938.3K\", \"totalAcceptedRaw\": 559467, \"totalSubmissionRaw\": 938346, \"acRate\": \"59.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"149","questionFrontendId":"149","title":"Max Points on a Line","titleSlug":"max-points-on-a-line","translatedTitle":null,"stats":"{\"totalAccepted\": \"333K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 332986, \"totalSubmissionRaw\": 1328049, \"acRate\": \"25.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"150","questionFrontendId":"150","title":"Evaluate Reverse Polish Notation","titleSlug":"evaluate-reverse-polish-notation","translatedTitle":null,"stats":"{\"totalAccepted\": \"632.6K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 632649, \"totalSubmissionRaw\": 1385852, \"acRate\": \"45.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"166","questionFrontendId":"166","title":"Fraction to Recurring Decimal","titleSlug":"fraction-to-recurring-decimal","translatedTitle":null,"stats":"{\"totalAccepted\": \"204.3K\", \"totalSubmission\": \"841.2K\", \"totalAcceptedRaw\": 204326, \"totalSubmissionRaw\": 841187, \"acRate\": \"24.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"168","questionFrontendId":"168","title":"Excel Sheet Column Title","titleSlug":"excel-sheet-column-title","translatedTitle":null,"stats":"{\"totalAccepted\": \"368.1K\", \"totalSubmission\": \"1M\", \"totalAcceptedRaw\": 368067, \"totalSubmissionRaw\": 1039187, \"acRate\": \"35.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"171","questionFrontendId":"171","title":"Excel Sheet Column Number","titleSlug":"excel-sheet-column-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"584K\", \"totalSubmission\": \"942.4K\", \"totalAcceptedRaw\": 583995, \"totalSubmissionRaw\": 942441, \"acRate\": \"62.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"172","questionFrontendId":"172","title":"Factorial Trailing Zeroes","titleSlug":"factorial-trailing-zeroes","translatedTitle":null,"stats":"{\"totalAccepted\": \"361K\", \"totalSubmission\": \"856.6K\", \"totalAcceptedRaw\": 360960, \"totalSubmissionRaw\": 856561, \"acRate\": \"42.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"189","questionFrontendId":"189","title":"Rotate Array","titleSlug":"rotate-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"3.6M\", \"totalAcceptedRaw\": 1436124, \"totalSubmissionRaw\": 3648270, \"acRate\": \"39.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"202","questionFrontendId":"202","title":"Happy Number","titleSlug":"happy-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"2M\", \"totalAcceptedRaw\": 1103717, \"totalSubmissionRaw\": 2015361, \"acRate\": \"54.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"204","questionFrontendId":"204","title":"Count Primes","titleSlug":"count-primes","translatedTitle":null,"stats":"{\"totalAccepted\": \"714.7K\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 714673, \"totalSubmissionRaw\": 2158946, \"acRate\": \"33.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"223","questionFrontendId":"223","title":"Rectangle Area","titleSlug":"rectangle-area","translatedTitle":null,"stats":"{\"totalAccepted\": \"198K\", \"totalSubmission\": \"439.1K\", \"totalAcceptedRaw\": 197968, \"totalSubmissionRaw\": 439069, \"acRate\": \"45.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"224","questionFrontendId":"224","title":"Basic Calculator","titleSlug":"basic-calculator","translatedTitle":null,"stats":"{\"totalAccepted\": \"373.8K\", \"totalSubmission\": \"881.3K\", \"totalAcceptedRaw\": 373768, \"totalSubmissionRaw\": 881324, \"acRate\": \"42.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"227","questionFrontendId":"227","title":"Basic Calculator II","titleSlug":"basic-calculator-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"507.3K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 507338, \"totalSubmissionRaw\": 1196563, \"acRate\": \"42.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"231","questionFrontendId":"231","title":"Power of Two","titleSlug":"power-of-two","translatedTitle":null,"stats":"{\"totalAccepted\": \"854.3K\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 854252, \"totalSubmissionRaw\": 1858107, \"acRate\": \"46.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"233","questionFrontendId":"233","title":"Number of Digit One","titleSlug":"number-of-digit-one","translatedTitle":null,"stats":"{\"totalAccepted\": \"75.1K\", \"totalSubmission\": \"221K\", \"totalAcceptedRaw\": 75051, \"totalSubmissionRaw\": 220980, \"acRate\": \"34.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"241","questionFrontendId":"241","title":"Different Ways to Add Parentheses","titleSlug":"different-ways-to-add-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"190.7K\", \"totalSubmission\": \"298.8K\", \"totalAcceptedRaw\": 190714, \"totalSubmissionRaw\": 298836, \"acRate\": \"63.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"258","questionFrontendId":"258","title":"Add Digits","titleSlug":"add-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"550.9K\", \"totalSubmission\": \"862K\", \"totalAcceptedRaw\": 550855, \"totalSubmissionRaw\": 862002, \"acRate\": \"63.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"263","questionFrontendId":"263","title":"Ugly Number","titleSlug":"ugly-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"415.3K\", \"totalSubmission\": \"981.5K\", \"totalAcceptedRaw\": 415341, \"totalSubmissionRaw\": 981537, \"acRate\": \"42.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"264","questionFrontendId":"264","title":"Ugly Number II","titleSlug":"ugly-number-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"301.3K\", \"totalSubmission\": \"652.4K\", \"totalAcceptedRaw\": 301267, \"totalSubmissionRaw\": 652373, \"acRate\": \"46.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"268","questionFrontendId":"268","title":"Missing Number","titleSlug":"missing-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 1431785, \"totalSubmissionRaw\": 2293208, \"acRate\": \"62.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"273","questionFrontendId":"273","title":"Integer to English Words","titleSlug":"integer-to-english-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"339.3K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 339318, \"totalSubmissionRaw\": 1131699, \"acRate\": \"30.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"279","questionFrontendId":"279","title":"Perfect Squares","titleSlug":"perfect-squares","translatedTitle":null,"stats":"{\"totalAccepted\": \"650.4K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 650365, \"totalSubmissionRaw\": 1235514, \"acRate\": \"52.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"282","questionFrontendId":"282","title":"Expression Add Operators","titleSlug":"expression-add-operators","translatedTitle":null,"stats":"{\"totalAccepted\": \"197.5K\", \"totalSubmission\": \"503.7K\", \"totalAcceptedRaw\": 197479, \"totalSubmissionRaw\": 503690, \"acRate\": \"39.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"292","questionFrontendId":"292","title":"Nim Game","titleSlug":"nim-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"315.9K\", \"totalSubmission\": \"563.4K\", \"totalAcceptedRaw\": 315943, \"totalSubmissionRaw\": 563403, \"acRate\": \"56.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"294","questionFrontendId":"294","title":"Flip Game II","titleSlug":"flip-game-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.4K\", \"totalSubmission\": \"129.8K\", \"totalAcceptedRaw\": 67351, \"totalSubmissionRaw\": 129839, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"296","questionFrontendId":"296","title":"Best Meeting Point","titleSlug":"best-meeting-point","translatedTitle":null,"stats":"{\"totalAccepted\": \"67K\", \"totalSubmission\": \"111.4K\", \"totalAcceptedRaw\": 66964, \"totalSubmissionRaw\": 111420, \"acRate\": \"60.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"313","questionFrontendId":"313","title":"Super Ugly Number","titleSlug":"super-ugly-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"115.8K\", \"totalSubmission\": \"254.4K\", \"totalAcceptedRaw\": 115792, \"totalSubmissionRaw\": 254382, \"acRate\": \"45.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"319","questionFrontendId":"319","title":"Bulb Switcher","titleSlug":"bulb-switcher","translatedTitle":null,"stats":"{\"totalAccepted\": \"129.3K\", \"totalSubmission\": \"267.8K\", \"totalAcceptedRaw\": 129299, \"totalSubmissionRaw\": 267825, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"326","questionFrontendId":"326","title":"Power of Three","titleSlug":"power-of-three","translatedTitle":null,"stats":"{\"totalAccepted\": \"662.9K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 662901, \"totalSubmissionRaw\": 1457672, \"acRate\": \"45.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"335","questionFrontendId":"335","title":"Self Crossing","titleSlug":"self-crossing","translatedTitle":null,"stats":"{\"totalAccepted\": \"30K\", \"totalSubmission\": \"102K\", \"totalAcceptedRaw\": 30023, \"totalSubmissionRaw\": 102001, \"acRate\": \"29.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"342","questionFrontendId":"342","title":"Power of Four","titleSlug":"power-of-four","translatedTitle":null,"stats":"{\"totalAccepted\": \"445.7K\", \"totalSubmission\": \"967K\", \"totalAcceptedRaw\": 445660, \"totalSubmissionRaw\": 967022, \"acRate\": \"46.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"343","questionFrontendId":"343","title":"Integer Break","titleSlug":"integer-break","translatedTitle":null,"stats":"{\"totalAccepted\": \"226K\", \"totalSubmission\": \"403.9K\", \"totalAcceptedRaw\": 225990, \"totalSubmissionRaw\": 403905, \"acRate\": \"56.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"356","questionFrontendId":"356","title":"Line Reflection","titleSlug":"line-reflection","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.4K\", \"totalSubmission\": \"99K\", \"totalAcceptedRaw\": 34413, \"totalSubmissionRaw\": 98964, \"acRate\": \"34.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"357","questionFrontendId":"357","title":"Count Numbers with Unique Digits","titleSlug":"count-numbers-with-unique-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"115.8K\", \"totalSubmission\": \"223.5K\", \"totalAcceptedRaw\": 115821, \"totalSubmissionRaw\": 223547, \"acRate\": \"51.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"360","questionFrontendId":"360","title":"Sort Transformed Array","titleSlug":"sort-transformed-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"61.6K\", \"totalSubmission\": \"112.1K\", \"totalAcceptedRaw\": 61611, \"totalSubmissionRaw\": 112063, \"acRate\": \"55.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"365","questionFrontendId":"365","title":"Water and Jug Problem","titleSlug":"water-and-jug-problem","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.4K\", \"totalSubmission\": \"209.8K\", \"totalAcceptedRaw\": 78427, \"totalSubmissionRaw\": 209822, \"acRate\": \"37.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"367","questionFrontendId":"367","title":"Valid Perfect Square","titleSlug":"valid-perfect-square","translatedTitle":null,"stats":"{\"totalAccepted\": \"468.1K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 468099, \"totalSubmissionRaw\": 1080536, \"acRate\": \"43.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"368","questionFrontendId":"368","title":"Largest Divisible Subset","titleSlug":"largest-divisible-subset","translatedTitle":null,"stats":"{\"totalAccepted\": \"175.4K\", \"totalSubmission\": \"423K\", \"totalAcceptedRaw\": 175431, \"totalSubmissionRaw\": 422970, \"acRate\": \"41.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"369","questionFrontendId":"369","title":"Plus One Linked List","titleSlug":"plus-one-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"74K\", \"totalSubmission\": \"121.3K\", \"totalAcceptedRaw\": 73987, \"totalSubmissionRaw\": 121304, \"acRate\": \"61.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"371","questionFrontendId":"371","title":"Sum of Two Integers","titleSlug":"sum-of-two-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"372.3K\", \"totalSubmission\": \"734.5K\", \"totalAcceptedRaw\": 372306, \"totalSubmissionRaw\": 734469, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"372","questionFrontendId":"372","title":"Super Pow","titleSlug":"super-pow","translatedTitle":null,"stats":"{\"totalAccepted\": \"57.9K\", \"totalSubmission\": \"158.9K\", \"totalAcceptedRaw\": 57920, \"totalSubmissionRaw\": 158935, \"acRate\": \"36.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"375","questionFrontendId":"375","title":"Guess Number Higher or Lower II","titleSlug":"guess-number-higher-or-lower-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"104.1K\", \"totalSubmission\": \"222.4K\", \"totalAcceptedRaw\": 104135, \"totalSubmissionRaw\": 222390, \"acRate\": \"46.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"380","questionFrontendId":"380","title":"Insert Delete GetRandom O(1)","titleSlug":"insert-delete-getrandom-o1","translatedTitle":null,"stats":"{\"totalAccepted\": \"611.5K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 611513, \"totalSubmissionRaw\": 1158158, \"acRate\": \"52.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"381","questionFrontendId":"381","title":"Insert Delete GetRandom O(1) - Duplicates allowed","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed","translatedTitle":null,"stats":"{\"totalAccepted\": \"125.3K\", \"totalSubmission\": \"352.7K\", \"totalAcceptedRaw\": 125334, \"totalSubmissionRaw\": 352713, \"acRate\": \"35.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"382","questionFrontendId":"382","title":"Linked List Random Node","titleSlug":"linked-list-random-node","translatedTitle":null,"stats":"{\"totalAccepted\": \"222K\", \"totalSubmission\": \"353.8K\", \"totalAcceptedRaw\": 221995, \"totalSubmissionRaw\": 353776, \"acRate\": \"62.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Reservoir Sampling","translatedName":null,"slug":"reservoir-sampling","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"384","questionFrontendId":"384","title":"Shuffle an Array","titleSlug":"shuffle-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"300.3K\", \"totalSubmission\": \"519.3K\", \"totalAcceptedRaw\": 300267, \"totalSubmissionRaw\": 519343, \"acRate\": \"57.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"390","questionFrontendId":"390","title":"Elimination Game","titleSlug":"elimination-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"56.5K\", \"totalSubmission\": \"122.4K\", \"totalAcceptedRaw\": 56540, \"totalSubmissionRaw\": 122445, \"acRate\": \"46.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"396","questionFrontendId":"396","title":"Rotate Function","titleSlug":"rotate-function","translatedTitle":null,"stats":"{\"totalAccepted\": \"72.4K\", \"totalSubmission\": \"176.4K\", \"totalAcceptedRaw\": 72429, \"totalSubmissionRaw\": 176379, \"acRate\": \"41.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"398","questionFrontendId":"398","title":"Random Pick Index","titleSlug":"random-pick-index","translatedTitle":null,"stats":"{\"totalAccepted\": \"187.6K\", \"totalSubmission\": \"300K\", \"totalAcceptedRaw\": 187635, \"totalSubmissionRaw\": 299982, \"acRate\": \"62.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Reservoir Sampling","translatedName":null,"slug":"reservoir-sampling","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"400","questionFrontendId":"400","title":"Nth Digit","titleSlug":"nth-digit","translatedTitle":null,"stats":"{\"totalAccepted\": \"84K\", \"totalSubmission\": \"246.1K\", \"totalAcceptedRaw\": 84000, \"totalSubmissionRaw\": 246106, \"acRate\": \"34.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"405","questionFrontendId":"405","title":"Convert a Number to Hexadecimal","titleSlug":"convert-a-number-to-hexadecimal","translatedTitle":null,"stats":"{\"totalAccepted\": \"117.5K\", \"totalSubmission\": \"251.8K\", \"totalAcceptedRaw\": 117521, \"totalSubmissionRaw\": 251845, \"acRate\": \"46.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"412","questionFrontendId":"412","title":"Fizz Buzz","titleSlug":"fizz-buzz","translatedTitle":null,"stats":"{\"totalAccepted\": \"917.1K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 917146, \"totalSubmissionRaw\": 1313667, \"acRate\": \"69.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"415","questionFrontendId":"415","title":"Add Strings","titleSlug":"add-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"555.8K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 555816, \"totalSubmissionRaw\": 1058823, \"acRate\": \"52.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"423","questionFrontendId":"423","title":"Reconstruct Original Digits from English","titleSlug":"reconstruct-original-digits-from-english","translatedTitle":null,"stats":"{\"totalAccepted\": \"71.5K\", \"totalSubmission\": \"139.4K\", \"totalAcceptedRaw\": 71468, \"totalSubmissionRaw\": 139416, \"acRate\": \"51.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"441","questionFrontendId":"441","title":"Arranging Coins","titleSlug":"arranging-coins","translatedTitle":null,"stats":"{\"totalAccepted\": \"346.2K\", \"totalSubmission\": \"748.9K\", \"totalAcceptedRaw\": 346203, \"totalSubmissionRaw\": 748937, \"acRate\": \"46.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"445","questionFrontendId":"445","title":"Add Two Numbers II","titleSlug":"add-two-numbers-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"361.8K\", \"totalSubmission\": \"606.8K\", \"totalAcceptedRaw\": 361771, \"totalSubmissionRaw\": 606794, \"acRate\": \"59.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"447","questionFrontendId":"447","title":"Number of Boomerangs","titleSlug":"number-of-boomerangs","translatedTitle":null,"stats":"{\"totalAccepted\": \"92.6K\", \"totalSubmission\": \"168.8K\", \"totalAcceptedRaw\": 92629, \"totalSubmissionRaw\": 168788, \"acRate\": \"54.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"453","questionFrontendId":"453","title":"Minimum Moves to Equal Array Elements","titleSlug":"minimum-moves-to-equal-array-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"149.6K\", \"totalSubmission\": \"267.3K\", \"totalAcceptedRaw\": 149604, \"totalSubmissionRaw\": 267338, \"acRate\": \"56.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"458","questionFrontendId":"458","title":"Poor Pigs","titleSlug":"poor-pigs","translatedTitle":null,"stats":"{\"totalAccepted\": \"73.5K\", \"totalSubmission\": \"116.8K\", \"totalAcceptedRaw\": 73529, \"totalSubmissionRaw\": 116801, \"acRate\": \"63.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"462","questionFrontendId":"462","title":"Minimum Moves to Equal Array Elements II","titleSlug":"minimum-moves-to-equal-array-elements-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"159K\", \"totalSubmission\": \"264.7K\", \"totalAcceptedRaw\": 158954, \"totalSubmissionRaw\": 264713, \"acRate\": \"60.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"464","questionFrontendId":"464","title":"Can I Win","titleSlug":"can-i-win","translatedTitle":null,"stats":"{\"totalAccepted\": \"83.6K\", \"totalSubmission\": \"281.8K\", \"totalAcceptedRaw\": 83628, \"totalSubmissionRaw\": 281764, \"acRate\": \"29.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"469","questionFrontendId":"469","title":"Convex Polygon","titleSlug":"convex-polygon","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.1K\", \"totalSubmission\": \"26K\", \"totalAcceptedRaw\": 10068, \"totalSubmissionRaw\": 25966, \"acRate\": \"38.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"477","questionFrontendId":"477","title":"Total Hamming Distance","titleSlug":"total-hamming-distance","translatedTitle":null,"stats":"{\"totalAccepted\": \"96.7K\", \"totalSubmission\": \"185.4K\", \"totalAcceptedRaw\": 96698, \"totalSubmissionRaw\": 185426, \"acRate\": \"52.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"479","questionFrontendId":"479","title":"Largest Palindrome Product","titleSlug":"largest-palindrome-product","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.9K\", \"totalSubmission\": \"68.6K\", \"totalAcceptedRaw\": 21906, \"totalSubmissionRaw\": 68552, \"acRate\": \"32.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"483","questionFrontendId":"483","title":"Smallest Good Base","titleSlug":"smallest-good-base","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.8K\", \"totalSubmission\": \"48.6K\", \"totalAcceptedRaw\": 18770, \"totalSubmissionRaw\": 48555, \"acRate\": \"38.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"486","questionFrontendId":"486","title":"Predict the Winner","titleSlug":"predict-the-winner","translatedTitle":null,"stats":"{\"totalAccepted\": \"135.6K\", \"totalSubmission\": \"265.5K\", \"totalAcceptedRaw\": 135618, \"totalSubmissionRaw\": 265549, \"acRate\": \"51.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"489","questionFrontendId":"1643","title":"Kth Smallest Instructions","titleSlug":"kth-smallest-instructions","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.9K\", \"totalSubmission\": \"21K\", \"totalAcceptedRaw\": 9877, \"totalSubmissionRaw\": 21004, \"acRate\": \"47.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"492","questionFrontendId":"492","title":"Construct the Rectangle","titleSlug":"construct-the-rectangle","translatedTitle":null,"stats":"{\"totalAccepted\": \"94.2K\", \"totalSubmission\": \"172.4K\", \"totalAcceptedRaw\": 94154, \"totalSubmissionRaw\": 172391, \"acRate\": \"54.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"504","questionFrontendId":"504","title":"Base 7","titleSlug":"base-7","translatedTitle":null,"stats":"{\"totalAccepted\": \"103.9K\", \"totalSubmission\": \"214.6K\", \"totalAcceptedRaw\": 103869, \"totalSubmissionRaw\": 214612, \"acRate\": \"48.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"507","questionFrontendId":"507","title":"Perfect Number","titleSlug":"perfect-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"130.2K\", \"totalSubmission\": \"345.7K\", \"totalAcceptedRaw\": 130195, \"totalSubmissionRaw\": 345746, \"acRate\": \"37.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"523","questionFrontendId":"523","title":"Continuous Subarray Sum","titleSlug":"continuous-subarray-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"386.9K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 386950, \"totalSubmissionRaw\": 1357202, \"acRate\": \"28.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"537","questionFrontendId":"537","title":"Complex Number Multiplication","titleSlug":"complex-number-multiplication","translatedTitle":null,"stats":"{\"totalAccepted\": \"87.2K\", \"totalSubmission\": \"122.1K\", \"totalAcceptedRaw\": 87195, \"totalSubmissionRaw\": 122114, \"acRate\": \"71.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"539","questionFrontendId":"539","title":"Minimum Time Difference","titleSlug":"minimum-time-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"121.4K\", \"totalSubmission\": \"215.4K\", \"totalAcceptedRaw\": 121424, \"totalSubmissionRaw\": 215391, \"acRate\": \"56.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"553","questionFrontendId":"553","title":"Optimal Division","titleSlug":"optimal-division","translatedTitle":null,"stats":"{\"totalAccepted\": \"35K\", \"totalSubmission\": \"58.5K\", \"totalAcceptedRaw\": 35046, \"totalSubmissionRaw\": 58541, \"acRate\": \"59.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"556","questionFrontendId":"556","title":"Next Greater Element III","titleSlug":"next-greater-element-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.2K\", \"totalSubmission\": \"365.1K\", \"totalAcceptedRaw\": 124200, \"totalSubmissionRaw\": 365078, \"acRate\": \"34.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"564","questionFrontendId":"564","title":"Find the Closest Palindrome","titleSlug":"find-the-closest-palindrome","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.5K\", \"totalSubmission\": \"171.2K\", \"totalAcceptedRaw\": 37488, \"totalSubmissionRaw\": 171228, \"acRate\": \"21.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"573","questionFrontendId":"573","title":"Squirrel Simulation","titleSlug":"squirrel-simulation","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"32.5K\", \"totalAcceptedRaw\": 17923, \"totalSubmissionRaw\": 32548, \"acRate\": \"55.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"587","questionFrontendId":"587","title":"Erect the Fence","titleSlug":"erect-the-fence","translatedTitle":null,"stats":"{\"totalAccepted\": \"53.6K\", \"totalSubmission\": \"102.6K\", \"totalAcceptedRaw\": 53612, \"totalSubmissionRaw\": 102635, \"acRate\": \"52.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"592","questionFrontendId":"592","title":"Fraction Addition and Subtraction","titleSlug":"fraction-addition-and-subtraction","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.1K\", \"totalSubmission\": \"61.3K\", \"totalAcceptedRaw\": 32098, \"totalSubmissionRaw\": 61306, \"acRate\": \"52.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"593","questionFrontendId":"593","title":"Valid Square","titleSlug":"valid-square","translatedTitle":null,"stats":"{\"totalAccepted\": \"96.5K\", \"totalSubmission\": \"219.4K\", \"totalAcceptedRaw\": 96456, \"totalSubmissionRaw\": 219425, \"acRate\": \"44.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"598","questionFrontendId":"598","title":"Range Addition II","titleSlug":"range-addition-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"87.9K\", \"totalSubmission\": \"159K\", \"totalAcceptedRaw\": 87920, \"totalSubmissionRaw\": 159045, \"acRate\": \"55.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"625","questionFrontendId":"625","title":"Minimum Factorization","titleSlug":"minimum-factorization","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.7K\", \"totalSubmission\": \"31.8K\", \"totalAcceptedRaw\": 10653, \"totalSubmissionRaw\": 31833, \"acRate\": \"33.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"628","questionFrontendId":"628","title":"Maximum Product of Three Numbers","titleSlug":"maximum-product-of-three-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"256.6K\", \"totalSubmission\": \"558.2K\", \"totalAcceptedRaw\": 256570, \"totalSubmissionRaw\": 558162, \"acRate\": \"46.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"633","questionFrontendId":"633","title":"Sum of Square Numbers","titleSlug":"sum-of-square-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"166.6K\", \"totalSubmission\": \"484.1K\", \"totalAcceptedRaw\": 166561, \"totalSubmissionRaw\": 484130, \"acRate\": \"34.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"634","questionFrontendId":"634","title":"Find the Derangement of An Array","titleSlug":"find-the-derangement-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.3K\", \"totalSubmission\": \"24.6K\", \"totalAcceptedRaw\": 10324, \"totalSubmissionRaw\": 24593, \"acRate\": \"42.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"640","questionFrontendId":"640","title":"Solve the Equation","titleSlug":"solve-the-equation","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.5K\", \"totalSubmission\": \"81.9K\", \"totalAcceptedRaw\": 35522, \"totalSubmissionRaw\": 81854, \"acRate\": \"43.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"650","questionFrontendId":"650","title":"2 Keys Keyboard","titleSlug":"2-keys-keyboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.5K\", \"totalSubmission\": \"214.5K\", \"totalAcceptedRaw\": 114525, \"totalSubmissionRaw\": 214527, \"acRate\": \"53.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"651","questionFrontendId":"651","title":"4 Keys Keyboard","titleSlug":"4-keys-keyboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.7K\", \"totalSubmission\": \"43.5K\", \"totalAcceptedRaw\": 23738, \"totalSubmissionRaw\": 43496, \"acRate\": \"54.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"660","questionFrontendId":"660","title":"Remove 9","titleSlug":"remove-9","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.2K\", \"totalSubmission\": \"17.8K\", \"totalAcceptedRaw\": 10196, \"totalSubmissionRaw\": 17809, \"acRate\": \"57.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"667","questionFrontendId":"667","title":"Beautiful Arrangement II","titleSlug":"beautiful-arrangement-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"50.2K\", \"totalSubmission\": \"84K\", \"totalAcceptedRaw\": 50237, \"totalSubmissionRaw\": 83998, \"acRate\": \"59.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"668","questionFrontendId":"668","title":"Kth Smallest Number in Multiplication Table","titleSlug":"kth-smallest-number-in-multiplication-table","translatedTitle":null,"stats":"{\"totalAccepted\": \"55.3K\", \"totalSubmission\": \"107.3K\", \"totalAcceptedRaw\": 55306, \"totalSubmissionRaw\": 107319, \"acRate\": \"51.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"670","questionFrontendId":"670","title":"Maximum Swap","titleSlug":"maximum-swap","translatedTitle":null,"stats":"{\"totalAccepted\": \"192.4K\", \"totalSubmission\": \"401.7K\", \"totalAcceptedRaw\": 192369, \"totalSubmissionRaw\": 401711, \"acRate\": \"47.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"672","questionFrontendId":"672","title":"Bulb Switcher II","titleSlug":"bulb-switcher-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.2K\", \"totalSubmission\": \"37.9K\", \"totalAcceptedRaw\": 19220, \"totalSubmissionRaw\": 37903, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"679","questionFrontendId":"679","title":"24 Game","titleSlug":"24-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.5K\", \"totalSubmission\": \"143.4K\", \"totalAcceptedRaw\": 70519, \"totalSubmissionRaw\": 143429, \"acRate\": \"49.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"728","questionFrontendId":"728","title":"Self Dividing Numbers","titleSlug":"self-dividing-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"201.4K\", \"totalSubmission\": \"258.7K\", \"totalAcceptedRaw\": 201377, \"totalSubmissionRaw\": 258703, \"acRate\": \"77.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"738","questionFrontendId":"738","title":"Monotone Increasing Digits","titleSlug":"monotone-increasing-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.3K\", \"totalSubmission\": \"93.9K\", \"totalAcceptedRaw\": 44329, \"totalSubmissionRaw\": 93868, \"acRate\": \"47.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"751","questionFrontendId":"750","title":"Number Of Corner Rectangles","titleSlug":"number-of-corner-rectangles","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.1K\", \"totalSubmission\": \"54.9K\", \"totalAcceptedRaw\": 37100, \"totalSubmissionRaw\": 54937, \"acRate\": \"67.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"755","questionFrontendId":"754","title":"Reach a Number","titleSlug":"reach-a-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.2K\", \"totalSubmission\": \"105.8K\", \"totalAcceptedRaw\": 45220, \"totalSubmissionRaw\": 105799, \"acRate\": \"42.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"767","questionFrontendId":"762","title":"Prime Number of Set Bits in Binary Representation","titleSlug":"prime-number-of-set-bits-in-binary-representation","translatedTitle":null,"stats":"{\"totalAccepted\": \"80.8K\", \"totalSubmission\": \"118.9K\", \"totalAcceptedRaw\": 80817, \"totalSubmissionRaw\": 118885, \"acRate\": \"68.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"781","questionFrontendId":"770","title":"Basic Calculator IV","titleSlug":"basic-calculator-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"16.4K\", \"totalAcceptedRaw\": 9186, \"totalSubmissionRaw\": 16435, \"acRate\": \"55.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"785","questionFrontendId":"772","title":"Basic Calculator III","titleSlug":"basic-calculator-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"102.3K\", \"totalSubmission\": \"209.6K\", \"totalAcceptedRaw\": 102271, \"totalSubmissionRaw\": 209557, \"acRate\": \"48.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"790","questionFrontendId":"775","title":"Global and Local Inversions","titleSlug":"global-and-local-inversions","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.6K\", \"totalSubmission\": \"146.7K\", \"totalAcceptedRaw\": 63587, \"totalSubmissionRaw\": 146690, \"acRate\": \"43.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"795","questionFrontendId":"779","title":"K-th Symbol in Grammar","titleSlug":"k-th-symbol-in-grammar","translatedTitle":null,"stats":"{\"totalAccepted\": \"111K\", \"totalSubmission\": \"269K\", \"totalAcceptedRaw\": 110976, \"totalSubmissionRaw\": 269039, \"acRate\": \"41.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"796","questionFrontendId":"780","title":"Reaching Points","titleSlug":"reaching-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.9K\", \"totalSubmission\": \"162.1K\", \"totalAcceptedRaw\": 52895, \"totalSubmissionRaw\": 162104, \"acRate\": \"32.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"797","questionFrontendId":"781","title":"Rabbits in Forest","titleSlug":"rabbits-in-forest","translatedTitle":null,"stats":"{\"totalAccepted\": \"45K\", \"totalSubmission\": \"82K\", \"totalAcceptedRaw\": 44962, \"totalSubmissionRaw\": 81989, \"acRate\": \"54.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"798","questionFrontendId":"782","title":"Transform to Chessboard","titleSlug":"transform-to-chessboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.8K\", \"totalSubmission\": \"30.6K\", \"totalAcceptedRaw\": 15836, \"totalSubmissionRaw\": 30625, \"acRate\": \"51.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"804","questionFrontendId":"788","title":"Rotated Digits","titleSlug":"rotated-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"95.2K\", \"totalSubmission\": \"167.8K\", \"totalAcceptedRaw\": 95154, \"totalSubmissionRaw\": 167833, \"acRate\": \"56.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"805","questionFrontendId":"789","title":"Escape The Ghosts","titleSlug":"escape-the-ghosts","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.7K\", \"totalSubmission\": \"40.6K\", \"totalAcceptedRaw\": 24684, \"totalSubmissionRaw\": 40610, \"acRate\": \"60.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"809","questionFrontendId":"793","title":"Preimage Size of Factorial Zeroes Function","titleSlug":"preimage-size-of-factorial-zeroes-function","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.1K\", \"totalSubmission\": \"35K\", \"totalAcceptedRaw\": 15114, \"totalSubmissionRaw\": 34992, \"acRate\": \"43.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"818","questionFrontendId":"800","title":"Similar RGB Color","titleSlug":"similar-rgb-color","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.2K\", \"totalSubmission\": \"24.2K\", \"totalAcceptedRaw\": 16229, \"totalSubmissionRaw\": 24222, \"acRate\": \"67.0%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"823","questionFrontendId":"805","title":"Split Array With Same Average","titleSlug":"split-array-with-same-average","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.9K\", \"totalSubmission\": \"116.5K\", \"totalAcceptedRaw\": 29911, \"totalSubmissionRaw\": 116468, \"acRate\": \"25.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"826","questionFrontendId":"808","title":"Soup Servings","titleSlug":"soup-servings","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.4K\", \"totalSubmission\": \"40.1K\", \"totalAcceptedRaw\": 17420, \"totalSubmissionRaw\": 40123, \"acRate\": \"43.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Probability and Statistics","translatedName":null,"slug":"probability-and-statistics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"828","questionFrontendId":"810","title":"Chalkboard XOR Game","titleSlug":"chalkboard-xor-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"8K\", \"totalSubmission\": \"14.3K\", \"totalAcceptedRaw\": 8021, \"totalSubmissionRaw\": 14260, \"acRate\": \"56.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"830","questionFrontendId":"812","title":"Largest Triangle Area","titleSlug":"largest-triangle-area","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.3K\", \"totalSubmission\": \"67.3K\", \"totalAcceptedRaw\": 40344, \"totalSubmissionRaw\": 67320, \"acRate\": \"59.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"856","questionFrontendId":"829","title":"Consecutive Numbers Sum","titleSlug":"consecutive-numbers-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"77.7K\", \"totalSubmission\": \"186.8K\", \"totalAcceptedRaw\": 77659, \"totalSubmissionRaw\": 186819, \"acRate\": \"41.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"866","questionFrontendId":"836","title":"Rectangle Overlap","titleSlug":"rectangle-overlap","translatedTitle":null,"stats":"{\"totalAccepted\": \"121.7K\", \"totalSubmission\": \"277.6K\", \"totalAcceptedRaw\": 121727, \"totalSubmissionRaw\": 277574, \"acRate\": \"43.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"867","questionFrontendId":"837","title":"New 21 Game","titleSlug":"new-21-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.5K\", \"totalSubmission\": \"95.3K\", \"totalAcceptedRaw\": 34515, \"totalSubmissionRaw\": 95334, \"acRate\": \"36.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Probability and Statistics","translatedName":null,"slug":"probability-and-statistics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"870","questionFrontendId":"840","title":"Magic Squares In Grid","titleSlug":"magic-squares-in-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"35K\", \"totalSubmission\": \"90.6K\", \"totalAcceptedRaw\": 34991, \"totalSubmissionRaw\": 90589, \"acRate\": \"38.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"873","questionFrontendId":"843","title":"Guess the Word","titleSlug":"guess-the-word","translatedTitle":null,"stats":"{\"totalAccepted\": \"130.1K\", \"totalSubmission\": \"314.2K\", \"totalAcceptedRaw\": 130129, \"totalSubmissionRaw\": 314220, \"acRate\": \"41.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"888","questionFrontendId":"858","title":"Mirror Reflection","titleSlug":"mirror-reflection","translatedTitle":null,"stats":"{\"totalAccepted\": \"75.6K\", \"totalSubmission\": \"119.7K\", \"totalAcceptedRaw\": 75569, \"totalSubmissionRaw\": 119689, \"acRate\": \"63.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"894","questionFrontendId":"710","title":"Random Pick with Blacklist","titleSlug":"random-pick-with-blacklist","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.8K\", \"totalSubmission\": \"106.6K\", \"totalAcceptedRaw\": 35755, \"totalSubmissionRaw\": 106616, \"acRate\": \"33.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"897","questionFrontendId":"866","title":"Prime Palindrome","titleSlug":"prime-palindrome","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.1K\", \"totalSubmission\": \"109K\", \"totalAcceptedRaw\": 28058, \"totalSubmissionRaw\": 108971, \"acRate\": \"25.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"900","questionFrontendId":"869","title":"Reordered Power of 2","titleSlug":"reordered-power-of-2","translatedTitle":null,"stats":"{\"totalAccepted\": \"106.5K\", \"totalSubmission\": \"167.5K\", \"totalAcceptedRaw\": 106544, \"totalSubmissionRaw\": 167538, \"acRate\": \"63.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"903","questionFrontendId":"470","title":"Implement Rand10() Using Rand7()","titleSlug":"implement-rand10-using-rand7","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.6K\", \"totalSubmission\": \"151.9K\", \"totalAcceptedRaw\": 70565, \"totalSubmissionRaw\": 151943, \"acRate\": \"46.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Rejection Sampling","translatedName":null,"slug":"rejection-sampling","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"},{"name":"Probability and Statistics","translatedName":null,"slug":"probability-and-statistics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"909","questionFrontendId":"877","title":"Stone Game","titleSlug":"stone-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"182.4K\", \"totalSubmission\": \"261.7K\", \"totalAcceptedRaw\": 182449, \"totalSubmissionRaw\": 261655, \"acRate\": \"69.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"910","questionFrontendId":"878","title":"Nth Magical Number","titleSlug":"nth-magical-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.9K\", \"totalSubmission\": \"93K\", \"totalAcceptedRaw\": 32859, \"totalSubmissionRaw\": 92992, \"acRate\": \"35.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"912","questionFrontendId":"528","title":"Random Pick with Weight","titleSlug":"random-pick-with-weight","translatedTitle":null,"stats":"{\"totalAccepted\": \"357K\", \"totalSubmission\": \"774.6K\", \"totalAcceptedRaw\": 356999, \"totalSubmissionRaw\": 774559, \"acRate\": \"46.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"913","questionFrontendId":"519","title":"Random Flip Matrix","titleSlug":"random-flip-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.1K\", \"totalSubmission\": \"40.1K\", \"totalAcceptedRaw\": 16058, \"totalSubmissionRaw\": 40131, \"acRate\": \"40.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Reservoir Sampling","translatedName":null,"slug":"reservoir-sampling","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"914","questionFrontendId":"497","title":"Random Point in Non-overlapping Rectangles","titleSlug":"random-point-in-non-overlapping-rectangles","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.7K\", \"totalSubmission\": \"93.2K\", \"totalAcceptedRaw\": 36679, \"totalSubmissionRaw\": 93194, \"acRate\": \"39.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Reservoir Sampling","translatedName":null,"slug":"reservoir-sampling","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"915","questionFrontendId":"478","title":"Generate Random Point in a Circle","titleSlug":"generate-random-point-in-a-circle","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.8K\", \"totalSubmission\": \"92.9K\", \"totalAcceptedRaw\": 36762, \"totalSubmissionRaw\": 92869, \"acRate\": \"39.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Rejection Sampling","translatedName":null,"slug":"rejection-sampling","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"919","questionFrontendId":"883","title":"Projection Area of 3D Shapes","titleSlug":"projection-area-of-3d-shapes","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.8K\", \"totalSubmission\": \"65.7K\", \"totalAcceptedRaw\": 46774, \"totalSubmissionRaw\": 65738, \"acRate\": \"71.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"923","questionFrontendId":"887","title":"Super Egg Drop","titleSlug":"super-egg-drop","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.6K\", \"totalSubmission\": \"215.3K\", \"totalAcceptedRaw\": 58572, \"totalSubmissionRaw\": 215331, \"acRate\": \"27.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"927","questionFrontendId":"891","title":"Sum of Subsequence Widths","titleSlug":"sum-of-subsequence-widths","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.3K\", \"totalSubmission\": \"50.1K\", \"totalAcceptedRaw\": 18328, \"totalSubmissionRaw\": 50080, \"acRate\": \"36.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"928","questionFrontendId":"892","title":"Surface Area of 3D Shapes","titleSlug":"surface-area-of-3d-shapes","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.6K\", \"totalSubmission\": \"52.5K\", \"totalAcceptedRaw\": 33586, \"totalSubmissionRaw\": 52489, \"acRate\": \"64.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"935","questionFrontendId":"899","title":"Orderly Queue","titleSlug":"orderly-queue","translatedTitle":null,"stats":"{\"totalAccepted\": \"64.3K\", \"totalSubmission\": \"96.9K\", \"totalAcceptedRaw\": 64299, \"totalSubmissionRaw\": 96906, \"acRate\": \"66.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"938","questionFrontendId":"902","title":"Numbers At Most N Given Digit Set","titleSlug":"numbers-at-most-n-given-digit-set","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.6K\", \"totalSubmission\": \"95.6K\", \"totalAcceptedRaw\": 39603, \"totalSubmissionRaw\": 95582, \"acRate\": \"41.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"942","questionFrontendId":"906","title":"Super Palindromes","titleSlug":"super-palindromes","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.5K\", \"totalSubmission\": \"57.8K\", \"totalAcceptedRaw\": 22458, \"totalSubmissionRaw\": 57803, \"acRate\": \"38.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"944","questionFrontendId":"908","title":"Smallest Range I","titleSlug":"smallest-range-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.9K\", \"totalSubmission\": \"104K\", \"totalAcceptedRaw\": 70921, \"totalSubmissionRaw\": 103956, \"acRate\": \"68.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"946","questionFrontendId":"910","title":"Smallest Range II","titleSlug":"smallest-range-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.8K\", \"totalSubmission\": \"130.5K\", \"totalAcceptedRaw\": 45848, \"totalSubmissionRaw\": 130519, \"acRate\": \"35.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"949","questionFrontendId":"913","title":"Cat and Mouse","titleSlug":"cat-and-mouse","translatedTitle":null,"stats":"{\"totalAccepted\": \"17K\", \"totalSubmission\": \"48.6K\", \"totalAcceptedRaw\": 16977, \"totalSubmissionRaw\": 48648, \"acRate\": \"34.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"950","questionFrontendId":"914","title":"X of a Kind in a Deck of Cards","titleSlug":"x-of-a-kind-in-a-deck-of-cards","translatedTitle":null,"stats":"{\"totalAccepted\": \"102.7K\", \"totalSubmission\": \"328.4K\", \"totalAcceptedRaw\": 102721, \"totalSubmissionRaw\": 328393, \"acRate\": \"31.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"956","questionFrontendId":"920","title":"Number of Music Playlists","titleSlug":"number-of-music-playlists","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"44K\", \"totalAcceptedRaw\": 22329, \"totalSubmissionRaw\": 43972, \"acRate\": \"50.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"963","questionFrontendId":"927","title":"Three Equal Parts","titleSlug":"three-equal-parts","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.7K\", \"totalSubmission\": \"70.1K\", \"totalAcceptedRaw\": 27737, \"totalSubmissionRaw\": 70135, \"acRate\": \"39.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"968","questionFrontendId":"932","title":"Beautiful Array","titleSlug":"beautiful-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.4K\", \"totalSubmission\": \"60.4K\", \"totalAcceptedRaw\": 39377, \"totalSubmissionRaw\": 60405, \"acRate\": \"65.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"976","questionFrontendId":"939","title":"Minimum Area Rectangle","titleSlug":"minimum-area-rectangle","translatedTitle":null,"stats":"{\"totalAccepted\": \"121.1K\", \"totalSubmission\": \"228.9K\", \"totalAcceptedRaw\": 121134, \"totalSubmissionRaw\": 228875, \"acRate\": \"52.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"989","questionFrontendId":"952","title":"Largest Component Size by Common Factor","titleSlug":"largest-component-size-by-common-factor","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.4K\", \"totalSubmission\": \"120.7K\", \"totalAcceptedRaw\": 48439, \"totalSubmissionRaw\": 120726, \"acRate\": \"40.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"994","questionFrontendId":"957","title":"Prison Cells After N Days","titleSlug":"prison-cells-after-n-days","translatedTitle":null,"stats":"{\"totalAccepted\": \"151.5K\", \"totalSubmission\": \"387.8K\", \"totalAcceptedRaw\": 151477, \"totalSubmissionRaw\": 387757, \"acRate\": \"39.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1003","questionFrontendId":"963","title":"Minimum Area Rectangle II","titleSlug":"minimum-area-rectangle-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"25K\", \"totalSubmission\": \"45.8K\", \"totalAcceptedRaw\": 25031, \"totalSubmissionRaw\": 45758, \"acRate\": \"54.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1004","questionFrontendId":"964","title":"Least Operators to Express Number","titleSlug":"least-operators-to-express-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.8K\", \"totalSubmission\": \"18.3K\", \"totalAcceptedRaw\": 8780, \"totalSubmissionRaw\": 18315, \"acRate\": \"47.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1010","questionFrontendId":"970","title":"Powerful Integers","titleSlug":"powerful-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"49.9K\", \"totalSubmission\": \"114.5K\", \"totalAcceptedRaw\": 49916, \"totalSubmissionRaw\": 114454, \"acRate\": \"43.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1012","questionFrontendId":"972","title":"Equal Rational Numbers","titleSlug":"equal-rational-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"14.1K\", \"totalAcceptedRaw\": 6140, \"totalSubmissionRaw\": 14149, \"acRate\": \"43.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1013","questionFrontendId":"509","title":"Fibonacci Number","titleSlug":"fibonacci-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 1269156, \"totalSubmissionRaw\": 1819531, \"acRate\": \"69.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1014","questionFrontendId":"973","title":"K Closest Points to Origin","titleSlug":"k-closest-points-to-origin","translatedTitle":null,"stats":"{\"totalAccepted\": \"955.7K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 955670, \"totalSubmissionRaw\": 1453778, \"acRate\": \"65.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Quickselect","translatedName":null,"slug":"quickselect","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1018","questionFrontendId":"976","title":"Largest Perimeter Triangle","titleSlug":"largest-perimeter-triangle","translatedTitle":null,"stats":"{\"totalAccepted\": \"198.2K\", \"totalSubmission\": \"362.7K\", \"totalAcceptedRaw\": 198155, \"totalSubmissionRaw\": 362737, \"acRate\": \"54.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1031","questionFrontendId":"989","title":"Add to Array-Form of Integer","titleSlug":"add-to-array-form-of-integer","translatedTitle":null,"stats":"{\"totalAccepted\": \"220.8K\", \"totalSubmission\": \"468.7K\", \"totalAcceptedRaw\": 220842, \"totalSubmissionRaw\": 468742, \"acRate\": \"47.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1033","questionFrontendId":"991","title":"Broken Calculator","titleSlug":"broken-calculator","translatedTitle":null,"stats":"{\"totalAccepted\": \"92.9K\", \"totalSubmission\": \"171.8K\", \"totalAcceptedRaw\": 92914, \"totalSubmissionRaw\": 171762, \"acRate\": \"54.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1038","questionFrontendId":"996","title":"Number of Squareful Arrays","titleSlug":"number-of-squareful-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.6K\", \"totalSubmission\": \"62.2K\", \"totalAcceptedRaw\": 30618, \"totalSubmissionRaw\": 62202, \"acRate\": \"49.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1048","questionFrontendId":"1006","title":"Clumsy Factorial","titleSlug":"clumsy-factorial","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.3K\", \"totalSubmission\": \"43.8K\", \"totalAcceptedRaw\": 24273, \"totalSubmissionRaw\": 43817, \"acRate\": \"55.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1053","questionFrontendId":"1058","title":"Minimize Rounding Error to Meet Target","titleSlug":"minimize-rounding-error-to-meet-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.4K\", \"totalSubmission\": \"18.7K\", \"totalAcceptedRaw\": 8379, \"totalSubmissionRaw\": 18653, \"acRate\": \"44.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1057","questionFrontendId":"1012","title":"Numbers With Repeated Digits","titleSlug":"numbers-with-repeated-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.9K\", \"totalSubmission\": \"29.8K\", \"totalAcceptedRaw\": 11882, \"totalSubmissionRaw\": 29829, \"acRate\": \"39.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1064","questionFrontendId":"1015","title":"Smallest Integer Divisible by K","titleSlug":"smallest-integer-divisible-by-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.7K\", \"totalSubmission\": \"125.2K\", \"totalAcceptedRaw\": 58667, \"totalSubmissionRaw\": 125245, \"acRate\": \"46.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1068","questionFrontendId":"1067","title":"Digit Count in Range","titleSlug":"digit-count-in-range","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.4K\", \"totalSubmission\": \"7.5K\", \"totalAcceptedRaw\": 3398, \"totalSubmissionRaw\": 7533, \"acRate\": \"45.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1069","questionFrontendId":"1056","title":"Confusing Number","titleSlug":"confusing-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.7K\", \"totalSubmission\": \"74.1K\", \"totalAcceptedRaw\": 35732, \"totalSubmissionRaw\": 74064, \"acRate\": \"48.2%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1070","questionFrontendId":"1017","title":"Convert to Base -2","titleSlug":"convert-to-base-2","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.4K\", \"totalSubmission\": \"36.8K\", \"totalAcceptedRaw\": 22362, \"totalSubmissionRaw\": 36765, \"acRate\": \"60.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1077","questionFrontendId":"1088","title":"Confusing Number II","titleSlug":"confusing-number-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.5K\", \"totalSubmission\": \"75.2K\", \"totalAcceptedRaw\": 35546, \"totalSubmissionRaw\": 75226, \"acRate\": \"47.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1082","questionFrontendId":"1085","title":"Sum of Digits in the Minimum Number","titleSlug":"sum-of-digits-in-the-minimum-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.2K\", \"totalSubmission\": \"29.1K\", \"totalAcceptedRaw\": 22183, \"totalSubmissionRaw\": 29072, \"acRate\": \"76.3%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1086","questionFrontendId":"1025","title":"Divisor Game","titleSlug":"divisor-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"196.3K\", \"totalSubmission\": \"290.6K\", \"totalAcceptedRaw\": 196288, \"totalSubmissionRaw\": 290607, \"acRate\": \"67.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1088","questionFrontendId":"1118","title":"Number of Days in a Month","titleSlug":"number-of-days-in-a-month","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.4K\", \"totalSubmission\": \"12.9K\", \"totalAcceptedRaw\": 7392, \"totalSubmissionRaw\": 12947, \"acRate\": \"57.1%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1090","questionFrontendId":"1134","title":"Armstrong Number","titleSlug":"armstrong-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.7K\", \"totalSubmission\": \"40.8K\", \"totalAcceptedRaw\": 31711, \"totalSubmissionRaw\": 40769, \"acRate\": \"77.8%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1094","questionFrontendId":"1030","title":"Matrix Cells in Distance Order","titleSlug":"matrix-cells-in-distance-order","translatedTitle":null,"stats":"{\"totalAccepted\": \"49.2K\", \"totalSubmission\": \"70.7K\", \"totalAcceptedRaw\": 49221, \"totalSubmissionRaw\": 70684, \"acRate\": \"69.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1103","questionFrontendId":"1033","title":"Moving Stones Until Consecutive","titleSlug":"moving-stones-until-consecutive","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.8K\", \"totalSubmission\": \"47.1K\", \"totalAcceptedRaw\": 21797, \"totalSubmissionRaw\": 47144, \"acRate\": \"46.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1113","questionFrontendId":"1040","title":"Moving Stones Until Consecutive II","titleSlug":"moving-stones-until-consecutive-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"15.4K\", \"totalAcceptedRaw\": 8595, \"totalSubmissionRaw\": 15395, \"acRate\": \"55.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1115","questionFrontendId":"1037","title":"Valid Boomerang","titleSlug":"valid-boomerang","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.4K\", \"totalSubmission\": \"108.9K\", \"totalAcceptedRaw\": 40373, \"totalSubmissionRaw\": 108903, \"acRate\": \"37.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1119","questionFrontendId":"1041","title":"Robot Bounded In Circle","titleSlug":"robot-bounded-in-circle","translatedTitle":null,"stats":"{\"totalAccepted\": \"208K\", \"totalSubmission\": \"376.2K\", \"totalAcceptedRaw\": 208025, \"totalSubmissionRaw\": 376207, \"acRate\": \"55.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1131","questionFrontendId":"1180","title":"Count Substrings with Only One Distinct Letter","titleSlug":"count-substrings-with-only-one-distinct-letter","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.5K\", \"totalSubmission\": \"29.8K\", \"totalAcceptedRaw\": 23548, \"totalSubmissionRaw\": 29793, \"acRate\": \"79.0%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1146","questionFrontendId":"1071","title":"Greatest Common Divisor of Strings","titleSlug":"greatest-common-divisor-of-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"161.3K\", \"totalSubmission\": \"284.9K\", \"totalAcceptedRaw\": 161350, \"totalSubmissionRaw\": 284899, \"acRate\": \"56.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1148","questionFrontendId":"1073","title":"Adding Two Negabinary Numbers","titleSlug":"adding-two-negabinary-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.1K\", \"totalSubmission\": \"41.3K\", \"totalAcceptedRaw\": 15060, \"totalSubmissionRaw\": 41327, \"acRate\": \"36.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1164","questionFrontendId":"1228","title":"Missing Number In Arithmetic Progression","titleSlug":"missing-number-in-arithmetic-progression","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.4K\", \"totalSubmission\": \"45.4K\", \"totalAcceptedRaw\": 23366, \"totalSubmissionRaw\": 45416, \"acRate\": \"51.4%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1166","questionFrontendId":"1230","title":"Toss Strange Coins","titleSlug":"toss-strange-coins","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"23.3K\", \"totalAcceptedRaw\": 12553, \"totalSubmissionRaw\": 23270, \"acRate\": \"53.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Probability and Statistics","translatedName":null,"slug":"probability-and-statistics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1167","questionFrontendId":"1199","title":"Minimum Time to Build Blocks","titleSlug":"minimum-time-to-build-blocks","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.7K\", \"totalSubmission\": \"9.1K\", \"totalAcceptedRaw\": 3732, \"totalSubmissionRaw\": 9141, \"acRate\": \"40.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1183","questionFrontendId":"1093","title":"Statistics from a Large Sample","titleSlug":"statistics-from-a-large-sample","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.8K\", \"totalSubmission\": \"36.2K\", \"totalAcceptedRaw\": 15804, \"totalSubmissionRaw\": 36227, \"acRate\": \"43.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Probability and Statistics","translatedName":null,"slug":"probability-and-statistics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1189","questionFrontendId":"1256","title":"Encode Number","titleSlug":"encode-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"7K\", \"totalSubmission\": \"10.1K\", \"totalAcceptedRaw\": 7038, \"totalSubmissionRaw\": 10071, \"acRate\": \"69.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1194","questionFrontendId":"1104","title":"Path In Zigzag Labelled Binary Tree","titleSlug":"path-in-zigzag-labelled-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.9K\", \"totalSubmission\": \"51.9K\", \"totalAcceptedRaw\": 38925, \"totalSubmissionRaw\": 51865, \"acRate\": \"75.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1195","questionFrontendId":"1103","title":"Distribute Candies to People","titleSlug":"distribute-candies-to-people","translatedTitle":null,"stats":"{\"totalAccepted\": \"75.1K\", \"totalSubmission\": \"116.9K\", \"totalAcceptedRaw\": 75068, \"totalSubmissionRaw\": 116887, \"acRate\": \"64.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1199","questionFrontendId":"1271","title":"Hexspeak","titleSlug":"hexspeak","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.3K\", \"totalSubmission\": \"16.2K\", \"totalAcceptedRaw\": 9274, \"totalSubmissionRaw\": 16228, \"acRate\": \"57.1%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1213","questionFrontendId":"1259","title":"Handshakes That Don't Cross","titleSlug":"handshakes-that-dont-cross","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"15.2K\", \"totalAcceptedRaw\": 9150, \"totalSubmissionRaw\": 15158, \"acRate\": \"60.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1223","questionFrontendId":"1627","title":"Graph Connectivity With Threshold","titleSlug":"graph-connectivity-with-threshold","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"29.9K\", \"totalAcceptedRaw\": 13817, \"totalSubmissionRaw\": 29882, \"acRate\": \"46.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1230","questionFrontendId":"1131","title":"Maximum of Absolute Value Expression","titleSlug":"maximum-of-absolute-value-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.3K\", \"totalSubmission\": \"39.4K\", \"totalAcceptedRaw\": 19346, \"totalSubmissionRaw\": 39389, \"acRate\": \"49.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1236","questionFrontendId":"1137","title":"N-th Tribonacci Number","titleSlug":"n-th-tribonacci-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"466.7K\", \"totalSubmission\": \"731.8K\", \"totalAcceptedRaw\": 466651, \"totalSubmissionRaw\": 731750, \"acRate\": \"63.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1240","questionFrontendId":"1140","title":"Stone Game II","titleSlug":"stone-game-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.7K\", \"totalSubmission\": \"70.6K\", \"totalAcceptedRaw\": 45742, \"totalSubmissionRaw\": 70636, \"acRate\": \"64.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1255","questionFrontendId":"1330","title":"Reverse Subarray To Maximize Array Value","titleSlug":"reverse-subarray-to-maximize-array-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"11.5K\", \"totalAcceptedRaw\": 4613, \"totalSubmissionRaw\": 11469, \"acRate\": \"40.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1260","questionFrontendId":"1154","title":"Day of the Year","titleSlug":"day-of-the-year","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.6K\", \"totalSubmission\": \"85.8K\", \"totalAcceptedRaw\": 42590, \"totalSubmissionRaw\": 85818, \"acRate\": \"49.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1274","questionFrontendId":"1360","title":"Number of Days Between Two Dates","titleSlug":"number-of-days-between-two-dates","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.9K\", \"totalSubmission\": \"80.9K\", \"totalAcceptedRaw\": 38880, \"totalSubmissionRaw\": 80860, \"acRate\": \"48.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1276","questionFrontendId":"1362","title":"Closest Divisors","titleSlug":"closest-divisors","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.5K\", \"totalSubmission\": \"30.9K\", \"totalAcceptedRaw\": 18514, \"totalSubmissionRaw\": 30941, \"acRate\": \"59.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1279","questionFrontendId":"1175","title":"Prime Arrangements","titleSlug":"prime-arrangements","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.8K\", \"totalSubmission\": \"45.5K\", \"totalAcceptedRaw\": 24799, \"totalSubmissionRaw\": 45484, \"acRate\": \"54.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1284","questionFrontendId":"1390","title":"Four Divisors","titleSlug":"four-divisors","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.2K\", \"totalSubmission\": \"61.2K\", \"totalAcceptedRaw\": 25197, \"totalSubmissionRaw\": 61220, \"acRate\": \"41.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1289","questionFrontendId":"1185","title":"Day of the Week","titleSlug":"day-of-the-week","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.3K\", \"totalSubmission\": \"91.1K\", \"totalAcceptedRaw\": 52340, \"totalSubmissionRaw\": 91085, \"acRate\": \"57.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1295","questionFrontendId":"1954","title":"Minimum Garden Perimeter to Collect Enough Apples","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.6K\", \"totalSubmission\": \"25.4K\", \"totalAcceptedRaw\": 13559, \"totalSubmissionRaw\": 25427, \"acRate\": \"53.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1303","questionFrontendId":"2139","title":"Minimum Moves to Reach Target Score","titleSlug":"minimum-moves-to-reach-target-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.9K\", \"totalSubmission\": \"65.4K\", \"totalAcceptedRaw\": 31923, \"totalSubmissionRaw\": 65417, \"acRate\": \"48.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1307","questionFrontendId":"1201","title":"Ugly Number III","titleSlug":"ugly-number-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.1K\", \"totalSubmission\": \"90.7K\", \"totalAcceptedRaw\": 26098, \"totalSubmissionRaw\": 90713, \"acRate\": \"28.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1313","questionFrontendId":"1916","title":"Count Ways to Build Rooms in an Ant Colony","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"10.8K\", \"totalAcceptedRaw\": 5323, \"totalSubmissionRaw\": 10780, \"acRate\": \"49.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1326","questionFrontendId":"1862","title":"Sum of Floored Pairs","titleSlug":"sum-of-floored-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.4K\", \"totalSubmission\": \"26.3K\", \"totalAcceptedRaw\": 7374, \"totalSubmissionRaw\": 26264, \"acRate\": \"28.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1329","questionFrontendId":"1217","title":"Minimum Cost to Move Chips to The Same Position","titleSlug":"minimum-cost-to-move-chips-to-the-same-position","translatedTitle":null,"stats":"{\"totalAccepted\": \"110.7K\", \"totalSubmission\": \"153.9K\", \"totalAcceptedRaw\": 110677, \"totalSubmissionRaw\": 153906, \"acRate\": \"71.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1334","questionFrontendId":"2310","title":"Sum of Numbers With Units Digit K","titleSlug":"sum-of-numbers-with-units-digit-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.3K\", \"totalSubmission\": \"82.6K\", \"totalAcceptedRaw\": 21273, \"totalSubmissionRaw\": 82598, \"acRate\": \"25.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1345","questionFrontendId":"1427","title":"Perform String Shifts","titleSlug":"perform-string-shifts","translatedTitle":null,"stats":"{\"totalAccepted\": \"73.4K\", \"totalSubmission\": \"135.1K\", \"totalAcceptedRaw\": 73379, \"totalSubmissionRaw\": 135140, \"acRate\": \"54.3%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1349","questionFrontendId":"1232","title":"Check If It Is a Straight Line","titleSlug":"check-if-it-is-a-straight-line","translatedTitle":null,"stats":"{\"totalAccepted\": \"145.8K\", \"totalSubmission\": \"360.9K\", \"totalAcceptedRaw\": 145832, \"totalSubmissionRaw\": 360927, \"acRate\": \"40.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1358","questionFrontendId":"1237","title":"Find Positive Integer Solution for a Given Equation","titleSlug":"find-positive-integer-solution-for-a-given-equation","translatedTitle":null,"stats":"{\"totalAccepted\": \"57.2K\", \"totalSubmission\": \"82.6K\", \"totalAcceptedRaw\": 57219, \"totalSubmissionRaw\": 82634, \"acRate\": \"69.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1359","questionFrontendId":"1238","title":"Circular Permutation in Binary Representation","titleSlug":"circular-permutation-in-binary-representation","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.6K\", \"totalSubmission\": \"21.2K\", \"totalAcceptedRaw\": 14582, \"totalSubmissionRaw\": 21201, \"acRate\": \"68.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1362","questionFrontendId":"1227","title":"Airplane Seat Assignment Probability","titleSlug":"airplane-seat-assignment-probability","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.5K\", \"totalSubmission\": \"49.5K\", \"totalAcceptedRaw\": 32505, \"totalSubmissionRaw\": 49546, \"acRate\": \"65.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"},{"name":"Probability and Statistics","translatedName":null,"slug":"probability-and-statistics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1369","questionFrontendId":"1247","title":"Minimum Swaps to Make Strings Equal","titleSlug":"minimum-swaps-to-make-strings-equal","translatedTitle":null,"stats":"{\"totalAccepted\": \"33K\", \"totalSubmission\": \"51.6K\", \"totalAcceptedRaw\": 33020, \"totalSubmissionRaw\": 51556, \"acRate\": \"64.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1370","questionFrontendId":"1248","title":"Count Number of Nice Subarrays","titleSlug":"count-number-of-nice-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.1K\", \"totalSubmission\": \"128.4K\", \"totalAcceptedRaw\": 78097, \"totalSubmissionRaw\": 128353, \"acRate\": \"60.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1372","questionFrontendId":"1250","title":"Check If It Is a Good Array","titleSlug":"check-if-it-is-a-good-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.3K\", \"totalSubmission\": \"29.4K\", \"totalAcceptedRaw\": 17318, \"totalSubmissionRaw\": 29392, \"acRate\": \"58.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1375","questionFrontendId":"2217","title":"Find Palindrome With Fixed Length","titleSlug":"find-palindrome-with-fixed-length","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"41.8K\", \"totalAcceptedRaw\": 14220, \"totalSubmissionRaw\": 41775, \"acRate\": \"34.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1378","questionFrontendId":"1252","title":"Cells with Odd Values in a Matrix","titleSlug":"cells-with-odd-values-in-a-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"92.9K\", \"totalSubmission\": \"118.3K\", \"totalAcceptedRaw\": 92883, \"totalSubmissionRaw\": 118278, \"acRate\": \"78.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1383","questionFrontendId":"2198","title":"Number of Single Divisor Triplets","titleSlug":"number-of-single-divisor-triplets","translatedTitle":null,"stats":"{\"totalAccepted\": \"786\", \"totalSubmission\": \"1.4K\", \"totalAcceptedRaw\": 786, \"totalSubmissionRaw\": 1403, \"acRate\": \"56.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1385","questionFrontendId":"2189","title":"Number of Ways to Build House of Cards","titleSlug":"number-of-ways-to-build-house-of-cards","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5K\", \"totalSubmission\": \"2.3K\", \"totalAcceptedRaw\": 1469, \"totalSubmissionRaw\": 2344, \"acRate\": \"62.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1395","questionFrontendId":"1266","title":"Minimum Time Visiting All Points","titleSlug":"minimum-time-visiting-all-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"132.9K\", \"totalSubmission\": \"168K\", \"totalAcceptedRaw\": 132857, \"totalSubmissionRaw\": 168011, \"acRate\": \"79.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1401","questionFrontendId":"1276","title":"Number of Burgers with No Waste of Ingredients","titleSlug":"number-of-burgers-with-no-waste-of-ingredients","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.3K\", \"totalSubmission\": \"42K\", \"totalAcceptedRaw\": 21294, \"totalSubmissionRaw\": 41986, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1406","questionFrontendId":"1281","title":"Subtract the Product and Sum of Digits of an Integer","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer","translatedTitle":null,"stats":"{\"totalAccepted\": \"364.6K\", \"totalSubmission\": \"420.7K\", \"totalAcceptedRaw\": 364638, \"totalSubmissionRaw\": 420719, \"acRate\": \"86.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1411","questionFrontendId":"1290","title":"Convert Binary Number in a Linked List to Integer","titleSlug":"convert-binary-number-in-a-linked-list-to-integer","translatedTitle":null,"stats":"{\"totalAccepted\": \"370.7K\", \"totalSubmission\": \"451K\", \"totalAcceptedRaw\": 370696, \"totalSubmissionRaw\": 450965, \"acRate\": \"82.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1426","questionFrontendId":"1304","title":"Find N Unique Integers Sum up to Zero","titleSlug":"find-n-unique-integers-sum-up-to-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"180.3K\", \"totalSubmission\": \"234.3K\", \"totalAcceptedRaw\": 180325, \"totalSubmissionRaw\": 234311, \"acRate\": \"77.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1429","questionFrontendId":"1307","title":"Verbal Arithmetic Puzzle","titleSlug":"verbal-arithmetic-puzzle","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"31.1K\", \"totalAcceptedRaw\": 10646, \"totalSubmissionRaw\": 31144, \"acRate\": \"34.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1430","questionFrontendId":"2269","title":"Find the K-Beauty of a Number","titleSlug":"find-the-k-beauty-of-a-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.6K\", \"totalSubmission\": \"59.9K\", \"totalAcceptedRaw\": 34563, \"totalSubmissionRaw\": 59925, \"acRate\": \"57.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1440","questionFrontendId":"1317","title":"Convert Integer to the Sum of Two No-Zero Integers","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.7K\", \"totalSubmission\": \"66.1K\", \"totalAcceptedRaw\": 36675, \"totalSubmissionRaw\": 66097, \"acRate\": \"55.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1444","questionFrontendId":"1342","title":"Number of Steps to Reduce a Number to Zero","titleSlug":"number-of-steps-to-reduce-a-number-to-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"482.6K\", \"totalSubmission\": \"566.6K\", \"totalAcceptedRaw\": 482627, \"totalSubmissionRaw\": 566634, \"acRate\": \"85.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1446","questionFrontendId":"1344","title":"Angle Between Hands of a Clock","titleSlug":"angle-between-hands-of-a-clock","translatedTitle":null,"stats":"{\"totalAccepted\": \"104.6K\", \"totalSubmission\": \"165.3K\", \"totalAcceptedRaw\": 104594, \"totalSubmissionRaw\": 165299, \"acRate\": \"63.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1448","questionFrontendId":"1323","title":"Maximum 69 Number","titleSlug":"maximum-69-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"211K\", \"totalSubmission\": \"257K\", \"totalAcceptedRaw\": 211022, \"totalSubmissionRaw\": 257013, \"acRate\": \"82.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1461","questionFrontendId":"1359","title":"Count All Valid Pickup and Delivery Options","titleSlug":"count-all-valid-pickup-and-delivery-options","translatedTitle":null,"stats":"{\"totalAccepted\": \"58K\", \"totalSubmission\": \"92.5K\", \"totalAcceptedRaw\": 58021, \"totalSubmissionRaw\": 92515, \"acRate\": \"62.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1477","questionFrontendId":"1352","title":"Product of the Last K Numbers","titleSlug":"product-of-the-last-k-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.8K\", \"totalSubmission\": \"135.5K\", \"totalAcceptedRaw\": 67769, \"totalSubmissionRaw\": 135489, \"acRate\": \"50.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1500","questionFrontendId":"1399","title":"Count Largest Group","titleSlug":"count-largest-group","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.2K\", \"totalSubmission\": \"55.5K\", \"totalAcceptedRaw\": 37196, \"totalSubmissionRaw\": 55521, \"acRate\": \"67.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1501","questionFrontendId":"1401","title":"Circle and Rectangle Overlapping","titleSlug":"circle-and-rectangle-overlapping","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.5K\", \"totalSubmission\": \"26.1K\", \"totalAcceptedRaw\": 11510, \"totalSubmissionRaw\": 26093, \"acRate\": \"44.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1515","questionFrontendId":"1414","title":"Find the Minimum Number of Fibonacci Numbers Whose Sum Is K","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.4K\", \"totalSubmission\": \"55.6K\", \"totalAcceptedRaw\": 36398, \"totalSubmissionRaw\": 55617, \"acRate\": \"65.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1522","questionFrontendId":"1406","title":"Stone Game III","titleSlug":"stone-game-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.2K\", \"totalSubmission\": \"70.9K\", \"totalAcceptedRaw\": 42223, \"totalSubmissionRaw\": 70908, \"acRate\": \"59.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1529","questionFrontendId":"1432","title":"Max Difference You Can Get From Changing an Integer","titleSlug":"max-difference-you-can-get-from-changing-an-integer","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.4K\", \"totalSubmission\": \"34K\", \"totalAcceptedRaw\": 14399, \"totalSubmissionRaw\": 34007, \"acRate\": \"42.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1543","questionFrontendId":"1447","title":"Simplified Fractions","titleSlug":"simplified-fractions","translatedTitle":null,"stats":"{\"totalAccepted\": \"26K\", \"totalSubmission\": \"40K\", \"totalAcceptedRaw\": 26042, \"totalSubmissionRaw\": 40001, \"acRate\": \"65.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1553","questionFrontendId":"1442","title":"Count Triplets That Can Form Two Arrays of Equal XOR","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.4K\", \"totalSubmission\": \"41.3K\", \"totalAcceptedRaw\": 31365, \"totalSubmissionRaw\": 41263, \"acRate\": \"76.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1563","questionFrontendId":"1453","title":"Maximum Number of Darts Inside of a Circular Dartboard","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.2K\", \"totalSubmission\": \"14K\", \"totalAcceptedRaw\": 5150, \"totalSubmissionRaw\": 13963, \"acRate\": \"36.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1571","questionFrontendId":"1478","title":"Allocate Mailboxes","titleSlug":"allocate-mailboxes","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"35.8K\", \"totalAcceptedRaw\": 19894, \"totalSubmissionRaw\": 35815, \"acRate\": \"55.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1577","questionFrontendId":"1467","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"7K\", \"totalSubmission\": \"11.6K\", \"totalAcceptedRaw\": 7024, \"totalSubmissionRaw\": 11561, \"acRate\": \"60.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Probability and Statistics","translatedName":null,"slug":"probability-and-statistics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1585","questionFrontendId":"1492","title":"The kth Factor of n","titleSlug":"the-kth-factor-of-n","translatedTitle":null,"stats":"{\"totalAccepted\": \"112.3K\", \"totalSubmission\": \"178.9K\", \"totalAcceptedRaw\": 112258, \"totalSubmissionRaw\": 178889, \"acRate\": \"62.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1610","questionFrontendId":"1486","title":"XOR Operation in an Array","titleSlug":"xor-operation-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"150.9K\", \"totalSubmission\": \"178.3K\", \"totalAcceptedRaw\": 150895, \"totalSubmissionRaw\": 178344, \"acRate\": \"84.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1617","questionFrontendId":"1510","title":"Stone Game IV","titleSlug":"stone-game-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"64.4K\", \"totalSubmission\": \"106.7K\", \"totalAcceptedRaw\": 64411, \"totalSubmissionRaw\": 106676, \"acRate\": \"60.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1630","questionFrontendId":"1523","title":"Count Odd Numbers in an Interval Range","titleSlug":"count-odd-numbers-in-an-interval-range","translatedTitle":null,"stats":"{\"totalAccepted\": \"280.8K\", \"totalSubmission\": \"565.2K\", \"totalAcceptedRaw\": 280836, \"totalSubmissionRaw\": 565191, \"acRate\": \"49.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1631","questionFrontendId":"1524","title":"Number of Sub-arrays With Odd Sum","titleSlug":"number-of-sub-arrays-with-odd-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.5K\", \"totalSubmission\": \"72.8K\", \"totalAcceptedRaw\": 31509, \"totalSubmissionRaw\": 72836, \"acRate\": \"43.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1635","questionFrontendId":"1512","title":"Number of Good Pairs","titleSlug":"number-of-good-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"419.9K\", \"totalSubmission\": \"475.9K\", \"totalAcceptedRaw\": 419858, \"totalSubmissionRaw\": 475854, \"acRate\": \"88.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1636","questionFrontendId":"1513","title":"Number of Substrings With Only 1s","titleSlug":"number-of-substrings-with-only-1s","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.1K\", \"totalSubmission\": \"79.6K\", \"totalAcceptedRaw\": 36148, \"totalSubmissionRaw\": 79597, \"acRate\": \"45.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1638","questionFrontendId":"1515","title":"Best Position for a Service Centre","titleSlug":"best-position-for-a-service-centre","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.9K\", \"totalSubmission\": \"31.9K\", \"totalAcceptedRaw\": 11897, \"totalSubmissionRaw\": 31899, \"acRate\": \"37.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1642","questionFrontendId":"1518","title":"Water Bottles","titleSlug":"water-bottles","translatedTitle":null,"stats":"{\"totalAccepted\": \"61K\", \"totalSubmission\": \"100.8K\", \"totalAcceptedRaw\": 60955, \"totalSubmissionRaw\": 100845, \"acRate\": \"60.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1674","questionFrontendId":"1551","title":"Minimum Operations to Make Array Equal","titleSlug":"minimum-operations-to-make-array-equal","translatedTitle":null,"stats":"{\"totalAccepted\": \"80.4K\", \"totalSubmission\": \"98.7K\", \"totalAcceptedRaw\": 80412, \"totalSubmissionRaw\": 98718, \"acRate\": \"81.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1678","questionFrontendId":"1573","title":"Number of Ways to Split a String","titleSlug":"number-of-ways-to-split-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.6K\", \"totalSubmission\": \"72.8K\", \"totalAcceptedRaw\": 23643, \"totalSubmissionRaw\": 72778, \"acRate\": \"32.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1681","questionFrontendId":"1538","title":"Guess the Majority in a Hidden Array","titleSlug":"guess-the-majority-in-a-hidden-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"2.7K\", \"totalAcceptedRaw\": 1736, \"totalSubmissionRaw\": 2734, \"acRate\": \"63.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1683","questionFrontendId":"1561","title":"Maximum Number of Coins You Can Get","titleSlug":"maximum-number-of-coins-you-can-get","translatedTitle":null,"stats":"{\"totalAccepted\": \"64K\", \"totalSubmission\": \"81K\", \"totalAcceptedRaw\": 64033, \"totalSubmissionRaw\": 80980, \"acRate\": \"79.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1685","questionFrontendId":"1563","title":"Stone Game V","titleSlug":"stone-game-v","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.5K\", \"totalSubmission\": \"38.4K\", \"totalAcceptedRaw\": 15507, \"totalSubmissionRaw\": 38438, \"acRate\": \"40.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1692","questionFrontendId":"1569","title":"Number of Ways to Reorder Array to Get Same BST","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"24.4K\", \"totalAcceptedRaw\": 11685, \"totalSubmissionRaw\": 24422, \"acRate\": \"47.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1693","questionFrontendId":"1588","title":"Sum of All Odd Length Subarrays","titleSlug":"sum-of-all-odd-length-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"150.5K\", \"totalSubmission\": \"180.6K\", \"totalAcceptedRaw\": 150547, \"totalSubmissionRaw\": 180559, \"acRate\": \"83.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1699","questionFrontendId":"1577","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"44.6K\", \"totalAcceptedRaw\": 17874, \"totalSubmissionRaw\": 44569, \"acRate\": \"40.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1725","questionFrontendId":"1621","title":"Number of Sets of K Non-Overlapping Line Segments","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.1K\", \"totalSubmission\": \"19.2K\", \"totalAcceptedRaw\": 8144, \"totalSubmissionRaw\": 19239, \"acRate\": \"42.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1727","questionFrontendId":"1728","title":"Cat and Mouse II","titleSlug":"cat-and-mouse-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"14.3K\", \"totalAcceptedRaw\": 5730, \"totalSubmissionRaw\": 14349, \"acRate\": \"39.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1728","questionFrontendId":"1622","title":"Fancy Sequence","titleSlug":"fancy-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.5K\", \"totalSubmission\": \"58.7K\", \"totalAcceptedRaw\": 9453, \"totalSubmissionRaw\": 58748, \"acRate\": \"16.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1733","questionFrontendId":"1610","title":"Maximum Number of Visible Points","titleSlug":"maximum-number-of-visible-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"36K\", \"totalSubmission\": \"96.4K\", \"totalAcceptedRaw\": 35953, \"totalSubmissionRaw\": 96401, \"acRate\": \"37.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1761","questionFrontendId":"1641","title":"Count Sorted Vowel Strings","titleSlug":"count-sorted-vowel-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"154.2K\", \"totalSubmission\": \"199.3K\", \"totalAcceptedRaw\": 154180, \"totalSubmissionRaw\": 199274, \"acRate\": \"77.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1768","questionFrontendId":"1628","title":"Design an Expression Tree With Evaluate Function","titleSlug":"design-an-expression-tree-with-evaluate-function","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.1K\", \"totalSubmission\": \"29.1K\", \"totalAcceptedRaw\": 24080, \"totalSubmissionRaw\": 29074, \"acRate\": \"82.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1771","questionFrontendId":"1648","title":"Sell Diminishing-Valued Colored Balls","titleSlug":"sell-diminishing-valued-colored-balls","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.5K\", \"totalSubmission\": \"113.5K\", \"totalAcceptedRaw\": 34526, \"totalSubmissionRaw\": 113477, \"acRate\": \"30.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1774","questionFrontendId":"1634","title":"Add Two Polynomials Represented as Linked Lists","titleSlug":"add-two-polynomials-represented-as-linked-lists","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.7K\", \"totalSubmission\": \"16K\", \"totalAcceptedRaw\": 8687, \"totalSubmissionRaw\": 15967, \"acRate\": \"54.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1787","questionFrontendId":"1685","title":"Sum of Absolute Differences in a Sorted Array","titleSlug":"sum-of-absolute-differences-in-a-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.6K\", \"totalSubmission\": \"41.7K\", \"totalAcceptedRaw\": 26573, \"totalSubmissionRaw\": 41680, \"acRate\": \"63.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1788","questionFrontendId":"1686","title":"Stone Game VI","titleSlug":"stone-game-vi","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"25.9K\", \"totalAcceptedRaw\": 14167, \"totalSubmissionRaw\": 25862, \"acRate\": \"54.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1800","questionFrontendId":"1680","title":"Concatenation of Consecutive Binary Numbers","titleSlug":"concatenation-of-consecutive-binary-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"86.8K\", \"totalSubmission\": \"152.3K\", \"totalAcceptedRaw\": 86781, \"totalSubmissionRaw\": 152305, \"acRate\": \"57.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1806","questionFrontendId":"1688","title":"Count of Matches in Tournament","titleSlug":"count-of-matches-in-tournament","translatedTitle":null,"stats":"{\"totalAccepted\": \"94.5K\", \"totalSubmission\": \"113.5K\", \"totalAcceptedRaw\": 94472, \"totalSubmissionRaw\": 113543, \"acRate\": \"83.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1808","questionFrontendId":"1690","title":"Stone Game VII","titleSlug":"stone-game-vii","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.1K\", \"totalSubmission\": \"51.7K\", \"totalAcceptedRaw\": 30081, \"totalSubmissionRaw\": 51720, \"acRate\": \"58.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1817","questionFrontendId":"1716","title":"Calculate Money in Leetcode Bank","titleSlug":"calculate-money-in-leetcode-bank","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.5K\", \"totalSubmission\": \"58.3K\", \"totalAcceptedRaw\": 38527, \"totalSubmissionRaw\": 58293, \"acRate\": \"66.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1836","questionFrontendId":"1735","title":"Count Ways to Make Array With Product","titleSlug":"count-ways-to-make-array-with-product","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"8.9K\", \"totalAcceptedRaw\": 4456, \"totalSubmissionRaw\": 8862, \"acRate\": \"50.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1844","questionFrontendId":"1742","title":"Maximum Number of Balls in a Box","titleSlug":"maximum-number-of-balls-in-a-box","translatedTitle":null,"stats":"{\"totalAccepted\": \"50.3K\", \"totalSubmission\": \"68.2K\", \"totalAcceptedRaw\": 50273, \"totalSubmissionRaw\": 68194, \"acRate\": \"73.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1861","questionFrontendId":"1739","title":"Building Boxes","titleSlug":"building-boxes","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"11.3K\", \"totalAcceptedRaw\": 5858, \"totalSubmissionRaw\": 11264, \"acRate\": \"52.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1875","questionFrontendId":"1766","title":"Tree of Coprimes","titleSlug":"tree-of-coprimes","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.3K\", \"totalSubmission\": \"18.5K\", \"totalAcceptedRaw\": 7275, \"totalSubmissionRaw\": 18502, \"acRate\": \"39.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1879","questionFrontendId":"1753","title":"Maximum Score From Removing Stones","titleSlug":"maximum-score-from-removing-stones","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.3K\", \"totalSubmission\": \"45.5K\", \"totalAcceptedRaw\": 30281, \"totalSubmissionRaw\": 45492, \"acRate\": \"66.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1885","questionFrontendId":"1759","title":"Count Number of Homogenous Substrings","titleSlug":"count-number-of-homogenous-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.4K\", \"totalSubmission\": \"50.4K\", \"totalAcceptedRaw\": 24399, \"totalSubmissionRaw\": 50387, \"acRate\": \"48.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1889","questionFrontendId":"1780","title":"Check if Number is a Sum of Powers of Three","titleSlug":"check-if-number-is-a-sum-of-powers-of-three","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.6K\", \"totalSubmission\": \"48K\", \"totalAcceptedRaw\": 31551, \"totalSubmissionRaw\": 47957, \"acRate\": \"65.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1902","questionFrontendId":"1776","title":"Car Fleet II","titleSlug":"car-fleet-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.6K\", \"totalSubmission\": \"40.3K\", \"totalAcceptedRaw\": 21564, \"totalSubmissionRaw\": 40305, \"acRate\": \"53.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1906","questionFrontendId":"1799","title":"Maximize Score After N Operations","titleSlug":"maximize-score-after-n-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.9K\", \"totalSubmission\": \"34.5K\", \"totalAcceptedRaw\": 15865, \"totalSubmissionRaw\": 34490, \"acRate\": \"46.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1920","questionFrontendId":"1812","title":"Determine Color of a Chessboard Square","titleSlug":"determine-color-of-a-chessboard-square","translatedTitle":null,"stats":"{\"totalAccepted\": \"55.3K\", \"totalSubmission\": \"71.2K\", \"totalAcceptedRaw\": 55297, \"totalSubmissionRaw\": 71188, \"acRate\": \"77.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1925","questionFrontendId":"1814","title":"Count Nice Pairs in an Array","titleSlug":"count-nice-pairs-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.8K\", \"totalSubmission\": \"56.8K\", \"totalAcceptedRaw\": 23836, \"totalSubmissionRaw\": 56790, \"acRate\": \"42.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1935","questionFrontendId":"1806","title":"Minimum Number of Operations to Reinitialize a Permutation","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.7K\", \"totalSubmission\": \"21.9K\", \"totalAcceptedRaw\": 15739, \"totalSubmissionRaw\": 21870, \"acRate\": \"72.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1936","questionFrontendId":"1808","title":"Maximize Number of Nice Divisors","titleSlug":"maximize-number-of-nice-divisors","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.5K\", \"totalSubmission\": \"17.2K\", \"totalAcceptedRaw\": 5460, \"totalSubmissionRaw\": 17223, \"acRate\": \"31.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1939","questionFrontendId":"1828","title":"Queries on Number of Points Inside a Circle","titleSlug":"queries-on-number-of-points-inside-a-circle","translatedTitle":null,"stats":"{\"totalAccepted\": \"57.9K\", \"totalSubmission\": \"67K\", \"totalAcceptedRaw\": 57860, \"totalSubmissionRaw\": 67034, \"acRate\": \"86.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1941","questionFrontendId":"1830","title":"Minimum Number of Operations to Make String Sorted","titleSlug":"minimum-number-of-operations-to-make-string-sorted","translatedTitle":null,"stats":"{\"totalAccepted\": \"3K\", \"totalSubmission\": \"6K\", \"totalAcceptedRaw\": 2971, \"totalSubmissionRaw\": 6049, \"acRate\": \"49.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1947","questionFrontendId":"1819","title":"Number of Different Subsequences GCDs","titleSlug":"number-of-different-subsequences-gcds","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.3K\", \"totalSubmission\": \"18.6K\", \"totalAcceptedRaw\": 7277, \"totalSubmissionRaw\": 18636, \"acRate\": \"39.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1950","questionFrontendId":"1822","title":"Sign of the Product of an Array","titleSlug":"sign-of-the-product-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"161.3K\", \"totalSubmission\": \"247.2K\", \"totalAcceptedRaw\": 161324, \"totalSubmissionRaw\": 247214, \"acRate\": \"65.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1951","questionFrontendId":"1823","title":"Find the Winner of the Circular Game","titleSlug":"find-the-winner-of-the-circular-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"86.6K\", \"totalSubmission\": \"110.8K\", \"totalAcceptedRaw\": 86641, \"totalSubmissionRaw\": 110755, \"acRate\": \"78.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1963","questionFrontendId":"1835","title":"Find XOR Sum of All Pairs Bitwise AND","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.7K\", \"totalSubmission\": \"24.1K\", \"totalAcceptedRaw\": 14652, \"totalSubmissionRaw\": 24115, \"acRate\": \"60.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1965","questionFrontendId":"1837","title":"Sum of Digits in Base K","titleSlug":"sum-of-digits-in-base-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.5K\", \"totalSubmission\": \"50K\", \"totalAcceptedRaw\": 38500, \"totalSubmissionRaw\": 50015, \"acRate\": \"77.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1968","questionFrontendId":"1840","title":"Maximum Building Height","titleSlug":"maximum-building-height","translatedTitle":null,"stats":"{\"totalAccepted\": \"6K\", \"totalSubmission\": \"17K\", \"totalAcceptedRaw\": 6033, \"totalSubmissionRaw\": 16999, \"acRate\": \"35.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1990","questionFrontendId":"1878","title":"Get Biggest Three Rhombus Sums in a Grid","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.4K\", \"totalSubmission\": \"26.3K\", \"totalAcceptedRaw\": 12381, \"totalSubmissionRaw\": 26283, \"acRate\": \"47.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1993","questionFrontendId":"1863","title":"Sum of All Subset XOR Totals","titleSlug":"sum-of-all-subset-xor-totals","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.4K\", \"totalSubmission\": \"64.4K\", \"totalAcceptedRaw\": 51448, \"totalSubmissionRaw\": 64365, \"acRate\": \"79.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1996","questionFrontendId":"1866","title":"Number of Ways to Rearrange Sticks With K Sticks Visible","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.7K\", \"totalSubmission\": \"19.2K\", \"totalAcceptedRaw\": 10701, \"totalSubmissionRaw\": 19239, \"acRate\": \"55.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2002","questionFrontendId":"1872","title":"Stone Game VIII","titleSlug":"stone-game-viii","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.2K\", \"totalSubmission\": \"13.7K\", \"totalAcceptedRaw\": 7203, \"totalSubmissionRaw\": 13677, \"acRate\": \"52.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2008","questionFrontendId":"1896","title":"Minimum Cost to Change the Final Value of Expression","titleSlug":"minimum-cost-to-change-the-final-value-of-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"6K\", \"totalAcceptedRaw\": 3268, \"totalSubmissionRaw\": 5971, \"acRate\": \"54.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2031","questionFrontendId":"1884","title":"Egg Drop With 2 Eggs and N Floors","titleSlug":"egg-drop-with-2-eggs-and-n-floors","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.1K\", \"totalSubmission\": \"46.7K\", \"totalAcceptedRaw\": 33072, \"totalSubmissionRaw\": 46714, \"acRate\": \"70.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2032","questionFrontendId":"1903","title":"Largest Odd Number in String","titleSlug":"largest-odd-number-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"54.3K\", \"totalSubmission\": \"97K\", \"totalAcceptedRaw\": 54345, \"totalSubmissionRaw\": 96991, \"acRate\": \"56.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2033","questionFrontendId":"1904","title":"The Number of Full Rounds You Have Played","titleSlug":"the-number-of-full-rounds-you-have-played","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.7K\", \"totalSubmission\": \"41.7K\", \"totalAcceptedRaw\": 18731, \"totalSubmissionRaw\": 41723, \"acRate\": \"44.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2037","questionFrontendId":"1925","title":"Count Square Sum Triples","titleSlug":"count-square-sum-triples","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.5K\", \"totalSubmission\": \"46.3K\", \"totalAcceptedRaw\": 31489, \"totalSubmissionRaw\": 46265, \"acRate\": \"68.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2039","questionFrontendId":"1927","title":"Sum Game","titleSlug":"sum-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.4K\", \"totalSubmission\": \"18K\", \"totalAcceptedRaw\": 8426, \"totalSubmissionRaw\": 18006, \"acRate\": \"46.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2050","questionFrontendId":"1922","title":"Count Good Numbers","titleSlug":"count-good-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.5K\", \"totalSubmission\": \"61.7K\", \"totalAcceptedRaw\": 24527, \"totalSubmissionRaw\": 61677, \"acRate\": \"39.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2062","questionFrontendId":"1908","title":"Game of Nim","titleSlug":"game-of-nim","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.8K\", \"totalSubmission\": \"6K\", \"totalAcceptedRaw\": 3849, \"totalSubmissionRaw\": 5963, \"acRate\": \"64.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2073","questionFrontendId":"1956","title":"Minimum Time For K Virus Variants to Spread","titleSlug":"minimum-time-for-k-virus-variants-to-spread","translatedTitle":null,"stats":"{\"totalAccepted\": \"695\", \"totalSubmission\": \"1.4K\", \"totalAcceptedRaw\": 695, \"totalSubmissionRaw\": 1448, \"acRate\": \"48.0%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2074","questionFrontendId":"1924","title":"Erect the Fence II","titleSlug":"erect-the-fence-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"558\", \"totalSubmission\": \"1.1K\", \"totalAcceptedRaw\": 558, \"totalSubmissionRaw\": 1050, \"acRate\": \"53.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2083","questionFrontendId":"1952","title":"Three Divisors","titleSlug":"three-divisors","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.4K\", \"totalSubmission\": \"73K\", \"totalAcceptedRaw\": 42403, \"totalSubmissionRaw\": 72983, \"acRate\": \"58.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2100","questionFrontendId":"1969","title":"Minimum Non-Zero Product of the Array Elements","titleSlug":"minimum-non-zero-product-of-the-array-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.9K\", \"totalSubmission\": \"25.9K\", \"totalAcceptedRaw\": 8883, \"totalSubmissionRaw\": 25944, \"acRate\": \"34.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2105","questionFrontendId":"1994","title":"The Number of Good Subsets","titleSlug":"the-number-of-good-subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.1K\", \"totalSubmission\": \"14.7K\", \"totalAcceptedRaw\": 5111, \"totalSubmissionRaw\": 14706, \"acRate\": \"34.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2106","questionFrontendId":"1979","title":"Find Greatest Common Divisor of Array","titleSlug":"find-greatest-common-divisor-of-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"77.7K\", \"totalSubmission\": \"100.9K\", \"totalAcceptedRaw\": 77669, \"totalSubmissionRaw\": 100940, \"acRate\": \"76.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2125","questionFrontendId":"1998","title":"GCD Sort of an Array","titleSlug":"gcd-sort-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.6K\", \"totalSubmission\": \"14.5K\", \"totalAcceptedRaw\": 6629, \"totalSubmissionRaw\": 14522, \"acRate\": \"45.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2129","questionFrontendId":"2001","title":"Number of Pairs of Interchangeable Rectangles","titleSlug":"number-of-pairs-of-interchangeable-rectangles","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.7K\", \"totalSubmission\": \"51.5K\", \"totalAcceptedRaw\": 23699, \"totalSubmissionRaw\": 51498, \"acRate\": \"46.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2141","questionFrontendId":"1999","title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"2.5K\", \"totalAcceptedRaw\": 1254, \"totalSubmissionRaw\": 2533, \"acRate\": \"49.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2147","questionFrontendId":"2019","title":"The Score of Students Solving Math Expression","titleSlug":"the-score-of-students-solving-math-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"16.8K\", \"totalAcceptedRaw\": 5676, \"totalSubmissionRaw\": 16803, \"acRate\": \"33.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2149","questionFrontendId":"2038","title":"Remove Colored Pieces if Both Neighbors are the Same Color","titleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.1K\", \"totalSubmission\": \"39.9K\", \"totalAcceptedRaw\": 23138, \"totalSubmissionRaw\": 39885, \"acRate\": \"58.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2153","questionFrontendId":"2005","title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"466\", \"totalSubmission\": \"734\", \"totalAcceptedRaw\": 466, \"totalSubmissionRaw\": 734, \"acRate\": \"63.5%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2155","questionFrontendId":"2028","title":"Find Missing Observations","titleSlug":"find-missing-observations","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.2K\", \"totalSubmission\": \"45.4K\", \"totalAcceptedRaw\": 20226, \"totalSubmissionRaw\": 45412, \"acRate\": \"44.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2156","questionFrontendId":"2029","title":"Stone Game IX","titleSlug":"stone-game-ix","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"23.7K\", \"totalAcceptedRaw\": 6310, \"totalSubmissionRaw\": 23708, \"acRate\": \"26.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2160","questionFrontendId":"2033","title":"Minimum Operations to Make a Uni-Value Grid","titleSlug":"minimum-operations-to-make-a-uni-value-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.6K\", \"totalSubmission\": \"35.5K\", \"totalAcceptedRaw\": 18604, \"totalSubmissionRaw\": 35485, \"acRate\": \"52.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2174","questionFrontendId":"2048","title":"Next Greater Numerically Balanced Number","titleSlug":"next-greater-numerically-balanced-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.8K\", \"totalSubmission\": \"22.8K\", \"totalAcceptedRaw\": 10798, \"totalSubmissionRaw\": 22831, \"acRate\": \"47.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2187","questionFrontendId":"2063","title":"Vowels of All Substrings","titleSlug":"vowels-of-all-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"38.7K\", \"totalAcceptedRaw\": 21164, \"totalSubmissionRaw\": 38658, \"acRate\": \"54.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2202","questionFrontendId":"2081","title":"Sum of k-Mirror Numbers","titleSlug":"sum-of-k-mirror-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"15K\", \"totalAcceptedRaw\": 6279, \"totalSubmissionRaw\": 14951, \"acRate\": \"42.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2206","questionFrontendId":"2101","title":"Detonate the Maximum Bombs","titleSlug":"detonate-the-maximum-bombs","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.4K\", \"totalSubmission\": \"67.7K\", \"totalAcceptedRaw\": 28437, \"totalSubmissionRaw\": 67665, \"acRate\": \"42.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2222","questionFrontendId":"2117","title":"Abbreviating the Product of a Range","titleSlug":"abbreviating-the-product-of-a-range","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.6K\", \"totalSubmission\": \"9.7K\", \"totalAcceptedRaw\": 2622, \"totalSubmissionRaw\": 9656, \"acRate\": \"27.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2225","questionFrontendId":"2083","title":"Substrings That Begin and End With the Same Letter","titleSlug":"substrings-that-begin-and-end-with-the-same-letter","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.1K\", \"totalSubmission\": \"7.5K\", \"totalAcceptedRaw\": 5121, \"totalSubmissionRaw\": 7549, \"acRate\": \"67.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2233","questionFrontendId":"2110","title":"Number of Smooth Descent Periods of a Stock","titleSlug":"number-of-smooth-descent-periods-of-a-stock","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.6K\", \"totalSubmission\": \"47.9K\", \"totalAcceptedRaw\": 27618, \"totalSubmissionRaw\": 47892, \"acRate\": \"57.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2238","questionFrontendId":"2119","title":"A Number After a Double Reversal","titleSlug":"a-number-after-a-double-reversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"53.6K\", \"totalSubmission\": \"69.7K\", \"totalAcceptedRaw\": 53628, \"totalSubmissionRaw\": 69720, \"acRate\": \"76.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2244","questionFrontendId":"2125","title":"Number of Laser Beams in a Bank","titleSlug":"number-of-laser-beams-in-a-bank","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.2K\", \"totalSubmission\": \"53.8K\", \"totalAcceptedRaw\": 44207, \"totalSubmissionRaw\": 53771, \"acRate\": \"82.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2251","questionFrontendId":"2147","title":"Number of Ways to Divide a Long Corridor","titleSlug":"number-of-ways-to-divide-a-long-corridor","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.5K\", \"totalSubmission\": \"23.7K\", \"totalAcceptedRaw\": 9476, \"totalSubmissionRaw\": 23736, \"acRate\": \"39.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2264","questionFrontendId":"2160","title":"Minimum Sum of Four Digit Number After Splitting Digits","titleSlug":"minimum-sum-of-four-digit-number-after-splitting-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.9K\", \"totalSubmission\": \"90.8K\", \"totalAcceptedRaw\": 78926, \"totalSubmissionRaw\": 90768, \"acRate\": \"87.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2266","questionFrontendId":"2162","title":"Minimum Cost to Set Cooking Time","titleSlug":"minimum-cost-to-set-cooking-time","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 13318, \"totalSubmissionRaw\": 33394, \"acRate\": \"39.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2268","questionFrontendId":"2128","title":"Remove All Ones With Row and Column Flips","titleSlug":"remove-all-ones-with-row-and-column-flips","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.2K\", \"totalSubmission\": \"39.6K\", \"totalAcceptedRaw\": 30229, \"totalSubmissionRaw\": 39600, \"acRate\": \"76.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2278","questionFrontendId":"2177","title":"Find Three Consecutive Integers That Sum to a Given Number","titleSlug":"find-three-consecutive-integers-that-sum-to-a-given-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.3K\", \"totalSubmission\": \"50.5K\", \"totalAcceptedRaw\": 32322, \"totalSubmissionRaw\": 50550, \"acRate\": \"63.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2279","questionFrontendId":"2178","title":"Maximum Split of Positive Even Integers","titleSlug":"maximum-split-of-positive-even-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.8K\", \"totalSubmission\": \"63.8K\", \"totalAcceptedRaw\": 37818, \"totalSubmissionRaw\": 63780, \"acRate\": \"59.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2284","questionFrontendId":"2165","title":"Smallest Value of the Rearranged Number","titleSlug":"smallest-value-of-the-rearranged-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.7K\", \"totalSubmission\": \"54K\", \"totalAcceptedRaw\": 27747, \"totalSubmissionRaw\": 53984, \"acRate\": \"51.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2287","questionFrontendId":"2152","title":"Minimum Number of Lines to Cover Points","titleSlug":"minimum-number-of-lines-to-cover-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"3K\", \"totalAcceptedRaw\": 1407, \"totalSubmissionRaw\": 3016, \"acRate\": \"46.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2288","questionFrontendId":"2169","title":"Count Operations to Obtain Zero","titleSlug":"count-operations-to-obtain-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.4K\", \"totalSubmission\": \"68.5K\", \"totalAcceptedRaw\": 51441, \"totalSubmissionRaw\": 68478, \"acRate\": \"75.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2298","questionFrontendId":"2180","title":"Count Integers With Even Digit Sum","titleSlug":"count-integers-with-even-digit-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.5K\", \"totalSubmission\": \"62K\", \"totalAcceptedRaw\": 40526, \"totalSubmissionRaw\": 61960, \"acRate\": \"65.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2301","questionFrontendId":"2183","title":"Count Array Pairs Divisible by K","titleSlug":"count-array-pairs-divisible-by-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"41.1K\", \"totalAcceptedRaw\": 11663, \"totalSubmissionRaw\": 41107, \"acRate\": \"28.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2305","questionFrontendId":"2195","title":"Append K Integers With Minimal Sum","titleSlug":"append-k-integers-with-minimal-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.5K\", \"totalSubmission\": \"102.1K\", \"totalAcceptedRaw\": 25530, \"totalSubmissionRaw\": 102065, \"acRate\": \"25.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2307","questionFrontendId":"2197","title":"Replace Non-Coprime Numbers in Array","titleSlug":"replace-non-coprime-numbers-in-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.5K\", \"totalSubmission\": \"29.8K\", \"totalAcceptedRaw\": 11507, \"totalSubmissionRaw\": 29828, \"acRate\": \"38.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2324","questionFrontendId":"2221","title":"Find Triangular Sum of an Array","titleSlug":"find-triangular-sum-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.3K\", \"totalSubmission\": \"66.6K\", \"totalAcceptedRaw\": 52305, \"totalSubmissionRaw\": 66593, \"acRate\": \"78.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2332","questionFrontendId":"2249","title":"Count Lattice Points Inside a Circle","titleSlug":"count-lattice-points-inside-a-circle","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"36K\", \"totalAcceptedRaw\": 18182, \"totalSubmissionRaw\": 35992, \"acRate\": \"50.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2348","questionFrontendId":"2266","title":"Count Number of Texts","titleSlug":"count-number-of-texts","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.9K\", \"totalSubmission\": \"31.7K\", \"totalAcceptedRaw\": 14906, \"totalSubmissionRaw\": 31670, \"acRate\": \"47.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2351","questionFrontendId":"2240","title":"Number of Ways to Buy Pens and Pencils","titleSlug":"number-of-ways-to-buy-pens-and-pencils","translatedTitle":null,"stats":"{\"totalAccepted\": \"20K\", \"totalSubmission\": \"35.2K\", \"totalAcceptedRaw\": 20006, \"totalSubmissionRaw\": 35191, \"acRate\": \"56.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2367","questionFrontendId":"2280","title":"Minimum Lines to Represent a Line Chart","titleSlug":"minimum-lines-to-represent-a-line-chart","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.8K\", \"totalSubmission\": \"89.9K\", \"totalAcceptedRaw\": 21814, \"totalSubmissionRaw\": 89888, \"acRate\": \"24.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2383","questionFrontendId":"2235","title":"Add Two Integers","titleSlug":"add-two-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"243.7K\", \"totalSubmission\": \"275.2K\", \"totalAcceptedRaw\": 243730, \"totalSubmissionRaw\": 275235, \"acRate\": \"88.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2402","questionFrontendId":"2317","title":"Maximum XOR After Operations ","titleSlug":"maximum-xor-after-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.8K\", \"totalSubmission\": \"21.2K\", \"totalAcceptedRaw\": 16779, \"totalSubmissionRaw\": 21198, \"acRate\": \"79.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2415","questionFrontendId":"2338","title":"Count the Number of Ideal Arrays","titleSlug":"count-the-number-of-ideal-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.7K\", \"totalSubmission\": \"17.9K\", \"totalAcceptedRaw\": 4695, \"totalSubmissionRaw\": 17875, \"acRate\": \"26.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2418","questionFrontendId":"2333","title":"Minimum Sum of Squared Difference","titleSlug":"minimum-sum-of-squared-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"11K\", \"totalSubmission\": \"42.9K\", \"totalAcceptedRaw\": 10958, \"totalSubmissionRaw\": 42935, \"acRate\": \"25.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2423","questionFrontendId":"2344","title":"Minimum Deletions to Make Array Divisible","titleSlug":"minimum-deletions-to-make-array-divisible","translatedTitle":null,"stats":"{\"totalAccepted\": \"23K\", \"totalSubmission\": \"40.6K\", \"totalAcceptedRaw\": 23032, \"totalSubmissionRaw\": 40557, \"acRate\": \"56.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2432","questionFrontendId":"2348","title":"Number of Zero-Filled Subarrays","titleSlug":"number-of-zero-filled-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.3K\", \"totalSubmission\": \"49.1K\", \"totalAcceptedRaw\": 28338, \"totalSubmissionRaw\": 49054, \"acRate\": \"57.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2437","questionFrontendId":"2358","title":"Maximum Number of Groups Entering a Competition","titleSlug":"maximum-number-of-groups-entering-a-competition","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.5K\", \"totalSubmission\": \"42.2K\", \"totalAcceptedRaw\": 28514, \"totalSubmissionRaw\": 42152, \"acRate\": \"67.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2450","questionFrontendId":"2366","title":"Minimum Replacements to Sort the Array","titleSlug":"minimum-replacements-to-sort-the-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.6K\", \"totalSubmission\": \"23.3K\", \"totalAcceptedRaw\": 9550, \"totalSubmissionRaw\": 23338, \"acRate\": \"40.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2457","questionFrontendId":"2376","title":"Count Special Integers","titleSlug":"count-special-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"23.5K\", \"totalAcceptedRaw\": 8603, \"totalSubmissionRaw\": 23487, \"acRate\": \"36.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2477","questionFrontendId":"2400","title":"Number of Ways to Reach a Position After Exactly k Steps","titleSlug":"number-of-ways-to-reach-a-position-after-exactly-k-steps","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.1K\", \"totalSubmission\": \"64K\", \"totalAcceptedRaw\": 21099, \"totalSubmissionRaw\": 64032, \"acRate\": \"33.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2481","questionFrontendId":"2396","title":"Strictly Palindromic Number","titleSlug":"strictly-palindromic-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.1K\", \"totalSubmission\": \"52.5K\", \"totalAcceptedRaw\": 46106, \"totalSubmissionRaw\": 52485, \"acRate\": \"87.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2491","questionFrontendId":"2413","title":"Smallest Even Multiple","titleSlug":"smallest-even-multiple","translatedTitle":null,"stats":"{\"totalAccepted\": \"76.3K\", \"totalSubmission\": \"87K\", \"totalAcceptedRaw\": 76341, \"totalSubmissionRaw\": 87038, \"acRate\": \"87.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2496","questionFrontendId":"2409","title":"Count Days Spent Together","titleSlug":"count-days-spent-together","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.7K\", \"totalSubmission\": \"38.3K\", \"totalAcceptedRaw\": 16671, \"totalSubmissionRaw\": 38314, \"acRate\": \"43.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2507","questionFrontendId":"2427","title":"Number of Common Factors","titleSlug":"number-of-common-factors","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.5K\", \"totalSubmission\": \"55.8K\", \"totalAcceptedRaw\": 44475, \"totalSubmissionRaw\": 55768, \"acRate\": \"79.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2525","questionFrontendId":"2442","title":"Count Number of Distinct Integers After Reverse Operations","titleSlug":"count-number-of-distinct-integers-after-reverse-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"35K\", \"totalSubmission\": \"44.5K\", \"totalAcceptedRaw\": 35027, \"totalSubmissionRaw\": 44509, \"acRate\": \"78.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2531","questionFrontendId":"2440","title":"Create Components With Same Value","titleSlug":"create-components-with-same-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.2K\", \"totalSubmission\": \"7.6K\", \"totalAcceptedRaw\": 4167, \"totalSubmissionRaw\": 7629, \"acRate\": \"54.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2535","questionFrontendId":"2393","title":"Count Strictly Increasing Subarrays","titleSlug":"count-strictly-increasing-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"3K\", \"totalAcceptedRaw\": 2193, \"totalSubmissionRaw\": 3007, \"acRate\": \"72.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2541","questionFrontendId":"2443","title":"Sum of Number and Its Reverse","titleSlug":"sum-of-number-and-its-reverse","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.6K\", \"totalSubmission\": \"60.4K\", \"totalAcceptedRaw\": 27614, \"totalSubmissionRaw\": 60360, \"acRate\": \"45.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2542","questionFrontendId":"2455","title":"Average Value of Even Numbers That Are Divisible by Three","titleSlug":"average-value-of-even-numbers-that-are-divisible-by-three","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.3K\", \"totalSubmission\": \"58K\", \"totalAcceptedRaw\": 34280, \"totalSubmissionRaw\": 58045, \"acRate\": \"59.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2544","questionFrontendId":"2457","title":"Minimum Addition to Make Integer Beautiful","titleSlug":"minimum-addition-to-make-integer-beautiful","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.2K\", \"totalSubmission\": \"41K\", \"totalAcceptedRaw\": 15176, \"totalSubmissionRaw\": 41007, \"acRate\": \"37.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2546","questionFrontendId":"2447","title":"Number of Subarrays With GCD Equal to K","titleSlug":"number-of-subarrays-with-gcd-equal-to-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"19K\", \"totalSubmission\": \"39.1K\", \"totalAcceptedRaw\": 19010, \"totalSubmissionRaw\": 39112, \"acRate\": \"48.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2547","questionFrontendId":"2451","title":"Odd String Difference","titleSlug":"odd-string-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"33.1K\", \"totalAcceptedRaw\": 19903, \"totalSubmissionRaw\": 33093, \"acRate\": \"60.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2556","questionFrontendId":"2469","title":"Convert the Temperature","titleSlug":"convert-the-temperature","translatedTitle":null,"stats":"{\"totalAccepted\": \"68.2K\", \"totalSubmission\": \"76.5K\", \"totalAcceptedRaw\": 68171, \"totalSubmissionRaw\": 76491, \"acRate\": \"89.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2557","questionFrontendId":"2470","title":"Number of Subarrays With LCM Equal to K","titleSlug":"number-of-subarrays-with-lcm-equal-to-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.8K\", \"totalSubmission\": \"46.5K\", \"totalAcceptedRaw\": 17826, \"totalSubmissionRaw\": 46468, \"acRate\": \"38.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2560","questionFrontendId":"2417","title":"Closest Fair Integer","titleSlug":"closest-fair-integer","translatedTitle":null,"stats":"{\"totalAccepted\": \"700\", \"totalSubmission\": \"1.5K\", \"totalAcceptedRaw\": 700, \"totalSubmissionRaw\": 1546, \"acRate\": \"45.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2571","questionFrontendId":"2485","title":"Find the Pivot Integer","titleSlug":"find-the-pivot-integer","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.7K\", \"totalSubmission\": \"39.7K\", \"totalAcceptedRaw\": 31729, \"totalSubmissionRaw\": 39660, \"acRate\": \"80.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2575","questionFrontendId":"2481","title":"Minimum Cuts to Divide a Circle","titleSlug":"minimum-cuts-to-divide-a-circle","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"37.9K\", \"totalAcceptedRaw\": 19888, \"totalSubmissionRaw\": 37852, \"acRate\": \"52.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2579","questionFrontendId":"2436","title":"Minimum Split Into Subarrays With GCD Greater Than One","titleSlug":"minimum-split-into-subarrays-with-gcd-greater-than-one","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"1.8K\", \"totalAcceptedRaw\": 1339, \"totalSubmissionRaw\": 1805, \"acRate\": \"74.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2593","questionFrontendId":"2450","title":"Number of Distinct Binary Strings After Applying Operations","titleSlug":"number-of-distinct-binary-strings-after-applying-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"554\", \"totalSubmission\": \"819\", \"totalAcceptedRaw\": 554, \"totalSubmissionRaw\": 819, \"acRate\": \"67.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2595","questionFrontendId":"2507","title":"Smallest Value After Replacing With Sum of Prime Factors","titleSlug":"smallest-value-after-replacing-with-sum-of-prime-factors","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.9K\", \"totalSubmission\": \"32.6K\", \"totalAcceptedRaw\": 15895, \"totalSubmissionRaw\": 32642, \"acRate\": \"48.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2604","questionFrontendId":"2541","title":"Minimum Operations to Make Array Equal II","titleSlug":"minimum-operations-to-make-array-equal-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.6K\", \"totalSubmission\": \"53.9K\", \"totalAcceptedRaw\": 16646, \"totalSubmissionRaw\": 53949, \"acRate\": \"30.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2605","questionFrontendId":"2514","title":"Count Anagrams","titleSlug":"count-anagrams","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.5K\", \"totalSubmission\": \"16.3K\", \"totalAcceptedRaw\": 5550, \"totalSubmissionRaw\": 16254, \"acRate\": \"34.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2607","questionFrontendId":"2464","title":"Minimum Subarrays in a Valid Split","titleSlug":"minimum-subarrays-in-a-valid-split","translatedTitle":null,"stats":"{\"totalAccepted\": \"665\", \"totalSubmission\": \"1.2K\", \"totalAcceptedRaw\": 665, \"totalSubmissionRaw\": 1187, \"acRate\": \"56.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2608","questionFrontendId":"2520","title":"Count the Digits That Divide a Number","titleSlug":"count-the-digits-that-divide-a-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.8K\", \"totalSubmission\": \"42.1K\", \"totalAcceptedRaw\": 35764, \"totalSubmissionRaw\": 42081, \"acRate\": \"85.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2609","questionFrontendId":"2521","title":"Distinct Prime Factors of Product of Array","titleSlug":"distinct-prime-factors-of-product-of-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.5K\", \"totalSubmission\": \"39.1K\", \"totalAcceptedRaw\": 19548, \"totalSubmissionRaw\": 39054, \"acRate\": \"50.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2610","questionFrontendId":"2523","title":"Closest Prime Numbers in Range","titleSlug":"closest-prime-numbers-in-range","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.4K\", \"totalSubmission\": \"41.6K\", \"totalAcceptedRaw\": 15398, \"totalSubmissionRaw\": 41622, \"acRate\": \"37.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2619","questionFrontendId":"2525","title":"Categorize Box According to Criteria","titleSlug":"categorize-box-according-to-criteria","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.4K\", \"totalSubmission\": \"62.9K\", \"totalAcceptedRaw\": 21357, \"totalSubmissionRaw\": 62929, \"acRate\": \"33.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2621","questionFrontendId":"2527","title":"Find Xor-Beauty of Array","titleSlug":"find-xor-beauty-of-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.5K\", \"totalSubmission\": \"19.2K\", \"totalAcceptedRaw\": 13480, \"totalSubmissionRaw\": 19234, \"acRate\": \"70.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2624","questionFrontendId":"2535","title":"Difference Between Element Sum and Digit Sum of an Array","titleSlug":"difference-between-element-sum-and-digit-sum-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.3K\", \"totalSubmission\": \"60K\", \"totalAcceptedRaw\": 51322, \"totalSubmissionRaw\": 60025, \"acRate\": \"85.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2628","questionFrontendId":"2513","title":"Minimize the Maximum of Two Arrays","titleSlug":"minimize-the-maximum-of-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"16.7K\", \"totalAcceptedRaw\": 4438, \"totalSubmissionRaw\": 16714, \"acRate\": \"26.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2629","questionFrontendId":"2489","title":"Number of Substrings With Fixed Ratio","titleSlug":"number-of-substrings-with-fixed-ratio","translatedTitle":null,"stats":"{\"totalAccepted\": \"495\", \"totalSubmission\": \"843\", \"totalAcceptedRaw\": 495, \"totalSubmissionRaw\": 843, \"acRate\": \"58.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2630","questionFrontendId":"2544","title":"Alternating Digit Sum","titleSlug":"alternating-digit-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.5K\", \"totalSubmission\": \"45.2K\", \"totalAcceptedRaw\": 31546, \"totalSubmissionRaw\": 45247, \"acRate\": \"69.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2635","questionFrontendId":"2543","title":"Check if Point Is Reachable","titleSlug":"check-if-point-is-reachable","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"10.8K\", \"totalAcceptedRaw\": 4551, \"totalSubmissionRaw\": 10788, \"acRate\": \"42.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2638","questionFrontendId":"2495","title":"Number of Subarrays Having Even Product","titleSlug":"number-of-subarrays-having-even-product","translatedTitle":null,"stats":"{\"totalAccepted\": \"930\", \"totalSubmission\": \"1.4K\", \"totalAcceptedRaw\": 930, \"totalSubmissionRaw\": 1419, \"acRate\": \"65.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2644","questionFrontendId":"2505","title":"Bitwise OR of All Subsequence Sums","titleSlug":"bitwise-or-of-all-subsequence-sums","translatedTitle":null,"stats":"{\"totalAccepted\": \"555\", \"totalSubmission\": \"930\", \"totalAcceptedRaw\": 555, \"totalSubmissionRaw\": 930, \"acRate\": \"59.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2645","questionFrontendId":"2582","title":"Pass the Pillow","titleSlug":"pass-the-pillow","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.7K\", \"totalSubmission\": \"47K\", \"totalAcceptedRaw\": 21728, \"totalSubmissionRaw\": 47022, \"acRate\": \"46.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2647","questionFrontendId":"2584","title":"Split the Array to Make Coprime Products","titleSlug":"split-the-array-to-make-coprime-products","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.9K\", \"totalSubmission\": \"36.2K\", \"totalAcceptedRaw\": 7936, \"totalSubmissionRaw\": 36240, \"acRate\": \"21.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2649","questionFrontendId":"2579","title":"Count Total Number of Colored Cells","titleSlug":"count-total-number-of-colored-cells","translatedTitle":null,"stats":"{\"totalAccepted\": \"17K\", \"totalSubmission\": \"29.8K\", \"totalAcceptedRaw\": 16983, \"totalSubmissionRaw\": 29817, \"acRate\": \"57.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2650","questionFrontendId":"2578","title":"Split With Minimum Sum","titleSlug":"split-with-minimum-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.2K\", \"totalSubmission\": \"24.8K\", \"totalAcceptedRaw\": 17210, \"totalSubmissionRaw\": 24837, \"acRate\": \"69.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2667","questionFrontendId":"2524","title":"Maximum Frequency Score of a Subarray","titleSlug":"maximum-frequency-score-of-a-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"530\", \"totalSubmission\": \"1.3K\", \"totalAcceptedRaw\": 530, \"totalSubmissionRaw\": 1318, \"acRate\": \"40.2%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2679","questionFrontendId":"2549","title":"Count Distinct Numbers on Board","titleSlug":"count-distinct-numbers-on-board","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.9K\", \"totalSubmission\": \"43.3K\", \"totalAcceptedRaw\": 25882, \"totalSubmissionRaw\": 43263, \"acRate\": \"59.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2680","questionFrontendId":"2550","title":"Count Collisions of Monkeys on a Polygon","titleSlug":"count-collisions-of-monkeys-on-a-polygon","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.5K\", \"totalSubmission\": \"54.8K\", \"totalAcceptedRaw\": 14535, \"totalSubmissionRaw\": 54803, \"acRate\": \"26.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2683","questionFrontendId":"2539","title":"Count the Number of Good Subsequences","titleSlug":"count-the-number-of-good-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"1.6K\", \"totalAcceptedRaw\": 1274, \"totalSubmissionRaw\": 1647, \"acRate\": \"77.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2704","questionFrontendId":"2566","title":"Maximum Difference by Remapping a Digit","titleSlug":"maximum-difference-by-remapping-a-digit","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.3K\", \"totalSubmission\": \"28.7K\", \"totalAcceptedRaw\": 17283, \"totalSubmissionRaw\": 28733, \"acRate\": \"60.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2709","questionFrontendId":"2572","title":"Count the Number of Square-Free Subsets","titleSlug":"count-the-number-of-square-free-subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"22.7K\", \"totalAcceptedRaw\": 4600, \"totalSubmissionRaw\": 22696, \"acRate\": \"20.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2713","questionFrontendId":"2575","title":"Find the Divisibility Array of a String","titleSlug":"find-the-divisibility-array-of-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.8K\", \"totalSubmission\": \"60.8K\", \"totalAcceptedRaw\": 18753, \"totalSubmissionRaw\": 60764, \"acRate\": \"30.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/tmp/segment-tree-graphql.json b/tmp/segment-tree-graphql.json
new file mode 100644
index 000000000..7b428f656
--- /dev/null
+++ b/tmp/segment-tree-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","questions":[{"status":null,"questionId":"218","questionFrontendId":"218","title":"The Skyline Problem","titleSlug":"the-skyline-problem","translatedTitle":null,"stats":"{\"totalAccepted\": \"261.1K\", \"totalSubmission\": \"624.5K\", \"totalAcceptedRaw\": 261106, \"totalSubmissionRaw\": 624490, \"acRate\": \"41.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Line Sweep","translatedName":null,"slug":"line-sweep","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"307","questionFrontendId":"307","title":"Range Sum Query - Mutable","titleSlug":"range-sum-query-mutable","translatedTitle":null,"stats":"{\"totalAccepted\": \"243.5K\", \"totalSubmission\": \"598.4K\", \"totalAcceptedRaw\": 243470, \"totalSubmissionRaw\": 598370, \"acRate\": \"40.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"308","questionFrontendId":"308","title":"Range Sum Query 2D - Mutable","titleSlug":"range-sum-query-2d-mutable","translatedTitle":null,"stats":"{\"totalAccepted\": \"71.7K\", \"totalSubmission\": \"167.5K\", \"totalAcceptedRaw\": 71691, \"totalSubmissionRaw\": 167536, \"acRate\": \"42.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"315","questionFrontendId":"315","title":"Count of Smaller Numbers After Self","titleSlug":"count-of-smaller-numbers-after-self","translatedTitle":null,"stats":"{\"totalAccepted\": \"288.9K\", \"totalSubmission\": \"678K\", \"totalAcceptedRaw\": 288868, \"totalSubmissionRaw\": 678012, \"acRate\": \"42.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"327","questionFrontendId":"327","title":"Count of Range Sum","titleSlug":"count-of-range-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.8K\", \"totalSubmission\": \"188.6K\", \"totalAcceptedRaw\": 67792, \"totalSubmissionRaw\": 188553, \"acRate\": \"36.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"406","questionFrontendId":"406","title":"Queue Reconstruction by Height","titleSlug":"queue-reconstruction-by-height","translatedTitle":null,"stats":"{\"totalAccepted\": \"280K\", \"totalSubmission\": \"383.9K\", \"totalAcceptedRaw\": 279970, \"totalSubmissionRaw\": 383924, \"acRate\": \"72.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"493","questionFrontendId":"493","title":"Reverse Pairs","titleSlug":"reverse-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"118.3K\", \"totalSubmission\": \"382.9K\", \"totalAcceptedRaw\": 118322, \"totalSubmissionRaw\": 382860, \"acRate\": \"30.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"510","questionFrontendId":"2031","title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.8K\", \"totalSubmission\": \"5.5K\", \"totalAcceptedRaw\": 2837, \"totalSubmissionRaw\": 5470, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"673","questionFrontendId":"673","title":"Number of Longest Increasing Subsequence","titleSlug":"number-of-longest-increasing-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"140.4K\", \"totalSubmission\": \"328.4K\", \"totalAcceptedRaw\": 140435, \"totalSubmissionRaw\": 328435, \"acRate\": \"42.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"699","questionFrontendId":"699","title":"Falling Squares","titleSlug":"falling-squares","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.7K\", \"totalSubmission\": \"51K\", \"totalAcceptedRaw\": 22695, \"totalSubmissionRaw\": 50967, \"acRate\": \"44.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"715","questionFrontendId":"715","title":"Range Module","titleSlug":"range-module","translatedTitle":null,"stats":"{\"totalAccepted\": \"57.3K\", \"totalSubmission\": \"128.4K\", \"totalAcceptedRaw\": 57336, \"totalSubmissionRaw\": 128436, \"acRate\": \"44.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"729","questionFrontendId":"729","title":"My Calendar I","titleSlug":"my-calendar-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"252.8K\", \"totalSubmission\": \"444.3K\", \"totalAcceptedRaw\": 252811, \"totalSubmissionRaw\": 444303, \"acRate\": \"56.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"731","questionFrontendId":"731","title":"My Calendar II","titleSlug":"my-calendar-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"89K\", \"totalSubmission\": \"161.9K\", \"totalAcceptedRaw\": 89017, \"totalSubmissionRaw\": 161870, \"acRate\": \"55.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"732","questionFrontendId":"732","title":"My Calendar III","titleSlug":"my-calendar-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"83K\", \"totalSubmission\": \"116K\", \"totalAcceptedRaw\": 82952, \"totalSubmissionRaw\": 115960, \"acRate\": \"71.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"880","questionFrontendId":"850","title":"Rectangle Area II","titleSlug":"rectangle-area-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.3K\", \"totalSubmission\": \"59.9K\", \"totalAcceptedRaw\": 32323, \"totalSubmissionRaw\": 59947, \"acRate\": \"53.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Line Sweep","translatedName":null,"slug":"line-sweep","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1262","questionFrontendId":"1157","title":"Online Majority Element In Subarray","titleSlug":"online-majority-element-in-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.5K\", \"totalSubmission\": \"34.8K\", \"totalAcceptedRaw\": 14496, \"totalSubmissionRaw\": 34767, \"acRate\": \"41.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1294","questionFrontendId":"2080","title":"Range Frequency Queries","titleSlug":"range-frequency-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.9K\", \"totalSubmission\": \"41.1K\", \"totalAcceptedRaw\": 15852, \"totalSubmissionRaw\": 41081, \"acRate\": \"38.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1629","questionFrontendId":"1505","title":"Minimum Possible Integer After at Most K Adjacent Swaps On Digits","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"22.5K\", \"totalAcceptedRaw\": 8624, \"totalSubmissionRaw\": 22462, \"acRate\": \"38.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1645","questionFrontendId":"1521","title":"Find a Value of a Mysterious Function Closest to Target","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"19.8K\", \"totalAcceptedRaw\": 8608, \"totalSubmissionRaw\": 19783, \"acRate\": \"43.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1728","questionFrontendId":"1622","title":"Fancy Sequence","titleSlug":"fancy-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.5K\", \"totalSubmission\": \"58.7K\", \"totalAcceptedRaw\": 9453, \"totalSubmissionRaw\": 58748, \"acRate\": \"16.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1772","questionFrontendId":"1649","title":"Create Sorted Array through Instructions","titleSlug":"create-sorted-array-through-instructions","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"59.6K\", \"totalAcceptedRaw\": 22274, \"totalSubmissionRaw\": 59648, \"acRate\": \"37.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1789","questionFrontendId":"1687","title":"Delivering Boxes from Storage to Ports","titleSlug":"delivering-boxes-from-storage-to-ports","translatedTitle":null,"stats":"{\"totalAccepted\": \"5K\", \"totalSubmission\": \"12.8K\", \"totalAcceptedRaw\": 4956, \"totalSubmissionRaw\": 12791, \"acRate\": \"38.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2280","questionFrontendId":"2179","title":"Count Good Triplets in an Array","titleSlug":"count-good-triplets-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"15.3K\", \"totalAcceptedRaw\": 5891, \"totalSubmissionRaw\": 15350, \"acRate\": \"38.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2297","questionFrontendId":"2158","title":"Amount of New Area Painted Each Day","titleSlug":"amount-of-new-area-painted-each-day","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.1K\", \"totalSubmission\": \"42.3K\", \"totalAcceptedRaw\": 23091, \"totalSubmissionRaw\": 42281, \"acRate\": \"54.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2319","questionFrontendId":"2213","title":"Longest Substring of One Repeating Character","titleSlug":"longest-substring-of-one-repeating-character","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.4K\", \"totalSubmission\": \"11K\", \"totalAcceptedRaw\": 3412, \"totalSubmissionRaw\": 11038, \"acRate\": \"30.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2357","questionFrontendId":"2276","title":"Count Integers in Intervals","titleSlug":"count-integers-in-intervals","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.8K\", \"totalSubmission\": \"37.2K\", \"totalAcceptedRaw\": 12784, \"totalSubmissionRaw\": 37193, \"acRate\": \"34.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2380","questionFrontendId":"2286","title":"Booking Concert Tickets in Groups","titleSlug":"booking-concert-tickets-in-groups","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"28.7K\", \"totalAcceptedRaw\": 4400, \"totalSubmissionRaw\": 28665, \"acRate\": \"15.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2512","questionFrontendId":"2424","title":"Longest Uploaded Prefix","titleSlug":"longest-uploaded-prefix","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.9K\", \"totalSubmission\": \"27.6K\", \"totalAcceptedRaw\": 14892, \"totalSubmissionRaw\": 27592, \"acRate\": \"54.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2513","questionFrontendId":"2426","title":"Number of Pairs Satisfying Inequality","titleSlug":"number-of-pairs-satisfying-inequality","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.8K\", \"totalSubmission\": \"20.4K\", \"totalAcceptedRaw\": 8763, \"totalSubmissionRaw\": 20397, \"acRate\": \"43.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2526","questionFrontendId":"2407","title":"Longest Increasing Subsequence II","titleSlug":"longest-increasing-subsequence-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.8K\", \"totalSubmission\": \"36.2K\", \"totalAcceptedRaw\": 7841, \"totalSubmissionRaw\": 36205, \"acRate\": \"21.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2658","questionFrontendId":"2519","title":"Count the Number of K-Big Indices","titleSlug":"count-the-number-of-k-big-indices","translatedTitle":null,"stats":"{\"totalAccepted\": \"565\", \"totalSubmission\": \"879\", \"totalAcceptedRaw\": 565, \"totalSubmissionRaw\": 879, \"acRate\": \"64.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2703","questionFrontendId":"2569","title":"Handling Sum Queries After Update","titleSlug":"handling-sum-queries-after-update","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"11.9K\", \"totalAcceptedRaw\": 3053, \"totalSubmissionRaw\": 11907, \"acRate\": \"25.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/tmp/sliding-window-graphql.json b/tmp/sliding-window-graphql.json
new file mode 100644
index 000000000..398486fb1
--- /dev/null
+++ b/tmp/sliding-window-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","questions":[{"status":null,"questionId":"3","questionFrontendId":"3","title":"Longest Substring Without Repeating Characters","titleSlug":"longest-substring-without-repeating-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.3M\", \"totalSubmission\": \"12.8M\", \"totalAcceptedRaw\": 4334592, \"totalSubmissionRaw\": 12815178, \"acRate\": \"33.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"30","questionFrontendId":"30","title":"Substring with Concatenation of All Words","titleSlug":"substring-with-concatenation-of-all-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"338.7K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 338691, \"totalSubmissionRaw\": 1086631, \"acRate\": \"31.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"76","questionFrontendId":"76","title":"Minimum Window Substring","titleSlug":"minimum-window-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"980.5K\", \"totalSubmission\": \"2.4M\", \"totalAcceptedRaw\": 980539, \"totalSubmissionRaw\": 2399464, \"acRate\": \"40.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"159","questionFrontendId":"159","title":"Longest Substring with At Most Two Distinct Characters","titleSlug":"longest-substring-with-at-most-two-distinct-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"224.5K\", \"totalSubmission\": \"417.4K\", \"totalAcceptedRaw\": 224494, \"totalSubmissionRaw\": 417416, \"acRate\": \"53.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"187","questionFrontendId":"187","title":"Repeated DNA Sequences","titleSlug":"repeated-dna-sequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"317.3K\", \"totalSubmission\": \"676.7K\", \"totalAcceptedRaw\": 317329, \"totalSubmissionRaw\": 676721, \"acRate\": \"46.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"209","questionFrontendId":"209","title":"Minimum Size Subarray Sum","titleSlug":"minimum-size-subarray-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"673.1K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 673091, \"totalSubmissionRaw\": 1498174, \"acRate\": \"44.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"219","questionFrontendId":"219","title":"Contains Duplicate II","titleSlug":"contains-duplicate-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"649K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 649025, \"totalSubmissionRaw\": 1526488, \"acRate\": \"42.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"220","questionFrontendId":"220","title":"Contains Duplicate III","titleSlug":"contains-duplicate-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"226.7K\", \"totalSubmission\": \"1M\", \"totalAcceptedRaw\": 226731, \"totalSubmissionRaw\": 1025014, \"acRate\": \"22.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Bucket Sort","translatedName":null,"slug":"bucket-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"239","questionFrontendId":"239","title":"Sliding Window Maximum","titleSlug":"sliding-window-maximum","translatedTitle":null,"stats":"{\"totalAccepted\": \"734.3K\", \"totalSubmission\": \"1.6M\", \"totalAcceptedRaw\": 734312, \"totalSubmissionRaw\": 1584674, \"acRate\": \"46.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"340","questionFrontendId":"340","title":"Longest Substring with At Most K Distinct Characters","titleSlug":"longest-substring-with-at-most-k-distinct-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"307.7K\", \"totalSubmission\": \"641.4K\", \"totalAcceptedRaw\": 307714, \"totalSubmissionRaw\": 641394, \"acRate\": \"48.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"395","questionFrontendId":"395","title":"Longest Substring with At Least K Repeating Characters","titleSlug":"longest-substring-with-at-least-k-repeating-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"184.9K\", \"totalSubmission\": \"412.9K\", \"totalAcceptedRaw\": 184867, \"totalSubmissionRaw\": 412866, \"acRate\": \"44.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"424","questionFrontendId":"424","title":"Longest Repeating Character Replacement","titleSlug":"longest-repeating-character-replacement","translatedTitle":null,"stats":"{\"totalAccepted\": \"423.3K\", \"totalSubmission\": \"816.3K\", \"totalAcceptedRaw\": 423254, \"totalSubmissionRaw\": 816265, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"438","questionFrontendId":"438","title":"Find All Anagrams in a String","titleSlug":"find-all-anagrams-in-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"742.2K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 742156, \"totalSubmissionRaw\": 1479640, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"480","questionFrontendId":"480","title":"Sliding Window Median","titleSlug":"sliding-window-median","translatedTitle":null,"stats":"{\"totalAccepted\": \"125.3K\", \"totalSubmission\": \"303.1K\", \"totalAcceptedRaw\": 125261, \"totalSubmissionRaw\": 303079, \"acRate\": \"41.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"487","questionFrontendId":"487","title":"Max Consecutive Ones II","titleSlug":"max-consecutive-ones-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.1K\", \"totalSubmission\": \"240.1K\", \"totalAcceptedRaw\": 119147, \"totalSubmissionRaw\": 240077, \"acRate\": \"49.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"567","questionFrontendId":"567","title":"Permutation in String","titleSlug":"permutation-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"624.7K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 624728, \"totalSubmissionRaw\": 1408151, \"acRate\": \"44.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"632","questionFrontendId":"632","title":"Smallest Range Covering Elements from K Lists","titleSlug":"smallest-range-covering-elements-from-k-lists","translatedTitle":null,"stats":"{\"totalAccepted\": \"83.1K\", \"totalSubmission\": \"136.4K\", \"totalAcceptedRaw\": 83143, \"totalSubmissionRaw\": 136412, \"acRate\": \"60.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"643","questionFrontendId":"643","title":"Maximum Average Subarray I","titleSlug":"maximum-average-subarray-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"197.8K\", \"totalSubmission\": \"452.2K\", \"totalAcceptedRaw\": 197763, \"totalSubmissionRaw\": 452168, \"acRate\": \"43.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"658","questionFrontendId":"658","title":"Find K Closest Elements","titleSlug":"find-k-closest-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"421.4K\", \"totalSubmission\": \"900.2K\", \"totalAcceptedRaw\": 421412, \"totalSubmissionRaw\": 900220, \"acRate\": \"46.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"683","questionFrontendId":"683","title":"K Empty Slots","titleSlug":"k-empty-slots","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.9K\", \"totalSubmission\": \"159.4K\", \"totalAcceptedRaw\": 58917, \"totalSubmissionRaw\": 159409, \"acRate\": \"37.0%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"713","questionFrontendId":"713","title":"Subarray Product Less Than K","titleSlug":"subarray-product-less-than-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"221K\", \"totalSubmission\": \"484K\", \"totalAcceptedRaw\": 221025, \"totalSubmissionRaw\": 484020, \"acRate\": \"45.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"718","questionFrontendId":"718","title":"Maximum Length of Repeated Subarray","titleSlug":"maximum-length-of-repeated-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"258.8K\", \"totalSubmission\": \"504.6K\", \"totalAcceptedRaw\": 258775, \"totalSubmissionRaw\": 504577, \"acRate\": \"51.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"727","questionFrontendId":"727","title":"Minimum Window Subsequence","titleSlug":"minimum-window-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"82.8K\", \"totalSubmission\": \"193.3K\", \"totalAcceptedRaw\": 82819, \"totalSubmissionRaw\": 193257, \"acRate\": \"42.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"867","questionFrontendId":"837","title":"New 21 Game","titleSlug":"new-21-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.5K\", \"totalSubmission\": \"95.3K\", \"totalAcceptedRaw\": 34515, \"totalSubmissionRaw\": 95334, \"acRate\": \"36.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Probability and Statistics","translatedName":null,"slug":"probability-and-statistics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"892","questionFrontendId":"862","title":"Shortest Subarray with Sum at Least K","titleSlug":"shortest-subarray-with-sum-at-least-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"84.1K\", \"totalSubmission\": \"322.7K\", \"totalAcceptedRaw\": 84068, \"totalSubmissionRaw\": 322662, \"acRate\": \"26.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"940","questionFrontendId":"904","title":"Fruit Into Baskets","titleSlug":"fruit-into-baskets","translatedTitle":null,"stats":"{\"totalAccepted\": \"327K\", \"totalSubmission\": \"747.8K\", \"totalAcceptedRaw\": 326964, \"totalSubmissionRaw\": 747764, \"acRate\": \"43.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"966","questionFrontendId":"930","title":"Binary Subarrays With Sum","titleSlug":"binary-subarrays-with-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"64.7K\", \"totalSubmission\": \"124.5K\", \"totalAcceptedRaw\": 64720, \"totalSubmissionRaw\": 124513, \"acRate\": \"52.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1020","questionFrontendId":"978","title":"Longest Turbulent Subarray","titleSlug":"longest-turbulent-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"82.3K\", \"totalSubmission\": \"174.4K\", \"totalAcceptedRaw\": 82301, \"totalSubmissionRaw\": 174411, \"acRate\": \"47.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1034","questionFrontendId":"992","title":"Subarrays with K Different Integers","titleSlug":"subarrays-with-k-different-integers","translatedTitle":null,"stats":"{\"totalAccepted\": \"90.2K\", \"totalSubmission\": \"165K\", \"totalAcceptedRaw\": 90236, \"totalSubmissionRaw\": 165019, \"acRate\": \"54.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1037","questionFrontendId":"995","title":"Minimum Number of K Consecutive Bit Flips","titleSlug":"minimum-number-of-k-consecutive-bit-flips","translatedTitle":null,"stats":"{\"totalAccepted\": \"30K\", \"totalSubmission\": \"58.7K\", \"totalAcceptedRaw\": 30028, \"totalSubmissionRaw\": 58669, \"acRate\": \"51.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1046","questionFrontendId":"1004","title":"Max Consecutive Ones III","titleSlug":"max-consecutive-ones-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"284.6K\", \"totalSubmission\": \"450K\", \"totalAcceptedRaw\": 284557, \"totalSubmissionRaw\": 449973, \"acRate\": \"63.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1084","questionFrontendId":"1100","title":"Find K-Length Substrings With No Repeated Characters","titleSlug":"find-k-length-substrings-with-no-repeated-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.3K\", \"totalSubmission\": \"45.9K\", \"totalAcceptedRaw\": 34284, \"totalSubmissionRaw\": 45921, \"acRate\": \"74.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1096","questionFrontendId":"1031","title":"Maximum Sum of Two Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"61.3K\", \"totalSubmission\": \"102.9K\", \"totalAcceptedRaw\": 61303, \"totalSubmissionRaw\": 102853, \"acRate\": \"59.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1107","questionFrontendId":"1151","title":"Minimum Swaps to Group All 1's Together","titleSlug":"minimum-swaps-to-group-all-1s-together","translatedTitle":null,"stats":"{\"totalAccepted\": \"55.1K\", \"totalSubmission\": \"90.5K\", \"totalAcceptedRaw\": 55053, \"totalSubmissionRaw\": 90456, \"acRate\": \"60.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1122","questionFrontendId":"1044","title":"Longest Duplicate Substring","titleSlug":"longest-duplicate-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"61.2K\", \"totalSubmission\": \"200.2K\", \"totalAcceptedRaw\": 61173, \"totalSubmissionRaw\": 200160, \"acRate\": \"30.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Suffix Array","translatedName":null,"slug":"suffix-array","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1138","questionFrontendId":"1052","title":"Grumpy Bookstore Owner","titleSlug":"grumpy-bookstore-owner","translatedTitle":null,"stats":"{\"totalAccepted\": \"62.1K\", \"totalSubmission\": \"108.8K\", \"totalAcceptedRaw\": 62146, \"totalSubmissionRaw\": 108823, \"acRate\": \"57.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1261","questionFrontendId":"1156","title":"Swap For Longest Repeated Character Substring","titleSlug":"swap-for-longest-repeated-character-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.7K\", \"totalSubmission\": \"59.1K\", \"totalAcceptedRaw\": 26683, \"totalSubmissionRaw\": 59087, \"acRate\": \"45.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1280","questionFrontendId":"1176","title":"Diet Plan Performance","titleSlug":"diet-plan-performance","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.9K\", \"totalSubmission\": \"54.7K\", \"totalAcceptedRaw\": 28858, \"totalSubmissionRaw\": 54745, \"acRate\": \"52.7%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1286","questionFrontendId":"1425","title":"Constrained Subsequence Sum","titleSlug":"constrained-subsequence-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.7K\", \"totalSubmission\": \"49.9K\", \"totalAcceptedRaw\": 23700, \"totalSubmissionRaw\": 49852, \"acRate\": \"47.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1321","questionFrontendId":"1208","title":"Get Equal Substrings Within Budget","titleSlug":"get-equal-substrings-within-budget","translatedTitle":null,"stats":"{\"totalAccepted\": \"37K\", \"totalSubmission\": \"76.3K\", \"totalAcceptedRaw\": 36954, \"totalSubmissionRaw\": 76261, \"acRate\": \"48.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1351","questionFrontendId":"1234","title":"Replace the Substring for Balanced String","titleSlug":"replace-the-substring-for-balanced-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.6K\", \"totalSubmission\": \"74.4K\", \"totalAcceptedRaw\": 27619, \"totalSubmissionRaw\": 74369, \"acRate\": \"37.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1370","questionFrontendId":"1248","title":"Count Number of Nice Subarrays","titleSlug":"count-number-of-nice-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.1K\", \"totalSubmission\": \"128.4K\", \"totalAcceptedRaw\": 78097, \"totalSubmissionRaw\": 128353, \"acRate\": \"60.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1423","questionFrontendId":"1297","title":"Maximum Number of Occurrences of a Substring","titleSlug":"maximum-number-of-occurrences-of-a-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.3K\", \"totalSubmission\": \"77.6K\", \"totalAcceptedRaw\": 40266, \"totalSubmissionRaw\": 77602, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1430","questionFrontendId":"2269","title":"Find the K-Beauty of a Number","titleSlug":"find-the-k-beauty-of-a-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.6K\", \"totalSubmission\": \"59.9K\", \"totalAcceptedRaw\": 34563, \"totalSubmissionRaw\": 59925, \"acRate\": \"57.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1445","questionFrontendId":"1343","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"53.1K\", \"totalSubmission\": \"78.6K\", \"totalAcceptedRaw\": 53125, \"totalSubmissionRaw\": 78613, \"acRate\": \"67.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1460","questionFrontendId":"1358","title":"Number of Substrings Containing All Three Characters","titleSlug":"number-of-substrings-containing-all-three-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"54.1K\", \"totalSubmission\": \"85.5K\", \"totalAcceptedRaw\": 54132, \"totalSubmissionRaw\": 85473, \"acRate\": \"63.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1538","questionFrontendId":"1423","title":"Maximum Points You Can Obtain from Cards","titleSlug":"maximum-points-you-can-obtain-from-cards","translatedTitle":null,"stats":"{\"totalAccepted\": \"216.9K\", \"totalSubmission\": \"415.1K\", \"totalAcceptedRaw\": 216947, \"totalSubmissionRaw\": 415147, \"acRate\": \"52.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1549","questionFrontendId":"1438","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"107.6K\", \"totalSubmission\": \"222.8K\", \"totalAcceptedRaw\": 107582, \"totalSubmissionRaw\": 222791, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1567","questionFrontendId":"1456","title":"Maximum Number of Vowels in a Substring of Given Length","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length","translatedTitle":null,"stats":"{\"totalAccepted\": \"56.9K\", \"totalSubmission\": \"97.8K\", \"totalAcceptedRaw\": 56880, \"totalSubmissionRaw\": 97819, \"acRate\": \"58.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1573","questionFrontendId":"1477","title":"Find Two Non-overlapping Sub-arrays Each With Target Sum","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.1K\", \"totalSubmission\": \"117.1K\", \"totalAcceptedRaw\": 43129, \"totalSubmissionRaw\": 117109, \"acRate\": \"36.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1586","questionFrontendId":"1493","title":"Longest Subarray of 1's After Deleting One Element","titleSlug":"longest-subarray-of-1s-after-deleting-one-element","translatedTitle":null,"stats":"{\"totalAccepted\": \"58K\", \"totalSubmission\": \"96.2K\", \"totalAcceptedRaw\": 58044, \"totalSubmissionRaw\": 96214, \"acRate\": \"60.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1622","questionFrontendId":"1499","title":"Max Value of Equation","titleSlug":"max-value-of-equation","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.8K\", \"totalSubmission\": \"80.3K\", \"totalAcceptedRaw\": 36804, \"totalSubmissionRaw\": 80301, \"acRate\": \"45.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1733","questionFrontendId":"1610","title":"Maximum Number of Visible Points","titleSlug":"maximum-number-of-visible-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"36K\", \"totalSubmission\": \"96.4K\", \"totalAcceptedRaw\": 35953, \"totalSubmissionRaw\": 96401, \"acRate\": \"37.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1776","questionFrontendId":"1658","title":"Minimum Operations to Reduce X to Zero","titleSlug":"minimum-operations-to-reduce-x-to-zero","translatedTitle":null,"stats":"{\"totalAccepted\": \"109K\", \"totalSubmission\": \"289.9K\", \"totalAcceptedRaw\": 109032, \"totalSubmissionRaw\": 289890, \"acRate\": \"37.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1805","questionFrontendId":"1703","title":"Minimum Adjacent Swaps for K Consecutive Ones","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.2K\", \"totalSubmission\": \"19.4K\", \"totalAcceptedRaw\": 8208, \"totalSubmissionRaw\": 19402, \"acRate\": \"42.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1813","questionFrontendId":"1695","title":"Maximum Erasure Value","titleSlug":"maximum-erasure-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"107.8K\", \"totalSubmission\": \"187.3K\", \"totalAcceptedRaw\": 107766, \"totalSubmissionRaw\": 187253, \"acRate\": \"57.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1814","questionFrontendId":"1696","title":"Jump Game VI","titleSlug":"jump-game-vi","translatedTitle":null,"stats":"{\"totalAccepted\": \"97.4K\", \"totalSubmission\": \"211.4K\", \"totalAcceptedRaw\": 97397, \"totalSubmissionRaw\": 211365, \"acRate\": \"46.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1873","questionFrontendId":"1763","title":"Longest Nice Substring","titleSlug":"longest-nice-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.7K\", \"totalSubmission\": \"59.5K\", \"totalAcceptedRaw\": 36653, \"totalSubmissionRaw\": 59499, \"acRate\": \"61.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1966","questionFrontendId":"1838","title":"Frequency of the Most Frequent Element","titleSlug":"frequency-of-the-most-frequent-element","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.9K\", \"totalSubmission\": \"101.8K\", \"totalAcceptedRaw\": 39940, \"totalSubmissionRaw\": 101833, \"acRate\": \"39.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1967","questionFrontendId":"1839","title":"Longest Substring Of All Vowels in Order","titleSlug":"longest-substring-of-all-vowels-in-order","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.1K\", \"totalSubmission\": \"49.5K\", \"totalAcceptedRaw\": 24078, \"totalSubmissionRaw\": 49528, \"acRate\": \"48.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1987","questionFrontendId":"1876","title":"Substrings of Size Three with Distinct Characters","titleSlug":"substrings-of-size-three-with-distinct-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"73K\", \"totalSubmission\": \"102.8K\", \"totalAcceptedRaw\": 73030, \"totalSubmissionRaw\": 102751, \"acRate\": \"71.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2003","questionFrontendId":"1852","title":"Distinct Numbers in Each Subarray","titleSlug":"distinct-numbers-in-each-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"7.8K\", \"totalAcceptedRaw\": 5574, \"totalSubmissionRaw\": 7831, \"acRate\": \"71.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2017","questionFrontendId":"1888","title":"Minimum Number of Flips to Make the Binary String Alternating","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"46.1K\", \"totalAcceptedRaw\": 17862, \"totalSubmissionRaw\": 46074, \"acRate\": \"38.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2069","questionFrontendId":"1918","title":"Kth Smallest Subarray Sum","titleSlug":"kth-smallest-subarray-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.2K\", \"totalSubmission\": \"6.1K\", \"totalAcceptedRaw\": 3216, \"totalSubmissionRaw\": 6118, \"acRate\": \"52.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2112","questionFrontendId":"1984","title":"Minimum Difference Between Highest and Lowest of K Scores","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores","translatedTitle":null,"stats":"{\"totalAccepted\": \"41.9K\", \"totalSubmission\": \"77.1K\", \"totalAcceptedRaw\": 41912, \"totalSubmissionRaw\": 77077, \"acRate\": \"54.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2134","questionFrontendId":"2024","title":"Maximize the Confusion of an Exam","titleSlug":"maximize-the-confusion-of-an-exam","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"40.1K\", \"totalAcceptedRaw\": 24180, \"totalSubmissionRaw\": 40079, \"acRate\": \"60.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2211","questionFrontendId":"2090","title":"K Radius Subarray Averages","titleSlug":"k-radius-subarray-averages","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.8K\", \"totalSubmission\": \"53.5K\", \"totalAcceptedRaw\": 22839, \"totalSubmissionRaw\": 53531, \"acRate\": \"42.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2229","questionFrontendId":"2106","title":"Maximum Fruits Harvested After at Most K Steps","titleSlug":"maximum-fruits-harvested-after-at-most-k-steps","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.4K\", \"totalSubmission\": \"24.1K\", \"totalAcceptedRaw\": 8447, \"totalSubmissionRaw\": 24113, \"acRate\": \"35.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2247","questionFrontendId":"2107","title":"Number of Unique Flavors After Sharing K Candies","titleSlug":"number-of-unique-flavors-after-sharing-k-candies","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"4K\", \"totalAcceptedRaw\": 2229, \"totalSubmissionRaw\": 3966, \"acRate\": \"56.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2255","questionFrontendId":"2134","title":"Minimum Swaps to Group All 1's Together II","titleSlug":"minimum-swaps-to-group-all-1s-together-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"41.4K\", \"totalAcceptedRaw\": 21237, \"totalSubmissionRaw\": 41412, \"acRate\": \"51.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2275","questionFrontendId":"2156","title":"Find Substring With Given Hash Value","titleSlug":"find-substring-with-given-hash-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.2K\", \"totalSubmission\": \"50.1K\", \"totalAcceptedRaw\": 11158, \"totalSubmissionRaw\": 50115, \"acRate\": \"22.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2338","questionFrontendId":"2260","title":"Minimum Consecutive Cards to Pick Up","titleSlug":"minimum-consecutive-cards-to-pick-up","translatedTitle":null,"stats":"{\"totalAccepted\": \"40K\", \"totalSubmission\": \"78K\", \"totalAcceptedRaw\": 39971, \"totalSubmissionRaw\": 78007, \"acRate\": \"51.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2394","questionFrontendId":"2302","title":"Count Subarrays With Score Less Than K","titleSlug":"count-subarrays-with-score-less-than-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.1K\", \"totalSubmission\": \"30.8K\", \"totalAcceptedRaw\": 16066, \"totalSubmissionRaw\": 30757, \"acRate\": \"52.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2449","questionFrontendId":"2398","title":"Maximum Number of Robots Within Budget","titleSlug":"maximum-number-of-robots-within-budget","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.6K\", \"totalSubmission\": \"44.3K\", \"totalAcceptedRaw\": 14582, \"totalSubmissionRaw\": 44331, \"acRate\": \"32.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2463","questionFrontendId":"2379","title":"Minimum Recolors to Get K Consecutive Black Blocks","titleSlug":"minimum-recolors-to-get-k-consecutive-black-blocks","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.3K\", \"totalSubmission\": \"54.3K\", \"totalAcceptedRaw\": 31325, \"totalSubmissionRaw\": 54277, \"acRate\": \"57.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2478","questionFrontendId":"2401","title":"Longest Nice Subarray","titleSlug":"longest-nice-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.3K\", \"totalSubmission\": \"41.3K\", \"totalAcceptedRaw\": 20313, \"totalSubmissionRaw\": 41272, \"acRate\": \"49.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2498","questionFrontendId":"2411","title":"Smallest Subarrays With Maximum Bitwise OR","titleSlug":"smallest-subarrays-with-maximum-bitwise-or","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.4K\", \"totalSubmission\": \"22.5K\", \"totalAcceptedRaw\": 9379, \"totalSubmissionRaw\": 22537, \"acRate\": \"41.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2527","questionFrontendId":"2444","title":"Count Subarrays With Fixed Bounds","titleSlug":"count-subarrays-with-fixed-bounds","translatedTitle":null,"stats":"{\"totalAccepted\": \"54.7K\", \"totalSubmission\": \"88.2K\", \"totalAcceptedRaw\": 54701, \"totalSubmissionRaw\": 88186, \"acRate\": \"62.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2552","questionFrontendId":"2461","title":"Maximum Sum of Distinct Subarrays With Length K","titleSlug":"maximum-sum-of-distinct-subarrays-with-length-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.5K\", \"totalSubmission\": \"65.8K\", \"totalAcceptedRaw\": 22536, \"totalSubmissionRaw\": 65770, \"acRate\": \"34.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2599","questionFrontendId":"2516","title":"Take K of Each Character From Left and Right","titleSlug":"take-k-of-each-character-from-left-and-right","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.5K\", \"totalSubmission\": \"30.9K\", \"totalAcceptedRaw\": 10457, \"totalSubmissionRaw\": 30850, \"acRate\": \"33.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2618","questionFrontendId":"2528","title":"Maximize the Minimum Powered City","titleSlug":"maximize-the-minimum-powered-city","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"13.3K\", \"totalAcceptedRaw\": 4282, \"totalSubmissionRaw\": 13347, \"acRate\": \"32.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2626","questionFrontendId":"2537","title":"Count the Number of Good Subarrays","titleSlug":"count-the-number-of-good-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 11735, \"totalSubmissionRaw\": 24498, \"acRate\": \"47.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2667","questionFrontendId":"2524","title":"Maximum Frequency Score of a Subarray","titleSlug":"maximum-frequency-score-of-a-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"530\", \"totalSubmission\": \"1.3K\", \"totalAcceptedRaw\": 530, \"totalSubmissionRaw\": 1318, \"acRate\": \"40.2%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2673","questionFrontendId":"2555","title":"Maximize Win From Two Segments","titleSlug":"maximize-win-from-two-segments","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"20.8K\", \"totalAcceptedRaw\": 6279, \"totalSubmissionRaw\": 20844, \"acRate\": \"30.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/tmp/sorting-graphql.json b/tmp/sorting-graphql.json
new file mode 100644
index 000000000..01bf1e06e
--- /dev/null
+++ b/tmp/sorting-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"Sorting","translatedName":null,"slug":"sorting","questions":[{"status":null,"questionId":"15","questionFrontendId":"15","title":"3Sum","titleSlug":"3sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.6M\", \"totalSubmission\": \"7.8M\", \"totalAcceptedRaw\": 2554405, \"totalSubmissionRaw\": 7849967, \"acRate\": \"32.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"16","questionFrontendId":"16","title":"3Sum Closest","titleSlug":"3sum-closest","translatedTitle":null,"stats":"{\"totalAccepted\": \"1M\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 1004216, \"totalSubmissionRaw\": 2192777, \"acRate\": \"45.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"18","questionFrontendId":"18","title":"4Sum","titleSlug":"4sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"715.9K\", \"totalSubmission\": \"2M\", \"totalAcceptedRaw\": 715871, \"totalSubmissionRaw\": 1990148, \"acRate\": \"36.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"49","questionFrontendId":"49","title":"Group Anagrams","titleSlug":"group-anagrams","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.9M\", \"totalSubmission\": \"2.8M\", \"totalAcceptedRaw\": 1881058, \"totalSubmissionRaw\": 2819376, \"acRate\": \"66.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"56","questionFrontendId":"56","title":"Merge Intervals","titleSlug":"merge-intervals","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.8M\", \"totalSubmission\": \"4M\", \"totalAcceptedRaw\": 1823295, \"totalSubmissionRaw\": 3950102, \"acRate\": \"46.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"75","questionFrontendId":"75","title":"Sort Colors","titleSlug":"sort-colors","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 1365670, \"totalSubmissionRaw\": 2339162, \"acRate\": \"58.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"88","questionFrontendId":"88","title":"Merge Sorted Array","titleSlug":"merge-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.9M\", \"totalSubmission\": \"4.1M\", \"totalAcceptedRaw\": 1924442, \"totalSubmissionRaw\": 4139391, \"acRate\": \"46.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"147","questionFrontendId":"147","title":"Insertion Sort List","titleSlug":"insertion-sort-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"317.7K\", \"totalSubmission\": \"623.9K\", \"totalAcceptedRaw\": 317709, \"totalSubmissionRaw\": 623891, \"acRate\": \"50.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"148","questionFrontendId":"148","title":"Sort List","titleSlug":"sort-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"611.2K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 611213, \"totalSubmissionRaw\": 1110991, \"acRate\": \"55.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"164","questionFrontendId":"164","title":"Maximum Gap","titleSlug":"maximum-gap","translatedTitle":null,"stats":"{\"totalAccepted\": \"163.9K\", \"totalSubmission\": \"379K\", \"totalAcceptedRaw\": 163928, \"totalSubmissionRaw\": 379019, \"acRate\": \"43.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Bucket Sort","translatedName":null,"slug":"bucket-sort","__typename":"TopicTagNode"},{"name":"Radix Sort","translatedName":null,"slug":"radix-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"169","questionFrontendId":"169","title":"Majority Element","titleSlug":"majority-element","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6M\", \"totalSubmission\": \"2.6M\", \"totalAcceptedRaw\": 1646153, \"totalSubmissionRaw\": 2575601, \"acRate\": \"63.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"179","questionFrontendId":"179","title":"Largest Number","titleSlug":"largest-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"383.3K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 383285, \"totalSubmissionRaw\": 1111221, \"acRate\": \"34.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"215","questionFrontendId":"215","title":"Kth Largest Element in an Array","titleSlug":"kth-largest-element-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.7M\", \"totalSubmission\": \"2.6M\", \"totalAcceptedRaw\": 1694440, \"totalSubmissionRaw\": 2562929, \"acRate\": \"66.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Quickselect","translatedName":null,"slug":"quickselect","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"217","questionFrontendId":"217","title":"Contains Duplicate","titleSlug":"contains-duplicate","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.6M\", \"totalSubmission\": \"4.2M\", \"totalAcceptedRaw\": 2571766, \"totalSubmissionRaw\": 4187672, \"acRate\": \"61.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"220","questionFrontendId":"220","title":"Contains Duplicate III","titleSlug":"contains-duplicate-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"226.7K\", \"totalSubmission\": \"1M\", \"totalAcceptedRaw\": 226731, \"totalSubmissionRaw\": 1025014, \"acRate\": \"22.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Bucket Sort","translatedName":null,"slug":"bucket-sort","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"229","questionFrontendId":"229","title":"Majority Element II","titleSlug":"majority-element-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"385.4K\", \"totalSubmission\": \"857.4K\", \"totalAcceptedRaw\": 385433, \"totalSubmissionRaw\": 857447, \"acRate\": \"45.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"242","questionFrontendId":"242","title":"Valid Anagram","titleSlug":"valid-anagram","translatedTitle":null,"stats":"{\"totalAccepted\": \"2M\", \"totalSubmission\": \"3.2M\", \"totalAcceptedRaw\": 2033389, \"totalSubmissionRaw\": 3226600, \"acRate\": \"63.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"252","questionFrontendId":"252","title":"Meeting Rooms","titleSlug":"meeting-rooms","translatedTitle":null,"stats":"{\"totalAccepted\": \"334.5K\", \"totalSubmission\": \"584.4K\", \"totalAcceptedRaw\": 334480, \"totalSubmissionRaw\": 584405, \"acRate\": \"57.2%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"253","questionFrontendId":"253","title":"Meeting Rooms II","titleSlug":"meeting-rooms-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"767K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 767005, \"totalSubmissionRaw\": 1517236, \"acRate\": \"50.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"259","questionFrontendId":"259","title":"3Sum Smaller","titleSlug":"3sum-smaller","translatedTitle":null,"stats":"{\"totalAccepted\": \"133.4K\", \"totalSubmission\": \"263.2K\", \"totalAcceptedRaw\": 133353, \"totalSubmissionRaw\": 263193, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"268","questionFrontendId":"268","title":"Missing Number","titleSlug":"missing-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 1431785, \"totalSubmissionRaw\": 2293208, \"acRate\": \"62.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"274","questionFrontendId":"274","title":"H-Index","titleSlug":"h-index","translatedTitle":null,"stats":"{\"totalAccepted\": \"257.8K\", \"totalSubmission\": \"672.8K\", \"totalAcceptedRaw\": 257819, \"totalSubmissionRaw\": 672847, \"acRate\": \"38.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting Sort","translatedName":null,"slug":"counting-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"280","questionFrontendId":"280","title":"Wiggle Sort","titleSlug":"wiggle-sort","translatedTitle":null,"stats":"{\"totalAccepted\": \"128.2K\", \"totalSubmission\": \"191.3K\", \"totalAcceptedRaw\": 128218, \"totalSubmissionRaw\": 191346, \"acRate\": \"67.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"295","questionFrontendId":"295","title":"Find Median from Data Stream","titleSlug":"find-median-from-data-stream","translatedTitle":null,"stats":"{\"totalAccepted\": \"616.5K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 616522, \"totalSubmissionRaw\": 1198271, \"acRate\": \"51.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"296","questionFrontendId":"296","title":"Best Meeting Point","titleSlug":"best-meeting-point","translatedTitle":null,"stats":"{\"totalAccepted\": \"67K\", \"totalSubmission\": \"111.4K\", \"totalAcceptedRaw\": 66964, \"totalSubmissionRaw\": 111420, \"acRate\": \"60.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"324","questionFrontendId":"324","title":"Wiggle Sort II","titleSlug":"wiggle-sort-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"139.4K\", \"totalSubmission\": \"419.3K\", \"totalAcceptedRaw\": 139437, \"totalSubmissionRaw\": 419273, \"acRate\": \"33.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Quickselect","translatedName":null,"slug":"quickselect","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"347","questionFrontendId":"347","title":"Top K Frequent Elements","titleSlug":"top-k-frequent-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 1345636, \"totalSubmissionRaw\": 2093537, \"acRate\": \"64.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Bucket Sort","translatedName":null,"slug":"bucket-sort","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Quickselect","translatedName":null,"slug":"quickselect","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"349","questionFrontendId":"349","title":"Intersection of Two Arrays","titleSlug":"intersection-of-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"824.6K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 824619, \"totalSubmissionRaw\": 1163783, \"acRate\": \"70.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"350","questionFrontendId":"350","title":"Intersection of Two Arrays II","titleSlug":"intersection-of-two-arrays-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"1M\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 1026502, \"totalSubmissionRaw\": 1835394, \"acRate\": \"55.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"354","questionFrontendId":"354","title":"Russian Doll Envelopes","titleSlug":"russian-doll-envelopes","translatedTitle":null,"stats":"{\"totalAccepted\": \"185.7K\", \"totalSubmission\": \"488.6K\", \"totalAcceptedRaw\": 185705, \"totalSubmissionRaw\": 488647, \"acRate\": \"38.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"358","questionFrontendId":"358","title":"Rearrange String k Distance Apart","titleSlug":"rearrange-string-k-distance-apart","translatedTitle":null,"stats":"{\"totalAccepted\": \"57.4K\", \"totalSubmission\": \"152K\", \"totalAcceptedRaw\": 57395, \"totalSubmissionRaw\": 152041, \"acRate\": \"37.7%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"360","questionFrontendId":"360","title":"Sort Transformed Array","titleSlug":"sort-transformed-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"61.6K\", \"totalSubmission\": \"112.1K\", \"totalAcceptedRaw\": 61611, \"totalSubmissionRaw\": 112063, \"acRate\": \"55.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"368","questionFrontendId":"368","title":"Largest Divisible Subset","titleSlug":"largest-divisible-subset","translatedTitle":null,"stats":"{\"totalAccepted\": \"175.4K\", \"totalSubmission\": \"423K\", \"totalAcceptedRaw\": 175431, \"totalSubmissionRaw\": 422970, \"acRate\": \"41.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"378","questionFrontendId":"378","title":"Kth Smallest Element in a Sorted Matrix","titleSlug":"kth-smallest-element-in-a-sorted-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"526.4K\", \"totalSubmission\": \"852.2K\", \"totalAcceptedRaw\": 526380, \"totalSubmissionRaw\": 852230, \"acRate\": \"61.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"389","questionFrontendId":"389","title":"Find the Difference","titleSlug":"find-the-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"482.5K\", \"totalSubmission\": \"804.5K\", \"totalAcceptedRaw\": 482524, \"totalSubmissionRaw\": 804520, \"acRate\": \"60.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"406","questionFrontendId":"406","title":"Queue Reconstruction by Height","titleSlug":"queue-reconstruction-by-height","translatedTitle":null,"stats":"{\"totalAccepted\": \"280K\", \"totalSubmission\": \"383.9K\", \"totalAcceptedRaw\": 279970, \"totalSubmissionRaw\": 383924, \"acRate\": \"72.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"414","questionFrontendId":"414","title":"Third Maximum Number","titleSlug":"third-maximum-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"416.1K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 416081, \"totalSubmissionRaw\": 1256516, \"acRate\": \"33.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"435","questionFrontendId":"435","title":"Non-overlapping Intervals","titleSlug":"non-overlapping-intervals","translatedTitle":null,"stats":"{\"totalAccepted\": \"348.8K\", \"totalSubmission\": \"694.6K\", \"totalAcceptedRaw\": 348777, \"totalSubmissionRaw\": 694562, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"436","questionFrontendId":"436","title":"Find Right Interval","titleSlug":"find-right-interval","translatedTitle":null,"stats":"{\"totalAccepted\": \"91.8K\", \"totalSubmission\": \"180.9K\", \"totalAcceptedRaw\": 91813, \"totalSubmissionRaw\": 180936, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"451","questionFrontendId":"451","title":"Sort Characters By Frequency","titleSlug":"sort-characters-by-frequency","translatedTitle":null,"stats":"{\"totalAccepted\": \"494.3K\", \"totalSubmission\": \"705.6K\", \"totalAcceptedRaw\": 494256, \"totalSubmissionRaw\": 705582, \"acRate\": \"70.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Bucket Sort","translatedName":null,"slug":"bucket-sort","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"452","questionFrontendId":"452","title":"Minimum Number of Arrows to Burst Balloons","titleSlug":"minimum-number-of-arrows-to-burst-balloons","translatedTitle":null,"stats":"{\"totalAccepted\": \"297.1K\", \"totalSubmission\": \"537.4K\", \"totalAcceptedRaw\": 297056, \"totalSubmissionRaw\": 537417, \"acRate\": \"55.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"455","questionFrontendId":"455","title":"Assign Cookies","titleSlug":"assign-cookies","translatedTitle":null,"stats":"{\"totalAccepted\": \"213.8K\", \"totalSubmission\": \"427.6K\", \"totalAcceptedRaw\": 213801, \"totalSubmissionRaw\": 427580, \"acRate\": \"50.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"462","questionFrontendId":"462","title":"Minimum Moves to Equal Array Elements II","titleSlug":"minimum-moves-to-equal-array-elements-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"159K\", \"totalSubmission\": \"264.7K\", \"totalAcceptedRaw\": 158954, \"totalSubmissionRaw\": 264713, \"acRate\": \"60.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"475","questionFrontendId":"475","title":"Heaters","titleSlug":"heaters","translatedTitle":null,"stats":"{\"totalAccepted\": \"100.1K\", \"totalSubmission\": \"274.8K\", \"totalAcceptedRaw\": 100072, \"totalSubmissionRaw\": 274829, \"acRate\": \"36.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"502","questionFrontendId":"502","title":"IPO","titleSlug":"ipo","translatedTitle":null,"stats":"{\"totalAccepted\": \"90.3K\", \"totalSubmission\": \"181.6K\", \"totalAcceptedRaw\": 90289, \"totalSubmissionRaw\": 181553, \"acRate\": \"49.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"506","questionFrontendId":"506","title":"Relative Ranks","titleSlug":"relative-ranks","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.3K\", \"totalSubmission\": \"197.6K\", \"totalAcceptedRaw\": 119270, \"totalSubmissionRaw\": 197648, \"acRate\": \"60.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"522","questionFrontendId":"522","title":"Longest Uncommon Subsequence II","titleSlug":"longest-uncommon-subsequence-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.8K\", \"totalSubmission\": \"115.7K\", \"totalAcceptedRaw\": 46844, \"totalSubmissionRaw\": 115706, \"acRate\": \"40.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"524","questionFrontendId":"524","title":"Longest Word in Dictionary through Deleting","titleSlug":"longest-word-in-dictionary-through-deleting","translatedTitle":null,"stats":"{\"totalAccepted\": \"140K\", \"totalSubmission\": \"274.4K\", \"totalAcceptedRaw\": 140046, \"totalSubmissionRaw\": 274393, \"acRate\": \"51.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"527","questionFrontendId":"527","title":"Word Abbreviation","titleSlug":"word-abbreviation","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.9K\", \"totalSubmission\": \"42.7K\", \"totalAcceptedRaw\": 25866, \"totalSubmissionRaw\": 42671, \"acRate\": \"60.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"532","questionFrontendId":"532","title":"K-diff Pairs in an Array","titleSlug":"k-diff-pairs-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"287.7K\", \"totalSubmission\": \"699.9K\", \"totalAcceptedRaw\": 287711, \"totalSubmissionRaw\": 699894, \"acRate\": \"41.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"539","questionFrontendId":"539","title":"Minimum Time Difference","titleSlug":"minimum-time-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"121.4K\", \"totalSubmission\": \"215.4K\", \"totalAcceptedRaw\": 121424, \"totalSubmissionRaw\": 215391, \"acRate\": \"56.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"561","questionFrontendId":"561","title":"Array Partition","titleSlug":"array-partition","translatedTitle":null,"stats":"{\"totalAccepted\": \"389.2K\", \"totalSubmission\": \"504.6K\", \"totalAcceptedRaw\": 389241, \"totalSubmissionRaw\": 504560, \"acRate\": \"77.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting Sort","translatedName":null,"slug":"counting-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"581","questionFrontendId":"581","title":"Shortest Unsorted Continuous Subarray","titleSlug":"shortest-unsorted-continuous-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"298.7K\", \"totalSubmission\": \"820.3K\", \"totalAcceptedRaw\": 298714, \"totalSubmissionRaw\": 820281, \"acRate\": \"36.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"594","questionFrontendId":"594","title":"Longest Harmonious Subsequence","titleSlug":"longest-harmonious-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"132.5K\", \"totalSubmission\": \"247.8K\", \"totalAcceptedRaw\": 132474, \"totalSubmissionRaw\": 247770, \"acRate\": \"53.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"611","questionFrontendId":"611","title":"Valid Triangle Number","titleSlug":"valid-triangle-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"165.9K\", \"totalSubmission\": \"328.4K\", \"totalAcceptedRaw\": 165878, \"totalSubmissionRaw\": 328376, \"acRate\": \"50.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"621","questionFrontendId":"621","title":"Task Scheduler","titleSlug":"task-scheduler","translatedTitle":null,"stats":"{\"totalAccepted\": \"418.7K\", \"totalSubmission\": \"744K\", \"totalAcceptedRaw\": 418729, \"totalSubmissionRaw\": 743960, \"acRate\": \"56.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"628","questionFrontendId":"628","title":"Maximum Product of Three Numbers","titleSlug":"maximum-product-of-three-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"256.6K\", \"totalSubmission\": \"558.2K\", \"totalAcceptedRaw\": 256570, \"totalSubmissionRaw\": 558162, \"acRate\": \"46.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"632","questionFrontendId":"632","title":"Smallest Range Covering Elements from K Lists","titleSlug":"smallest-range-covering-elements-from-k-lists","translatedTitle":null,"stats":"{\"totalAccepted\": \"83.1K\", \"totalSubmission\": \"136.4K\", \"totalAcceptedRaw\": 83143, \"totalSubmissionRaw\": 136412, \"acRate\": \"60.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"645","questionFrontendId":"645","title":"Set Mismatch","titleSlug":"set-mismatch","translatedTitle":null,"stats":"{\"totalAccepted\": \"262.8K\", \"totalSubmission\": \"614.7K\", \"totalAcceptedRaw\": 262794, \"totalSubmissionRaw\": 614699, \"acRate\": \"42.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"646","questionFrontendId":"646","title":"Maximum Length of Pair Chain","titleSlug":"maximum-length-of-pair-chain","translatedTitle":null,"stats":"{\"totalAccepted\": \"132K\", \"totalSubmission\": \"233.5K\", \"totalAcceptedRaw\": 131968, \"totalSubmissionRaw\": 233467, \"acRate\": \"56.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"658","questionFrontendId":"658","title":"Find K Closest Elements","titleSlug":"find-k-closest-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"421.4K\", \"totalSubmission\": \"900.2K\", \"totalAcceptedRaw\": 421412, \"totalSubmissionRaw\": 900220, \"acRate\": \"46.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"692","questionFrontendId":"692","title":"Top K Frequent Words","titleSlug":"top-k-frequent-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"532.5K\", \"totalSubmission\": \"932.1K\", \"totalAcceptedRaw\": 532489, \"totalSubmissionRaw\": 932140, \"acRate\": \"57.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Bucket Sort","translatedName":null,"slug":"bucket-sort","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"719","questionFrontendId":"719","title":"Find K-th Smallest Pair Distance","titleSlug":"find-k-th-smallest-pair-distance","translatedTitle":null,"stats":"{\"totalAccepted\": \"74.1K\", \"totalSubmission\": \"201.8K\", \"totalAcceptedRaw\": 74084, \"totalSubmissionRaw\": 201821, \"acRate\": \"36.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"720","questionFrontendId":"720","title":"Longest Word in Dictionary","titleSlug":"longest-word-in-dictionary","translatedTitle":null,"stats":"{\"totalAccepted\": \"134.4K\", \"totalSubmission\": \"258.7K\", \"totalAcceptedRaw\": 134388, \"totalSubmissionRaw\": 258746, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"726","questionFrontendId":"726","title":"Number of Atoms","titleSlug":"number-of-atoms","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.4K\", \"totalSubmission\": \"100.6K\", \"totalAcceptedRaw\": 52417, \"totalSubmissionRaw\": 100570, \"acRate\": \"52.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"748","questionFrontendId":"747","title":"Largest Number At Least Twice of Others","titleSlug":"largest-number-at-least-twice-of-others","translatedTitle":null,"stats":"{\"totalAccepted\": \"197.8K\", \"totalSubmission\": \"420.5K\", \"totalAcceptedRaw\": 197796, \"totalSubmissionRaw\": 420511, \"acRate\": \"47.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"759","questionFrontendId":"757","title":"Set Intersection Size At Least Two","titleSlug":"set-intersection-size-at-least-two","translatedTitle":null,"stats":"{\"totalAccepted\": \"19K\", \"totalSubmission\": \"43.3K\", \"totalAcceptedRaw\": 18957, \"totalSubmissionRaw\": 43287, \"acRate\": \"43.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"761","questionFrontendId":"759","title":"Employee Free Time","titleSlug":"employee-free-time","translatedTitle":null,"stats":"{\"totalAccepted\": \"130.5K\", \"totalSubmission\": \"181.7K\", \"totalAcceptedRaw\": 130465, \"totalSubmissionRaw\": 181718, \"acRate\": \"71.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"778","questionFrontendId":"767","title":"Reorganize String","titleSlug":"reorganize-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"258.4K\", \"totalSubmission\": \"488.8K\", \"totalAcceptedRaw\": 258385, \"totalSubmissionRaw\": 488764, \"acRate\": \"52.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"779","questionFrontendId":"768","title":"Max Chunks To Make Sorted II","titleSlug":"max-chunks-to-make-sorted-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.3K\", \"totalSubmission\": \"99.1K\", \"totalAcceptedRaw\": 52309, \"totalSubmissionRaw\": 99052, \"acRate\": \"52.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"780","questionFrontendId":"769","title":"Max Chunks To Make Sorted","titleSlug":"max-chunks-to-make-sorted","translatedTitle":null,"stats":"{\"totalAccepted\": \"88.2K\", \"totalSubmission\": \"151.5K\", \"totalAcceptedRaw\": 88199, \"totalSubmissionRaw\": 151523, \"acRate\": \"58.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"802","questionFrontendId":"786","title":"K-th Smallest Prime Fraction","titleSlug":"k-th-smallest-prime-fraction","translatedTitle":null,"stats":"{\"totalAccepted\": \"34K\", \"totalSubmission\": \"65.9K\", \"totalAcceptedRaw\": 34000, \"totalSubmissionRaw\": 65946, \"acRate\": \"51.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"807","questionFrontendId":"791","title":"Custom Sort String","titleSlug":"custom-sort-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"210.9K\", \"totalSubmission\": \"304.9K\", \"totalAcceptedRaw\": 210867, \"totalSubmissionRaw\": 304922, \"acRate\": \"69.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"808","questionFrontendId":"792","title":"Number of Matching Subsequences","titleSlug":"number-of-matching-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"208K\", \"totalSubmission\": \"402.6K\", \"totalAcceptedRaw\": 207969, \"totalSubmissionRaw\": 402573, \"acRate\": \"51.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"852","questionFrontendId":"825","title":"Friends Of Appropriate Ages","titleSlug":"friends-of-appropriate-ages","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.7K\", \"totalSubmission\": \"152.6K\", \"totalAcceptedRaw\": 70689, \"totalSubmissionRaw\": 152584, \"acRate\": \"46.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"853","questionFrontendId":"826","title":"Most Profit Assigning Work","titleSlug":"most-profit-assigning-work","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.8K\", \"totalSubmission\": \"117.8K\", \"totalAcceptedRaw\": 52810, \"totalSubmissionRaw\": 117798, \"acRate\": \"44.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"862","questionFrontendId":"833","title":"Find And Replace in String","titleSlug":"find-and-replace-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"133.3K\", \"totalSubmission\": \"246.8K\", \"totalAcceptedRaw\": 133263, \"totalSubmissionRaw\": 246785, \"acRate\": \"54.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"876","questionFrontendId":"846","title":"Hand of Straights","titleSlug":"hand-of-straights","translatedTitle":null,"stats":"{\"totalAccepted\": \"113.5K\", \"totalSubmission\": \"201.8K\", \"totalAcceptedRaw\": 113453, \"totalSubmissionRaw\": 201770, \"acRate\": \"56.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"883","questionFrontendId":"853","title":"Car Fleet","titleSlug":"car-fleet","translatedTitle":null,"stats":"{\"totalAccepted\": \"129K\", \"totalSubmission\": \"256.6K\", \"totalAcceptedRaw\": 128974, \"totalSubmissionRaw\": 256638, \"acRate\": \"50.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"887","questionFrontendId":"857","title":"Minimum Cost to Hire K Workers","titleSlug":"minimum-cost-to-hire-k-workers","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.2K\", \"totalSubmission\": \"111.4K\", \"totalAcceptedRaw\": 58233, \"totalSubmissionRaw\": 111424, \"acRate\": \"52.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"894","questionFrontendId":"710","title":"Random Pick with Blacklist","titleSlug":"random-pick-with-blacklist","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.8K\", \"totalSubmission\": \"106.6K\", \"totalAcceptedRaw\": 35755, \"totalSubmissionRaw\": 106616, \"acRate\": \"33.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Randomized","translatedName":null,"slug":"randomized","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"900","questionFrontendId":"869","title":"Reordered Power of 2","titleSlug":"reordered-power-of-2","translatedTitle":null,"stats":"{\"totalAccepted\": \"106.5K\", \"totalSubmission\": \"167.5K\", \"totalAcceptedRaw\": 106544, \"totalSubmissionRaw\": 167538, \"acRate\": \"63.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"901","questionFrontendId":"870","title":"Advantage Shuffle","titleSlug":"advantage-shuffle","translatedTitle":null,"stats":"{\"totalAccepted\": \"59.8K\", \"totalSubmission\": \"115.3K\", \"totalAcceptedRaw\": 59785, \"totalSubmissionRaw\": 115308, \"acRate\": \"51.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"917","questionFrontendId":"881","title":"Boats to Save People","titleSlug":"boats-to-save-people","translatedTitle":null,"stats":"{\"totalAccepted\": \"173.4K\", \"totalSubmission\": \"326.8K\", \"totalAcceptedRaw\": 173407, \"totalSubmissionRaw\": 326835, \"acRate\": \"53.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"924","questionFrontendId":"888","title":"Fair Candy Swap","titleSlug":"fair-candy-swap","translatedTitle":null,"stats":"{\"totalAccepted\": \"99.4K\", \"totalSubmission\": \"163.8K\", \"totalAcceptedRaw\": 99438, \"totalSubmissionRaw\": 163833, \"acRate\": \"60.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"927","questionFrontendId":"891","title":"Sum of Subsequence Widths","titleSlug":"sum-of-subsequence-widths","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.3K\", \"totalSubmission\": \"50.1K\", \"totalAcceptedRaw\": 18328, \"totalSubmissionRaw\": 50080, \"acRate\": \"36.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"935","questionFrontendId":"899","title":"Orderly Queue","titleSlug":"orderly-queue","translatedTitle":null,"stats":"{\"totalAccepted\": \"64.3K\", \"totalSubmission\": \"96.9K\", \"totalAcceptedRaw\": 64299, \"totalSubmissionRaw\": 96906, \"acRate\": \"66.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"941","questionFrontendId":"905","title":"Sort Array By Parity","titleSlug":"sort-array-by-parity","translatedTitle":null,"stats":"{\"totalAccepted\": \"588.7K\", \"totalSubmission\": \"778.7K\", \"totalAcceptedRaw\": 588664, \"totalSubmissionRaw\": 778692, \"acRate\": \"75.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"946","questionFrontendId":"910","title":"Smallest Range II","titleSlug":"smallest-range-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.8K\", \"totalSubmission\": \"130.5K\", \"totalAcceptedRaw\": 45848, \"totalSubmissionRaw\": 130519, \"acRate\": \"35.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"948","questionFrontendId":"912","title":"Sort an Array","titleSlug":"sort-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"438.2K\", \"totalSubmission\": \"734K\", \"totalAcceptedRaw\": 438182, \"totalSubmissionRaw\": 733984, \"acRate\": \"59.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"},{"name":"Bucket Sort","translatedName":null,"slug":"bucket-sort","__typename":"TopicTagNode"},{"name":"Radix Sort","translatedName":null,"slug":"radix-sort","__typename":"TopicTagNode"},{"name":"Counting Sort","translatedName":null,"slug":"counting-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"958","questionFrontendId":"922","title":"Sort Array By Parity II","titleSlug":"sort-array-by-parity-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"213.8K\", \"totalSubmission\": \"302.6K\", \"totalAcceptedRaw\": 213847, \"totalSubmissionRaw\": 302555, \"acRate\": \"70.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"959","questionFrontendId":"923","title":"3Sum With Multiplicity","titleSlug":"3sum-with-multiplicity","translatedTitle":null,"stats":"{\"totalAccepted\": \"95.4K\", \"totalSubmission\": \"210.5K\", \"totalAcceptedRaw\": 95352, \"totalSubmissionRaw\": 210469, \"acRate\": \"45.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"974","questionFrontendId":"937","title":"Reorder Data in Log Files","titleSlug":"reorder-data-in-log-files","translatedTitle":null,"stats":"{\"totalAccepted\": \"340.3K\", \"totalSubmission\": \"603.5K\", \"totalAcceptedRaw\": 340321, \"totalSubmissionRaw\": 603482, \"acRate\": \"56.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"976","questionFrontendId":"939","title":"Minimum Area Rectangle","titleSlug":"minimum-area-rectangle","translatedTitle":null,"stats":"{\"totalAccepted\": \"121.1K\", \"totalSubmission\": \"228.9K\", \"totalAcceptedRaw\": 121134, \"totalSubmissionRaw\": 228875, \"acRate\": \"52.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"982","questionFrontendId":"945","title":"Minimum Increment to Make Array Unique","titleSlug":"minimum-increment-to-make-array-unique","translatedTitle":null,"stats":"{\"totalAccepted\": \"73.2K\", \"totalSubmission\": \"143.3K\", \"totalAcceptedRaw\": 73166, \"totalSubmissionRaw\": 143320, \"acRate\": \"51.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"985","questionFrontendId":"948","title":"Bag of Tokens","titleSlug":"bag-of-tokens","translatedTitle":null,"stats":"{\"totalAccepted\": \"100.2K\", \"totalSubmission\": \"192.4K\", \"totalAcceptedRaw\": 100213, \"totalSubmissionRaw\": 192421, \"acRate\": \"52.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"987","questionFrontendId":"950","title":"Reveal Cards In Increasing Order","titleSlug":"reveal-cards-in-increasing-order","translatedTitle":null,"stats":"{\"totalAccepted\": \"66.1K\", \"totalSubmission\": \"85K\", \"totalAcceptedRaw\": 66089, \"totalSubmissionRaw\": 85005, \"acRate\": \"77.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"991","questionFrontendId":"954","title":"Array of Doubled Pairs","titleSlug":"array-of-doubled-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"80.4K\", \"totalSubmission\": \"205.8K\", \"totalAcceptedRaw\": 80389, \"totalSubmissionRaw\": 205809, \"acRate\": \"39.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1009","questionFrontendId":"969","title":"Pancake Sorting","titleSlug":"pancake-sorting","translatedTitle":null,"stats":"{\"totalAccepted\": \"82.7K\", \"totalSubmission\": \"118K\", \"totalAcceptedRaw\": 82721, \"totalSubmissionRaw\": 118018, \"acRate\": \"70.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1014","questionFrontendId":"973","title":"K Closest Points to Origin","titleSlug":"k-closest-points-to-origin","translatedTitle":null,"stats":"{\"totalAccepted\": \"955.7K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 955670, \"totalSubmissionRaw\": 1453778, \"acRate\": \"65.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Quickselect","translatedName":null,"slug":"quickselect","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1018","questionFrontendId":"976","title":"Largest Perimeter Triangle","titleSlug":"largest-perimeter-triangle","translatedTitle":null,"stats":"{\"totalAccepted\": \"198.2K\", \"totalSubmission\": \"362.7K\", \"totalAcceptedRaw\": 198155, \"totalSubmissionRaw\": 362737, \"acRate\": \"54.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1019","questionFrontendId":"977","title":"Squares of a Sorted Array","titleSlug":"squares-of-a-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 1359168, \"totalSubmissionRaw\": 1890450, \"acRate\": \"71.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1047","questionFrontendId":"1005","title":"Maximize Sum Of Array After K Negations","titleSlug":"maximize-sum-of-array-after-k-negations","translatedTitle":null,"stats":"{\"totalAccepted\": \"69.5K\", \"totalSubmission\": \"136.6K\", \"totalAcceptedRaw\": 69504, \"totalSubmissionRaw\": 136616, \"acRate\": \"50.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1052","questionFrontendId":"1057","title":"Campus Bikes","titleSlug":"campus-bikes","translatedTitle":null,"stats":"{\"totalAccepted\": \"64.1K\", \"totalSubmission\": \"111.2K\", \"totalAcceptedRaw\": 64088, \"totalSubmissionRaw\": 111192, \"acRate\": \"57.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1074","questionFrontendId":"1086","title":"High Five","titleSlug":"high-five","translatedTitle":null,"stats":"{\"totalAccepted\": \"93.2K\", \"totalSubmission\": \"124.1K\", \"totalAcceptedRaw\": 93171, \"totalSubmissionRaw\": 124138, \"acRate\": \"75.1%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1075","questionFrontendId":"1065","title":"Index Pairs of a String","titleSlug":"index-pairs-of-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.7K\", \"totalSubmission\": \"32.5K\", \"totalAcceptedRaw\": 20743, \"totalSubmissionRaw\": 32527, \"acRate\": \"63.8%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1083","questionFrontendId":"1099","title":"Two Sum Less Than K","titleSlug":"two-sum-less-than-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.6K\", \"totalSubmission\": \"187.8K\", \"totalAcceptedRaw\": 114602, \"totalSubmissionRaw\": 187804, \"acRate\": \"61.0%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1094","questionFrontendId":"1030","title":"Matrix Cells in Distance Order","titleSlug":"matrix-cells-in-distance-order","translatedTitle":null,"stats":"{\"totalAccepted\": \"49.2K\", \"totalSubmission\": \"70.7K\", \"totalAcceptedRaw\": 49221, \"totalSubmissionRaw\": 70684, \"acRate\": \"69.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1095","questionFrontendId":"1029","title":"Two City Scheduling","titleSlug":"two-city-scheduling","translatedTitle":null,"stats":"{\"totalAccepted\": \"209.2K\", \"totalSubmission\": \"320.9K\", \"totalAcceptedRaw\": 209220, \"totalSubmissionRaw\": 320892, \"acRate\": \"65.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1098","questionFrontendId":"1133","title":"Largest Unique Number","titleSlug":"largest-unique-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.8K\", \"totalSubmission\": \"56K\", \"totalAcceptedRaw\": 37833, \"totalSubmissionRaw\": 55972, \"acRate\": \"67.6%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1108","questionFrontendId":"1152","title":"Analyze User Website Visit Pattern","titleSlug":"analyze-user-website-visit-pattern","translatedTitle":null,"stats":"{\"totalAccepted\": \"86.8K\", \"totalSubmission\": \"201.2K\", \"totalAcceptedRaw\": 86798, \"totalSubmissionRaw\": 201226, \"acRate\": \"43.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1113","questionFrontendId":"1040","title":"Moving Stones Until Consecutive II","titleSlug":"moving-stones-until-consecutive-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"15.4K\", \"totalAcceptedRaw\": 8595, \"totalSubmissionRaw\": 15395, \"acRate\": \"55.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1132","questionFrontendId":"1181","title":"Before and After Puzzle","titleSlug":"before-and-after-puzzle","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"20.4K\", \"totalAcceptedRaw\": 9235, \"totalSubmissionRaw\": 20399, \"acRate\": \"45.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1137","questionFrontendId":"1051","title":"Height Checker","titleSlug":"height-checker","translatedTitle":null,"stats":"{\"totalAccepted\": \"262.1K\", \"totalSubmission\": \"347K\", \"totalAcceptedRaw\": 262075, \"totalSubmissionRaw\": 346967, \"acRate\": \"75.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting Sort","translatedName":null,"slug":"counting-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1140","questionFrontendId":"1054","title":"Distant Barcodes","titleSlug":"distant-barcodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.1K\", \"totalSubmission\": \"78.8K\", \"totalAcceptedRaw\": 36058, \"totalSubmissionRaw\": 78752, \"acRate\": \"45.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1141","questionFrontendId":"1196","title":"How Many Apples Can You Put into the Basket","titleSlug":"how-many-apples-can-you-put-into-the-basket","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.9K\", \"totalSubmission\": \"37.3K\", \"totalAcceptedRaw\": 24909, \"totalSubmissionRaw\": 37253, \"acRate\": \"66.9%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1165","questionFrontendId":"1229","title":"Meeting Scheduler","titleSlug":"meeting-scheduler","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.8K\", \"totalSubmission\": \"128.2K\", \"totalAcceptedRaw\": 70827, \"totalSubmissionRaw\": 128196, \"acRate\": \"55.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1169","questionFrontendId":"1090","title":"Largest Values From Labels","titleSlug":"largest-values-from-labels","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.6K\", \"totalSubmission\": \"53.4K\", \"totalAcceptedRaw\": 32604, \"totalSubmissionRaw\": 53384, \"acRate\": \"61.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1176","questionFrontendId":"1244","title":"Design A Leaderboard","titleSlug":"design-a-leaderboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"60.1K\", \"totalSubmission\": \"87.5K\", \"totalAcceptedRaw\": 60121, \"totalSubmissionRaw\": 87539, \"acRate\": \"68.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1184","questionFrontendId":"1094","title":"Car Pooling","titleSlug":"car-pooling","translatedTitle":null,"stats":"{\"totalAccepted\": \"188K\", \"totalSubmission\": \"330.1K\", \"totalAcceptedRaw\": 187965, \"totalSubmissionRaw\": 330098, \"acRate\": \"56.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1210","questionFrontendId":"1619","title":"Mean of Array After Removing Some Elements","titleSlug":"mean-of-array-after-removing-some-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.6K\", \"totalSubmission\": \"66.4K\", \"totalAcceptedRaw\": 43598, \"totalSubmissionRaw\": 66417, \"acRate\": \"65.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1217","questionFrontendId":"1122","title":"Relative Sort Array","titleSlug":"relative-sort-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"152.5K\", \"totalSubmission\": \"222.3K\", \"totalAcceptedRaw\": 152506, \"totalSubmissionRaw\": 222307, \"acRate\": \"68.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting Sort","translatedName":null,"slug":"counting-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1222","questionFrontendId":"1288","title":"Remove Covered Intervals","titleSlug":"remove-covered-intervals","translatedTitle":null,"stats":"{\"totalAccepted\": \"106.5K\", \"totalSubmission\": \"186.8K\", \"totalAcceptedRaw\": 106503, \"totalSubmissionRaw\": 186779, \"acRate\": \"57.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1232","questionFrontendId":"1300","title":"Sum of Mutated Array Closest to Target","titleSlug":"sum-of-mutated-array-closest-to-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.2K\", \"totalSubmission\": \"73.8K\", \"totalAcceptedRaw\": 32155, \"totalSubmissionRaw\": 73832, \"acRate\": \"43.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1253","questionFrontendId":"1329","title":"Sort the Matrix Diagonally","titleSlug":"sort-the-matrix-diagonally","translatedTitle":null,"stats":"{\"totalAccepted\": \"144.4K\", \"totalSubmission\": \"173.2K\", \"totalAcceptedRaw\": 144427, \"totalSubmissionRaw\": 173250, \"acRate\": \"83.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1256","questionFrontendId":"1331","title":"Rank Transform of an Array","titleSlug":"rank-transform-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"81.3K\", \"totalSubmission\": \"137.2K\", \"totalAcceptedRaw\": 81289, \"totalSubmissionRaw\": 137244, \"acRate\": \"59.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1272","questionFrontendId":"1169","title":"Invalid Transactions","titleSlug":"invalid-transactions","translatedTitle":null,"stats":"{\"totalAccepted\": \"60.2K\", \"totalSubmission\": \"192.9K\", \"totalAcceptedRaw\": 60216, \"totalSubmissionRaw\": 192888, \"acRate\": \"31.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1273","questionFrontendId":"1170","title":"Compare Strings by Frequency of the Smallest Character","titleSlug":"compare-strings-by-frequency-of-the-smallest-character","translatedTitle":null,"stats":"{\"totalAccepted\": \"72.1K\", \"totalSubmission\": \"117.3K\", \"totalAcceptedRaw\": 72132, \"totalSubmissionRaw\": 117266, \"acRate\": \"61.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1306","questionFrontendId":"1200","title":"Minimum Absolute Difference","titleSlug":"minimum-absolute-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"152.5K\", \"totalSubmission\": \"219.1K\", \"totalAcceptedRaw\": 152549, \"totalSubmissionRaw\": 219064, \"acRate\": \"69.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1333","questionFrontendId":"2191","title":"Sort the Jumbled Numbers","titleSlug":"sort-the-jumbled-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.1K\", \"totalSubmission\": \"35.2K\", \"totalAcceptedRaw\": 16103, \"totalSubmissionRaw\": 35182, \"acRate\": \"45.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1352","questionFrontendId":"1235","title":"Maximum Profit in Job Scheduling","titleSlug":"maximum-profit-in-job-scheduling","translatedTitle":null,"stats":"{\"totalAccepted\": \"178.8K\", \"totalSubmission\": \"334.7K\", \"totalAcceptedRaw\": 178833, \"totalSubmissionRaw\": 334691, \"acRate\": \"53.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1353","questionFrontendId":"2273","title":"Find Resultant Array After Removing Anagrams","titleSlug":"find-resultant-array-after-removing-anagrams","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.4K\", \"totalSubmission\": \"65.7K\", \"totalAcceptedRaw\": 38388, \"totalSubmissionRaw\": 65727, \"acRate\": \"58.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1354","questionFrontendId":"2225","title":"Find Players With Zero or One Losses","titleSlug":"find-players-with-zero-or-one-losses","translatedTitle":null,"stats":"{\"totalAccepted\": \"89K\", \"totalSubmission\": \"122.4K\", \"totalAcceptedRaw\": 88955, \"totalSubmissionRaw\": 122438, \"acRate\": \"72.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1367","questionFrontendId":"1691","title":"Maximum Height by Stacking Cuboids ","titleSlug":"maximum-height-by-stacking-cuboids","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.1K\", \"totalSubmission\": \"31.5K\", \"totalAcceptedRaw\": 17144, \"totalSubmissionRaw\": 31539, \"acRate\": \"54.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1422","questionFrontendId":"1296","title":"Divide Array in Sets of K Consecutive Numbers","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.9K\", \"totalSubmission\": \"125.6K\", \"totalAcceptedRaw\": 70940, \"totalSubmissionRaw\": 125609, \"acRate\": \"56.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1427","questionFrontendId":"1305","title":"All Elements in Two Binary Search Trees","titleSlug":"all-elements-in-two-binary-search-trees","translatedTitle":null,"stats":"{\"totalAccepted\": \"186.3K\", \"totalSubmission\": \"233.3K\", \"totalAcceptedRaw\": 186260, \"totalSubmissionRaw\": 233326, \"acRate\": \"79.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1436","questionFrontendId":"1311","title":"Get Watched Videos by Your Friends","titleSlug":"get-watched-videos-by-your-friends","translatedTitle":null,"stats":"{\"totalAccepted\": \"18K\", \"totalSubmission\": \"39.2K\", \"totalAcceptedRaw\": 17986, \"totalSubmissionRaw\": 39164, \"acRate\": \"45.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1455","questionFrontendId":"1333","title":"Filter Restaurants by Vegan-Friendly, Price and Distance","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.1K\", \"totalSubmission\": \"43.4K\", \"totalAcceptedRaw\": 26081, \"totalSubmissionRaw\": 43442, \"acRate\": \"60.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1458","questionFrontendId":"1356","title":"Sort Integers by The Number of 1 Bits","titleSlug":"sort-integers-by-the-number-of-1-bits","translatedTitle":null,"stats":"{\"totalAccepted\": \"106.6K\", \"totalSubmission\": \"146.1K\", \"totalAcceptedRaw\": 106562, \"totalSubmissionRaw\": 146099, \"acRate\": \"72.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1463","questionFrontendId":"1337","title":"The K Weakest Rows in a Matrix","titleSlug":"the-k-weakest-rows-in-a-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"236.7K\", \"totalSubmission\": \"328.2K\", \"totalAcceptedRaw\": 236728, \"totalSubmissionRaw\": 328219, \"acRate\": \"72.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1464","questionFrontendId":"1338","title":"Reduce Array Size to The Half","titleSlug":"reduce-array-size-to-the-half","translatedTitle":null,"stats":"{\"totalAccepted\": \"169.1K\", \"totalSubmission\": \"243.5K\", \"totalAcceptedRaw\": 169119, \"totalSubmissionRaw\": 243543, \"acRate\": \"69.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1466","questionFrontendId":"1340","title":"Jump Game V","titleSlug":"jump-game-v","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.8K\", \"totalSubmission\": \"39.7K\", \"totalAcceptedRaw\": 24845, \"totalSubmissionRaw\": 39736, \"acRate\": \"62.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1468","questionFrontendId":"1346","title":"Check If N and Its Double Exist","titleSlug":"check-if-n-and-its-double-exist","translatedTitle":null,"stats":"{\"totalAccepted\": \"272.7K\", \"totalSubmission\": \"746.9K\", \"totalAcceptedRaw\": 272653, \"totalSubmissionRaw\": 746897, \"acRate\": \"36.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1470","questionFrontendId":"1348","title":"Tweet Counts Per Frequency","titleSlug":"tweet-counts-per-frequency","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.9K\", \"totalSubmission\": \"68.2K\", \"totalAcceptedRaw\": 29914, \"totalSubmissionRaw\": 68209, \"acRate\": \"43.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1478","questionFrontendId":"1353","title":"Maximum Number of Events That Can Be Attended","titleSlug":"maximum-number-of-events-that-can-be-attended","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.8K\", \"totalSubmission\": \"208K\", \"totalAcceptedRaw\": 67778, \"totalSubmissionRaw\": 208031, \"acRate\": \"32.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1482","questionFrontendId":"1365","title":"How Many Numbers Are Smaller Than the Current Number","titleSlug":"how-many-numbers-are-smaller-than-the-current-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"414.7K\", \"totalSubmission\": \"478.5K\", \"totalAcceptedRaw\": 414663, \"totalSubmissionRaw\": 478465, \"acRate\": \"86.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1483","questionFrontendId":"1366","title":"Rank Teams by Votes","titleSlug":"rank-teams-by-votes","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.6K\", \"totalSubmission\": \"89.1K\", \"totalAcceptedRaw\": 51621, \"totalSubmissionRaw\": 89105, \"acRate\": \"57.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1486","questionFrontendId":"1385","title":"Find the Distance Value Between Two Arrays","titleSlug":"find-the-distance-value-between-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.5K\", \"totalSubmission\": \"118.2K\", \"totalAcceptedRaw\": 78467, \"totalSubmissionRaw\": 118199, \"acRate\": \"66.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1488","questionFrontendId":"1387","title":"Sort Integers by The Power Value","titleSlug":"sort-integers-by-the-power-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"75.6K\", \"totalSubmission\": \"107.9K\", \"totalAcceptedRaw\": 75629, \"totalSubmissionRaw\": 107916, \"acRate\": \"70.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1499","questionFrontendId":"1383","title":"Maximum Performance of a Team","titleSlug":"maximum-performance-of-a-team","translatedTitle":null,"stats":"{\"totalAccepted\": \"85.7K\", \"totalSubmission\": \"176.8K\", \"totalAcceptedRaw\": 85743, \"totalSubmissionRaw\": 176760, \"acRate\": \"48.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1503","questionFrontendId":"1402","title":"Reducing Dishes","titleSlug":"reducing-dishes","translatedTitle":null,"stats":"{\"totalAccepted\": \"53.8K\", \"totalSubmission\": \"74.8K\", \"totalAcceptedRaw\": 53835, \"totalSubmissionRaw\": 74750, \"acRate\": \"72.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1519","questionFrontendId":"1403","title":"Minimum Subsequence in Non-Increasing Order","titleSlug":"minimum-subsequence-in-non-increasing-order","translatedTitle":null,"stats":"{\"totalAccepted\": \"60K\", \"totalSubmission\": \"83K\", \"totalAcceptedRaw\": 60001, \"totalSubmissionRaw\": 83033, \"acRate\": \"72.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1530","questionFrontendId":"1433","title":"Check If a String Can Break Another String","titleSlug":"check-if-a-string-can-break-another-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.2K\", \"totalSubmission\": \"51.1K\", \"totalAcceptedRaw\": 35226, \"totalSubmissionRaw\": 51128, \"acRate\": \"68.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1533","questionFrontendId":"1418","title":"Display Table of Food Orders in a Restaurant","titleSlug":"display-table-of-food-orders-in-a-restaurant","translatedTitle":null,"stats":"{\"totalAccepted\": \"23K\", \"totalSubmission\": \"31K\", \"totalAcceptedRaw\": 22977, \"totalSubmissionRaw\": 31012, \"acRate\": \"74.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1539","questionFrontendId":"1424","title":"Diagonal Traverse II","titleSlug":"diagonal-traverse-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"47.3K\", \"totalSubmission\": \"93.6K\", \"totalAcceptedRaw\": 47272, \"totalSubmissionRaw\": 93638, \"acRate\": \"50.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1556","questionFrontendId":"1460","title":"Make Two Arrays Equal by Reversing Subarrays","titleSlug":"make-two-arrays-equal-by-reversing-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"103.9K\", \"totalSubmission\": \"143.9K\", \"totalAcceptedRaw\": 103880, \"totalSubmissionRaw\": 143902, \"acRate\": \"72.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1561","questionFrontendId":"1451","title":"Rearrange Words in a Sentence","titleSlug":"rearrange-words-in-a-sentence","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.8K\", \"totalSubmission\": \"69.4K\", \"totalAcceptedRaw\": 43767, \"totalSubmissionRaw\": 69432, \"acRate\": \"63.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1571","questionFrontendId":"1478","title":"Allocate Mailboxes","titleSlug":"allocate-mailboxes","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"35.8K\", \"totalAcceptedRaw\": 19894, \"totalSubmissionRaw\": 35815, \"acRate\": \"55.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1574","questionFrontendId":"1464","title":"Maximum Product of Two Elements in an Array","titleSlug":"maximum-product-of-two-elements-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"181.9K\", \"totalSubmission\": \"227.8K\", \"totalAcceptedRaw\": 181946, \"totalSubmissionRaw\": 227843, \"acRate\": \"79.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1575","questionFrontendId":"1465","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"159.7K\", \"totalSubmission\": \"390.8K\", \"totalAcceptedRaw\": 159692, \"totalSubmissionRaw\": 390781, \"acRate\": \"40.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1581","questionFrontendId":"1471","title":"The k Strongest Values in an Array","titleSlug":"the-k-strongest-values-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"33K\", \"totalSubmission\": \"54.7K\", \"totalAcceptedRaw\": 33022, \"totalSubmissionRaw\": 54653, \"acRate\": \"60.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1584","questionFrontendId":"1491","title":"Average Salary Excluding the Minimum and Maximum Salary","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary","translatedTitle":null,"stats":"{\"totalAccepted\": \"196.2K\", \"totalSubmission\": \"319.5K\", \"totalAcceptedRaw\": 196204, \"totalSubmissionRaw\": 319505, \"acRate\": \"61.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1604","questionFrontendId":"1481","title":"Least Number of Unique Integers after K Removals","titleSlug":"least-number-of-unique-integers-after-k-removals","translatedTitle":null,"stats":"{\"totalAccepted\": \"93.8K\", \"totalSubmission\": \"168.3K\", \"totalAcceptedRaw\": 93784, \"totalSubmissionRaw\": 168316, \"acRate\": \"55.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1613","questionFrontendId":"1489","title":"Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.7K\", \"totalSubmission\": \"20.5K\", \"totalAcceptedRaw\": 10749, \"totalSubmissionRaw\": 20460, \"acRate\": \"52.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Minimum Spanning Tree","translatedName":null,"slug":"minimum-spanning-tree","__typename":"TopicTagNode"},{"name":"Strongly Connected Component","translatedName":null,"slug":"strongly-connected-component","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1615","questionFrontendId":"1508","title":"Range Sum of Sorted Subarray Sums","titleSlug":"range-sum-of-sorted-subarray-sums","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.1K\", \"totalSubmission\": \"54.3K\", \"totalAcceptedRaw\": 32071, \"totalSubmissionRaw\": 54334, \"acRate\": \"59.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1616","questionFrontendId":"1509","title":"Minimum Difference Between Largest and Smallest Value in Three Moves","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves","translatedTitle":null,"stats":"{\"totalAccepted\": \"74.2K\", \"totalSubmission\": \"135.9K\", \"totalAcceptedRaw\": 74224, \"totalSubmissionRaw\": 135894, \"acRate\": \"54.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1621","questionFrontendId":"1498","title":"Number of Subsequences That Satisfy the Given Sum Condition","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.5K\", \"totalSubmission\": \"107.8K\", \"totalAcceptedRaw\": 40464, \"totalSubmissionRaw\": 107781, \"acRate\": \"37.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1626","questionFrontendId":"1502","title":"Can Make Arithmetic Progression From Sequence","titleSlug":"can-make-arithmetic-progression-from-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"125.1K\", \"totalSubmission\": \"184.7K\", \"totalAcceptedRaw\": 125124, \"totalSubmissionRaw\": 184691, \"acRate\": \"67.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1675","questionFrontendId":"1552","title":"Magnetic Force Between Two Balls","titleSlug":"magnetic-force-between-two-balls","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.4K\", \"totalSubmission\": \"68K\", \"totalAcceptedRaw\": 39385, \"totalSubmissionRaw\": 67953, \"acRate\": \"58.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1683","questionFrontendId":"1561","title":"Maximum Number of Coins You Can Get","titleSlug":"maximum-number-of-coins-you-can-get","translatedTitle":null,"stats":"{\"totalAccepted\": \"64K\", \"totalSubmission\": \"81K\", \"totalAcceptedRaw\": 64033, \"totalSubmissionRaw\": 80980, \"acRate\": \"79.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1695","questionFrontendId":"1589","title":"Maximum Sum Obtained of Any Permutation","titleSlug":"maximum-sum-obtained-of-any-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.6K\", \"totalSubmission\": \"41.9K\", \"totalAcceptedRaw\": 15609, \"totalSubmissionRaw\": 41932, \"acRate\": \"37.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1703","questionFrontendId":"1564","title":"Put Boxes Into the Warehouse I","titleSlug":"put-boxes-into-the-warehouse-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"21.2K\", \"totalAcceptedRaw\": 14227, \"totalSubmissionRaw\": 21220, \"acRate\": \"67.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1707","questionFrontendId":"1585","title":"Check If String Is Transformable With Substring Sort Operations","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"14.3K\", \"totalAcceptedRaw\": 6857, \"totalSubmissionRaw\": 14302, \"acRate\": \"47.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1709","questionFrontendId":"1604","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.1K\", \"totalSubmission\": \"61.9K\", \"totalAcceptedRaw\": 29087, \"totalSubmissionRaw\": 61891, \"acRate\": \"47.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1719","questionFrontendId":"1580","title":"Put Boxes Into the Warehouse II","titleSlug":"put-boxes-into-the-warehouse-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.9K\", \"totalSubmission\": \"6.1K\", \"totalAcceptedRaw\": 3901, \"totalSubmissionRaw\": 6120, \"acRate\": \"63.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1730","questionFrontendId":"1608","title":"Special Array With X Elements Greater Than or Equal X","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.5K\", \"totalSubmission\": \"105.1K\", \"totalAcceptedRaw\": 63520, \"totalSubmissionRaw\": 105100, \"acRate\": \"60.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1733","questionFrontendId":"1610","title":"Maximum Number of Visible Points","titleSlug":"maximum-number-of-visible-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"36K\", \"totalSubmission\": \"96.4K\", \"totalAcceptedRaw\": 35953, \"totalSubmissionRaw\": 96401, \"acRate\": \"37.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1741","questionFrontendId":"1636","title":"Sort Array by Increasing Frequency","titleSlug":"sort-array-by-increasing-frequency","translatedTitle":null,"stats":"{\"totalAccepted\": \"91.4K\", \"totalSubmission\": \"131.6K\", \"totalAcceptedRaw\": 91396, \"totalSubmissionRaw\": 131557, \"acRate\": \"69.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1742","questionFrontendId":"1637","title":"Widest Vertical Area Between Two Points Containing No Points","titleSlug":"widest-vertical-area-between-two-points-containing-no-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.2K\", \"totalSubmission\": \"45.3K\", \"totalAcceptedRaw\": 38243, \"totalSubmissionRaw\": 45342, \"acRate\": \"84.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1748","questionFrontendId":"1626","title":"Best Team With No Conflicts","titleSlug":"best-team-with-no-conflicts","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.1K\", \"totalSubmission\": \"137.1K\", \"totalAcceptedRaw\": 70104, \"totalSubmissionRaw\": 137060, \"acRate\": \"51.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1752","questionFrontendId":"1630","title":"Arithmetic Subarrays","titleSlug":"arithmetic-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.7K\", \"totalSubmission\": \"60.6K\", \"totalAcceptedRaw\": 48685, \"totalSubmissionRaw\": 60630, \"acRate\": \"80.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1770","questionFrontendId":"1647","title":"Minimum Deletions to Make Character Frequencies Unique","titleSlug":"minimum-deletions-to-make-character-frequencies-unique","translatedTitle":null,"stats":"{\"totalAccepted\": \"169.5K\", \"totalSubmission\": \"286.8K\", \"totalAcceptedRaw\": 169527, \"totalSubmissionRaw\": 286787, \"acRate\": \"59.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1771","questionFrontendId":"1648","title":"Sell Diminishing-Valued Colored Balls","titleSlug":"sell-diminishing-valued-colored-balls","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.5K\", \"totalSubmission\": \"113.5K\", \"totalAcceptedRaw\": 34526, \"totalSubmissionRaw\": 113477, \"acRate\": \"30.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1777","questionFrontendId":"1657","title":"Determine if Two Strings Are Close","titleSlug":"determine-if-two-strings-are-close","translatedTitle":null,"stats":"{\"totalAccepted\": \"105.3K\", \"totalSubmission\": \"186.9K\", \"totalAcceptedRaw\": 105273, \"totalSubmissionRaw\": 186937, \"acRate\": \"56.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1784","questionFrontendId":"1665","title":"Minimum Initial Energy to Finish Tasks","titleSlug":"minimum-initial-energy-to-finish-tasks","translatedTitle":null,"stats":"{\"totalAccepted\": \"14K\", \"totalSubmission\": \"24.9K\", \"totalAcceptedRaw\": 14037, \"totalSubmissionRaw\": 24933, \"acRate\": \"56.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1788","questionFrontendId":"1686","title":"Stone Game VI","titleSlug":"stone-game-vi","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"25.9K\", \"totalAcceptedRaw\": 14167, \"totalSubmissionRaw\": 25862, \"acRate\": \"54.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1798","questionFrontendId":"1679","title":"Max Number of K-Sum Pairs","titleSlug":"max-number-of-k-sum-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"121.5K\", \"totalSubmission\": \"212.1K\", \"totalAcceptedRaw\": 121487, \"totalSubmissionRaw\": 212103, \"acRate\": \"57.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1815","questionFrontendId":"1697","title":"Checking Existence of Edge Length Limited Paths","titleSlug":"checking-existence-of-edge-length-limited-paths","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.4K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 12436, \"totalSubmissionRaw\": 24505, \"acRate\": \"50.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1829","questionFrontendId":"1710","title":"Maximum Units on a Truck","titleSlug":"maximum-units-on-a-truck","translatedTitle":null,"stats":"{\"totalAccepted\": \"261.9K\", \"totalSubmission\": \"354.9K\", \"totalAcceptedRaw\": 261930, \"totalSubmissionRaw\": 354850, \"acRate\": \"73.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1845","questionFrontendId":"1727","title":"Largest Submatrix With Rearrangements","titleSlug":"largest-submatrix-with-rearrangements","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.9K\", \"totalSubmission\": \"24.3K\", \"totalAcceptedRaw\": 14854, \"totalSubmissionRaw\": 24260, \"acRate\": \"61.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1919","questionFrontendId":"1772","title":"Sort Features by Popularity","titleSlug":"sort-features-by-popularity","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.9K\", \"totalSubmission\": \"7.5K\", \"totalAcceptedRaw\": 4874, \"totalSubmissionRaw\": 7485, \"acRate\": \"65.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1946","questionFrontendId":"1818","title":"Minimum Absolute Sum Difference","titleSlug":"minimum-absolute-sum-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.4K\", \"totalSubmission\": \"67.1K\", \"totalAcceptedRaw\": 20353, \"totalSubmissionRaw\": 67143, \"acRate\": \"30.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1956","questionFrontendId":"1846","title":"Maximum Element After Decreasing and Rearranging","titleSlug":"maximum-element-after-decreasing-and-rearranging","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.9K\", \"totalSubmission\": \"32K\", \"totalAcceptedRaw\": 18864, \"totalSubmissionRaw\": 32037, \"acRate\": \"58.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1957","questionFrontendId":"1847","title":"Closest Room","titleSlug":"closest-room","translatedTitle":null,"stats":"{\"totalAccepted\": \"7K\", \"totalSubmission\": \"19.7K\", \"totalAcceptedRaw\": 7004, \"totalSubmissionRaw\": 19690, \"acRate\": \"35.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1961","questionFrontendId":"1833","title":"Maximum Ice Cream Bars","titleSlug":"maximum-ice-cream-bars","translatedTitle":null,"stats":"{\"totalAccepted\": \"137.8K\", \"totalSubmission\": \"186.2K\", \"totalAcceptedRaw\": 137810, \"totalSubmissionRaw\": 186235, \"acRate\": \"74.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1962","questionFrontendId":"1834","title":"Single-Threaded CPU","titleSlug":"single-threaded-cpu","translatedTitle":null,"stats":"{\"totalAccepted\": \"86.3K\", \"totalSubmission\": \"188.5K\", \"totalAcceptedRaw\": 86272, \"totalSubmissionRaw\": 188526, \"acRate\": \"45.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1966","questionFrontendId":"1838","title":"Frequency of the Most Frequent Element","titleSlug":"frequency-of-the-most-frequent-element","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.9K\", \"totalSubmission\": \"101.8K\", \"totalAcceptedRaw\": 39940, \"totalSubmissionRaw\": 101833, \"acRate\": \"39.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1970","questionFrontendId":"1859","title":"Sorting the Sentence","titleSlug":"sorting-the-sentence","translatedTitle":null,"stats":"{\"totalAccepted\": \"108.6K\", \"totalSubmission\": \"129.2K\", \"totalAcceptedRaw\": 108606, \"totalSubmissionRaw\": 129177, \"acRate\": \"84.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1977","questionFrontendId":"1851","title":"Minimum Interval to Include Each Query","titleSlug":"minimum-interval-to-include-each-query","translatedTitle":null,"stats":"{\"totalAccepted\": \"16K\", \"totalSubmission\": \"33.2K\", \"totalAcceptedRaw\": 16003, \"totalSubmissionRaw\": 33222, \"acRate\": \"48.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Line Sweep","translatedName":null,"slug":"line-sweep","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1988","questionFrontendId":"1877","title":"Minimize Maximum Pair Sum in Array","titleSlug":"minimize-maximum-pair-sum-in-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"70K\", \"totalSubmission\": \"87.6K\", \"totalAcceptedRaw\": 69969, \"totalSubmissionRaw\": 87552, \"acRate\": \"79.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1990","questionFrontendId":"1878","title":"Get Biggest Three Rhombus Sums in a Grid","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.4K\", \"totalSubmission\": \"26.3K\", \"totalAcceptedRaw\": 12381, \"totalSubmissionRaw\": 26283, \"acRate\": \"47.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1992","questionFrontendId":"2046","title":"Sort Linked List Already Sorted Using Absolute Values","titleSlug":"sort-linked-list-already-sorted-using-absolute-values","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.8K\", \"totalSubmission\": \"7K\", \"totalAcceptedRaw\": 4766, \"totalSubmissionRaw\": 6950, \"acRate\": \"68.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2016","questionFrontendId":"1887","title":"Reduction Operations to Make the Array Elements Equal","titleSlug":"reduction-operations-to-make-the-array-elements-equal","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.9K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 20864, \"totalSubmissionRaw\": 33405, \"acRate\": \"62.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2018","questionFrontendId":"1889","title":"Minimum Space Wasted From Packaging","titleSlug":"minimum-space-wasted-from-packaging","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.2K\", \"totalSubmission\": \"32.6K\", \"totalAcceptedRaw\": 10157, \"totalSubmissionRaw\": 32556, \"acRate\": \"31.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2029","questionFrontendId":"1874","title":"Minimize Product Sum of Two Arrays","titleSlug":"minimize-product-sum-of-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"16K\", \"totalSubmission\": \"17.7K\", \"totalAcceptedRaw\": 15987, \"totalSubmissionRaw\": 17747, \"acRate\": \"90.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2036","questionFrontendId":"1885","title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"7.5K\", \"totalAcceptedRaw\": 4440, \"totalSubmissionRaw\": 7475, \"acRate\": \"59.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2042","questionFrontendId":"1913","title":"Maximum Product Difference Between Two Pairs","titleSlug":"maximum-product-difference-between-two-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"80.5K\", \"totalSubmission\": \"99K\", \"totalAcceptedRaw\": 80476, \"totalSubmissionRaw\": 98993, \"acRate\": \"81.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2049","questionFrontendId":"1921","title":"Eliminate Maximum Number of Monsters","titleSlug":"eliminate-maximum-number-of-monsters","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.4K\", \"totalSubmission\": \"57.1K\", \"totalAcceptedRaw\": 21359, \"totalSubmissionRaw\": 57147, \"acRate\": \"37.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2085","questionFrontendId":"1968","title":"Array With Elements Not Equal to Average of Neighbors","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.7K\", \"totalSubmission\": \"47.9K\", \"totalAcceptedRaw\": 23710, \"totalSubmissionRaw\": 47894, \"acRate\": \"49.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2112","questionFrontendId":"1984","title":"Minimum Difference Between Highest and Lowest of K Scores","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores","translatedTitle":null,"stats":"{\"totalAccepted\": \"41.9K\", \"totalSubmission\": \"77.1K\", \"totalAcceptedRaw\": 41912, \"totalSubmissionRaw\": 77077, \"acRate\": \"54.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2113","questionFrontendId":"1985","title":"Find the Kth Largest Integer in the Array","titleSlug":"find-the-kth-largest-integer-in-the-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.8K\", \"totalSubmission\": \"100.7K\", \"totalAcceptedRaw\": 44825, \"totalSubmissionRaw\": 100665, \"acRate\": \"44.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Quickselect","translatedName":null,"slug":"quickselect","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2117","questionFrontendId":"2007","title":"Find Original Array From Doubled Array","titleSlug":"find-original-array-from-doubled-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"117.3K\", \"totalSubmission\": \"288.1K\", \"totalAcceptedRaw\": 117298, \"totalSubmissionRaw\": 288074, \"acRate\": \"40.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2118","questionFrontendId":"2008","title":"Maximum Earnings From Taxi","titleSlug":"maximum-earnings-from-taxi","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.1K\", \"totalSubmission\": \"48.3K\", \"totalAcceptedRaw\": 21055, \"totalSubmissionRaw\": 48338, \"acRate\": \"43.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2123","questionFrontendId":"1996","title":"The Number of Weak Characters in the Game","titleSlug":"the-number-of-weak-characters-in-the-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"93.5K\", \"totalSubmission\": \"212.6K\", \"totalAcceptedRaw\": 93510, \"totalSubmissionRaw\": 212637, \"acRate\": \"44.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2125","questionFrontendId":"1998","title":"GCD Sort of an Array","titleSlug":"gcd-sort-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.6K\", \"totalSubmission\": \"14.5K\", \"totalAcceptedRaw\": 6629, \"totalSubmissionRaw\": 14522, \"acRate\": \"45.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2142","questionFrontendId":"2015","title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5K\", \"totalSubmission\": \"2.6K\", \"totalAcceptedRaw\": 1530, \"totalSubmissionRaw\": 2598, \"acRate\": \"58.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2148","questionFrontendId":"2037","title":"Minimum Number of Moves to Seat Everyone","titleSlug":"minimum-number-of-moves-to-seat-everyone","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.3K\", \"totalSubmission\": \"55.2K\", \"totalAcceptedRaw\": 45305, \"totalSubmissionRaw\": 55218, \"acRate\": \"82.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2160","questionFrontendId":"2033","title":"Minimum Operations to Make a Uni-Value Grid","titleSlug":"minimum-operations-to-make-a-uni-value-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.6K\", \"totalSubmission\": \"35.5K\", \"totalAcceptedRaw\": 18604, \"totalSubmissionRaw\": 35485, \"acRate\": \"52.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2164","questionFrontendId":"2054","title":"Two Best Non-Overlapping Events","titleSlug":"two-best-non-overlapping-events","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"29.4K\", \"totalAcceptedRaw\": 13290, \"totalSubmissionRaw\": 29383, \"acRate\": \"45.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2179","questionFrontendId":"2070","title":"Most Beautiful Item for Each Query","titleSlug":"most-beautiful-item-for-each-query","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.1K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 12139, \"totalSubmissionRaw\": 24501, \"acRate\": \"49.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2180","questionFrontendId":"2071","title":"Maximum Number of Tasks You Can Assign","titleSlug":"maximum-number-of-tasks-you-can-assign","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.5K\", \"totalSubmission\": \"19.2K\", \"totalAcceptedRaw\": 6516, \"totalSubmissionRaw\": 19174, \"acRate\": \"34.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Queue","translatedName":null,"slug":"monotonic-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2204","questionFrontendId":"2099","title":"Find Subsequence of Length K With the Largest Sum","titleSlug":"find-subsequence-of-length-k-with-the-largest-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"32K\", \"totalSubmission\": \"74.7K\", \"totalAcceptedRaw\": 31997, \"totalSubmissionRaw\": 74653, \"acRate\": \"42.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2210","questionFrontendId":"2089","title":"Find Target Indices After Sorting Array","titleSlug":"find-target-indices-after-sorting-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"109.3K\", \"totalSubmission\": \"143K\", \"totalAcceptedRaw\": 109283, \"totalSubmissionRaw\": 142997, \"acRate\": \"76.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2213","questionFrontendId":"2092","title":"Find All People With Secret","titleSlug":"find-all-people-with-secret","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.4K\", \"totalSubmission\": \"59.7K\", \"totalAcceptedRaw\": 20415, \"totalSubmissionRaw\": 59709, \"acRate\": \"34.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2215","questionFrontendId":"2094","title":"Finding 3-Digit Even Numbers","titleSlug":"finding-3-digit-even-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"38.7K\", \"totalAcceptedRaw\": 22314, \"totalSubmissionRaw\": 38660, \"acRate\": \"57.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2241","questionFrontendId":"2122","title":"Recover the Original Array","titleSlug":"recover-the-original-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.7K\", \"totalSubmission\": \"22.6K\", \"totalAcceptedRaw\": 8715, \"totalSubmissionRaw\": 22649, \"acRate\": \"38.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2242","questionFrontendId":"2098","title":"Subsequence of Size K With the Largest Even Sum","titleSlug":"subsequence-of-size-k-with-the-largest-even-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"5.6K\", \"totalAcceptedRaw\": 2158, \"totalSubmissionRaw\": 5635, \"acRate\": \"38.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2245","questionFrontendId":"2126","title":"Destroying Asteroids","titleSlug":"destroying-asteroids","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.9K\", \"totalSubmission\": \"54K\", \"totalAcceptedRaw\": 26949, \"totalSubmissionRaw\": 53973, \"acRate\": \"49.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2248","questionFrontendId":"2144","title":"Minimum Cost of Buying Candies With Discount","titleSlug":"minimum-cost-of-buying-candies-with-discount","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.6K\", \"totalSubmission\": \"56.7K\", \"totalAcceptedRaw\": 34602, \"totalSubmissionRaw\": 56738, \"acRate\": \"61.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2250","questionFrontendId":"2146","title":"K Highest Ranked Items Within a Price Range","titleSlug":"k-highest-ranked-items-within-a-price-range","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.2K\", \"totalSubmission\": \"29.5K\", \"totalAcceptedRaw\": 12198, \"totalSubmissionRaw\": 29500, \"acRate\": \"41.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2256","questionFrontendId":"2135","title":"Count Words Obtained After Adding a Letter","titleSlug":"count-words-obtained-after-adding-a-letter","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.3K\", \"totalSubmission\": \"68.4K\", \"totalAcceptedRaw\": 29298, \"totalSubmissionRaw\": 68420, \"acRate\": \"42.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2257","questionFrontendId":"2136","title":"Earliest Possible Day of Full Bloom","titleSlug":"earliest-possible-day-of-full-bloom","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.9K\", \"totalSubmission\": \"63.7K\", \"totalAcceptedRaw\": 46910, \"totalSubmissionRaw\": 63699, \"acRate\": \"73.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2263","questionFrontendId":"2141","title":"Maximum Running Time of N Computers","titleSlug":"maximum-running-time-of-n-computers","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.1K\", \"totalSubmission\": \"28.2K\", \"totalAcceptedRaw\": 11072, \"totalSubmissionRaw\": 28244, \"acRate\": \"39.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2264","questionFrontendId":"2160","title":"Minimum Sum of Four Digit Number After Splitting Digits","titleSlug":"minimum-sum-of-four-digit-number-after-splitting-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.9K\", \"totalSubmission\": \"90.8K\", \"totalAcceptedRaw\": 78926, \"totalSubmissionRaw\": 90768, \"acRate\": \"87.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2269","questionFrontendId":"2148","title":"Count Elements With Strictly Smaller and Greater Elements ","titleSlug":"count-elements-with-strictly-smaller-and-greater-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.9K\", \"totalSubmission\": \"66.9K\", \"totalAcceptedRaw\": 39942, \"totalSubmissionRaw\": 66858, \"acRate\": \"59.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2274","questionFrontendId":"2154","title":"Keep Multiplying Found Values by Two","titleSlug":"keep-multiplying-found-values-by-two","translatedTitle":null,"stats":"{\"totalAccepted\": \"62.5K\", \"totalSubmission\": \"86K\", \"totalAcceptedRaw\": 62522, \"totalSubmissionRaw\": 86045, \"acRate\": \"72.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2283","questionFrontendId":"2164","title":"Sort Even and Odd Indices Independently","titleSlug":"sort-even-and-odd-indices-independently","translatedTitle":null,"stats":"{\"totalAccepted\": \"41.9K\", \"totalSubmission\": \"64.3K\", \"totalAcceptedRaw\": 41890, \"totalSubmissionRaw\": 64345, \"acRate\": \"65.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2284","questionFrontendId":"2165","title":"Smallest Value of the Rearranged Number","titleSlug":"smallest-value-of-the-rearranged-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.7K\", \"totalSubmission\": \"54K\", \"totalAcceptedRaw\": 27747, \"totalSubmissionRaw\": 53984, \"acRate\": \"51.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2290","questionFrontendId":"2171","title":"Removing Minimum Number of Magic Beans","titleSlug":"removing-minimum-number-of-magic-beans","translatedTitle":null,"stats":"{\"totalAccepted\": \"21K\", \"totalSubmission\": \"49.8K\", \"totalAcceptedRaw\": 20955, \"totalSubmissionRaw\": 49835, \"acRate\": \"42.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2305","questionFrontendId":"2195","title":"Append K Integers With Minimal Sum","titleSlug":"append-k-integers-with-minimal-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.5K\", \"totalSubmission\": \"102.1K\", \"totalAcceptedRaw\": 25530, \"totalSubmissionRaw\": 102065, \"acRate\": \"25.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2327","questionFrontendId":"2231","title":"Largest Number After Digit Swaps by Parity","titleSlug":"largest-number-after-digit-swaps-by-parity","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.6K\", \"totalSubmission\": \"50.1K\", \"totalAcceptedRaw\": 30571, \"totalSubmissionRaw\": 50095, \"acRate\": \"61.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2330","questionFrontendId":"2234","title":"Maximum Total Beauty of the Gardens","titleSlug":"maximum-total-beauty-of-the-gardens","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"18.6K\", \"totalAcceptedRaw\": 5305, \"totalSubmissionRaw\": 18638, \"acRate\": \"28.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2333","questionFrontendId":"2250","title":"Count Number of Rectangles Containing Each Point","titleSlug":"count-number-of-rectangles-containing-each-point","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.8K\", \"totalSubmission\": \"34.7K\", \"totalAcceptedRaw\": 11822, \"totalSubmissionRaw\": 34677, \"acRate\": \"34.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2334","questionFrontendId":"2251","title":"Number of Flowers in Full Bloom","titleSlug":"number-of-flowers-in-full-bloom","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.5K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 12546, \"totalSubmissionRaw\": 24455, \"acRate\": \"51.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2353","questionFrontendId":"2242","title":"Maximum Score of a Node Sequence","titleSlug":"maximum-score-of-a-node-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.5K\", \"totalSubmission\": \"25K\", \"totalAcceptedRaw\": 9480, \"totalSubmissionRaw\": 25018, \"acRate\": \"37.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2355","questionFrontendId":"2274","title":"Maximum Consecutive Floors Without Special Floors","titleSlug":"maximum-consecutive-floors-without-special-floors","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.2K\", \"totalSubmission\": \"48.4K\", \"totalAcceptedRaw\": 25229, \"totalSubmissionRaw\": 48396, \"acRate\": \"52.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2359","questionFrontendId":"2271","title":"Maximum White Tiles Covered by a Carpet","titleSlug":"maximum-white-tiles-covered-by-a-carpet","translatedTitle":null,"stats":"{\"totalAccepted\": \"13K\", \"totalSubmission\": \"39.5K\", \"totalAcceptedRaw\": 13026, \"totalSubmissionRaw\": 39479, \"acRate\": \"33.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2366","questionFrontendId":"2279","title":"Maximum Bags With Full Capacity of Rocks","titleSlug":"maximum-bags-with-full-capacity-of-rocks","translatedTitle":null,"stats":"{\"totalAccepted\": \"83.8K\", \"totalSubmission\": \"123.7K\", \"totalAcceptedRaw\": 83818, \"totalSubmissionRaw\": 123739, \"acRate\": \"67.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2367","questionFrontendId":"2280","title":"Minimum Lines to Represent a Line Chart","titleSlug":"minimum-lines-to-represent-a-line-chart","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.8K\", \"totalSubmission\": \"89.9K\", \"totalAcceptedRaw\": 21814, \"totalSubmissionRaw\": 89888, \"acRate\": \"24.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Geometry","translatedName":null,"slug":"geometry","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2379","questionFrontendId":"2285","title":"Maximum Total Importance of Roads","titleSlug":"maximum-total-importance-of-roads","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.3K\", \"totalSubmission\": \"40K\", \"totalAcceptedRaw\": 24300, \"totalSubmissionRaw\": 40007, \"acRate\": \"60.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2387","questionFrontendId":"2294","title":"Partition Array Such That Maximum Difference Is K","titleSlug":"partition-array-such-that-maximum-difference-is-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.3K\", \"totalSubmission\": \"41.8K\", \"totalAcceptedRaw\": 30346, \"totalSubmissionRaw\": 41759, \"acRate\": \"72.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2392","questionFrontendId":"2300","title":"Successful Pairs of Spells and Potions","titleSlug":"successful-pairs-of-spells-and-potions","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"68.7K\", \"totalAcceptedRaw\": 22286, \"totalSubmissionRaw\": 68695, \"acRate\": \"32.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2405","questionFrontendId":"2268","title":"Minimum Number of Keypresses","titleSlug":"minimum-number-of-keypresses","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.5K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 10547, \"totalSubmissionRaw\": 14412, \"acRate\": \"73.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2412","questionFrontendId":"2335","title":"Minimum Amount of Time to Fill Cups","titleSlug":"minimum-amount-of-time-to-fill-cups","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.4K\", \"totalSubmission\": \"59.4K\", \"totalAcceptedRaw\": 33420, \"totalSubmissionRaw\": 59380, \"acRate\": \"56.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2417","questionFrontendId":"2332","title":"The Latest Time to Catch a Bus","titleSlug":"the-latest-time-to-catch-a-bus","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.2K\", \"totalSubmission\": \"56.3K\", \"totalAcceptedRaw\": 13185, \"totalSubmissionRaw\": 56331, \"acRate\": \"23.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2418","questionFrontendId":"2333","title":"Minimum Sum of Squared Difference","titleSlug":"minimum-sum-of-squared-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"11K\", \"totalSubmission\": \"42.9K\", \"totalAcceptedRaw\": 10958, \"totalSubmissionRaw\": 42935, \"acRate\": \"25.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2422","questionFrontendId":"2343","title":"Query Kth Smallest Trimmed Number","titleSlug":"query-kth-smallest-trimmed-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.7K\", \"totalSubmission\": \"50.2K\", \"totalAcceptedRaw\": 20742, \"totalSubmissionRaw\": 50189, \"acRate\": \"41.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Radix Sort","translatedName":null,"slug":"radix-sort","__typename":"TopicTagNode"},{"name":"Quickselect","translatedName":null,"slug":"quickselect","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2423","questionFrontendId":"2344","title":"Minimum Deletions to Make Array Divisible","titleSlug":"minimum-deletions-to-make-array-divisible","translatedTitle":null,"stats":"{\"totalAccepted\": \"23K\", \"totalSubmission\": \"40.6K\", \"totalAcceptedRaw\": 23032, \"totalSubmissionRaw\": 40557, \"acRate\": \"56.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2436","questionFrontendId":"2357","title":"Make Array Zero by Subtracting Equal Amounts","titleSlug":"make-array-zero-by-subtracting-equal-amounts","translatedTitle":null,"stats":"{\"totalAccepted\": \"62.3K\", \"totalSubmission\": \"85.7K\", \"totalAcceptedRaw\": 62276, \"totalSubmissionRaw\": 85663, \"acRate\": \"72.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2447","questionFrontendId":"2363","title":"Merge Similar Items","titleSlug":"merge-similar-items","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.8K\", \"totalSubmission\": \"46.1K\", \"totalAcceptedRaw\": 34843, \"totalSubmissionRaw\": 46123, \"acRate\": \"75.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2458","questionFrontendId":"2323","title":"Find Minimum Time to Finish All Jobs II","titleSlug":"find-minimum-time-to-finish-all-jobs-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6K\", \"totalSubmission\": \"2.1K\", \"totalAcceptedRaw\": 1571, \"totalSubmissionRaw\": 2128, \"acRate\": \"73.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2462","questionFrontendId":"2386","title":"Find the K-Sum of an Array","titleSlug":"find-the-k-sum-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"18K\", \"totalAcceptedRaw\": 6933, \"totalSubmissionRaw\": 18020, \"acRate\": \"38.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2469","questionFrontendId":"2389","title":"Longest Subsequence With Limited Sum","titleSlug":"longest-subsequence-with-limited-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.6K\", \"totalSubmission\": \"108.3K\", \"totalAcceptedRaw\": 78564, \"totalSubmissionRaw\": 108317, \"acRate\": \"72.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2473","questionFrontendId":"2342","title":"Max Sum of a Pair With Equal Sum of Digits","titleSlug":"max-sum-of-a-pair-with-equal-sum-of-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.4K\", \"totalSubmission\": \"58.9K\", \"totalAcceptedRaw\": 31426, \"totalSubmissionRaw\": 58890, \"acRate\": \"53.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2479","questionFrontendId":"2402","title":"Meeting Rooms III","titleSlug":"meeting-rooms-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.7K\", \"totalSubmission\": \"46.9K\", \"totalAcceptedRaw\": 15746, \"totalSubmissionRaw\": 46921, \"acRate\": \"33.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2485","questionFrontendId":"2345","title":"Finding the Number of Visible Mountains","titleSlug":"finding-the-number-of-visible-mountains","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"7.7K\", \"totalAcceptedRaw\": 3252, \"totalSubmissionRaw\": 7697, \"acRate\": \"42.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2488","questionFrontendId":"2406","title":"Divide Intervals Into Minimum Number of Groups","titleSlug":"divide-intervals-into-minimum-number-of-groups","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.3K\", \"totalSubmission\": \"44.2K\", \"totalAcceptedRaw\": 20310, \"totalSubmissionRaw\": 44185, \"acRate\": \"46.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2489","questionFrontendId":"2459","title":"Sort Array by Moving Items to Empty Space","titleSlug":"sort-array-by-moving-items-to-empty-space","translatedTitle":null,"stats":"{\"totalAccepted\": \"461\", \"totalSubmission\": \"889\", \"totalAcceptedRaw\": 461, \"totalSubmissionRaw\": 889, \"acRate\": \"51.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2497","questionFrontendId":"2410","title":"Maximum Matching of Players With Trainers","titleSlug":"maximum-matching-of-players-with-trainers","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.7K\", \"totalSubmission\": \"37.3K\", \"totalAcceptedRaw\": 22709, \"totalSubmissionRaw\": 37287, \"acRate\": \"60.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2499","questionFrontendId":"2412","title":"Minimum Money Required Before Transactions","titleSlug":"minimum-money-required-before-transactions","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.3K\", \"totalSubmission\": \"21.1K\", \"totalAcceptedRaw\": 8349, \"totalSubmissionRaw\": 21061, \"acRate\": \"39.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2502","questionFrontendId":"2418","title":"Sort the People","titleSlug":"sort-the-people","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.9K\", \"totalSubmission\": \"81.3K\", \"totalAcceptedRaw\": 65943, \"totalSubmissionRaw\": 81260, \"acRate\": \"81.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2506","questionFrontendId":"2371","title":"Minimize Maximum Value in a Grid","titleSlug":"minimize-maximum-value-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"890\", \"totalSubmission\": \"1.2K\", \"totalAcceptedRaw\": 890, \"totalSubmissionRaw\": 1249, \"acRate\": \"71.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2538","questionFrontendId":"2448","title":"Minimum Cost to Make Array Equal","titleSlug":"minimum-cost-to-make-array-equal","translatedTitle":null,"stats":"{\"totalAccepted\": \"12K\", \"totalSubmission\": \"34.4K\", \"totalAcceptedRaw\": 11957, \"totalSubmissionRaw\": 34361, \"acRate\": \"34.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2539","questionFrontendId":"2449","title":"Minimum Number of Operations to Make Arrays Similar","titleSlug":"minimum-number-of-operations-to-make-arrays-similar","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.9K\", \"totalSubmission\": \"13.9K\", \"totalAcceptedRaw\": 8918, \"totalSubmissionRaw\": 13937, \"acRate\": \"64.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2543","questionFrontendId":"2456","title":"Most Popular Video Creator","titleSlug":"most-popular-video-creator","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.6K\", \"totalSubmission\": \"40.2K\", \"totalAcceptedRaw\": 17613, \"totalSubmissionRaw\": 40196, \"acRate\": \"43.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2549","questionFrontendId":"2454","title":"Next Greater Element IV","titleSlug":"next-greater-element-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"15.9K\", \"totalAcceptedRaw\": 6338, \"totalSubmissionRaw\": 15923, \"acRate\": \"39.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2554","questionFrontendId":"2463","title":"Minimum Total Distance Traveled","titleSlug":"minimum-total-distance-traveled","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 5861, \"totalSubmissionRaw\": 14423, \"acRate\": \"40.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2561","questionFrontendId":"2465","title":"Number of Distinct Averages","titleSlug":"number-of-distinct-averages","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.3K\", \"totalSubmission\": \"43.3K\", \"totalAcceptedRaw\": 25253, \"totalSubmissionRaw\": 43315, \"acRate\": \"58.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2581","questionFrontendId":"2491","title":"Divide Players Into Teams of Equal Skill","titleSlug":"divide-players-into-teams-of-equal-skill","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.5K\", \"totalSubmission\": \"38.3K\", \"totalAcceptedRaw\": 22498, \"totalSubmissionRaw\": 38254, \"acRate\": \"58.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2585","questionFrontendId":"2500","title":"Delete Greatest Value in Each Row","titleSlug":"delete-greatest-value-in-each-row","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.2K\", \"totalSubmission\": \"34.8K\", \"totalAcceptedRaw\": 28225, \"totalSubmissionRaw\": 34835, \"acRate\": \"81.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2586","questionFrontendId":"2501","title":"Longest Square Streak in an Array","titleSlug":"longest-square-streak-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"19K\", \"totalSubmission\": \"47.9K\", \"totalAcceptedRaw\": 18961, \"totalSubmissionRaw\": 47944, \"acRate\": \"39.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2588","questionFrontendId":"2503","title":"Maximum Number of Points From Grid Queries","titleSlug":"maximum-number-of-points-from-grid-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.2K\", \"totalSubmission\": \"16.6K\", \"totalAcceptedRaw\": 6160, \"totalSubmissionRaw\": 16650, \"acRate\": \"37.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2590","questionFrontendId":"2497","title":"Maximum Star Sum of a Graph","titleSlug":"maximum-star-sum-of-a-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.6K\", \"totalSubmission\": \"30.2K\", \"totalAcceptedRaw\": 11609, \"totalSubmissionRaw\": 30211, \"acRate\": \"38.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2600","questionFrontendId":"2517","title":"Maximum Tastiness of Candy Basket","titleSlug":"maximum-tastiness-of-candy-basket","translatedTitle":null,"stats":"{\"totalAccepted\": \"10K\", \"totalSubmission\": \"15.5K\", \"totalAcceptedRaw\": 10013, \"totalSubmissionRaw\": 15511, \"acRate\": \"64.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2603","questionFrontendId":"2512","title":"Reward Top K Students","titleSlug":"reward-top-k-students","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.3K\", \"totalSubmission\": \"26.5K\", \"totalAcceptedRaw\": 12320, \"totalSubmissionRaw\": 26513, \"acRate\": \"46.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2631","questionFrontendId":"2545","title":"Sort the Students by Their Kth Score","titleSlug":"sort-the-students-by-their-kth-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.2K\", \"totalSubmission\": \"32.8K\", \"totalAcceptedRaw\": 28199, \"totalSubmissionRaw\": 32847, \"acRate\": \"85.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2636","questionFrontendId":"2542","title":"Maximum Subsequence Score","titleSlug":"maximum-subsequence-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.7K\", \"totalSubmission\": \"20.3K\", \"totalAcceptedRaw\": 7704, \"totalSubmissionRaw\": 20288, \"acRate\": \"38.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2640","questionFrontendId":"2554","title":"Maximum Number of Integers to Choose From a Range I","titleSlug":"maximum-number-of-integers-to-choose-from-a-range-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.7K\", \"totalSubmission\": \"39.5K\", \"totalAcceptedRaw\": 20691, \"totalSubmissionRaw\": 39493, \"acRate\": \"52.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2650","questionFrontendId":"2578","title":"Split With Minimum Sum","titleSlug":"split-with-minimum-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.2K\", \"totalSubmission\": \"24.8K\", \"totalAcceptedRaw\": 17210, \"totalSubmissionRaw\": 24837, \"acRate\": \"69.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2651","questionFrontendId":"2580","title":"Count Ways to Group Overlapping Ranges","titleSlug":"count-ways-to-group-overlapping-ranges","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"30.8K\", \"totalAcceptedRaw\": 10636, \"totalSubmissionRaw\": 30783, \"acRate\": \"34.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2655","questionFrontendId":"2587","title":"Rearrange Array to Maximize Prefix Score","titleSlug":"rearrange-array-to-maximize-prefix-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.1K\", \"totalSubmission\": \"46.3K\", \"totalAcceptedRaw\": 18144, \"totalSubmissionRaw\": 46316, \"acRate\": \"39.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2657","questionFrontendId":"2589","title":"Minimum Time to Complete All Tasks","titleSlug":"minimum-time-to-complete-all-tasks","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"12.6K\", \"totalAcceptedRaw\": 4351, \"totalSubmissionRaw\": 12553, \"acRate\": \"34.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2681","questionFrontendId":"2551","title":"Put Marbles in Bags","titleSlug":"put-marbles-in-bags","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"16.3K\", \"totalAcceptedRaw\": 8604, \"totalSubmissionRaw\": 16291, \"acRate\": \"52.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2693","questionFrontendId":"2548","title":"Maximum Price to Fill a Bag","titleSlug":"maximum-price-to-fill-a-bag","translatedTitle":null,"stats":"{\"totalAccepted\": \"699\", \"totalSubmission\": \"1K\", \"totalAcceptedRaw\": 699, \"totalSubmissionRaw\": 1013, \"acRate\": \"69.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2699","questionFrontendId":"2563","title":"Count the Number of Fair Pairs","titleSlug":"count-the-number-of-fair-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.4K\", \"totalSubmission\": \"51.5K\", \"totalAcceptedRaw\": 16374, \"totalSubmissionRaw\": 51502, \"acRate\": \"31.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2702","questionFrontendId":"2557","title":"Maximum Number of Integers to Choose From a Range II","titleSlug":"maximum-number-of-integers-to-choose-from-a-range-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"682\", \"totalSubmission\": \"1.5K\", \"totalAcceptedRaw\": 682, \"totalSubmissionRaw\": 1491, \"acRate\": \"45.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2706","questionFrontendId":"2567","title":"Minimum Score by Changing Two Elements","titleSlug":"minimum-score-by-changing-two-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.4K\", \"totalSubmission\": \"26.1K\", \"totalAcceptedRaw\": 12419, \"totalSubmissionRaw\": 26129, \"acRate\": \"47.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2712","questionFrontendId":"2576","title":"Find the Maximum Number of Marked Indices","titleSlug":"find-the-maximum-number-of-marked-indices","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.1K\", \"totalSubmission\": \"35.2K\", \"totalAcceptedRaw\": 13091, \"totalSubmissionRaw\": 35197, \"acRate\": \"37.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/tmp/stack-graphql.json b/tmp/stack-graphql.json
new file mode 100644
index 000000000..332bb7661
--- /dev/null
+++ b/tmp/stack-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"Stack","translatedName":null,"slug":"stack","questions":[{"status":null,"questionId":"20","questionFrontendId":"20","title":"Valid Parentheses","titleSlug":"valid-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.1M\", \"totalSubmission\": \"7.7M\", \"totalAcceptedRaw\": 3116954, \"totalSubmissionRaw\": 7739006, \"acRate\": \"40.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"32","questionFrontendId":"32","title":"Longest Valid Parentheses","titleSlug":"longest-valid-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"603.2K\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 603209, \"totalSubmissionRaw\": 1839027, \"acRate\": \"32.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"42","questionFrontendId":"42","title":"Trapping Rain Water","titleSlug":"trapping-rain-water","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5M\", \"totalSubmission\": \"2.5M\", \"totalAcceptedRaw\": 1475865, \"totalSubmissionRaw\": 2493706, \"acRate\": \"59.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"71","questionFrontendId":"71","title":"Simplify Path","titleSlug":"simplify-path","translatedTitle":null,"stats":"{\"totalAccepted\": \"494.2K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 494222, \"totalSubmissionRaw\": 1257132, \"acRate\": \"39.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"84","questionFrontendId":"84","title":"Largest Rectangle in Histogram","titleSlug":"largest-rectangle-in-histogram","translatedTitle":null,"stats":"{\"totalAccepted\": \"646.6K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 646589, \"totalSubmissionRaw\": 1520203, \"acRate\": \"42.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"85","questionFrontendId":"85","title":"Maximal Rectangle","titleSlug":"maximal-rectangle","translatedTitle":null,"stats":"{\"totalAccepted\": \"338K\", \"totalSubmission\": \"756.6K\", \"totalAcceptedRaw\": 337961, \"totalSubmissionRaw\": 756591, \"acRate\": \"44.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"94","questionFrontendId":"94","title":"Binary Tree Inorder Traversal","titleSlug":"binary-tree-inorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.9M\", \"totalSubmission\": \"2.6M\", \"totalAcceptedRaw\": 1938413, \"totalSubmissionRaw\": 2629905, \"acRate\": \"73.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"114","questionFrontendId":"114","title":"Flatten Binary Tree to Linked List","titleSlug":"flatten-binary-tree-to-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"758K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 757996, \"totalSubmissionRaw\": 1227848, \"acRate\": \"61.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"143","questionFrontendId":"143","title":"Reorder List","titleSlug":"reorder-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"645.1K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 645075, \"totalSubmissionRaw\": 1232075, \"acRate\": \"52.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"144","questionFrontendId":"144","title":"Binary Tree Preorder Traversal","titleSlug":"binary-tree-preorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 1279305, \"totalSubmissionRaw\": 1917628, \"acRate\": \"66.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"145","questionFrontendId":"145","title":"Binary Tree Postorder Traversal","titleSlug":"binary-tree-postorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"924.9K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 924886, \"totalSubmissionRaw\": 1364034, \"acRate\": \"67.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"150","questionFrontendId":"150","title":"Evaluate Reverse Polish Notation","titleSlug":"evaluate-reverse-polish-notation","translatedTitle":null,"stats":"{\"totalAccepted\": \"632.6K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 632644, \"totalSubmissionRaw\": 1385846, \"acRate\": \"45.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"155","questionFrontendId":"155","title":"Min Stack","titleSlug":"min-stack","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 1222663, \"totalSubmissionRaw\": 2339017, \"acRate\": \"52.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"173","questionFrontendId":"173","title":"Binary Search Tree Iterator","titleSlug":"binary-search-tree-iterator","translatedTitle":null,"stats":"{\"totalAccepted\": \"659.8K\", \"totalSubmission\": \"947.2K\", \"totalAcceptedRaw\": 659778, \"totalSubmissionRaw\": 947231, \"acRate\": \"69.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"},{"name":"Iterator","translatedName":null,"slug":"iterator","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"224","questionFrontendId":"224","title":"Basic Calculator","titleSlug":"basic-calculator","translatedTitle":null,"stats":"{\"totalAccepted\": \"373.8K\", \"totalSubmission\": \"881.3K\", \"totalAcceptedRaw\": 373768, \"totalSubmissionRaw\": 881324, \"acRate\": \"42.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"225","questionFrontendId":"225","title":"Implement Stack using Queues","titleSlug":"implement-stack-using-queues","translatedTitle":null,"stats":"{\"totalAccepted\": \"433.5K\", \"totalSubmission\": \"741K\", \"totalAcceptedRaw\": 433544, \"totalSubmissionRaw\": 741004, \"acRate\": \"58.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"227","questionFrontendId":"227","title":"Basic Calculator II","titleSlug":"basic-calculator-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"507.3K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 507338, \"totalSubmissionRaw\": 1196563, \"acRate\": \"42.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"232","questionFrontendId":"232","title":"Implement Queue using Stacks","titleSlug":"implement-queue-using-stacks","translatedTitle":null,"stats":"{\"totalAccepted\": \"632.2K\", \"totalSubmission\": \"1M\", \"totalAcceptedRaw\": 632207, \"totalSubmissionRaw\": 1001899, \"acRate\": \"63.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"234","questionFrontendId":"234","title":"Palindrome Linked List","titleSlug":"palindrome-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.8M\", \"totalAcceptedRaw\": 1393619, \"totalSubmissionRaw\": 2779640, \"acRate\": \"50.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"255","questionFrontendId":"255","title":"Verify Preorder Sequence in Binary Search Tree","titleSlug":"verify-preorder-sequence-in-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.1K\", \"totalSubmission\": \"145.3K\", \"totalAcceptedRaw\": 70070, \"totalSubmissionRaw\": 145309, \"acRate\": \"48.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"272","questionFrontendId":"272","title":"Closest Binary Search Tree Value II","titleSlug":"closest-binary-search-tree-value-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"110K\", \"totalSubmission\": \"188.3K\", \"totalAcceptedRaw\": 109964, \"totalSubmissionRaw\": 188323, \"acRate\": \"58.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"316","questionFrontendId":"316","title":"Remove Duplicate Letters","titleSlug":"remove-duplicate-letters","translatedTitle":null,"stats":"{\"totalAccepted\": \"224.6K\", \"totalSubmission\": \"499.8K\", \"totalAcceptedRaw\": 224630, \"totalSubmissionRaw\": 499842, \"acRate\": \"44.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"321","questionFrontendId":"321","title":"Create Maximum Number","titleSlug":"create-maximum-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"54K\", \"totalSubmission\": \"185.8K\", \"totalAcceptedRaw\": 53983, \"totalSubmissionRaw\": 185802, \"acRate\": \"29.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"331","questionFrontendId":"331","title":"Verify Preorder Serialization of a Binary Tree","titleSlug":"verify-preorder-serialization-of-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"127.4K\", \"totalSubmission\": \"286K\", \"totalAcceptedRaw\": 127418, \"totalSubmissionRaw\": 285960, \"acRate\": \"44.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"341","questionFrontendId":"341","title":"Flatten Nested List Iterator","titleSlug":"flatten-nested-list-iterator","translatedTitle":null,"stats":"{\"totalAccepted\": \"358.8K\", \"totalSubmission\": \"580.5K\", \"totalAcceptedRaw\": 358753, \"totalSubmissionRaw\": 580520, \"acRate\": \"61.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Iterator","translatedName":null,"slug":"iterator","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"364","questionFrontendId":"364","title":"Nested List Weight Sum II","titleSlug":"nested-list-weight-sum-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"128.9K\", \"totalSubmission\": \"193.5K\", \"totalAcceptedRaw\": 128935, \"totalSubmissionRaw\": 193548, \"acRate\": \"66.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"385","questionFrontendId":"385","title":"Mini Parser","titleSlug":"mini-parser","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.8K\", \"totalSubmission\": \"140.7K\", \"totalAcceptedRaw\": 51848, \"totalSubmissionRaw\": 140662, \"acRate\": \"36.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"388","questionFrontendId":"388","title":"Longest Absolute File Path","titleSlug":"longest-absolute-file-path","translatedTitle":null,"stats":"{\"totalAccepted\": \"141K\", \"totalSubmission\": \"302.4K\", \"totalAcceptedRaw\": 141011, \"totalSubmissionRaw\": 302371, \"acRate\": \"46.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"394","questionFrontendId":"394","title":"Decode String","titleSlug":"decode-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"624.8K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 624825, \"totalSubmissionRaw\": 1080101, \"acRate\": \"57.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"402","questionFrontendId":"402","title":"Remove K Digits","titleSlug":"remove-k-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"302.9K\", \"totalSubmission\": \"991K\", \"totalAcceptedRaw\": 302879, \"totalSubmissionRaw\": 991025, \"acRate\": \"30.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"439","questionFrontendId":"439","title":"Ternary Expression Parser","titleSlug":"ternary-expression-parser","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.3K\", \"totalSubmission\": \"45K\", \"totalAcceptedRaw\": 26291, \"totalSubmissionRaw\": 45029, \"acRate\": \"58.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"445","questionFrontendId":"445","title":"Add Two Numbers II","titleSlug":"add-two-numbers-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"361.8K\", \"totalSubmission\": \"606.8K\", \"totalAcceptedRaw\": 361771, \"totalSubmissionRaw\": 606794, \"acRate\": \"59.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"456","questionFrontendId":"456","title":"132 Pattern","titleSlug":"132-pattern","translatedTitle":null,"stats":"{\"totalAccepted\": \"166.4K\", \"totalSubmission\": \"513.3K\", \"totalAcceptedRaw\": 166379, \"totalSubmissionRaw\": 513300, \"acRate\": \"32.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"484","questionFrontendId":"484","title":"Find Permutation","titleSlug":"find-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.8K\", \"totalSubmission\": \"53.5K\", \"totalAcceptedRaw\": 35822, \"totalSubmissionRaw\": 53518, \"acRate\": \"66.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"496","questionFrontendId":"496","title":"Next Greater Element I","titleSlug":"next-greater-element-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"503.4K\", \"totalSubmission\": \"704.5K\", \"totalAcceptedRaw\": 503374, \"totalSubmissionRaw\": 704509, \"acRate\": \"71.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"503","questionFrontendId":"503","title":"Next Greater Element II","titleSlug":"next-greater-element-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"293.7K\", \"totalSubmission\": \"464.9K\", \"totalAcceptedRaw\": 293716, \"totalSubmissionRaw\": 464915, \"acRate\": \"63.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"581","questionFrontendId":"581","title":"Shortest Unsorted Continuous Subarray","titleSlug":"shortest-unsorted-continuous-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"298.7K\", \"totalSubmission\": \"820.3K\", \"totalAcceptedRaw\": 298714, \"totalSubmissionRaw\": 820281, \"acRate\": \"36.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"591","questionFrontendId":"591","title":"Tag Validator","titleSlug":"tag-validator","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.9K\", \"totalSubmission\": \"34.7K\", \"totalAcceptedRaw\": 12892, \"totalSubmissionRaw\": 34687, \"acRate\": \"37.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"636","questionFrontendId":"636","title":"Exclusive Time of Functions","titleSlug":"exclusive-time-of-functions","translatedTitle":null,"stats":"{\"totalAccepted\": \"187.9K\", \"totalSubmission\": \"307.1K\", \"totalAcceptedRaw\": 187859, \"totalSubmissionRaw\": 307128, \"acRate\": \"61.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"654","questionFrontendId":"654","title":"Maximum Binary Tree","titleSlug":"maximum-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"249.9K\", \"totalSubmission\": \"295K\", \"totalAcceptedRaw\": 249947, \"totalSubmissionRaw\": 295018, \"acRate\": \"84.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"678","questionFrontendId":"678","title":"Valid Parenthesis String","titleSlug":"valid-parenthesis-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"201.5K\", \"totalSubmission\": \"591.2K\", \"totalAcceptedRaw\": 201452, \"totalSubmissionRaw\": 591200, \"acRate\": \"34.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"682","questionFrontendId":"682","title":"Baseball Game","titleSlug":"baseball-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"240.7K\", \"totalSubmission\": \"324.4K\", \"totalAcceptedRaw\": 240718, \"totalSubmissionRaw\": 324366, \"acRate\": \"74.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"716","questionFrontendId":"716","title":"Max Stack","titleSlug":"max-stack","translatedTitle":null,"stats":"{\"totalAccepted\": \"140.5K\", \"totalSubmission\": \"310.8K\", \"totalAcceptedRaw\": 140509, \"totalSubmissionRaw\": 310797, \"acRate\": \"45.2%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"726","questionFrontendId":"726","title":"Number of Atoms","titleSlug":"number-of-atoms","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.4K\", \"totalSubmission\": \"100.6K\", \"totalAcceptedRaw\": 52417, \"totalSubmissionRaw\": 100570, \"acRate\": \"52.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"735","questionFrontendId":"735","title":"Asteroid Collision","titleSlug":"asteroid-collision","translatedTitle":null,"stats":"{\"totalAccepted\": \"260.5K\", \"totalSubmission\": \"586.5K\", \"totalAcceptedRaw\": 260456, \"totalSubmissionRaw\": 586510, \"acRate\": \"44.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"736","questionFrontendId":"736","title":"Parse Lisp Expression","titleSlug":"parse-lisp-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.1K\", \"totalSubmission\": \"39K\", \"totalAcceptedRaw\": 20132, \"totalSubmissionRaw\": 39027, \"acRate\": \"51.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"739","questionFrontendId":"739","title":"Daily Temperatures","titleSlug":"daily-temperatures","translatedTitle":null,"stats":"{\"totalAccepted\": \"587K\", \"totalSubmission\": \"885.1K\", \"totalAcceptedRaw\": 586976, \"totalSubmissionRaw\": 885128, \"acRate\": \"66.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"758","questionFrontendId":"426","title":"Convert Binary Search Tree to Sorted Doubly Linked List","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"233.7K\", \"totalSubmission\": \"361.5K\", \"totalAcceptedRaw\": 233675, \"totalSubmissionRaw\": 361492, \"acRate\": \"64.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"775","questionFrontendId":"589","title":"N-ary Tree Preorder Traversal","titleSlug":"n-ary-tree-preorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"373.9K\", \"totalSubmission\": \"492.5K\", \"totalAcceptedRaw\": 373899, \"totalSubmissionRaw\": 492501, \"acRate\": \"75.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"776","questionFrontendId":"590","title":"N-ary Tree Postorder Traversal","titleSlug":"n-ary-tree-postorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"220.5K\", \"totalSubmission\": \"284.9K\", \"totalAcceptedRaw\": 220546, \"totalSubmissionRaw\": 284943, \"acRate\": \"77.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"779","questionFrontendId":"768","title":"Max Chunks To Make Sorted II","titleSlug":"max-chunks-to-make-sorted-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.3K\", \"totalSubmission\": \"99.1K\", \"totalAcceptedRaw\": 52309, \"totalSubmissionRaw\": 99052, \"acRate\": \"52.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"780","questionFrontendId":"769","title":"Max Chunks To Make Sorted","titleSlug":"max-chunks-to-make-sorted","translatedTitle":null,"stats":"{\"totalAccepted\": \"88.2K\", \"totalSubmission\": \"151.5K\", \"totalAcceptedRaw\": 88199, \"totalSubmissionRaw\": 151523, \"acRate\": \"58.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"781","questionFrontendId":"770","title":"Basic Calculator IV","titleSlug":"basic-calculator-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"16.4K\", \"totalAcceptedRaw\": 9186, \"totalSubmissionRaw\": 16435, \"acRate\": \"55.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"785","questionFrontendId":"772","title":"Basic Calculator III","titleSlug":"basic-calculator-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"102.3K\", \"totalSubmission\": \"209.6K\", \"totalAcceptedRaw\": 102271, \"totalSubmissionRaw\": 209557, \"acRate\": \"48.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"874","questionFrontendId":"844","title":"Backspace String Compare","titleSlug":"backspace-string-compare","translatedTitle":null,"stats":"{\"totalAccepted\": \"614.2K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 614158, \"totalSubmissionRaw\": 1278182, \"acRate\": \"48.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"883","questionFrontendId":"853","title":"Car Fleet","titleSlug":"car-fleet","translatedTitle":null,"stats":"{\"totalAccepted\": \"129K\", \"totalSubmission\": \"256.6K\", \"totalAcceptedRaw\": 128974, \"totalSubmissionRaw\": 256638, \"acRate\": \"50.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"886","questionFrontendId":"856","title":"Score of Parentheses","titleSlug":"score-of-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"155.6K\", \"totalSubmission\": \"240.2K\", \"totalAcceptedRaw\": 155607, \"totalSubmissionRaw\": 240222, \"acRate\": \"64.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"916","questionFrontendId":"880","title":"Decoded String at Index","titleSlug":"decoded-string-at-index","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.1K\", \"totalSubmission\": \"127.4K\", \"totalAcceptedRaw\": 36081, \"totalSubmissionRaw\": 127381, \"acRate\": \"28.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"931","questionFrontendId":"895","title":"Maximum Frequency Stack","titleSlug":"maximum-frequency-stack","translatedTitle":null,"stats":"{\"totalAccepted\": \"150K\", \"totalSubmission\": \"225.1K\", \"totalAcceptedRaw\": 149957, \"totalSubmissionRaw\": 225111, \"acRate\": \"66.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"933","questionFrontendId":"897","title":"Increasing Order Search Tree","titleSlug":"increasing-order-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"244.5K\", \"totalSubmission\": \"311.6K\", \"totalAcceptedRaw\": 244474, \"totalSubmissionRaw\": 311624, \"acRate\": \"78.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"937","questionFrontendId":"901","title":"Online Stock Span","titleSlug":"online-stock-span","translatedTitle":null,"stats":"{\"totalAccepted\": \"216.4K\", \"totalSubmission\": \"331.8K\", \"totalAcceptedRaw\": 216356, \"totalSubmissionRaw\": 331796, \"acRate\": \"65.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"943","questionFrontendId":"907","title":"Sum of Subarray Minimums","titleSlug":"sum-of-subarray-minimums","translatedTitle":null,"stats":"{\"totalAccepted\": \"142.4K\", \"totalSubmission\": \"397.8K\", \"totalAcceptedRaw\": 142438, \"totalSubmissionRaw\": 397827, \"acRate\": \"35.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"957","questionFrontendId":"921","title":"Minimum Add to Make Parentheses Valid","titleSlug":"minimum-add-to-make-parentheses-valid","translatedTitle":null,"stats":"{\"totalAccepted\": \"250.9K\", \"totalSubmission\": \"330.9K\", \"totalAcceptedRaw\": 250856, \"totalSubmissionRaw\": 330899, \"acRate\": \"75.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"973","questionFrontendId":"936","title":"Stamping The Sequence","titleSlug":"stamping-the-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"56.2K\", \"totalSubmission\": \"89.1K\", \"totalAcceptedRaw\": 56159, \"totalSubmissionRaw\": 89097, \"acRate\": \"63.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"983","questionFrontendId":"946","title":"Validate Stack Sequences","titleSlug":"validate-stack-sequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"197.8K\", \"totalSubmission\": \"292.4K\", \"totalAcceptedRaw\": 197829, \"totalSubmissionRaw\": 292361, \"acRate\": \"67.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1002","questionFrontendId":"962","title":"Maximum Width Ramp","titleSlug":"maximum-width-ramp","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.4K\", \"totalSubmission\": \"80.4K\", \"totalAcceptedRaw\": 39373, \"totalSubmissionRaw\": 80424, \"acRate\": \"49.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1017","questionFrontendId":"975","title":"Odd Even Jump","titleSlug":"odd-even-jump","translatedTitle":null,"stats":"{\"totalAccepted\": \"72K\", \"totalSubmission\": \"184.8K\", \"totalAcceptedRaw\": 71998, \"totalSubmissionRaw\": 184811, \"acRate\": \"39.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1045","questionFrontendId":"1003","title":"Check If Word Is Valid After Substitutions","titleSlug":"check-if-word-is-valid-after-substitutions","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.6K\", \"totalSubmission\": \"83.5K\", \"totalAcceptedRaw\": 48576, \"totalSubmissionRaw\": 83477, \"acRate\": \"58.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1048","questionFrontendId":"1006","title":"Clumsy Factorial","titleSlug":"clumsy-factorial","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.3K\", \"totalSubmission\": \"43.8K\", \"totalAcceptedRaw\": 24273, \"totalSubmissionRaw\": 43817, \"acRate\": \"55.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1050","questionFrontendId":"1008","title":"Construct Binary Search Tree from Preorder Traversal","titleSlug":"construct-binary-search-tree-from-preorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"285.7K\", \"totalSubmission\": \"352.2K\", \"totalAcceptedRaw\": 285727, \"totalSubmissionRaw\": 352247, \"acRate\": \"81.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1061","questionFrontendId":"1063","title":"Number of Valid Subarrays","titleSlug":"number-of-valid-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.4K\", \"totalSubmission\": \"9.9K\", \"totalAcceptedRaw\": 7381, \"totalSubmissionRaw\": 9925, \"acRate\": \"74.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1072","questionFrontendId":"1019","title":"Next Greater Node In Linked List","titleSlug":"next-greater-node-in-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.5K\", \"totalSubmission\": \"207.9K\", \"totalAcceptedRaw\": 124540, \"totalSubmissionRaw\": 207923, \"acRate\": \"59.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1078","questionFrontendId":"1021","title":"Remove Outermost Parentheses","titleSlug":"remove-outermost-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"211K\", \"totalSubmission\": \"261.8K\", \"totalAcceptedRaw\": 211015, \"totalSubmissionRaw\": 261782, \"acRate\": \"80.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1128","questionFrontendId":"1047","title":"Remove All Adjacent Duplicates In String","titleSlug":"remove-all-adjacent-duplicates-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"430.9K\", \"totalSubmission\": \"617.8K\", \"totalAcceptedRaw\": 430853, \"totalSubmissionRaw\": 617823, \"acRate\": \"69.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1150","questionFrontendId":"1214","title":"Two Sum BSTs","titleSlug":"two-sum-bsts","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.8K\", \"totalSubmission\": \"58.8K\", \"totalAcceptedRaw\": 38839, \"totalSubmissionRaw\": 58760, \"acRate\": \"66.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1159","questionFrontendId":"1081","title":"Smallest Subsequence of Distinct Characters","titleSlug":"smallest-subsequence-of-distinct-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.9K\", \"totalSubmission\": \"84.7K\", \"totalAcceptedRaw\": 48945, \"totalSubmissionRaw\": 84669, \"acRate\": \"57.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1188","questionFrontendId":"1096","title":"Brace Expansion II","titleSlug":"brace-expansion-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.1K\", \"totalSubmission\": \"34.8K\", \"totalAcceptedRaw\": 22075, \"totalSubmissionRaw\": 34791, \"acRate\": \"63.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1197","questionFrontendId":"1106","title":"Parsing A Boolean Expression","titleSlug":"parsing-a-boolean-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.4K\", \"totalSubmission\": \"38.4K\", \"totalAcceptedRaw\": 22440, \"totalSubmissionRaw\": 38424, \"acRate\": \"58.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1208","questionFrontendId":"1111","title":"Maximum Nesting Depth of Two Valid Parentheses Strings","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.7K\", \"totalSubmission\": \"31.1K\", \"totalAcceptedRaw\": 22738, \"totalSubmissionRaw\": 31131, \"acRate\": \"73.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1219","questionFrontendId":"1124","title":"Longest Well-Performing Interval","titleSlug":"longest-well-performing-interval","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.3K\", \"totalSubmission\": \"75.8K\", \"totalAcceptedRaw\": 26256, \"totalSubmissionRaw\": 75782, \"acRate\": \"34.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1228","questionFrontendId":"1130","title":"Minimum Cost Tree From Leaf Values","titleSlug":"minimum-cost-tree-from-leaf-values","translatedTitle":null,"stats":"{\"totalAccepted\": \"83.5K\", \"totalSubmission\": \"122.2K\", \"totalAcceptedRaw\": 83489, \"totalSubmissionRaw\": 122197, \"acRate\": \"68.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1270","questionFrontendId":"1172","title":"Dinner Plate Stacks","titleSlug":"dinner-plate-stacks","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.6K\", \"totalSubmission\": \"47K\", \"totalAcceptedRaw\": 15571, \"totalSubmissionRaw\": 47011, \"acRate\": \"33.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1298","questionFrontendId":"1190","title":"Reverse Substrings Between Each Pair of Parentheses","titleSlug":"reverse-substrings-between-each-pair-of-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"59.9K\", \"totalSubmission\": \"90.9K\", \"totalAcceptedRaw\": 59910, \"totalSubmissionRaw\": 90887, \"acRate\": \"65.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1305","questionFrontendId":"1944","title":"Number of Visible People in a Queue","titleSlug":"number-of-visible-people-in-a-queue","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.2K\", \"totalSubmission\": \"46.6K\", \"totalAcceptedRaw\": 32234, \"totalSubmissionRaw\": 46596, \"acRate\": \"69.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1320","questionFrontendId":"1209","title":"Remove All Adjacent Duplicates in String II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"260.4K\", \"totalSubmission\": \"463.6K\", \"totalAcceptedRaw\": 260417, \"totalSubmissionRaw\": 463635, \"acRate\": \"56.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1355","questionFrontendId":"2216","title":"Minimum Deletions to Make Array Beautiful","titleSlug":"minimum-deletions-to-make-array-beautiful","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.7K\", \"totalSubmission\": \"52.7K\", \"totalAcceptedRaw\": 24693, \"totalSubmissionRaw\": 52704, \"acRate\": \"46.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1371","questionFrontendId":"1249","title":"Minimum Remove to Make Valid Parentheses","titleSlug":"minimum-remove-to-make-valid-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"491.2K\", \"totalSubmission\": \"746.3K\", \"totalAcceptedRaw\": 491233, \"totalSubmissionRaw\": 746336, \"acRate\": \"65.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1404","questionFrontendId":"1265","title":"Print Immutable Linked List in Reverse","titleSlug":"print-immutable-linked-list-in-reverse","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.6K\", \"totalSubmission\": \"51.6K\", \"totalAcceptedRaw\": 48606, \"totalSubmissionRaw\": 51580, \"acRate\": \"94.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1497","questionFrontendId":"1381","title":"Design a Stack With Increment Operation","titleSlug":"design-a-stack-with-increment-operation","translatedTitle":null,"stats":"{\"totalAccepted\": \"89.8K\", \"totalSubmission\": \"116.4K\", \"totalAcceptedRaw\": 89787, \"totalSubmissionRaw\": 116422, \"acRate\": \"77.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1552","questionFrontendId":"1441","title":"Build an Array With Stack Operations","titleSlug":"build-an-array-with-stack-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"72K\", \"totalSubmission\": \"100.3K\", \"totalAcceptedRaw\": 71952, \"totalSubmissionRaw\": 100258, \"acRate\": \"71.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1570","questionFrontendId":"1475","title":"Final Prices With a Special Discount in a Shop","titleSlug":"final-prices-with-a-special-discount-in-a-shop","translatedTitle":null,"stats":"{\"totalAccepted\": \"103.6K\", \"totalSubmission\": \"136.3K\", \"totalAcceptedRaw\": 103626, \"totalSubmissionRaw\": 136343, \"acRate\": \"76.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1582","questionFrontendId":"1472","title":"Design Browser History","titleSlug":"design-browser-history","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.9K\", \"totalSubmission\": \"157.3K\", \"totalAcceptedRaw\": 119865, \"totalSubmissionRaw\": 157289, \"acRate\": \"76.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1628","questionFrontendId":"1504","title":"Count Submatrices With All Ones","titleSlug":"count-submatrices-with-all-ones","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.2K\", \"totalSubmission\": \"75K\", \"totalAcceptedRaw\": 43164, \"totalSubmissionRaw\": 75010, \"acRate\": \"57.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1633","questionFrontendId":"1526","title":"Minimum Number of Increments on Subarrays to Form a Target Array","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.6K\", \"totalSubmission\": \"44.7K\", \"totalAcceptedRaw\": 30642, \"totalSubmissionRaw\": 44713, \"acRate\": \"68.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1648","questionFrontendId":"1541","title":"Minimum Insertions to Balance a Parentheses String","titleSlug":"minimum-insertions-to-balance-a-parentheses-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"38K\", \"totalSubmission\": \"76.2K\", \"totalAcceptedRaw\": 37999, \"totalSubmissionRaw\": 76238, \"acRate\": \"49.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1666","questionFrontendId":"1544","title":"Make The String Great","titleSlug":"make-the-string-great","translatedTitle":null,"stats":"{\"totalAccepted\": \"134.9K\", \"totalSubmission\": \"213.3K\", \"totalAcceptedRaw\": 134917, \"totalSubmissionRaw\": 213268, \"acRate\": \"63.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1679","questionFrontendId":"1574","title":"Shortest Subarray to be Removed to Make Array Sorted","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.7K\", \"totalSubmission\": \"66.8K\", \"totalAcceptedRaw\": 24721, \"totalSubmissionRaw\": 66827, \"acRate\": \"37.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1720","questionFrontendId":"1598","title":"Crawler Log Folder","titleSlug":"crawler-log-folder","translatedTitle":null,"stats":"{\"totalAccepted\": \"57.6K\", \"totalSubmission\": \"89.3K\", \"totalAcceptedRaw\": 57590, \"totalSubmissionRaw\": 89268, \"acRate\": \"64.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1729","questionFrontendId":"1586","title":"Binary Search Tree Iterator II","titleSlug":"binary-search-tree-iterator-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.5K\", \"totalSubmission\": \"17.7K\", \"totalAcceptedRaw\": 12533, \"totalSubmissionRaw\": 17689, \"acRate\": \"70.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"},{"name":"Iterator","translatedName":null,"slug":"iterator","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1736","questionFrontendId":"1597","title":"Build Binary Expression Tree From Infix Expression","titleSlug":"build-binary-expression-tree-from-infix-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.8K\", \"totalSubmission\": \"18.9K\", \"totalAcceptedRaw\": 11836, \"totalSubmissionRaw\": 18875, \"acRate\": \"62.7%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1737","questionFrontendId":"1614","title":"Maximum Nesting Depth of the Parentheses","titleSlug":"maximum-nesting-depth-of-the-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"123.9K\", \"totalSubmission\": \"150.5K\", \"totalAcceptedRaw\": 123857, \"totalSubmissionRaw\": 150541, \"acRate\": \"82.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1756","questionFrontendId":"1653","title":"Minimum Deletions to Make String Balanced","titleSlug":"minimum-deletions-to-make-string-balanced","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.6K\", \"totalSubmission\": \"56.8K\", \"totalAcceptedRaw\": 33576, \"totalSubmissionRaw\": 56812, \"acRate\": \"59.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1768","questionFrontendId":"1628","title":"Design an Expression Tree With Evaluate Function","titleSlug":"design-an-expression-tree-with-evaluate-function","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.1K\", \"totalSubmission\": \"29.1K\", \"totalAcceptedRaw\": 24080, \"totalSubmissionRaw\": 29074, \"acRate\": \"82.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1792","questionFrontendId":"1673","title":"Find the Most Competitive Subsequence","titleSlug":"find-the-most-competitive-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.1K\", \"totalSubmission\": \"103.7K\", \"totalAcceptedRaw\": 51074, \"totalSubmissionRaw\": 103688, \"acRate\": \"49.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1802","questionFrontendId":"1700","title":"Number of Students Unable to Eat Lunch","titleSlug":"number-of-students-unable-to-eat-lunch","translatedTitle":null,"stats":"{\"totalAccepted\": \"61K\", \"totalSubmission\": \"88.8K\", \"totalAcceptedRaw\": 60960, \"totalSubmissionRaw\": 88845, \"acRate\": \"68.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1818","questionFrontendId":"1717","title":"Maximum Score From Removing Substrings","titleSlug":"maximum-score-from-removing-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.1K\", \"totalSubmission\": \"26.2K\", \"totalAcceptedRaw\": 12073, \"totalSubmissionRaw\": 26153, \"acRate\": \"46.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1902","questionFrontendId":"1776","title":"Car Fleet II","titleSlug":"car-fleet-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.6K\", \"totalSubmission\": \"40.3K\", \"totalAcceptedRaw\": 21564, \"totalSubmissionRaw\": 40305, \"acRate\": \"53.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1903","questionFrontendId":"1756","title":"Design Most Recently Used Queue","titleSlug":"design-most-recently-used-queue","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.9K\", \"totalSubmission\": \"11.3K\", \"totalAcceptedRaw\": 8907, \"totalSubmissionRaw\": 11346, \"acRate\": \"78.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1909","questionFrontendId":"1762","title":"Buildings With an Ocean View","titleSlug":"buildings-with-an-ocean-view","translatedTitle":null,"stats":"{\"totalAccepted\": \"139.8K\", \"totalSubmission\": \"176.7K\", \"totalAcceptedRaw\": 139780, \"totalSubmissionRaw\": 176738, \"acRate\": \"79.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1918","questionFrontendId":"1793","title":"Maximum Score of a Good Subarray","titleSlug":"maximum-score-of-a-good-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.4K\", \"totalSubmission\": \"36.3K\", \"totalAcceptedRaw\": 19408, \"totalSubmissionRaw\": 36265, \"acRate\": \"53.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1985","questionFrontendId":"1856","title":"Maximum Subarray Min-Product","titleSlug":"maximum-subarray-min-product","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.4K\", \"totalSubmission\": \"53.9K\", \"totalAcceptedRaw\": 20390, \"totalSubmissionRaw\": 53863, \"acRate\": \"37.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2008","questionFrontendId":"1896","title":"Minimum Cost to Change the Final Value of Expression","titleSlug":"minimum-cost-to-change-the-final-value-of-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"6K\", \"totalAcceptedRaw\": 3268, \"totalSubmissionRaw\": 5971, \"acRate\": \"54.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2056","questionFrontendId":"2297","title":"Jump Game VIII","titleSlug":"jump-game-viii","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"2.5K\", \"totalAcceptedRaw\": 1423, \"totalSubmissionRaw\": 2536, \"acRate\": \"56.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2072","questionFrontendId":"1950","title":"Maximum of Minimum Values in All Subarrays","titleSlug":"maximum-of-minimum-values-in-all-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.4K\", \"totalSubmission\": \"4.9K\", \"totalAcceptedRaw\": 2441, \"totalSubmissionRaw\": 4897, \"acRate\": \"49.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2095","questionFrontendId":"1963","title":"Minimum Number of Swaps to Make the String Balanced","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.1K\", \"totalSubmission\": \"63.7K\", \"totalAcceptedRaw\": 44066, \"totalSubmissionRaw\": 63671, \"acRate\": \"69.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2123","questionFrontendId":"1996","title":"The Number of Weak Characters in the Game","titleSlug":"the-number-of-weak-characters-in-the-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"93.5K\", \"totalSubmission\": \"212.6K\", \"totalAcceptedRaw\": 93510, \"totalSubmissionRaw\": 212637, \"acRate\": \"44.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2147","questionFrontendId":"2019","title":"The Score of Students Solving Math Expression","titleSlug":"the-score-of-students-solving-math-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"16.8K\", \"totalAcceptedRaw\": 5676, \"totalSubmissionRaw\": 16803, \"acRate\": \"33.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2157","questionFrontendId":"2030","title":"Smallest K-Length Subsequence With Occurrences of a Letter","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"15.8K\", \"totalAcceptedRaw\": 6116, \"totalSubmissionRaw\": 15756, \"acRate\": \"38.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2221","questionFrontendId":"2116","title":"Check if a Parentheses String Can Be Valid","titleSlug":"check-if-a-parentheses-string-can-be-valid","translatedTitle":null,"stats":"{\"totalAccepted\": \"15K\", \"totalSubmission\": \"48.2K\", \"totalAcceptedRaw\": 14981, \"totalSubmissionRaw\": 48219, \"acRate\": \"31.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2227","questionFrontendId":"2104","title":"Sum of Subarray Ranges","titleSlug":"sum-of-subarray-ranges","translatedTitle":null,"stats":"{\"totalAccepted\": \"66.8K\", \"totalSubmission\": \"110.8K\", \"totalAcceptedRaw\": 66796, \"totalSubmissionRaw\": 110777, \"acRate\": \"60.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2236","questionFrontendId":"2130","title":"Maximum Twin Sum of a Linked List","titleSlug":"maximum-twin-sum-of-a-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"86.6K\", \"totalSubmission\": \"107.4K\", \"totalAcceptedRaw\": 86606, \"totalSubmissionRaw\": 107385, \"acRate\": \"80.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2307","questionFrontendId":"2197","title":"Replace Non-Coprime Numbers in Array","titleSlug":"replace-non-coprime-numbers-in-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.5K\", \"totalSubmission\": \"29.8K\", \"totalAcceptedRaw\": 11507, \"totalSubmissionRaw\": 29828, \"acRate\": \"38.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2317","questionFrontendId":"2211","title":"Count Collisions on a Road","titleSlug":"count-collisions-on-a-road","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.2K\", \"totalSubmission\": \"45.5K\", \"totalAcceptedRaw\": 19227, \"totalSubmissionRaw\": 45471, \"acRate\": \"42.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2368","questionFrontendId":"2281","title":"Sum of Total Strength of Wizards","titleSlug":"sum-of-total-strength-of-wizards","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"50.5K\", \"totalAcceptedRaw\": 13816, \"totalSubmissionRaw\": 50503, \"acRate\": \"27.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2374","questionFrontendId":"2289","title":"Steps to Make Array Non-decreasing","titleSlug":"steps-to-make-array-non-decreasing","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.1K\", \"totalSubmission\": \"67K\", \"totalAcceptedRaw\": 14120, \"totalSubmissionRaw\": 66974, \"acRate\": \"21.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2389","questionFrontendId":"2296","title":"Design a Text Editor","titleSlug":"design-a-text-editor","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.7K\", \"totalSubmission\": \"38.5K\", \"totalAcceptedRaw\": 15665, \"totalSubmissionRaw\": 38510, \"acRate\": \"40.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2396","questionFrontendId":"2254","title":"Design Video Sharing Platform","titleSlug":"design-video-sharing-platform","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"2.1K\", \"totalAcceptedRaw\": 1349, \"totalSubmissionRaw\": 2071, \"acRate\": \"65.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2419","questionFrontendId":"2334","title":"Subarray With Elements Greater Than Varying Threshold","titleSlug":"subarray-with-elements-greater-than-varying-threshold","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 5921, \"totalSubmissionRaw\": 14392, \"acRate\": \"41.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2425","questionFrontendId":"2282","title":"Number of People That Can Be Seen in a Grid","titleSlug":"number-of-people-that-can-be-seen-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1K\", \"totalSubmission\": \"2.3K\", \"totalAcceptedRaw\": 1129, \"totalSubmissionRaw\": 2275, \"acRate\": \"49.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2456","questionFrontendId":"2375","title":"Construct Smallest Number From DI String","titleSlug":"construct-smallest-number-from-di-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.6K\", \"totalSubmission\": \"28.9K\", \"totalAcceptedRaw\": 21565, \"totalSubmissionRaw\": 28928, \"acRate\": \"74.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2470","questionFrontendId":"2390","title":"Removing Stars From a String","titleSlug":"removing-stars-from-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.3K\", \"totalSubmission\": \"60.3K\", \"totalAcceptedRaw\": 39330, \"totalSubmissionRaw\": 60310, \"acRate\": \"65.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2485","questionFrontendId":"2345","title":"Finding the Number of Visible Mountains","titleSlug":"finding-the-number-of-visible-mountains","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"7.7K\", \"totalAcceptedRaw\": 3252, \"totalSubmissionRaw\": 7697, \"acRate\": \"42.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2490","questionFrontendId":"2355","title":"Maximum Number of Books You Can Take","titleSlug":"maximum-number-of-books-you-can-take","translatedTitle":null,"stats":"{\"totalAccepted\": \"4K\", \"totalSubmission\": \"9K\", \"totalAcceptedRaw\": 3986, \"totalSubmissionRaw\": 9042, \"acRate\": \"44.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2520","questionFrontendId":"2434","title":"Using a Robot to Print the Lexicographically Smallest String","titleSlug":"using-a-robot-to-print-the-lexicographically-smallest-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"35.9K\", \"totalAcceptedRaw\": 13842, \"totalSubmissionRaw\": 35918, \"acRate\": \"38.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2549","questionFrontendId":"2454","title":"Next Greater Element IV","titleSlug":"next-greater-element-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"15.9K\", \"totalAcceptedRaw\": 6338, \"totalSubmissionRaw\": 15923, \"acRate\": \"39.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2573","questionFrontendId":"2487","title":"Remove Nodes From Linked List","titleSlug":"remove-nodes-from-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.3K\", \"totalSubmission\": \"36.8K\", \"totalAcceptedRaw\": 25295, \"totalSubmissionRaw\": 36770, \"acRate\": \"68.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2657","questionFrontendId":"2589","title":"Minimum Time to Complete All Tasks","titleSlug":"minimum-time-to-complete-all-tasks","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"12.6K\", \"totalAcceptedRaw\": 4351, \"totalSubmissionRaw\": 12553, \"acRate\": \"34.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/tmp/string-graphql.json b/tmp/string-graphql.json
new file mode 100644
index 000000000..1e8f5d1ad
--- /dev/null
+++ b/tmp/string-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"String","translatedName":null,"slug":"string","questions":[{"status":null,"questionId":"3","questionFrontendId":"3","title":"Longest Substring Without Repeating Characters","titleSlug":"longest-substring-without-repeating-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.3M\", \"totalSubmission\": \"12.8M\", \"totalAcceptedRaw\": 4334592, \"totalSubmissionRaw\": 12815178, \"acRate\": \"33.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"5","questionFrontendId":"5","title":"Longest Palindromic Substring","titleSlug":"longest-palindromic-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.3M\", \"totalSubmission\": \"7.2M\", \"totalAcceptedRaw\": 2329929, \"totalSubmissionRaw\": 7191327, \"acRate\": \"32.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"6","questionFrontendId":"6","title":"Zigzag Conversion","titleSlug":"zigzag-conversion","translatedTitle":null,"stats":"{\"totalAccepted\": \"995.2K\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 995151, \"totalSubmissionRaw\": 2222100, \"acRate\": \"44.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"8","questionFrontendId":"8","title":"String to Integer (atoi)","titleSlug":"string-to-integer-atoi","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"7.3M\", \"totalAcceptedRaw\": 1213335, \"totalSubmissionRaw\": 7307535, \"acRate\": \"16.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"10","questionFrontendId":"10","title":"Regular Expression Matching","titleSlug":"regular-expression-matching","translatedTitle":null,"stats":"{\"totalAccepted\": \"794.5K\", \"totalSubmission\": \"2.8M\", \"totalAcceptedRaw\": 794527, \"totalSubmissionRaw\": 2833902, \"acRate\": \"28.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"12","questionFrontendId":"12","title":"Integer to Roman","titleSlug":"integer-to-roman","translatedTitle":null,"stats":"{\"totalAccepted\": \"955K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 954997, \"totalSubmissionRaw\": 1541977, \"acRate\": \"61.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"13","questionFrontendId":"13","title":"Roman to Integer","titleSlug":"roman-to-integer","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.5M\", \"totalSubmission\": \"4.3M\", \"totalAcceptedRaw\": 2497238, \"totalSubmissionRaw\": 4272457, \"acRate\": \"58.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"14","questionFrontendId":"14","title":"Longest Common Prefix","titleSlug":"longest-common-prefix","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.2M\", \"totalSubmission\": \"5.5M\", \"totalAcceptedRaw\": 2246270, \"totalSubmissionRaw\": 5501317, \"acRate\": \"40.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"17","questionFrontendId":"17","title":"Letter Combinations of a Phone Number","titleSlug":"letter-combinations-of-a-phone-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5M\", \"totalSubmission\": \"2.7M\", \"totalAcceptedRaw\": 1503848, \"totalSubmissionRaw\": 2665165, \"acRate\": \"56.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"20","questionFrontendId":"20","title":"Valid Parentheses","titleSlug":"valid-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.1M\", \"totalSubmission\": \"7.7M\", \"totalAcceptedRaw\": 3116954, \"totalSubmissionRaw\": 7739006, \"acRate\": \"40.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"22","questionFrontendId":"22","title":"Generate Parentheses","titleSlug":"generate-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 1352114, \"totalSubmissionRaw\": 1866646, \"acRate\": \"72.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"28","questionFrontendId":"28","title":"Find the Index of the First Occurrence in a String","titleSlug":"find-the-index-of-the-first-occurrence-in-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6M\", \"totalSubmission\": \"4.2M\", \"totalAcceptedRaw\": 1638169, \"totalSubmissionRaw\": 4210561, \"acRate\": \"38.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"30","questionFrontendId":"30","title":"Substring with Concatenation of All Words","titleSlug":"substring-with-concatenation-of-all-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"338.7K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 338689, \"totalSubmissionRaw\": 1086628, \"acRate\": \"31.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"32","questionFrontendId":"32","title":"Longest Valid Parentheses","titleSlug":"longest-valid-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"603.2K\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 603209, \"totalSubmissionRaw\": 1839027, \"acRate\": \"32.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"38","questionFrontendId":"38","title":"Count and Say","titleSlug":"count-and-say","translatedTitle":null,"stats":"{\"totalAccepted\": \"770.7K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 770678, \"totalSubmissionRaw\": 1482219, \"acRate\": \"52.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"43","questionFrontendId":"43","title":"Multiply Strings","titleSlug":"multiply-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"641.9K\", \"totalSubmission\": \"1.6M\", \"totalAcceptedRaw\": 641869, \"totalSubmissionRaw\": 1640866, \"acRate\": \"39.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"44","questionFrontendId":"44","title":"Wildcard Matching","titleSlug":"wildcard-matching","translatedTitle":null,"stats":"{\"totalAccepted\": \"460.3K\", \"totalSubmission\": \"1.7M\", \"totalAcceptedRaw\": 460278, \"totalSubmissionRaw\": 1709983, \"acRate\": \"26.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"49","questionFrontendId":"49","title":"Group Anagrams","titleSlug":"group-anagrams","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.9M\", \"totalSubmission\": \"2.8M\", \"totalAcceptedRaw\": 1881058, \"totalSubmissionRaw\": 2819376, \"acRate\": \"66.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"58","questionFrontendId":"58","title":"Length of Last Word","titleSlug":"length-of-last-word","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"2.5M\", \"totalAcceptedRaw\": 1062589, \"totalSubmissionRaw\": 2491950, \"acRate\": \"42.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"65","questionFrontendId":"65","title":"Valid Number","titleSlug":"valid-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"301K\", \"totalSubmission\": \"1.6M\", \"totalAcceptedRaw\": 300997, \"totalSubmissionRaw\": 1610166, \"acRate\": \"18.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"67","questionFrontendId":"67","title":"Add Binary","titleSlug":"add-binary","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 1111348, \"totalSubmissionRaw\": 2121846, \"acRate\": \"52.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"68","questionFrontendId":"68","title":"Text Justification","titleSlug":"text-justification","translatedTitle":null,"stats":"{\"totalAccepted\": \"288K\", \"totalSubmission\": \"771K\", \"totalAcceptedRaw\": 288035, \"totalSubmissionRaw\": 770959, \"acRate\": \"37.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"71","questionFrontendId":"71","title":"Simplify Path","titleSlug":"simplify-path","translatedTitle":null,"stats":"{\"totalAccepted\": \"494.2K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 494222, \"totalSubmissionRaw\": 1257132, \"acRate\": \"39.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"72","questionFrontendId":"72","title":"Edit Distance","titleSlug":"edit-distance","translatedTitle":null,"stats":"{\"totalAccepted\": \"628.6K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 628572, \"totalSubmissionRaw\": 1156657, \"acRate\": \"54.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"76","questionFrontendId":"76","title":"Minimum Window Substring","titleSlug":"minimum-window-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"980.5K\", \"totalSubmission\": \"2.4M\", \"totalAcceptedRaw\": 980539, \"totalSubmissionRaw\": 2399464, \"acRate\": \"40.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"87","questionFrontendId":"87","title":"Scramble String","titleSlug":"scramble-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"162.5K\", \"totalSubmission\": \"449.5K\", \"totalAcceptedRaw\": 162462, \"totalSubmissionRaw\": 449492, \"acRate\": \"36.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"91","questionFrontendId":"91","title":"Decode Ways","titleSlug":"decode-ways","translatedTitle":null,"stats":"{\"totalAccepted\": \"990K\", \"totalSubmission\": \"3M\", \"totalAcceptedRaw\": 989955, \"totalSubmissionRaw\": 3029902, \"acRate\": \"32.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"93","questionFrontendId":"93","title":"Restore IP Addresses","titleSlug":"restore-ip-addresses","translatedTitle":null,"stats":"{\"totalAccepted\": \"394.7K\", \"totalSubmission\": \"834.5K\", \"totalAcceptedRaw\": 394708, \"totalSubmissionRaw\": 834455, \"acRate\": \"47.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"97","questionFrontendId":"97","title":"Interleaving String","titleSlug":"interleaving-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"369K\", \"totalSubmission\": \"988.9K\", \"totalAcceptedRaw\": 368978, \"totalSubmissionRaw\": 988856, \"acRate\": \"37.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"115","questionFrontendId":"115","title":"Distinct Subsequences","titleSlug":"distinct-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"282.7K\", \"totalSubmission\": \"636.8K\", \"totalAcceptedRaw\": 282673, \"totalSubmissionRaw\": 636845, \"acRate\": \"44.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"125","questionFrontendId":"125","title":"Valid Palindrome","titleSlug":"valid-palindrome","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.8M\", \"totalSubmission\": \"4.1M\", \"totalAcceptedRaw\": 1837406, \"totalSubmissionRaw\": 4148477, \"acRate\": \"44.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"126","questionFrontendId":"126","title":"Word Ladder II","titleSlug":"word-ladder-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"339.2K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 339186, \"totalSubmissionRaw\": 1232948, \"acRate\": \"27.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"127","questionFrontendId":"127","title":"Word Ladder","titleSlug":"word-ladder","translatedTitle":null,"stats":"{\"totalAccepted\": \"893.8K\", \"totalSubmission\": \"2.4M\", \"totalAcceptedRaw\": 893822, \"totalSubmissionRaw\": 2409565, \"acRate\": \"37.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"131","questionFrontendId":"131","title":"Palindrome Partitioning","titleSlug":"palindrome-partitioning","translatedTitle":null,"stats":"{\"totalAccepted\": \"624.6K\", \"totalSubmission\": \"964.7K\", \"totalAcceptedRaw\": 624593, \"totalSubmissionRaw\": 964712, \"acRate\": \"64.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"132","questionFrontendId":"132","title":"Palindrome Partitioning II","titleSlug":"palindrome-partitioning-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"237K\", \"totalSubmission\": \"702K\", \"totalAcceptedRaw\": 237046, \"totalSubmissionRaw\": 702026, \"acRate\": \"33.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"139","questionFrontendId":"139","title":"Word Break","titleSlug":"word-break","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"2.9M\", \"totalAcceptedRaw\": 1302318, \"totalSubmissionRaw\": 2858470, \"acRate\": \"45.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"140","questionFrontendId":"140","title":"Word Break II","titleSlug":"word-break-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"507.3K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 507264, \"totalSubmissionRaw\": 1122470, \"acRate\": \"45.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"151","questionFrontendId":"151","title":"Reverse Words in a String","titleSlug":"reverse-words-in-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"897.2K\", \"totalSubmission\": \"2.7M\", \"totalAcceptedRaw\": 897213, \"totalSubmissionRaw\": 2749728, \"acRate\": \"32.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"157","questionFrontendId":"157","title":"Read N Characters Given Read4","titleSlug":"read-n-characters-given-read4","translatedTitle":null,"stats":"{\"totalAccepted\": \"179.7K\", \"totalSubmission\": \"438.9K\", \"totalAcceptedRaw\": 179686, \"totalSubmissionRaw\": 438867, \"acRate\": \"40.9%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"158","questionFrontendId":"158","title":"Read N Characters Given read4 II - Call Multiple Times","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times","translatedTitle":null,"stats":"{\"totalAccepted\": \"175.1K\", \"totalSubmission\": \"420.7K\", \"totalAcceptedRaw\": 175059, \"totalSubmissionRaw\": 420667, \"acRate\": \"41.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"159","questionFrontendId":"159","title":"Longest Substring with At Most Two Distinct Characters","titleSlug":"longest-substring-with-at-most-two-distinct-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"224.5K\", \"totalSubmission\": \"417.4K\", \"totalAcceptedRaw\": 224494, \"totalSubmissionRaw\": 417416, \"acRate\": \"53.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"161","questionFrontendId":"161","title":"One Edit Distance","titleSlug":"one-edit-distance","translatedTitle":null,"stats":"{\"totalAccepted\": \"187K\", \"totalSubmission\": \"547.8K\", \"totalAcceptedRaw\": 186958, \"totalSubmissionRaw\": 547829, \"acRate\": \"34.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"165","questionFrontendId":"165","title":"Compare Version Numbers","titleSlug":"compare-version-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"345.7K\", \"totalSubmission\": \"969K\", \"totalAcceptedRaw\": 345661, \"totalSubmissionRaw\": 968959, \"acRate\": \"35.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"166","questionFrontendId":"166","title":"Fraction to Recurring Decimal","titleSlug":"fraction-to-recurring-decimal","translatedTitle":null,"stats":"{\"totalAccepted\": \"204.3K\", \"totalSubmission\": \"841.2K\", \"totalAcceptedRaw\": 204326, \"totalSubmissionRaw\": 841187, \"acRate\": \"24.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"168","questionFrontendId":"168","title":"Excel Sheet Column Title","titleSlug":"excel-sheet-column-title","translatedTitle":null,"stats":"{\"totalAccepted\": \"368.1K\", \"totalSubmission\": \"1M\", \"totalAcceptedRaw\": 368067, \"totalSubmissionRaw\": 1039187, \"acRate\": \"35.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"171","questionFrontendId":"171","title":"Excel Sheet Column Number","titleSlug":"excel-sheet-column-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"584K\", \"totalSubmission\": \"942.4K\", \"totalAcceptedRaw\": 583995, \"totalSubmissionRaw\": 942441, \"acRate\": \"62.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"179","questionFrontendId":"179","title":"Largest Number","titleSlug":"largest-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"383.3K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 383285, \"totalSubmissionRaw\": 1111221, \"acRate\": \"34.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"186","questionFrontendId":"186","title":"Reverse Words in a String II","titleSlug":"reverse-words-in-a-string-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"146.4K\", \"totalSubmission\": \"277.1K\", \"totalAcceptedRaw\": 146411, \"totalSubmissionRaw\": 277137, \"acRate\": \"52.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"187","questionFrontendId":"187","title":"Repeated DNA Sequences","titleSlug":"repeated-dna-sequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"317.3K\", \"totalSubmission\": \"676.7K\", \"totalAcceptedRaw\": 317329, \"totalSubmissionRaw\": 676721, \"acRate\": \"46.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"205","questionFrontendId":"205","title":"Isomorphic Strings","titleSlug":"isomorphic-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"836.5K\", \"totalSubmission\": \"2M\", \"totalAcceptedRaw\": 836459, \"totalSubmissionRaw\": 1952344, \"acRate\": \"42.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"208","questionFrontendId":"208","title":"Implement Trie (Prefix Tree)","titleSlug":"implement-trie-prefix-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"746.8K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 746839, \"totalSubmissionRaw\": 1211271, \"acRate\": \"61.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"211","questionFrontendId":"211","title":"Design Add and Search Words Data Structure","titleSlug":"design-add-and-search-words-data-structure","translatedTitle":null,"stats":"{\"totalAccepted\": \"471.4K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 471353, \"totalSubmissionRaw\": 1096120, \"acRate\": \"43.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"212","questionFrontendId":"212","title":"Word Search II","titleSlug":"word-search-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"547.8K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 547761, \"totalSubmissionRaw\": 1501670, \"acRate\": \"36.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"214","questionFrontendId":"214","title":"Shortest Palindrome","titleSlug":"shortest-palindrome","translatedTitle":null,"stats":"{\"totalAccepted\": \"153.4K\", \"totalSubmission\": \"474.5K\", \"totalAcceptedRaw\": 153396, \"totalSubmissionRaw\": 474539, \"acRate\": \"32.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"224","questionFrontendId":"224","title":"Basic Calculator","titleSlug":"basic-calculator","translatedTitle":null,"stats":"{\"totalAccepted\": \"373.8K\", \"totalSubmission\": \"881.3K\", \"totalAcceptedRaw\": 373768, \"totalSubmissionRaw\": 881324, \"acRate\": \"42.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"227","questionFrontendId":"227","title":"Basic Calculator II","titleSlug":"basic-calculator-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"507.3K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 507338, \"totalSubmissionRaw\": 1196563, \"acRate\": \"42.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"241","questionFrontendId":"241","title":"Different Ways to Add Parentheses","titleSlug":"different-ways-to-add-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"190.7K\", \"totalSubmission\": \"298.8K\", \"totalAcceptedRaw\": 190714, \"totalSubmissionRaw\": 298836, \"acRate\": \"63.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"242","questionFrontendId":"242","title":"Valid Anagram","titleSlug":"valid-anagram","translatedTitle":null,"stats":"{\"totalAccepted\": \"2M\", \"totalSubmission\": \"3.2M\", \"totalAcceptedRaw\": 2033389, \"totalSubmissionRaw\": 3226600, \"acRate\": \"63.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"243","questionFrontendId":"243","title":"Shortest Word Distance","titleSlug":"shortest-word-distance","translatedTitle":null,"stats":"{\"totalAccepted\": \"199.1K\", \"totalSubmission\": \"306.4K\", \"totalAcceptedRaw\": 199141, \"totalSubmissionRaw\": 306377, \"acRate\": \"65.0%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"244","questionFrontendId":"244","title":"Shortest Word Distance II","titleSlug":"shortest-word-distance-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"146.1K\", \"totalSubmission\": \"240.2K\", \"totalAcceptedRaw\": 146141, \"totalSubmissionRaw\": 240211, \"acRate\": \"60.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"245","questionFrontendId":"245","title":"Shortest Word Distance III","titleSlug":"shortest-word-distance-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"74K\", \"totalSubmission\": \"128.5K\", \"totalAcceptedRaw\": 73999, \"totalSubmissionRaw\": 128464, \"acRate\": \"57.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"246","questionFrontendId":"246","title":"Strobogrammatic Number","titleSlug":"strobogrammatic-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"158.3K\", \"totalSubmission\": \"331.7K\", \"totalAcceptedRaw\": 158338, \"totalSubmissionRaw\": 331655, \"acRate\": \"47.7%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"247","questionFrontendId":"247","title":"Strobogrammatic Number II","titleSlug":"strobogrammatic-number-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"128.3K\", \"totalSubmission\": \"248.9K\", \"totalAcceptedRaw\": 128260, \"totalSubmissionRaw\": 248883, \"acRate\": \"51.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"248","questionFrontendId":"248","title":"Strobogrammatic Number III","titleSlug":"strobogrammatic-number-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.3K\", \"totalSubmission\": \"84.2K\", \"totalAcceptedRaw\": 35319, \"totalSubmissionRaw\": 84247, \"acRate\": \"41.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"249","questionFrontendId":"249","title":"Group Shifted Strings","titleSlug":"group-shifted-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"189.4K\", \"totalSubmission\": \"294.5K\", \"totalAcceptedRaw\": 189449, \"totalSubmissionRaw\": 294518, \"acRate\": \"64.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"257","questionFrontendId":"257","title":"Binary Tree Paths","titleSlug":"binary-tree-paths","translatedTitle":null,"stats":"{\"totalAccepted\": \"603.6K\", \"totalSubmission\": \"984.7K\", \"totalAcceptedRaw\": 603639, \"totalSubmissionRaw\": 984698, \"acRate\": \"61.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"266","questionFrontendId":"266","title":"Palindrome Permutation","titleSlug":"palindrome-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"179.8K\", \"totalSubmission\": \"272.3K\", \"totalAcceptedRaw\": 179774, \"totalSubmissionRaw\": 272276, \"acRate\": \"66.0%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"267","questionFrontendId":"267","title":"Palindrome Permutation II","titleSlug":"palindrome-permutation-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"60.9K\", \"totalSubmission\": \"149.7K\", \"totalAcceptedRaw\": 60906, \"totalSubmissionRaw\": 149659, \"acRate\": \"40.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"269","questionFrontendId":"269","title":"Alien Dictionary","titleSlug":"alien-dictionary","translatedTitle":null,"stats":"{\"totalAccepted\": \"332.5K\", \"totalSubmission\": \"941.2K\", \"totalAcceptedRaw\": 332478, \"totalSubmissionRaw\": 941223, \"acRate\": \"35.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"271","questionFrontendId":"271","title":"Encode and Decode Strings","titleSlug":"encode-and-decode-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"138.4K\", \"totalSubmission\": \"324K\", \"totalAcceptedRaw\": 138357, \"totalSubmissionRaw\": 323996, \"acRate\": \"42.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"273","questionFrontendId":"273","title":"Integer to English Words","titleSlug":"integer-to-english-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"339.3K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 339318, \"totalSubmissionRaw\": 1131699, \"acRate\": \"30.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"282","questionFrontendId":"282","title":"Expression Add Operators","titleSlug":"expression-add-operators","translatedTitle":null,"stats":"{\"totalAccepted\": \"197.5K\", \"totalSubmission\": \"503.7K\", \"totalAcceptedRaw\": 197479, \"totalSubmissionRaw\": 503690, \"acRate\": \"39.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"288","questionFrontendId":"288","title":"Unique Word Abbreviation","titleSlug":"unique-word-abbreviation","translatedTitle":null,"stats":"{\"totalAccepted\": \"69.1K\", \"totalSubmission\": \"270.3K\", \"totalAcceptedRaw\": 69088, \"totalSubmissionRaw\": 270277, \"acRate\": \"25.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"290","questionFrontendId":"290","title":"Word Pattern","titleSlug":"word-pattern","translatedTitle":null,"stats":"{\"totalAccepted\": \"510K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 509998, \"totalSubmissionRaw\": 1223933, \"acRate\": \"41.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"291","questionFrontendId":"291","title":"Word Pattern II","titleSlug":"word-pattern-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"67K\", \"totalSubmission\": \"142.3K\", \"totalAcceptedRaw\": 66973, \"totalSubmissionRaw\": 142304, \"acRate\": \"47.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"293","questionFrontendId":"293","title":"Flip Game","titleSlug":"flip-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.5K\", \"totalSubmission\": \"100.4K\", \"totalAcceptedRaw\": 63462, \"totalSubmissionRaw\": 100446, \"acRate\": \"63.2%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"297","questionFrontendId":"297","title":"Serialize and Deserialize Binary Tree","titleSlug":"serialize-and-deserialize-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"727.9K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 727921, \"totalSubmissionRaw\": 1315117, \"acRate\": \"55.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"299","questionFrontendId":"299","title":"Bulls and Cows","titleSlug":"bulls-and-cows","translatedTitle":null,"stats":"{\"totalAccepted\": \"336.7K\", \"totalSubmission\": \"682.4K\", \"totalAcceptedRaw\": 336715, \"totalSubmissionRaw\": 682426, \"acRate\": \"49.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"301","questionFrontendId":"301","title":"Remove Invalid Parentheses","titleSlug":"remove-invalid-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"378.8K\", \"totalSubmission\": \"802.9K\", \"totalAcceptedRaw\": 378847, \"totalSubmissionRaw\": 802924, \"acRate\": \"47.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"306","questionFrontendId":"306","title":"Additive Number","titleSlug":"additive-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"78K\", \"totalSubmission\": \"251.4K\", \"totalAcceptedRaw\": 78048, \"totalSubmissionRaw\": 251412, \"acRate\": \"31.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"316","questionFrontendId":"316","title":"Remove Duplicate Letters","titleSlug":"remove-duplicate-letters","translatedTitle":null,"stats":"{\"totalAccepted\": \"224.6K\", \"totalSubmission\": \"499.8K\", \"totalAcceptedRaw\": 224630, \"totalSubmissionRaw\": 499842, \"acRate\": \"44.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"318","questionFrontendId":"318","title":"Maximum Product of Word Lengths","titleSlug":"maximum-product-of-word-lengths","translatedTitle":null,"stats":"{\"totalAccepted\": \"200.2K\", \"totalSubmission\": \"334.4K\", \"totalAcceptedRaw\": 200248, \"totalSubmissionRaw\": 334389, \"acRate\": \"59.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"320","questionFrontendId":"320","title":"Generalized Abbreviation","titleSlug":"generalized-abbreviation","translatedTitle":null,"stats":"{\"totalAccepted\": \"65K\", \"totalSubmission\": \"112.8K\", \"totalAcceptedRaw\": 65030, \"totalSubmissionRaw\": 112833, \"acRate\": \"57.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"331","questionFrontendId":"331","title":"Verify Preorder Serialization of a Binary Tree","titleSlug":"verify-preorder-serialization-of-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"127.4K\", \"totalSubmission\": \"286K\", \"totalAcceptedRaw\": 127418, \"totalSubmissionRaw\": 285960, \"acRate\": \"44.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"336","questionFrontendId":"336","title":"Palindrome Pairs","titleSlug":"palindrome-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"191.2K\", \"totalSubmission\": \"545.9K\", \"totalAcceptedRaw\": 191190, \"totalSubmissionRaw\": 545949, \"acRate\": \"35.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"340","questionFrontendId":"340","title":"Longest Substring with At Most K Distinct Characters","titleSlug":"longest-substring-with-at-most-k-distinct-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"307.7K\", \"totalSubmission\": \"641.4K\", \"totalAcceptedRaw\": 307714, \"totalSubmissionRaw\": 641394, \"acRate\": \"48.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"344","questionFrontendId":"344","title":"Reverse String","titleSlug":"reverse-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"2M\", \"totalSubmission\": \"2.6M\", \"totalAcceptedRaw\": 2022579, \"totalSubmissionRaw\": 2637990, \"acRate\": \"76.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"345","questionFrontendId":"345","title":"Reverse Vowels of a String","titleSlug":"reverse-vowels-of-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"486.4K\", \"totalSubmission\": \"971.8K\", \"totalAcceptedRaw\": 486374, \"totalSubmissionRaw\": 971803, \"acRate\": \"50.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"358","questionFrontendId":"358","title":"Rearrange String k Distance Apart","titleSlug":"rearrange-string-k-distance-apart","translatedTitle":null,"stats":"{\"totalAccepted\": \"57.4K\", \"totalSubmission\": \"152K\", \"totalAcceptedRaw\": 57395, \"totalSubmissionRaw\": 152041, \"acRate\": \"37.7%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"383","questionFrontendId":"383","title":"Ransom Note","titleSlug":"ransom-note","translatedTitle":null,"stats":"{\"totalAccepted\": \"719.9K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 719913, \"totalSubmissionRaw\": 1237820, \"acRate\": \"58.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"385","questionFrontendId":"385","title":"Mini Parser","titleSlug":"mini-parser","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.8K\", \"totalSubmission\": \"140.7K\", \"totalAcceptedRaw\": 51848, \"totalSubmissionRaw\": 140662, \"acRate\": \"36.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"387","questionFrontendId":"387","title":"First Unique Character in a String","titleSlug":"first-unique-character-in-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 1362161, \"totalSubmissionRaw\": 2288838, \"acRate\": \"59.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"388","questionFrontendId":"388","title":"Longest Absolute File Path","titleSlug":"longest-absolute-file-path","translatedTitle":null,"stats":"{\"totalAccepted\": \"141K\", \"totalSubmission\": \"302.4K\", \"totalAcceptedRaw\": 141011, \"totalSubmissionRaw\": 302371, \"acRate\": \"46.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"389","questionFrontendId":"389","title":"Find the Difference","titleSlug":"find-the-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"482.5K\", \"totalSubmission\": \"804.5K\", \"totalAcceptedRaw\": 482524, \"totalSubmissionRaw\": 804520, \"acRate\": \"60.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"392","questionFrontendId":"392","title":"Is Subsequence","titleSlug":"is-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"791.5K\", \"totalSubmission\": \"1.7M\", \"totalAcceptedRaw\": 791508, \"totalSubmissionRaw\": 1658595, \"acRate\": \"47.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"394","questionFrontendId":"394","title":"Decode String","titleSlug":"decode-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"624.8K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 624825, \"totalSubmissionRaw\": 1080101, \"acRate\": \"57.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"395","questionFrontendId":"395","title":"Longest Substring with At Least K Repeating Characters","titleSlug":"longest-substring-with-at-least-k-repeating-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"184.9K\", \"totalSubmission\": \"412.9K\", \"totalAcceptedRaw\": 184867, \"totalSubmissionRaw\": 412866, \"acRate\": \"44.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"402","questionFrontendId":"402","title":"Remove K Digits","titleSlug":"remove-k-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"302.9K\", \"totalSubmission\": \"991K\", \"totalAcceptedRaw\": 302879, \"totalSubmissionRaw\": 991025, \"acRate\": \"30.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"408","questionFrontendId":"408","title":"Valid Word Abbreviation","titleSlug":"valid-word-abbreviation","translatedTitle":null,"stats":"{\"totalAccepted\": \"117.7K\", \"totalSubmission\": \"338K\", \"totalAcceptedRaw\": 117710, \"totalSubmissionRaw\": 337994, \"acRate\": \"34.8%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"409","questionFrontendId":"409","title":"Longest Palindrome","titleSlug":"longest-palindrome","translatedTitle":null,"stats":"{\"totalAccepted\": \"487.3K\", \"totalSubmission\": \"898.1K\", \"totalAcceptedRaw\": 487322, \"totalSubmissionRaw\": 898065, \"acRate\": \"54.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"411","questionFrontendId":"411","title":"Minimum Unique Word Abbreviation","titleSlug":"minimum-unique-word-abbreviation","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"36K\", \"totalAcceptedRaw\": 14181, \"totalSubmissionRaw\": 35994, \"acRate\": \"39.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"412","questionFrontendId":"412","title":"Fizz Buzz","titleSlug":"fizz-buzz","translatedTitle":null,"stats":"{\"totalAccepted\": \"917.1K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 917146, \"totalSubmissionRaw\": 1313667, \"acRate\": \"69.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"415","questionFrontendId":"415","title":"Add Strings","titleSlug":"add-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"555.8K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 555816, \"totalSubmissionRaw\": 1058823, \"acRate\": \"52.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"418","questionFrontendId":"418","title":"Sentence Screen Fitting","titleSlug":"sentence-screen-fitting","translatedTitle":null,"stats":"{\"totalAccepted\": \"92.4K\", \"totalSubmission\": \"259.5K\", \"totalAcceptedRaw\": 92418, \"totalSubmissionRaw\": 259492, \"acRate\": \"35.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"420","questionFrontendId":"420","title":"Strong Password Checker","titleSlug":"strong-password-checker","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.3K\", \"totalSubmission\": \"227.2K\", \"totalAcceptedRaw\": 31332, \"totalSubmissionRaw\": 227183, \"acRate\": \"13.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"423","questionFrontendId":"423","title":"Reconstruct Original Digits from English","titleSlug":"reconstruct-original-digits-from-english","translatedTitle":null,"stats":"{\"totalAccepted\": \"71.5K\", \"totalSubmission\": \"139.4K\", \"totalAcceptedRaw\": 71468, \"totalSubmissionRaw\": 139416, \"acRate\": \"51.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"424","questionFrontendId":"424","title":"Longest Repeating Character Replacement","titleSlug":"longest-repeating-character-replacement","translatedTitle":null,"stats":"{\"totalAccepted\": \"423.3K\", \"totalSubmission\": \"816.3K\", \"totalAcceptedRaw\": 423254, \"totalSubmissionRaw\": 816265, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"425","questionFrontendId":"425","title":"Word Squares","titleSlug":"word-squares","translatedTitle":null,"stats":"{\"totalAccepted\": \"69.2K\", \"totalSubmission\": \"131.1K\", \"totalAcceptedRaw\": 69203, \"totalSubmissionRaw\": 131137, \"acRate\": \"52.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"433","questionFrontendId":"433","title":"Minimum Genetic Mutation","titleSlug":"minimum-genetic-mutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.6K\", \"totalSubmission\": \"219K\", \"totalAcceptedRaw\": 114574, \"totalSubmissionRaw\": 218999, \"acRate\": \"52.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"434","questionFrontendId":"434","title":"Number of Segments in a String","titleSlug":"number-of-segments-in-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"140.5K\", \"totalSubmission\": \"377.7K\", \"totalAcceptedRaw\": 140527, \"totalSubmissionRaw\": 377664, \"acRate\": \"37.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"438","questionFrontendId":"438","title":"Find All Anagrams in a String","titleSlug":"find-all-anagrams-in-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"742.2K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 742156, \"totalSubmissionRaw\": 1479640, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"439","questionFrontendId":"439","title":"Ternary Expression Parser","titleSlug":"ternary-expression-parser","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.3K\", \"totalSubmission\": \"45K\", \"totalAcceptedRaw\": 26291, \"totalSubmissionRaw\": 45029, \"acRate\": \"58.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"443","questionFrontendId":"443","title":"String Compression","titleSlug":"string-compression","translatedTitle":null,"stats":"{\"totalAccepted\": \"368.5K\", \"totalSubmission\": \"706.8K\", \"totalAcceptedRaw\": 368457, \"totalSubmissionRaw\": 706751, \"acRate\": \"52.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"449","questionFrontendId":"449","title":"Serialize and Deserialize BST","titleSlug":"serialize-and-deserialize-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"215.8K\", \"totalSubmission\": \"378.7K\", \"totalAcceptedRaw\": 215815, \"totalSubmissionRaw\": 378697, \"acRate\": \"57.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"451","questionFrontendId":"451","title":"Sort Characters By Frequency","titleSlug":"sort-characters-by-frequency","translatedTitle":null,"stats":"{\"totalAccepted\": \"494.3K\", \"totalSubmission\": \"705.6K\", \"totalAcceptedRaw\": 494256, \"totalSubmissionRaw\": 705582, \"acRate\": \"70.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Bucket Sort","translatedName":null,"slug":"bucket-sort","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"459","questionFrontendId":"459","title":"Repeated Substring Pattern","titleSlug":"repeated-substring-pattern","translatedTitle":null,"stats":"{\"totalAccepted\": \"288.5K\", \"totalSubmission\": \"659.8K\", \"totalAcceptedRaw\": 288500, \"totalSubmissionRaw\": 659835, \"acRate\": \"43.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"466","questionFrontendId":"466","title":"Count The Repetitions","titleSlug":"count-the-repetitions","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.7K\", \"totalSubmission\": \"53.4K\", \"totalAcceptedRaw\": 15686, \"totalSubmissionRaw\": 53400, \"acRate\": \"29.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"467","questionFrontendId":"467","title":"Unique Substrings in Wraparound String","titleSlug":"unique-substrings-in-wraparound-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.2K\", \"totalSubmission\": \"101.8K\", \"totalAcceptedRaw\": 39233, \"totalSubmissionRaw\": 101834, \"acRate\": \"38.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"468","questionFrontendId":"468","title":"Validate IP Address","titleSlug":"validate-ip-address","translatedTitle":null,"stats":"{\"totalAccepted\": \"141.2K\", \"totalSubmission\": \"530.9K\", \"totalAcceptedRaw\": 141233, \"totalSubmissionRaw\": 530869, \"acRate\": \"26.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"471","questionFrontendId":"471","title":"Encode String with Shortest Length","titleSlug":"encode-string-with-shortest-length","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.8K\", \"totalSubmission\": \"58.8K\", \"totalAcceptedRaw\": 29752, \"totalSubmissionRaw\": 58813, \"acRate\": \"50.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"472","questionFrontendId":"472","title":"Concatenated Words","titleSlug":"concatenated-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"206K\", \"totalSubmission\": \"411.5K\", \"totalAcceptedRaw\": 206044, \"totalSubmissionRaw\": 411541, \"acRate\": \"50.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"474","questionFrontendId":"474","title":"Ones and Zeroes","titleSlug":"ones-and-zeroes","translatedTitle":null,"stats":"{\"totalAccepted\": \"166.9K\", \"totalSubmission\": \"357K\", \"totalAcceptedRaw\": 166876, \"totalSubmissionRaw\": 356991, \"acRate\": \"46.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"481","questionFrontendId":"481","title":"Magical String","titleSlug":"magical-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.5K\", \"totalSubmission\": \"62.1K\", \"totalAcceptedRaw\": 31473, \"totalSubmissionRaw\": 62063, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"482","questionFrontendId":"482","title":"License Key Formatting","titleSlug":"license-key-formatting","translatedTitle":null,"stats":"{\"totalAccepted\": \"245.6K\", \"totalSubmission\": \"567.6K\", \"totalAcceptedRaw\": 245609, \"totalSubmissionRaw\": 567615, \"acRate\": \"43.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"484","questionFrontendId":"484","title":"Find Permutation","titleSlug":"find-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.8K\", \"totalSubmission\": \"53.5K\", \"totalAcceptedRaw\": 35822, \"totalSubmissionRaw\": 53518, \"acRate\": \"66.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"488","questionFrontendId":"488","title":"Zuma Game","titleSlug":"zuma-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.3K\", \"totalSubmission\": \"62.8K\", \"totalAcceptedRaw\": 21336, \"totalSubmissionRaw\": 62820, \"acRate\": \"34.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"500","questionFrontendId":"500","title":"Keyboard Row","titleSlug":"keyboard-row","translatedTitle":null,"stats":"{\"totalAccepted\": \"181K\", \"totalSubmission\": \"260.4K\", \"totalAcceptedRaw\": 180999, \"totalSubmissionRaw\": 260416, \"acRate\": \"69.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"514","questionFrontendId":"514","title":"Freedom Trail","titleSlug":"freedom-trail","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.6K\", \"totalSubmission\": \"67.2K\", \"totalAcceptedRaw\": 31575, \"totalSubmissionRaw\": 67241, \"acRate\": \"47.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"516","questionFrontendId":"516","title":"Longest Palindromic Subsequence","titleSlug":"longest-palindromic-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"324.7K\", \"totalSubmission\": \"532.5K\", \"totalAcceptedRaw\": 324716, \"totalSubmissionRaw\": 532478, \"acRate\": \"61.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"520","questionFrontendId":"520","title":"Detect Capital","titleSlug":"detect-capital","translatedTitle":null,"stats":"{\"totalAccepted\": \"384.6K\", \"totalSubmission\": \"674.3K\", \"totalAcceptedRaw\": 384584, \"totalSubmissionRaw\": 674321, \"acRate\": \"57.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"521","questionFrontendId":"521","title":"Longest Uncommon Subsequence I","titleSlug":"longest-uncommon-subsequence-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"95.1K\", \"totalSubmission\": \"157.8K\", \"totalAcceptedRaw\": 95126, \"totalSubmissionRaw\": 157773, \"acRate\": \"60.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"522","questionFrontendId":"522","title":"Longest Uncommon Subsequence II","titleSlug":"longest-uncommon-subsequence-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.8K\", \"totalSubmission\": \"115.7K\", \"totalAcceptedRaw\": 46844, \"totalSubmissionRaw\": 115706, \"acRate\": \"40.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"524","questionFrontendId":"524","title":"Longest Word in Dictionary through Deleting","titleSlug":"longest-word-in-dictionary-through-deleting","translatedTitle":null,"stats":"{\"totalAccepted\": \"140K\", \"totalSubmission\": \"274.4K\", \"totalAcceptedRaw\": 140046, \"totalSubmissionRaw\": 274393, \"acRate\": \"51.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"527","questionFrontendId":"527","title":"Word Abbreviation","titleSlug":"word-abbreviation","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.9K\", \"totalSubmission\": \"42.7K\", \"totalAcceptedRaw\": 25866, \"totalSubmissionRaw\": 42671, \"acRate\": \"60.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"535","questionFrontendId":"535","title":"Encode and Decode TinyURL","titleSlug":"encode-and-decode-tinyurl","translatedTitle":null,"stats":"{\"totalAccepted\": \"225.6K\", \"totalSubmission\": \"262.6K\", \"totalAcceptedRaw\": 225605, \"totalSubmissionRaw\": 262567, \"acRate\": \"85.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"536","questionFrontendId":"536","title":"Construct Binary Tree from String","titleSlug":"construct-binary-tree-from-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"82.8K\", \"totalSubmission\": \"147.3K\", \"totalAcceptedRaw\": 82832, \"totalSubmissionRaw\": 147300, \"acRate\": \"56.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"537","questionFrontendId":"537","title":"Complex Number Multiplication","titleSlug":"complex-number-multiplication","translatedTitle":null,"stats":"{\"totalAccepted\": \"87.2K\", \"totalSubmission\": \"122.1K\", \"totalAcceptedRaw\": 87195, \"totalSubmissionRaw\": 122114, \"acRate\": \"71.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"539","questionFrontendId":"539","title":"Minimum Time Difference","titleSlug":"minimum-time-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"121.4K\", \"totalSubmission\": \"215.4K\", \"totalAcceptedRaw\": 121424, \"totalSubmissionRaw\": 215391, \"acRate\": \"56.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"541","questionFrontendId":"541","title":"Reverse String II","titleSlug":"reverse-string-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"191.1K\", \"totalSubmission\": \"378.6K\", \"totalAcceptedRaw\": 191096, \"totalSubmissionRaw\": 378602, \"acRate\": \"50.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"544","questionFrontendId":"544","title":"Output Contest Matches","titleSlug":"output-contest-matches","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.9K\", \"totalSubmission\": \"33.7K\", \"totalAcceptedRaw\": 25908, \"totalSubmissionRaw\": 33687, \"acRate\": \"76.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"551","questionFrontendId":"551","title":"Student Attendance Record I","titleSlug":"student-attendance-record-i","translatedTitle":null,"stats":"{\"totalAccepted\": \"173.7K\", \"totalSubmission\": \"360.6K\", \"totalAcceptedRaw\": 173712, \"totalSubmissionRaw\": 360558, \"acRate\": \"48.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"555","questionFrontendId":"555","title":"Split Concatenated Strings","titleSlug":"split-concatenated-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"14.5K\", \"totalAcceptedRaw\": 6335, \"totalSubmissionRaw\": 14533, \"acRate\": \"43.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"556","questionFrontendId":"556","title":"Next Greater Element III","titleSlug":"next-greater-element-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.2K\", \"totalSubmission\": \"365.1K\", \"totalAcceptedRaw\": 124200, \"totalSubmissionRaw\": 365078, \"acRate\": \"34.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"557","questionFrontendId":"557","title":"Reverse Words in a String III","titleSlug":"reverse-words-in-a-string-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"668.7K\", \"totalSubmission\": \"816.7K\", \"totalAcceptedRaw\": 668707, \"totalSubmissionRaw\": 816698, \"acRate\": \"81.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"564","questionFrontendId":"564","title":"Find the Closest Palindrome","titleSlug":"find-the-closest-palindrome","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.5K\", \"totalSubmission\": \"171.2K\", \"totalAcceptedRaw\": 37488, \"totalSubmissionRaw\": 171228, \"acRate\": \"21.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"567","questionFrontendId":"567","title":"Permutation in String","titleSlug":"permutation-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"624.7K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 624728, \"totalSubmissionRaw\": 1408151, \"acRate\": \"44.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"583","questionFrontendId":"583","title":"Delete Operation for Two Strings","titleSlug":"delete-operation-for-two-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"199.7K\", \"totalSubmission\": \"334.4K\", \"totalAcceptedRaw\": 199716, \"totalSubmissionRaw\": 334362, \"acRate\": \"59.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"588","questionFrontendId":"588","title":"Design In-Memory File System","titleSlug":"design-in-memory-file-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"84K\", \"totalSubmission\": \"172.6K\", \"totalAcceptedRaw\": 83961, \"totalSubmissionRaw\": 172639, \"acRate\": \"48.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"591","questionFrontendId":"591","title":"Tag Validator","titleSlug":"tag-validator","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.9K\", \"totalSubmission\": \"34.7K\", \"totalAcceptedRaw\": 12892, \"totalSubmissionRaw\": 34687, \"acRate\": \"37.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"592","questionFrontendId":"592","title":"Fraction Addition and Subtraction","titleSlug":"fraction-addition-and-subtraction","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.1K\", \"totalSubmission\": \"61.3K\", \"totalAcceptedRaw\": 32098, \"totalSubmissionRaw\": 61306, \"acRate\": \"52.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"599","questionFrontendId":"599","title":"Minimum Index Sum of Two Lists","titleSlug":"minimum-index-sum-of-two-lists","translatedTitle":null,"stats":"{\"totalAccepted\": \"185.2K\", \"totalSubmission\": \"347.5K\", \"totalAcceptedRaw\": 185166, \"totalSubmissionRaw\": 347545, \"acRate\": \"53.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"604","questionFrontendId":"604","title":"Design Compressed String Iterator","titleSlug":"design-compressed-string-iterator","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.3K\", \"totalSubmission\": \"74.2K\", \"totalAcceptedRaw\": 29303, \"totalSubmissionRaw\": 74168, \"acRate\": \"39.5%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Iterator","translatedName":null,"slug":"iterator","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"606","questionFrontendId":"606","title":"Construct String from Binary Tree","titleSlug":"construct-string-from-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"213.6K\", \"totalSubmission\": \"334K\", \"totalAcceptedRaw\": 213587, \"totalSubmissionRaw\": 333989, \"acRate\": \"64.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"609","questionFrontendId":"609","title":"Find Duplicate File in System","titleSlug":"find-duplicate-file-in-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"143.6K\", \"totalSubmission\": \"211.9K\", \"totalAcceptedRaw\": 143589, \"totalSubmissionRaw\": 211868, \"acRate\": \"67.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"616","questionFrontendId":"616","title":"Add Bold Tag in String","titleSlug":"add-bold-tag-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"82.1K\", \"totalSubmission\": \"168.2K\", \"totalAcceptedRaw\": 82101, \"totalSubmissionRaw\": 168183, \"acRate\": \"48.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"635","questionFrontendId":"635","title":"Design Log Storage System","titleSlug":"design-log-storage-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.1K\", \"totalSubmission\": \"52.7K\", \"totalAcceptedRaw\": 33081, \"totalSubmissionRaw\": 52688, \"acRate\": \"62.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"639","questionFrontendId":"639","title":"Decode Ways II","titleSlug":"decode-ways-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"66.5K\", \"totalSubmission\": \"218.9K\", \"totalAcceptedRaw\": 66524, \"totalSubmissionRaw\": 218905, \"acRate\": \"30.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"640","questionFrontendId":"640","title":"Solve the Equation","titleSlug":"solve-the-equation","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.5K\", \"totalSubmission\": \"81.9K\", \"totalAcceptedRaw\": 35522, \"totalSubmissionRaw\": 81854, \"acRate\": \"43.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"642","questionFrontendId":"642","title":"Design Search Autocomplete System","titleSlug":"design-search-autocomplete-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"128.5K\", \"totalSubmission\": \"264.2K\", \"totalAcceptedRaw\": 128527, \"totalSubmissionRaw\": 264221, \"acRate\": \"48.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"647","questionFrontendId":"647","title":"Palindromic Substrings","titleSlug":"palindromic-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"555.4K\", \"totalSubmission\": \"831.1K\", \"totalAcceptedRaw\": 555402, \"totalSubmissionRaw\": 831117, \"acRate\": \"66.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"648","questionFrontendId":"648","title":"Replace Words","titleSlug":"replace-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"116.5K\", \"totalSubmission\": \"185.8K\", \"totalAcceptedRaw\": 116539, \"totalSubmissionRaw\": 185827, \"acRate\": \"62.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"649","questionFrontendId":"649","title":"Dota2 Senate","titleSlug":"dota2-senate","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.9K\", \"totalSubmission\": \"56.5K\", \"totalAcceptedRaw\": 22925, \"totalSubmissionRaw\": 56503, \"acRate\": \"40.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"657","questionFrontendId":"657","title":"Robot Return to Origin","titleSlug":"robot-return-to-origin","translatedTitle":null,"stats":"{\"totalAccepted\": \"364.5K\", \"totalSubmission\": \"484K\", \"totalAcceptedRaw\": 364519, \"totalSubmissionRaw\": 483952, \"acRate\": \"75.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"664","questionFrontendId":"664","title":"Strange Printer","titleSlug":"strange-printer","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.5K\", \"totalSubmission\": \"67.3K\", \"totalAcceptedRaw\": 31524, \"totalSubmissionRaw\": 67274, \"acRate\": \"46.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"676","questionFrontendId":"676","title":"Implement Magic Dictionary","titleSlug":"implement-magic-dictionary","translatedTitle":null,"stats":"{\"totalAccepted\": \"71K\", \"totalSubmission\": \"124.7K\", \"totalAcceptedRaw\": 70984, \"totalSubmissionRaw\": 124652, \"acRate\": \"56.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"677","questionFrontendId":"677","title":"Map Sum Pairs","titleSlug":"map-sum-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"101.7K\", \"totalSubmission\": \"179K\", \"totalAcceptedRaw\": 101720, \"totalSubmissionRaw\": 179038, \"acRate\": \"56.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"678","questionFrontendId":"678","title":"Valid Parenthesis String","titleSlug":"valid-parenthesis-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"201.5K\", \"totalSubmission\": \"591.2K\", \"totalAcceptedRaw\": 201452, \"totalSubmissionRaw\": 591200, \"acRate\": \"34.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"680","questionFrontendId":"680","title":"Valid Palindrome II","titleSlug":"valid-palindrome-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"582.4K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 582437, \"totalSubmissionRaw\": 1480464, \"acRate\": \"39.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"681","questionFrontendId":"681","title":"Next Closest Time","titleSlug":"next-closest-time","translatedTitle":null,"stats":"{\"totalAccepted\": \"101.5K\", \"totalSubmission\": \"218.9K\", \"totalAcceptedRaw\": 101539, \"totalSubmissionRaw\": 218857, \"acRate\": \"46.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"686","questionFrontendId":"686","title":"Repeated String Match","titleSlug":"repeated-string-match","translatedTitle":null,"stats":"{\"totalAccepted\": \"137.3K\", \"totalSubmission\": \"401.7K\", \"totalAcceptedRaw\": 137252, \"totalSubmissionRaw\": 401688, \"acRate\": \"34.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"691","questionFrontendId":"691","title":"Stickers to Spell Word","titleSlug":"stickers-to-spell-word","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.2K\", \"totalSubmission\": \"80.4K\", \"totalAcceptedRaw\": 37219, \"totalSubmissionRaw\": 80424, \"acRate\": \"46.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"692","questionFrontendId":"692","title":"Top K Frequent Words","titleSlug":"top-k-frequent-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"532.5K\", \"totalSubmission\": \"932.1K\", \"totalAcceptedRaw\": 532489, \"totalSubmissionRaw\": 932140, \"acRate\": \"57.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Bucket Sort","translatedName":null,"slug":"bucket-sort","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"696","questionFrontendId":"696","title":"Count Binary Substrings","titleSlug":"count-binary-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"182K\", \"totalSubmission\": \"277.7K\", \"totalAcceptedRaw\": 182030, \"totalSubmissionRaw\": 277684, \"acRate\": \"65.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"712","questionFrontendId":"712","title":"Minimum ASCII Delete Sum for Two Strings","titleSlug":"minimum-ascii-delete-sum-for-two-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"74.8K\", \"totalSubmission\": \"119.7K\", \"totalAcceptedRaw\": 74836, \"totalSubmissionRaw\": 119682, \"acRate\": \"62.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"720","questionFrontendId":"720","title":"Longest Word in Dictionary","titleSlug":"longest-word-in-dictionary","translatedTitle":null,"stats":"{\"totalAccepted\": \"134.4K\", \"totalSubmission\": \"258.7K\", \"totalAcceptedRaw\": 134388, \"totalSubmissionRaw\": 258746, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"721","questionFrontendId":"721","title":"Accounts Merge","titleSlug":"accounts-merge","translatedTitle":null,"stats":"{\"totalAccepted\": \"302.4K\", \"totalSubmission\": \"536.7K\", \"totalAcceptedRaw\": 302411, \"totalSubmissionRaw\": 536748, \"acRate\": \"56.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"722","questionFrontendId":"722","title":"Remove Comments","titleSlug":"remove-comments","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.9K\", \"totalSubmission\": \"167.4K\", \"totalAcceptedRaw\": 63933, \"totalSubmissionRaw\": 167372, \"acRate\": \"38.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"726","questionFrontendId":"726","title":"Number of Atoms","titleSlug":"number-of-atoms","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.4K\", \"totalSubmission\": \"100.6K\", \"totalAcceptedRaw\": 52417, \"totalSubmissionRaw\": 100570, \"acRate\": \"52.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"727","questionFrontendId":"727","title":"Minimum Window Subsequence","titleSlug":"minimum-window-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"82.8K\", \"totalSubmission\": \"193.3K\", \"totalAcceptedRaw\": 82819, \"totalSubmissionRaw\": 193257, \"acRate\": \"42.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"730","questionFrontendId":"730","title":"Count Different Palindromic Subsequences","titleSlug":"count-different-palindromic-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.3K\", \"totalSubmission\": \"72.2K\", \"totalAcceptedRaw\": 32336, \"totalSubmissionRaw\": 72206, \"acRate\": \"44.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"734","questionFrontendId":"734","title":"Sentence Similarity","titleSlug":"sentence-similarity","translatedTitle":null,"stats":"{\"totalAccepted\": \"60K\", \"totalSubmission\": \"136.4K\", \"totalAcceptedRaw\": 59975, \"totalSubmissionRaw\": 136387, \"acRate\": \"44.0%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"736","questionFrontendId":"736","title":"Parse Lisp Expression","titleSlug":"parse-lisp-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.1K\", \"totalSubmission\": \"39K\", \"totalAcceptedRaw\": 20132, \"totalSubmissionRaw\": 39027, \"acRate\": \"51.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"737","questionFrontendId":"737","title":"Sentence Similarity II","titleSlug":"sentence-similarity-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.1K\", \"totalSubmission\": \"132.8K\", \"totalAcceptedRaw\": 65064, \"totalSubmissionRaw\": 132773, \"acRate\": \"49.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"742","questionFrontendId":"709","title":"To Lower Case","titleSlug":"to-lower-case","translatedTitle":null,"stats":"{\"totalAccepted\": \"409.4K\", \"totalSubmission\": \"497.4K\", \"totalAcceptedRaw\": 409388, \"totalSubmissionRaw\": 497388, \"acRate\": \"82.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"746","questionFrontendId":"745","title":"Prefix and Suffix Search","titleSlug":"prefix-and-suffix-search","translatedTitle":null,"stats":"{\"totalAccepted\": \"89.3K\", \"totalSubmission\": \"216.5K\", \"totalAcceptedRaw\": 89321, \"totalSubmissionRaw\": 216530, \"acRate\": \"41.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"749","questionFrontendId":"748","title":"Shortest Completing Word","titleSlug":"shortest-completing-word","translatedTitle":null,"stats":"{\"totalAccepted\": \"59.9K\", \"totalSubmission\": \"101.2K\", \"totalAcceptedRaw\": 59934, \"totalSubmissionRaw\": 101198, \"acRate\": \"59.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"752","questionFrontendId":"751","title":"IP to CIDR","titleSlug":"ip-to-cidr","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.7K\", \"totalSubmission\": \"32.5K\", \"totalAcceptedRaw\": 17699, \"totalSubmissionRaw\": 32480, \"acRate\": \"54.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"753","questionFrontendId":"752","title":"Open the Lock","titleSlug":"open-the-lock","translatedTitle":null,"stats":"{\"totalAccepted\": \"197.6K\", \"totalSubmission\": \"355.3K\", \"totalAcceptedRaw\": 197567, \"totalSubmissionRaw\": 355274, \"acRate\": \"55.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"760","questionFrontendId":"758","title":"Bold Words in String","titleSlug":"bold-words-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.8K\", \"totalSubmission\": \"35K\", \"totalAcceptedRaw\": 17751, \"totalSubmissionRaw\": 34957, \"acRate\": \"50.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"763","questionFrontendId":"761","title":"Special Binary String","titleSlug":"special-binary-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.9K\", \"totalSubmission\": \"24.7K\", \"totalAcceptedRaw\": 14871, \"totalSubmissionRaw\": 24693, \"acRate\": \"60.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"765","questionFrontendId":"428","title":"Serialize and Deserialize N-ary Tree","titleSlug":"serialize-and-deserialize-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"77.9K\", \"totalSubmission\": \"118.1K\", \"totalAcceptedRaw\": 77875, \"totalSubmissionRaw\": 118100, \"acRate\": \"65.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"768","questionFrontendId":"763","title":"Partition Labels","titleSlug":"partition-labels","translatedTitle":null,"stats":"{\"totalAccepted\": \"456.9K\", \"totalSubmission\": \"572.9K\", \"totalAcceptedRaw\": 456930, \"totalSubmissionRaw\": 572908, \"acRate\": \"79.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"778","questionFrontendId":"767","title":"Reorganize String","titleSlug":"reorganize-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"258.4K\", \"totalSubmission\": \"488.8K\", \"totalAcceptedRaw\": 258384, \"totalSubmissionRaw\": 488762, \"acRate\": \"52.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"781","questionFrontendId":"770","title":"Basic Calculator IV","titleSlug":"basic-calculator-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"16.4K\", \"totalAcceptedRaw\": 9186, \"totalSubmissionRaw\": 16435, \"acRate\": \"55.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"782","questionFrontendId":"771","title":"Jewels and Stones","titleSlug":"jewels-and-stones","translatedTitle":null,"stats":"{\"totalAccepted\": \"852.8K\", \"totalSubmission\": \"967K\", \"totalAcceptedRaw\": 852766, \"totalSubmissionRaw\": 967031, \"acRate\": \"88.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"785","questionFrontendId":"772","title":"Basic Calculator III","titleSlug":"basic-calculator-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"102.3K\", \"totalSubmission\": \"209.6K\", \"totalAcceptedRaw\": 102271, \"totalSubmissionRaw\": 209557, \"acRate\": \"48.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"793","questionFrontendId":"777","title":"Swap Adjacent in LR String","titleSlug":"swap-adjacent-in-lr-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"68.9K\", \"totalSubmission\": \"187K\", \"totalAcceptedRaw\": 68906, \"totalSubmissionRaw\": 187031, \"acRate\": \"36.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"800","questionFrontendId":"784","title":"Letter Case Permutation","titleSlug":"letter-case-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"266.4K\", \"totalSubmission\": \"361.1K\", \"totalAcceptedRaw\": 266409, \"totalSubmissionRaw\": 361088, \"acRate\": \"73.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"807","questionFrontendId":"791","title":"Custom Sort String","titleSlug":"custom-sort-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"210.9K\", \"totalSubmission\": \"304.9K\", \"totalAcceptedRaw\": 210867, \"totalSubmissionRaw\": 304922, \"acRate\": \"69.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"808","questionFrontendId":"792","title":"Number of Matching Subsequences","titleSlug":"number-of-matching-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"208K\", \"totalSubmission\": \"402.6K\", \"totalAcceptedRaw\": 207969, \"totalSubmissionRaw\": 402573, \"acRate\": \"51.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"810","questionFrontendId":"794","title":"Valid Tic-Tac-Toe State","titleSlug":"valid-tic-tac-toe-state","translatedTitle":null,"stats":"{\"totalAccepted\": \"53.7K\", \"totalSubmission\": \"153K\", \"totalAcceptedRaw\": 53653, \"totalSubmissionRaw\": 153047, \"acRate\": \"35.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"812","questionFrontendId":"796","title":"Rotate String","titleSlug":"rotate-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"199.9K\", \"totalSubmission\": \"362.9K\", \"totalAcceptedRaw\": 199911, \"totalSubmissionRaw\": 362866, \"acRate\": \"55.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"818","questionFrontendId":"800","title":"Similar RGB Color","titleSlug":"similar-rgb-color","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.2K\", \"totalSubmission\": \"24.2K\", \"totalAcceptedRaw\": 16229, \"totalSubmissionRaw\": 24222, \"acRate\": \"67.0%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"822","questionFrontendId":"804","title":"Unique Morse Code Words","titleSlug":"unique-morse-code-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"310.5K\", \"totalSubmission\": \"375.8K\", \"totalAcceptedRaw\": 310457, \"totalSubmissionRaw\": 375758, \"acRate\": \"82.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"824","questionFrontendId":"806","title":"Number of Lines To Write String","titleSlug":"number-of-lines-to-write-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.7K\", \"totalSubmission\": \"95.6K\", \"totalAcceptedRaw\": 63669, \"totalSubmissionRaw\": 95597, \"acRate\": \"66.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"827","questionFrontendId":"809","title":"Expressive Words","titleSlug":"expressive-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"106.8K\", \"totalSubmission\": \"231.1K\", \"totalAcceptedRaw\": 106800, \"totalSubmissionRaw\": 231052, \"acRate\": \"46.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"829","questionFrontendId":"811","title":"Subdomain Visit Count","titleSlug":"subdomain-visit-count","translatedTitle":null,"stats":"{\"totalAccepted\": \"206.8K\", \"totalSubmission\": \"273.9K\", \"totalAcceptedRaw\": 206801, \"totalSubmissionRaw\": 273946, \"acRate\": \"75.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"834","questionFrontendId":"816","title":"Ambiguous Coordinates","titleSlug":"ambiguous-coordinates","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.5K\", \"totalSubmission\": \"48.8K\", \"totalAcceptedRaw\": 27495, \"totalSubmissionRaw\": 48839, \"acRate\": \"56.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"837","questionFrontendId":"819","title":"Most Common Word","titleSlug":"most-common-word","translatedTitle":null,"stats":"{\"totalAccepted\": \"322K\", \"totalSubmission\": \"719.2K\", \"totalAcceptedRaw\": 321984, \"totalSubmissionRaw\": 719249, \"acRate\": \"44.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"839","questionFrontendId":"820","title":"Short Encoding of Words","titleSlug":"short-encoding-of-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"91.4K\", \"totalSubmission\": \"150.8K\", \"totalAcceptedRaw\": 91354, \"totalSubmissionRaw\": 150755, \"acRate\": \"60.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"841","questionFrontendId":"821","title":"Shortest Distance to a Character","titleSlug":"shortest-distance-to-a-character","translatedTitle":null,"stats":"{\"totalAccepted\": \"155.2K\", \"totalSubmission\": \"217.6K\", \"totalAcceptedRaw\": 155206, \"totalSubmissionRaw\": 217571, \"acRate\": \"71.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"851","questionFrontendId":"824","title":"Goat Latin","titleSlug":"goat-latin","translatedTitle":null,"stats":"{\"totalAccepted\": \"155.6K\", \"totalSubmission\": \"229K\", \"totalAcceptedRaw\": 155602, \"totalSubmissionRaw\": 229042, \"acRate\": \"67.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"855","questionFrontendId":"828","title":"Count Unique Characters of All Substrings of a Given String","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.4K\", \"totalSubmission\": \"122.4K\", \"totalAcceptedRaw\": 63363, \"totalSubmissionRaw\": 122446, \"acRate\": \"51.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"857","questionFrontendId":"830","title":"Positions of Large Groups","titleSlug":"positions-of-large-groups","translatedTitle":null,"stats":"{\"totalAccepted\": \"81.6K\", \"totalSubmission\": \"157.6K\", \"totalAcceptedRaw\": 81611, \"totalSubmissionRaw\": 157576, \"acRate\": \"51.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"858","questionFrontendId":"831","title":"Masking Personal Information","titleSlug":"masking-personal-information","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.4K\", \"totalSubmission\": \"34.7K\", \"totalAcceptedRaw\": 16433, \"totalSubmissionRaw\": 34670, \"acRate\": \"47.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"862","questionFrontendId":"833","title":"Find And Replace in String","titleSlug":"find-and-replace-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"133.3K\", \"totalSubmission\": \"246.8K\", \"totalAcceptedRaw\": 133263, \"totalSubmissionRaw\": 246785, \"acRate\": \"54.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"868","questionFrontendId":"838","title":"Push Dominoes","titleSlug":"push-dominoes","translatedTitle":null,"stats":"{\"totalAccepted\": \"111.6K\", \"totalSubmission\": \"195.9K\", \"totalAcceptedRaw\": 111586, \"totalSubmissionRaw\": 195868, \"acRate\": \"57.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"869","questionFrontendId":"839","title":"Similar String Groups","titleSlug":"similar-string-groups","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.9K\", \"totalSubmission\": \"133.2K\", \"totalAcceptedRaw\": 63879, \"totalSubmissionRaw\": 133184, \"acRate\": \"48.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"872","questionFrontendId":"842","title":"Split Array into Fibonacci Sequence","titleSlug":"split-array-into-fibonacci-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"35K\", \"totalSubmission\": \"91K\", \"totalAcceptedRaw\": 34959, \"totalSubmissionRaw\": 91038, \"acRate\": \"38.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"873","questionFrontendId":"843","title":"Guess the Word","titleSlug":"guess-the-word","translatedTitle":null,"stats":"{\"totalAccepted\": \"130.1K\", \"totalSubmission\": \"314.2K\", \"totalAcceptedRaw\": 130129, \"totalSubmissionRaw\": 314220, \"acRate\": \"41.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"874","questionFrontendId":"844","title":"Backspace String Compare","titleSlug":"backspace-string-compare","translatedTitle":null,"stats":"{\"totalAccepted\": \"614.2K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 614158, \"totalSubmissionRaw\": 1278182, \"acRate\": \"48.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"878","questionFrontendId":"848","title":"Shifting Letters","titleSlug":"shifting-letters","translatedTitle":null,"stats":"{\"totalAccepted\": \"84.4K\", \"totalSubmission\": \"186.7K\", \"totalAcceptedRaw\": 84404, \"totalSubmissionRaw\": 186717, \"acRate\": \"45.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"884","questionFrontendId":"854","title":"K-Similar Strings","titleSlug":"k-similar-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.6K\", \"totalSubmission\": \"101.2K\", \"totalAcceptedRaw\": 40590, \"totalSubmissionRaw\": 101190, \"acRate\": \"40.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"886","questionFrontendId":"856","title":"Score of Parentheses","titleSlug":"score-of-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"155.6K\", \"totalSubmission\": \"240.2K\", \"totalAcceptedRaw\": 155607, \"totalSubmissionRaw\": 240222, \"acRate\": \"64.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"889","questionFrontendId":"859","title":"Buddy Strings","titleSlug":"buddy-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"144.1K\", \"totalSubmission\": \"494.2K\", \"totalAcceptedRaw\": 144115, \"totalSubmissionRaw\": 494218, \"acRate\": \"29.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"916","questionFrontendId":"880","title":"Decoded String at Index","titleSlug":"decoded-string-at-index","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.1K\", \"totalSubmission\": \"127.4K\", \"totalAcceptedRaw\": 36081, \"totalSubmissionRaw\": 127381, \"acRate\": \"28.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"920","questionFrontendId":"884","title":"Uncommon Words from Two Sentences","titleSlug":"uncommon-words-from-two-sentences","translatedTitle":null,"stats":"{\"totalAccepted\": \"115.6K\", \"totalSubmission\": \"174.3K\", \"totalAcceptedRaw\": 115606, \"totalSubmissionRaw\": 174297, \"acRate\": \"66.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"926","questionFrontendId":"890","title":"Find and Replace Pattern","titleSlug":"find-and-replace-pattern","translatedTitle":null,"stats":"{\"totalAccepted\": \"167.9K\", \"totalSubmission\": \"216.3K\", \"totalAcceptedRaw\": 167897, \"totalSubmissionRaw\": 216346, \"acRate\": \"77.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"929","questionFrontendId":"893","title":"Groups of Special-Equivalent Strings","titleSlug":"groups-of-special-equivalent-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.6K\", \"totalSubmission\": \"62.7K\", \"totalAcceptedRaw\": 44551, \"totalSubmissionRaw\": 62696, \"acRate\": \"71.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"935","questionFrontendId":"899","title":"Orderly Queue","titleSlug":"orderly-queue","translatedTitle":null,"stats":"{\"totalAccepted\": \"64.3K\", \"totalSubmission\": \"96.9K\", \"totalAcceptedRaw\": 64299, \"totalSubmissionRaw\": 96906, \"acRate\": \"66.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"938","questionFrontendId":"902","title":"Numbers At Most N Given Digit Set","titleSlug":"numbers-at-most-n-given-digit-set","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.6K\", \"totalSubmission\": \"95.6K\", \"totalAcceptedRaw\": 39603, \"totalSubmissionRaw\": 95582, \"acRate\": \"41.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"952","questionFrontendId":"916","title":"Word Subsets","titleSlug":"word-subsets","translatedTitle":null,"stats":"{\"totalAccepted\": \"107.7K\", \"totalSubmission\": \"200.3K\", \"totalAcceptedRaw\": 107678, \"totalSubmissionRaw\": 200341, \"acRate\": \"53.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"953","questionFrontendId":"917","title":"Reverse Only Letters","titleSlug":"reverse-only-letters","translatedTitle":null,"stats":"{\"totalAccepted\": \"159.1K\", \"totalSubmission\": \"256.8K\", \"totalAcceptedRaw\": 159081, \"totalSubmissionRaw\": 256808, \"acRate\": \"61.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"957","questionFrontendId":"921","title":"Minimum Add to Make Parentheses Valid","titleSlug":"minimum-add-to-make-parentheses-valid","translatedTitle":null,"stats":"{\"totalAccepted\": \"250.9K\", \"totalSubmission\": \"330.9K\", \"totalAcceptedRaw\": 250856, \"totalSubmissionRaw\": 330899, \"acRate\": \"75.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"961","questionFrontendId":"925","title":"Long Pressed Name","titleSlug":"long-pressed-name","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.8K\", \"totalSubmission\": \"346.2K\", \"totalAcceptedRaw\": 114808, \"totalSubmissionRaw\": 346195, \"acRate\": \"33.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"962","questionFrontendId":"926","title":"Flip String to Monotone Increasing","titleSlug":"flip-string-to-monotone-increasing","translatedTitle":null,"stats":"{\"totalAccepted\": \"173.8K\", \"totalSubmission\": \"282.6K\", \"totalAcceptedRaw\": 173772, \"totalSubmissionRaw\": 282582, \"acRate\": \"61.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"965","questionFrontendId":"929","title":"Unique Email Addresses","titleSlug":"unique-email-addresses","translatedTitle":null,"stats":"{\"totalAccepted\": \"415.2K\", \"totalSubmission\": \"618.4K\", \"totalAcceptedRaw\": 415205, \"totalSubmissionRaw\": 618445, \"acRate\": \"67.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"973","questionFrontendId":"936","title":"Stamping The Sequence","titleSlug":"stamping-the-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"56.2K\", \"totalSubmission\": \"89.1K\", \"totalAcceptedRaw\": 56159, \"totalSubmissionRaw\": 89097, \"acRate\": \"63.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"974","questionFrontendId":"937","title":"Reorder Data in Log Files","titleSlug":"reorder-data-in-log-files","translatedTitle":null,"stats":"{\"totalAccepted\": \"340.3K\", \"totalSubmission\": \"603.5K\", \"totalAcceptedRaw\": 340321, \"totalSubmissionRaw\": 603482, \"acRate\": \"56.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"977","questionFrontendId":"940","title":"Distinct Subsequences II","titleSlug":"distinct-subsequences-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.5K\", \"totalSubmission\": \"73.9K\", \"totalAcceptedRaw\": 32490, \"totalSubmissionRaw\": 73863, \"acRate\": \"44.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"979","questionFrontendId":"942","title":"DI String Match","titleSlug":"di-string-match","translatedTitle":null,"stats":"{\"totalAccepted\": \"128.6K\", \"totalSubmission\": \"166.4K\", \"totalAcceptedRaw\": 128585, \"totalSubmissionRaw\": 166435, \"acRate\": \"77.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"980","questionFrontendId":"943","title":"Find the Shortest Superstring","titleSlug":"find-the-shortest-superstring","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.8K\", \"totalSubmission\": \"58K\", \"totalAcceptedRaw\": 25813, \"totalSubmissionRaw\": 58022, \"acRate\": \"44.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"981","questionFrontendId":"944","title":"Delete Columns to Make Sorted","titleSlug":"delete-columns-to-make-sorted","translatedTitle":null,"stats":"{\"totalAccepted\": \"168.5K\", \"totalSubmission\": \"225.3K\", \"totalAcceptedRaw\": 168537, \"totalSubmissionRaw\": 225319, \"acRate\": \"74.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"986","questionFrontendId":"949","title":"Largest Time for Given Digits","titleSlug":"largest-time-for-given-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"78K\", \"totalSubmission\": \"221.9K\", \"totalAcceptedRaw\": 78048, \"totalSubmissionRaw\": 221942, \"acRate\": \"35.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"990","questionFrontendId":"953","title":"Verifying an Alien Dictionary","titleSlug":"verifying-an-alien-dictionary","translatedTitle":null,"stats":"{\"totalAccepted\": \"453.7K\", \"totalSubmission\": \"833.1K\", \"totalAcceptedRaw\": 453731, \"totalSubmissionRaw\": 833145, \"acRate\": \"54.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"992","questionFrontendId":"955","title":"Delete Columns to Make Sorted II","titleSlug":"delete-columns-to-make-sorted-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.7K\", \"totalSubmission\": \"51K\", \"totalAcceptedRaw\": 17692, \"totalSubmissionRaw\": 50999, \"acRate\": \"34.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1000","questionFrontendId":"960","title":"Delete Columns to Make Sorted III","titleSlug":"delete-columns-to-make-sorted-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"12K\", \"totalSubmission\": \"20.9K\", \"totalAcceptedRaw\": 11983, \"totalSubmissionRaw\": 20933, \"acRate\": \"57.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1006","questionFrontendId":"966","title":"Vowel Spellchecker","titleSlug":"vowel-spellchecker","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.2K\", \"totalSubmission\": \"74.2K\", \"totalAcceptedRaw\": 38161, \"totalSubmissionRaw\": 74214, \"acRate\": \"51.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1012","questionFrontendId":"972","title":"Equal Rational Numbers","titleSlug":"equal-rational-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"14.1K\", \"totalAcceptedRaw\": 6140, \"totalSubmissionRaw\": 14149, \"acRate\": \"43.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1023","questionFrontendId":"981","title":"Time Based Key-Value Store","titleSlug":"time-based-key-value-store","translatedTitle":null,"stats":"{\"totalAccepted\": \"306.6K\", \"totalSubmission\": \"585.3K\", \"totalAcceptedRaw\": 306561, \"totalSubmissionRaw\": 585265, \"acRate\": \"52.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1026","questionFrontendId":"984","title":"String Without AAA or BBB","titleSlug":"string-without-aaa-or-bbb","translatedTitle":null,"stats":"{\"totalAccepted\": \"40K\", \"totalSubmission\": \"92.9K\", \"totalAcceptedRaw\": 40003, \"totalSubmissionRaw\": 92866, \"acRate\": \"43.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1030","questionFrontendId":"988","title":"Smallest String Starting From Leaf","titleSlug":"smallest-string-starting-from-leaf","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.6K\", \"totalSubmission\": \"130.7K\", \"totalAcceptedRaw\": 65584, \"totalSubmissionRaw\": 130696, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1032","questionFrontendId":"990","title":"Satisfiability of Equality Equations","titleSlug":"satisfiability-of-equality-equations","translatedTitle":null,"stats":"{\"totalAccepted\": \"109.1K\", \"totalSubmission\": \"216K\", \"totalAcceptedRaw\": 109149, \"totalSubmissionRaw\": 215959, \"acRate\": \"50.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1044","questionFrontendId":"1002","title":"Find Common Characters","titleSlug":"find-common-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"174.1K\", \"totalSubmission\": \"254.4K\", \"totalAcceptedRaw\": 174136, \"totalSubmissionRaw\": 254382, \"acRate\": \"68.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1045","questionFrontendId":"1003","title":"Check If Word Is Valid After Substitutions","titleSlug":"check-if-word-is-valid-after-substitutions","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.6K\", \"totalSubmission\": \"83.5K\", \"totalAcceptedRaw\": 48576, \"totalSubmissionRaw\": 83477, \"acRate\": \"58.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1051","questionFrontendId":"1055","title":"Shortest Way to Form String","titleSlug":"shortest-way-to-form-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.2K\", \"totalSubmission\": \"131K\", \"totalAcceptedRaw\": 78202, \"totalSubmissionRaw\": 130990, \"acRate\": \"59.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1053","questionFrontendId":"1058","title":"Minimize Rounding Error to Meet Target","titleSlug":"minimize-rounding-error-to-meet-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.4K\", \"totalSubmission\": \"18.7K\", \"totalAcceptedRaw\": 8379, \"totalSubmissionRaw\": 18653, \"acRate\": \"44.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1058","questionFrontendId":"1061","title":"Lexicographically Smallest Equivalent String","titleSlug":"lexicographically-smallest-equivalent-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"68K\", \"totalSubmission\": \"88.9K\", \"totalAcceptedRaw\": 68018, \"totalSubmissionRaw\": 88879, \"acRate\": \"76.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1060","questionFrontendId":"1062","title":"Longest Repeating Substring","titleSlug":"longest-repeating-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.4K\", \"totalSubmission\": \"54.7K\", \"totalAcceptedRaw\": 32408, \"totalSubmissionRaw\": 54744, \"acRate\": \"59.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Suffix Array","translatedName":null,"slug":"suffix-array","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1065","questionFrontendId":"1016","title":"Binary String With Substrings Representing 1 To N","titleSlug":"binary-string-with-substrings-representing-1-to-n","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.9K\", \"totalSubmission\": \"57.3K\", \"totalAcceptedRaw\": 32885, \"totalSubmissionRaw\": 57330, \"acRate\": \"57.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1075","questionFrontendId":"1065","title":"Index Pairs of a String","titleSlug":"index-pairs-of-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.7K\", \"totalSubmission\": \"32.5K\", \"totalAcceptedRaw\": 20743, \"totalSubmissionRaw\": 32527, \"acRate\": \"63.8%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1076","questionFrontendId":"1087","title":"Brace Expansion","titleSlug":"brace-expansion","translatedTitle":null,"stats":"{\"totalAccepted\": \"47.4K\", \"totalSubmission\": \"71.6K\", \"totalAcceptedRaw\": 47375, \"totalSubmissionRaw\": 71592, \"acRate\": \"66.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1078","questionFrontendId":"1021","title":"Remove Outermost Parentheses","titleSlug":"remove-outermost-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"211K\", \"totalSubmission\": \"261.8K\", \"totalAcceptedRaw\": 211015, \"totalSubmissionRaw\": 261782, \"acRate\": \"80.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1080","questionFrontendId":"1023","title":"Camelcase Matching","titleSlug":"camelcase-matching","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.6K\", \"totalSubmission\": \"63.8K\", \"totalAcceptedRaw\": 38623, \"totalSubmissionRaw\": 63767, \"acRate\": \"60.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1084","questionFrontendId":"1100","title":"Find K-Length Substrings With No Repeated Characters","titleSlug":"find-k-length-substrings-with-no-repeated-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.3K\", \"totalSubmission\": \"45.9K\", \"totalAcceptedRaw\": 34284, \"totalSubmissionRaw\": 45921, \"acRate\": \"74.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1089","questionFrontendId":"1119","title":"Remove Vowels from a String","titleSlug":"remove-vowels-from-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"93.6K\", \"totalSubmission\": \"103.1K\", \"totalAcceptedRaw\": 93594, \"totalSubmissionRaw\": 103088, \"acRate\": \"90.8%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1093","questionFrontendId":"1028","title":"Recover a Tree From Preorder Traversal","titleSlug":"recover-a-tree-from-preorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"41.8K\", \"totalSubmission\": \"57K\", \"totalAcceptedRaw\": 41771, \"totalSubmissionRaw\": 57034, \"acRate\": \"73.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1097","questionFrontendId":"1032","title":"Stream of Characters","titleSlug":"stream-of-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"81.4K\", \"totalSubmission\": \"157.8K\", \"totalAcceptedRaw\": 81407, \"totalSubmissionRaw\": 157795, \"acRate\": \"51.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1112","questionFrontendId":"1160","title":"Find Words That Can Be Formed by Characters","titleSlug":"find-words-that-can-be-formed-by-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"142.2K\", \"totalSubmission\": \"210.5K\", \"totalAcceptedRaw\": 142183, \"totalSubmissionRaw\": 210516, \"acRate\": \"67.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1119","questionFrontendId":"1041","title":"Robot Bounded In Circle","titleSlug":"robot-bounded-in-circle","translatedTitle":null,"stats":"{\"totalAccepted\": \"208K\", \"totalSubmission\": \"376.2K\", \"totalAcceptedRaw\": 208025, \"totalSubmissionRaw\": 376207, \"acRate\": \"55.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1122","questionFrontendId":"1044","title":"Longest Duplicate Substring","titleSlug":"longest-duplicate-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"61.2K\", \"totalSubmission\": \"200.2K\", \"totalAcceptedRaw\": 61173, \"totalSubmissionRaw\": 200160, \"acRate\": \"30.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Suffix Array","translatedName":null,"slug":"suffix-array","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1123","questionFrontendId":"1165","title":"Single-Row Keyboard","titleSlug":"single-row-keyboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"71.1K\", \"totalSubmission\": \"82.2K\", \"totalAcceptedRaw\": 71145, \"totalSubmissionRaw\": 82203, \"acRate\": \"86.5%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1124","questionFrontendId":"1153","title":"String Transforms Into Another String","titleSlug":"string-transforms-into-another-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"50.4K\", \"totalSubmission\": \"142.9K\", \"totalAcceptedRaw\": 50427, \"totalSubmissionRaw\": 142874, \"acRate\": \"35.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1125","questionFrontendId":"1166","title":"Design File System","titleSlug":"design-file-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"41.6K\", \"totalSubmission\": \"66.9K\", \"totalAcceptedRaw\": 41551, \"totalSubmissionRaw\": 66918, \"acRate\": \"62.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1128","questionFrontendId":"1047","title":"Remove All Adjacent Duplicates In String","titleSlug":"remove-all-adjacent-duplicates-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"430.9K\", \"totalSubmission\": \"617.8K\", \"totalAcceptedRaw\": 430853, \"totalSubmissionRaw\": 617823, \"acRate\": \"69.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1129","questionFrontendId":"1048","title":"Longest String Chain","titleSlug":"longest-string-chain","translatedTitle":null,"stats":"{\"totalAccepted\": \"302.1K\", \"totalSubmission\": \"509.9K\", \"totalAcceptedRaw\": 302070, \"totalSubmissionRaw\": 509934, \"acRate\": \"59.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1131","questionFrontendId":"1180","title":"Count Substrings with Only One Distinct Letter","titleSlug":"count-substrings-with-only-one-distinct-letter","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.5K\", \"totalSubmission\": \"29.8K\", \"totalAcceptedRaw\": 23548, \"totalSubmissionRaw\": 29793, \"acRate\": \"79.0%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1132","questionFrontendId":"1181","title":"Before and After Puzzle","titleSlug":"before-and-after-puzzle","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"20.4K\", \"totalAcceptedRaw\": 9235, \"totalSubmissionRaw\": 20399, \"acRate\": \"45.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1133","questionFrontendId":"1163","title":"Last Substring in Lexicographical Order","titleSlug":"last-substring-in-lexicographical-order","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.5K\", \"totalSubmission\": \"90.6K\", \"totalAcceptedRaw\": 31518, \"totalSubmissionRaw\": 90644, \"acRate\": \"34.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1146","questionFrontendId":"1071","title":"Greatest Common Divisor of Strings","titleSlug":"greatest-common-divisor-of-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"161.3K\", \"totalSubmission\": \"284.9K\", \"totalAcceptedRaw\": 161350, \"totalSubmissionRaw\": 284899, \"acRate\": \"56.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1156","questionFrontendId":"1078","title":"Occurrences After Bigram","titleSlug":"occurrences-after-bigram","translatedTitle":null,"stats":"{\"totalAccepted\": \"60.8K\", \"totalSubmission\": \"95.6K\", \"totalAcceptedRaw\": 60814, \"totalSubmissionRaw\": 95622, \"acRate\": \"63.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1159","questionFrontendId":"1081","title":"Smallest Subsequence of Distinct Characters","titleSlug":"smallest-subsequence-of-distinct-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.9K\", \"totalSubmission\": \"84.7K\", \"totalAcceptedRaw\": 48945, \"totalSubmissionRaw\": 84669, \"acRate\": \"57.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1160","questionFrontendId":"1079","title":"Letter Tile Possibilities","titleSlug":"letter-tile-possibilities","translatedTitle":null,"stats":"{\"totalAccepted\": \"83.1K\", \"totalSubmission\": \"109.3K\", \"totalAcceptedRaw\": 83056, \"totalSubmissionRaw\": 109302, \"acRate\": \"76.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1170","questionFrontendId":"1092","title":"Shortest Common Supersequence ","titleSlug":"shortest-common-supersequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"71.5K\", \"totalSubmission\": \"123.2K\", \"totalAcceptedRaw\": 71491, \"totalSubmissionRaw\": 123230, \"acRate\": \"58.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1178","questionFrontendId":"1216","title":"Valid Palindrome III","titleSlug":"valid-palindrome-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.4K\", \"totalSubmission\": \"86K\", \"totalAcceptedRaw\": 43370, \"totalSubmissionRaw\": 85966, \"acRate\": \"50.5%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1188","questionFrontendId":"1096","title":"Brace Expansion II","titleSlug":"brace-expansion-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.1K\", \"totalSubmission\": \"34.8K\", \"totalAcceptedRaw\": 22075, \"totalSubmissionRaw\": 34791, \"acRate\": \"63.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1189","questionFrontendId":"1256","title":"Encode Number","titleSlug":"encode-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"7K\", \"totalSubmission\": \"10.1K\", \"totalAcceptedRaw\": 7038, \"totalSubmissionRaw\": 10071, \"acRate\": \"69.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1190","questionFrontendId":"1257","title":"Smallest Common Region","titleSlug":"smallest-common-region","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.5K\", \"totalSubmission\": \"30.3K\", \"totalAcceptedRaw\": 19481, \"totalSubmissionRaw\": 30285, \"acRate\": \"64.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1191","questionFrontendId":"1258","title":"Synonymous Sentences","titleSlug":"synonymous-sentences","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.9K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 18944, \"totalSubmissionRaw\": 33431, \"acRate\": \"56.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1197","questionFrontendId":"1106","title":"Parsing A Boolean Expression","titleSlug":"parsing-a-boolean-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.4K\", \"totalSubmission\": \"38.4K\", \"totalAcceptedRaw\": 22440, \"totalSubmissionRaw\": 38424, \"acRate\": \"58.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1199","questionFrontendId":"1271","title":"Hexspeak","titleSlug":"hexspeak","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.3K\", \"totalSubmission\": \"16.2K\", \"totalAcceptedRaw\": 9274, \"totalSubmissionRaw\": 16228, \"acRate\": \"57.1%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1205","questionFrontendId":"1108","title":"Defanging an IP Address","titleSlug":"defanging-an-ip-address","translatedTitle":null,"stats":"{\"totalAccepted\": \"501.6K\", \"totalSubmission\": \"562.9K\", \"totalAcceptedRaw\": 501647, \"totalSubmissionRaw\": 562914, \"acRate\": \"89.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1208","questionFrontendId":"1111","title":"Maximum Nesting Depth of Two Valid Parentheses Strings","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.7K\", \"totalSubmission\": \"31.1K\", \"totalAcceptedRaw\": 22738, \"totalSubmissionRaw\": 31131, \"acRate\": \"73.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1211","questionFrontendId":"1286","title":"Iterator for Combination","titleSlug":"iterator-for-combination","translatedTitle":null,"stats":"{\"totalAccepted\": \"67.4K\", \"totalSubmission\": \"91.9K\", \"totalAcceptedRaw\": 67366, \"totalSubmissionRaw\": 91860, \"acRate\": \"73.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Iterator","translatedName":null,"slug":"iterator","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1238","questionFrontendId":"1138","title":"Alphabet Board Path","titleSlug":"alphabet-board-path","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.3K\", \"totalSubmission\": \"89.1K\", \"totalAcceptedRaw\": 46329, \"totalSubmissionRaw\": 89085, \"acRate\": \"52.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1244","questionFrontendId":"1316","title":"Distinct Echo Substrings","titleSlug":"distinct-echo-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.9K\", \"totalSubmission\": \"28K\", \"totalAcceptedRaw\": 13885, \"totalSubmissionRaw\": 27967, \"acRate\": \"49.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1250","questionFrontendId":"1143","title":"Longest Common Subsequence","titleSlug":"longest-common-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"662.4K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 662420, \"totalSubmissionRaw\": 1133822, \"acRate\": \"58.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1251","questionFrontendId":"1147","title":"Longest Chunked Palindrome Decomposition","titleSlug":"longest-chunked-palindrome-decomposition","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.8K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 19821, \"totalSubmissionRaw\": 33394, \"acRate\": \"59.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1252","questionFrontendId":"1328","title":"Break a Palindrome","titleSlug":"break-a-palindrome","translatedTitle":null,"stats":"{\"totalAccepted\": \"144.1K\", \"totalSubmission\": \"273.6K\", \"totalAcceptedRaw\": 144113, \"totalSubmissionRaw\": 273608, \"acRate\": \"52.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1260","questionFrontendId":"1154","title":"Day of the Year","titleSlug":"day-of-the-year","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.6K\", \"totalSubmission\": \"85.8K\", \"totalAcceptedRaw\": 42590, \"totalSubmissionRaw\": 85818, \"acRate\": \"49.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1261","questionFrontendId":"1156","title":"Swap For Longest Repeated Character Substring","titleSlug":"swap-for-longest-repeated-character-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.7K\", \"totalSubmission\": \"59.1K\", \"totalAcceptedRaw\": 26683, \"totalSubmissionRaw\": 59087, \"acRate\": \"45.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1264","questionFrontendId":"1935","title":"Maximum Number of Words You Can Type","titleSlug":"maximum-number-of-words-you-can-type","translatedTitle":null,"stats":"{\"totalAccepted\": \"42K\", \"totalSubmission\": \"58.7K\", \"totalAcceptedRaw\": 41982, \"totalSubmissionRaw\": 58737, \"acRate\": \"71.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1271","questionFrontendId":"1236","title":"Web Crawler","titleSlug":"web-crawler","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.8K\", \"totalSubmission\": \"44.9K\", \"totalAcceptedRaw\": 29825, \"totalSubmissionRaw\": 44866, \"acRate\": \"66.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1272","questionFrontendId":"1169","title":"Invalid Transactions","titleSlug":"invalid-transactions","translatedTitle":null,"stats":"{\"totalAccepted\": \"60.2K\", \"totalSubmission\": \"192.9K\", \"totalAcceptedRaw\": 60216, \"totalSubmissionRaw\": 192888, \"acRate\": \"31.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1273","questionFrontendId":"1170","title":"Compare Strings by Frequency of the Smallest Character","titleSlug":"compare-strings-by-frequency-of-the-smallest-character","translatedTitle":null,"stats":"{\"totalAccepted\": \"72.1K\", \"totalSubmission\": \"117.3K\", \"totalAcceptedRaw\": 72132, \"totalSubmissionRaw\": 117266, \"acRate\": \"61.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1274","questionFrontendId":"1360","title":"Number of Days Between Two Dates","titleSlug":"number-of-days-between-two-dates","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.9K\", \"totalSubmission\": \"80.9K\", \"totalAcceptedRaw\": 38880, \"totalSubmissionRaw\": 80860, \"acRate\": \"48.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1281","questionFrontendId":"1177","title":"Can Make Palindrome from Substring","titleSlug":"can-make-palindrome-from-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.4K\", \"totalSubmission\": \"61.6K\", \"totalAcceptedRaw\": 23400, \"totalSubmissionRaw\": 61594, \"acRate\": \"38.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1282","questionFrontendId":"1178","title":"Number of Valid Words for Each Puzzle","titleSlug":"number-of-valid-words-for-each-puzzle","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.4K\", \"totalSubmission\": \"61.4K\", \"totalAcceptedRaw\": 28445, \"totalSubmissionRaw\": 61429, \"acRate\": \"46.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1283","questionFrontendId":"1507","title":"Reformat Date","titleSlug":"reformat-date","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.8K\", \"totalSubmission\": \"83.6K\", \"totalAcceptedRaw\": 52849, \"totalSubmissionRaw\": 83564, \"acRate\": \"63.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1297","questionFrontendId":"1189","title":"Maximum Number of Balloons","titleSlug":"maximum-number-of-balloons","translatedTitle":null,"stats":"{\"totalAccepted\": \"141.5K\", \"totalSubmission\": \"231.5K\", \"totalAcceptedRaw\": 141536, \"totalSubmissionRaw\": 231498, \"acRate\": \"61.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1298","questionFrontendId":"1190","title":"Reverse Substrings Between Each Pair of Parentheses","titleSlug":"reverse-substrings-between-each-pair-of-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"59.9K\", \"totalSubmission\": \"90.9K\", \"totalAcceptedRaw\": 59910, \"totalSubmissionRaw\": 90887, \"acRate\": \"65.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1302","questionFrontendId":"1957","title":"Delete Characters to Make Fancy String","titleSlug":"delete-characters-to-make-fancy-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.7K\", \"totalSubmission\": \"46.8K\", \"totalAcceptedRaw\": 26683, \"totalSubmissionRaw\": 46807, \"acRate\": \"57.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1304","questionFrontendId":"1405","title":"Longest Happy String","titleSlug":"longest-happy-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.9K\", \"totalSubmission\": \"111.4K\", \"totalAcceptedRaw\": 63924, \"totalSubmissionRaw\": 111374, \"acRate\": \"57.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1308","questionFrontendId":"1202","title":"Smallest String With Swaps","titleSlug":"smallest-string-with-swaps","translatedTitle":null,"stats":"{\"totalAccepted\": \"96.9K\", \"totalSubmission\": \"168.2K\", \"totalAcceptedRaw\": 96903, \"totalSubmissionRaw\": 168244, \"acRate\": \"57.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1320","questionFrontendId":"1209","title":"Remove All Adjacent Duplicates in String II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"260.4K\", \"totalSubmission\": \"463.6K\", \"totalAcceptedRaw\": 260414, \"totalSubmissionRaw\": 463629, \"acRate\": \"56.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1321","questionFrontendId":"1208","title":"Get Equal Substrings Within Budget","titleSlug":"get-equal-substrings-within-budget","translatedTitle":null,"stats":"{\"totalAccepted\": \"37K\", \"totalSubmission\": \"76.3K\", \"totalAcceptedRaw\": 36954, \"totalSubmissionRaw\": 76261, \"acRate\": \"48.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1323","questionFrontendId":"10007","title":"Design Whatsapp","titleSlug":"design-whatsapp","translatedTitle":null,"stats":"{\"totalAccepted\": \"238\", \"totalSubmission\": \"750\", \"totalAcceptedRaw\": 238, \"totalSubmissionRaw\": 750, \"acRate\": \"31.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1336","questionFrontendId":"1960","title":"Maximum Product of the Length of Two Palindromic Substrings","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.6K\", \"totalSubmission\": \"8.8K\", \"totalAcceptedRaw\": 2612, \"totalSubmissionRaw\": 8779, \"acRate\": \"29.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1341","questionFrontendId":"1221","title":"Split a String in Balanced Strings","titleSlug":"split-a-string-in-balanced-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"239.8K\", \"totalSubmission\": \"281.8K\", \"totalAcceptedRaw\": 239850, \"totalSubmissionRaw\": 281820, \"acRate\": \"85.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1345","questionFrontendId":"1427","title":"Perform String Shifts","titleSlug":"perform-string-shifts","translatedTitle":null,"stats":"{\"totalAccepted\": \"73.4K\", \"totalSubmission\": \"135.1K\", \"totalAcceptedRaw\": 73379, \"totalSubmissionRaw\": 135140, \"acRate\": \"54.3%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1350","questionFrontendId":"1233","title":"Remove Sub-Folders from the Filesystem","titleSlug":"remove-sub-folders-from-the-filesystem","translatedTitle":null,"stats":"{\"totalAccepted\": \"47.7K\", \"totalSubmission\": \"72.7K\", \"totalAcceptedRaw\": 47678, \"totalSubmissionRaw\": 72718, \"acRate\": \"65.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1351","questionFrontendId":"1234","title":"Replace the Substring for Balanced String","titleSlug":"replace-the-substring-for-balanced-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.6K\", \"totalSubmission\": \"74.4K\", \"totalAcceptedRaw\": 27619, \"totalSubmissionRaw\": 74369, \"acRate\": \"37.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1353","questionFrontendId":"2273","title":"Find Resultant Array After Removing Anagrams","titleSlug":"find-resultant-array-after-removing-anagrams","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.4K\", \"totalSubmission\": \"65.7K\", \"totalAcceptedRaw\": 38388, \"totalSubmissionRaw\": 65727, \"acRate\": \"58.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1356","questionFrontendId":"2193","title":"Minimum Number of Moves to Make Palindrome","titleSlug":"minimum-number-of-moves-to-make-palindrome","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.9K\", \"totalSubmission\": \"32.9K\", \"totalAcceptedRaw\": 16895, \"totalSubmissionRaw\": 32935, \"acRate\": \"51.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1360","questionFrontendId":"1239","title":"Maximum Length of a Concatenated String with Unique Characters","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"170.2K\", \"totalSubmission\": \"326.2K\", \"totalAcceptedRaw\": 170160, \"totalSubmissionRaw\": 326223, \"acRate\": \"52.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1363","questionFrontendId":"2309","title":"Greatest English Letter in Upper and Lower Case","titleSlug":"greatest-english-letter-in-upper-and-lower-case","translatedTitle":null,"stats":"{\"totalAccepted\": \"38K\", \"totalSubmission\": \"55.2K\", \"totalAcceptedRaw\": 37952, \"totalSubmissionRaw\": 55162, \"acRate\": \"68.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1369","questionFrontendId":"1247","title":"Minimum Swaps to Make Strings Equal","titleSlug":"minimum-swaps-to-make-strings-equal","translatedTitle":null,"stats":"{\"totalAccepted\": \"33K\", \"totalSubmission\": \"51.6K\", \"totalAcceptedRaw\": 33020, \"totalSubmissionRaw\": 51556, \"acRate\": \"64.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1371","questionFrontendId":"1249","title":"Minimum Remove to Make Valid Parentheses","titleSlug":"minimum-remove-to-make-valid-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"491.2K\", \"totalSubmission\": \"746.3K\", \"totalAcceptedRaw\": 491233, \"totalSubmissionRaw\": 746336, \"acRate\": \"65.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1381","questionFrontendId":"1255","title":"Maximum Score Words Formed by Letters","titleSlug":"maximum-score-words-formed-by-letters","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.3K\", \"totalSubmission\": \"40.4K\", \"totalAcceptedRaw\": 29283, \"totalSubmissionRaw\": 40433, \"acRate\": \"72.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1384","questionFrontendId":"1618","title":"Maximum Font to Fit a Sentence in a Screen","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"10.2K\", \"totalAcceptedRaw\": 6103, \"totalSubmissionRaw\": 10219, \"acRate\": \"59.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1397","questionFrontendId":"1268","title":"Search Suggestions System","titleSlug":"search-suggestions-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"243K\", \"totalSubmission\": \"366.8K\", \"totalAcceptedRaw\": 243049, \"totalSubmissionRaw\": 366808, \"acRate\": \"66.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1403","questionFrontendId":"1278","title":"Palindrome Partitioning III","titleSlug":"palindrome-partitioning-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.8K\", \"totalSubmission\": \"37.5K\", \"totalAcceptedRaw\": 22794, \"totalSubmissionRaw\": 37493, \"acRate\": \"60.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1423","questionFrontendId":"1297","title":"Maximum Number of Occurrences of a Substring","titleSlug":"maximum-number-of-occurrences-of-a-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.3K\", \"totalSubmission\": \"77.6K\", \"totalAcceptedRaw\": 40266, \"totalSubmissionRaw\": 77602, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1429","questionFrontendId":"1307","title":"Verbal Arithmetic Puzzle","titleSlug":"verbal-arithmetic-puzzle","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"31.1K\", \"totalAcceptedRaw\": 10646, \"totalSubmissionRaw\": 31144, \"acRate\": \"34.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1430","questionFrontendId":"2269","title":"Find the K-Beauty of a Number","titleSlug":"find-the-k-beauty-of-a-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.6K\", \"totalSubmission\": \"59.9K\", \"totalAcceptedRaw\": 34563, \"totalSubmissionRaw\": 59925, \"acRate\": \"57.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1433","questionFrontendId":"2227","title":"Encrypt and Decrypt Strings","titleSlug":"encrypt-and-decrypt-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.8K\", \"totalSubmission\": \"25K\", \"totalAcceptedRaw\": 9848, \"totalSubmissionRaw\": 25014, \"acRate\": \"39.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1434","questionFrontendId":"1309","title":"Decrypt String from Alphabet to Integer Mapping","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping","translatedTitle":null,"stats":"{\"totalAccepted\": \"104.7K\", \"totalSubmission\": \"131.3K\", \"totalAcceptedRaw\": 104688, \"totalSubmissionRaw\": 131276, \"acRate\": \"79.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1437","questionFrontendId":"1312","title":"Minimum Insertion Steps to Make a String Palindrome","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome","translatedTitle":null,"stats":"{\"totalAccepted\": \"74.5K\", \"totalSubmission\": \"112.5K\", \"totalAcceptedRaw\": 74526, \"totalSubmissionRaw\": 112472, \"acRate\": \"66.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1443","questionFrontendId":"1320","title":"Minimum Distance to Type a Word Using Two Fingers","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.4K\", \"totalSubmission\": \"46.1K\", \"totalAcceptedRaw\": 27441, \"totalSubmissionRaw\": 46108, \"acRate\": \"59.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1449","questionFrontendId":"1324","title":"Print Words Vertically","titleSlug":"print-words-vertically","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.9K\", \"totalSubmission\": \"53.6K\", \"totalAcceptedRaw\": 32904, \"totalSubmissionRaw\": 53607, \"acRate\": \"61.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1454","questionFrontendId":"1332","title":"Remove Palindromic Subsequences","titleSlug":"remove-palindromic-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.3K\", \"totalSubmission\": \"156.6K\", \"totalAcceptedRaw\": 119307, \"totalSubmissionRaw\": 156554, \"acRate\": \"76.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1460","questionFrontendId":"1358","title":"Number of Substrings Containing All Three Characters","titleSlug":"number-of-substrings-containing-all-three-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"54.1K\", \"totalSubmission\": \"85.5K\", \"totalAcceptedRaw\": 54132, \"totalSubmissionRaw\": 85473, \"acRate\": \"63.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1469","questionFrontendId":"1347","title":"Minimum Number of Steps to Make Two Strings Anagram","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram","translatedTitle":null,"stats":"{\"totalAccepted\": \"125.3K\", \"totalSubmission\": \"161.1K\", \"totalAcceptedRaw\": 125278, \"totalSubmissionRaw\": 161099, \"acRate\": \"77.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1472","questionFrontendId":"1370","title":"Increasing Decreasing String","titleSlug":"increasing-decreasing-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"64.3K\", \"totalSubmission\": \"83.3K\", \"totalAcceptedRaw\": 64296, \"totalSubmissionRaw\": 83270, \"acRate\": \"77.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1473","questionFrontendId":"1371","title":"Find the Longest Substring Containing Vowels in Even Counts","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.1K\", \"totalSubmission\": \"35K\", \"totalAcceptedRaw\": 22143, \"totalSubmissionRaw\": 35043, \"acRate\": \"63.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1483","questionFrontendId":"1366","title":"Rank Teams by Votes","titleSlug":"rank-teams-by-votes","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.6K\", \"totalSubmission\": \"89.1K\", \"totalAcceptedRaw\": 51621, \"totalSubmissionRaw\": 89105, \"acRate\": \"57.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1490","questionFrontendId":"1374","title":"Generate a String With Characters That Have Odd Counts","titleSlug":"generate-a-string-with-characters-that-have-odd-counts","translatedTitle":null,"stats":"{\"totalAccepted\": \"77.7K\", \"totalSubmission\": \"100.1K\", \"totalAcceptedRaw\": 77705, \"totalSubmissionRaw\": 100127, \"acRate\": \"77.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1502","questionFrontendId":"1400","title":"Construct K Palindrome Strings","titleSlug":"construct-k-palindrome-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.4K\", \"totalSubmission\": \"70.5K\", \"totalAcceptedRaw\": 44364, \"totalSubmissionRaw\": 70490, \"acRate\": \"62.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1508","questionFrontendId":"1392","title":"Longest Happy Prefix","titleSlug":"longest-happy-prefix","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.8K\", \"totalSubmission\": \"64.2K\", \"totalAcceptedRaw\": 28821, \"totalSubmissionRaw\": 64241, \"acRate\": \"44.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1512","questionFrontendId":"1396","title":"Design Underground System","titleSlug":"design-underground-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"163.1K\", \"totalSubmission\": \"221.7K\", \"totalAcceptedRaw\": 163114, \"totalSubmissionRaw\": 221716, \"acRate\": \"73.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1513","questionFrontendId":"1397","title":"Find All Good Strings","titleSlug":"find-all-good-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.1K\", \"totalSubmission\": \"12.1K\", \"totalAcceptedRaw\": 5141, \"totalSubmissionRaw\": 12147, \"acRate\": \"42.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1516","questionFrontendId":"1415","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"31K\", \"totalSubmission\": \"42.9K\", \"totalAcceptedRaw\": 31044, \"totalSubmissionRaw\": 42854, \"acRate\": \"72.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1517","questionFrontendId":"1416","title":"Restore The Array","titleSlug":"restore-the-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.6K\", \"totalSubmission\": \"37.9K\", \"totalAcceptedRaw\": 14639, \"totalSubmissionRaw\": 37859, \"acRate\": \"38.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1520","questionFrontendId":"1404","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.5K\", \"totalSubmission\": \"63.8K\", \"totalAcceptedRaw\": 33506, \"totalSubmissionRaw\": 63755, \"acRate\": \"52.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1524","questionFrontendId":"1408","title":"String Matching in an Array","titleSlug":"string-matching-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"68.3K\", \"totalSubmission\": \"107K\", \"totalAcceptedRaw\": 68263, \"totalSubmissionRaw\": 107028, \"acRate\": \"63.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1526","questionFrontendId":"1410","title":"HTML Entity Parser","titleSlug":"html-entity-parser","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"40.9K\", \"totalAcceptedRaw\": 21160, \"totalSubmissionRaw\": 40928, \"acRate\": \"51.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1530","questionFrontendId":"1433","title":"Check If a String Can Break Another String","titleSlug":"check-if-a-string-can-break-another-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.2K\", \"totalSubmission\": \"51.1K\", \"totalAcceptedRaw\": 35226, \"totalSubmissionRaw\": 51128, \"acRate\": \"68.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1532","questionFrontendId":"1417","title":"Reformat The String","titleSlug":"reformat-the-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"49.3K\", \"totalSubmission\": \"89.9K\", \"totalAcceptedRaw\": 49287, \"totalSubmissionRaw\": 89866, \"acRate\": \"54.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1533","questionFrontendId":"1418","title":"Display Table of Food Orders in a Restaurant","titleSlug":"display-table-of-food-orders-in-a-restaurant","translatedTitle":null,"stats":"{\"totalAccepted\": \"23K\", \"totalSubmission\": \"31K\", \"totalAcceptedRaw\": 22977, \"totalSubmissionRaw\": 31012, \"acRate\": \"74.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1534","questionFrontendId":"1419","title":"Minimum Number of Frogs Croaking","titleSlug":"minimum-number-of-frogs-croaking","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.3K\", \"totalSubmission\": \"70.3K\", \"totalAcceptedRaw\": 35274, \"totalSubmissionRaw\": 70310, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1537","questionFrontendId":"1422","title":"Maximum Score After Splitting a String","titleSlug":"maximum-score-after-splitting-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.4K\", \"totalSubmission\": \"78.3K\", \"totalAcceptedRaw\": 45408, \"totalSubmissionRaw\": 78323, \"acRate\": \"58.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1542","questionFrontendId":"1446","title":"Consecutive Characters","titleSlug":"consecutive-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"137.5K\", \"totalSubmission\": \"224.3K\", \"totalAcceptedRaw\": 137473, \"totalSubmissionRaw\": 224328, \"acRate\": \"61.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1543","questionFrontendId":"1447","title":"Simplified Fractions","titleSlug":"simplified-fractions","translatedTitle":null,"stats":"{\"totalAccepted\": \"26K\", \"totalSubmission\": \"40K\", \"totalAcceptedRaw\": 26042, \"totalSubmissionRaw\": 40001, \"acRate\": \"65.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Number Theory","translatedName":null,"slug":"number-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1547","questionFrontendId":"1436","title":"Destination City","titleSlug":"destination-city","translatedTitle":null,"stats":"{\"totalAccepted\": \"122K\", \"totalSubmission\": \"157.4K\", \"totalAcceptedRaw\": 122013, \"totalSubmissionRaw\": 157449, \"acRate\": \"77.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1557","questionFrontendId":"1461","title":"Check If a String Contains All Binary Codes of Size K","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"108.2K\", \"totalSubmission\": \"191.1K\", \"totalAcceptedRaw\": 108224, \"totalSubmissionRaw\": 191129, \"acRate\": \"56.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1561","questionFrontendId":"1451","title":"Rearrange Words in a Sentence","titleSlug":"rearrange-words-in-a-sentence","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.8K\", \"totalSubmission\": \"69.4K\", \"totalAcceptedRaw\": 43767, \"totalSubmissionRaw\": 69432, \"acRate\": \"63.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1562","questionFrontendId":"1452","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"21K\", \"totalSubmission\": \"36.9K\", \"totalAcceptedRaw\": 20987, \"totalSubmissionRaw\": 36938, \"acRate\": \"56.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1566","questionFrontendId":"1455","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"62.7K\", \"totalSubmission\": \"97.6K\", \"totalAcceptedRaw\": 62651, \"totalSubmissionRaw\": 97576, \"acRate\": \"64.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1567","questionFrontendId":"1456","title":"Maximum Number of Vowels in a Substring of Given Length","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length","translatedTitle":null,"stats":"{\"totalAccepted\": \"56.9K\", \"totalSubmission\": \"97.8K\", \"totalAcceptedRaw\": 56880, \"totalSubmissionRaw\": 97819, \"acRate\": \"58.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1611","questionFrontendId":"1487","title":"Making File Names Unique","titleSlug":"making-file-names-unique","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.6K\", \"totalSubmission\": \"81.8K\", \"totalAcceptedRaw\": 29598, \"totalSubmissionRaw\": 81809, \"acRate\": \"36.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1619","questionFrontendId":"1496","title":"Path Crossing","titleSlug":"path-crossing","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.4K\", \"totalSubmission\": \"79.2K\", \"totalAcceptedRaw\": 44382, \"totalSubmissionRaw\": 79196, \"acRate\": \"56.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1629","questionFrontendId":"1505","title":"Minimum Possible Integer After at Most K Adjacent Swaps On Digits","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"22.5K\", \"totalAcceptedRaw\": 8624, \"totalSubmissionRaw\": 22462, \"acRate\": \"38.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1632","questionFrontendId":"1525","title":"Number of Good Ways to Split a String","titleSlug":"number-of-good-ways-to-split-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"87.9K\", \"totalSubmission\": \"127.4K\", \"totalAcceptedRaw\": 87869, \"totalSubmissionRaw\": 127374, \"acRate\": \"69.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1636","questionFrontendId":"1513","title":"Number of Substrings With Only 1s","titleSlug":"number-of-substrings-with-only-1s","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.1K\", \"totalSubmission\": \"79.6K\", \"totalAcceptedRaw\": 36148, \"totalSubmissionRaw\": 79597, \"acRate\": \"45.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1637","questionFrontendId":"1531","title":"String Compression II","titleSlug":"string-compression-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.2K\", \"totalSubmission\": \"87.2K\", \"totalAcceptedRaw\": 43183, \"totalSubmissionRaw\": 87171, \"acRate\": \"49.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1644","questionFrontendId":"1520","title":"Maximum Number of Non-Overlapping Substrings","titleSlug":"maximum-number-of-non-overlapping-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"13K\", \"totalSubmission\": \"34K\", \"totalAcceptedRaw\": 12990, \"totalSubmissionRaw\": 33994, \"acRate\": \"38.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1647","questionFrontendId":"1540","title":"Can Convert String in K Moves","titleSlug":"can-convert-string-in-k-moves","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.9K\", \"totalSubmission\": \"47.7K\", \"totalAcceptedRaw\": 15934, \"totalSubmissionRaw\": 47699, \"acRate\": \"33.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1648","questionFrontendId":"1541","title":"Minimum Insertions to Balance a Parentheses String","titleSlug":"minimum-insertions-to-balance-a-parentheses-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"38K\", \"totalSubmission\": \"76.2K\", \"totalAcceptedRaw\": 37999, \"totalSubmissionRaw\": 76238, \"acRate\": \"49.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1651","questionFrontendId":"1528","title":"Shuffle String","titleSlug":"shuffle-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"283.5K\", \"totalSubmission\": \"332.6K\", \"totalAcceptedRaw\": 283505, \"totalSubmissionRaw\": 332604, \"acRate\": \"85.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1652","questionFrontendId":"1529","title":"Minimum Suffix Flips","titleSlug":"minimum-suffix-flips","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.7K\", \"totalSubmission\": \"53.3K\", \"totalAcceptedRaw\": 38659, \"totalSubmissionRaw\": 53258, \"acRate\": \"72.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1660","questionFrontendId":"1556","title":"Thousand Separator","titleSlug":"thousand-separator","translatedTitle":null,"stats":"{\"totalAccepted\": \"41.1K\", \"totalSubmission\": \"75.3K\", \"totalAcceptedRaw\": 41074, \"totalSubmissionRaw\": 75262, \"acRate\": \"54.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1666","questionFrontendId":"1544","title":"Make The String Great","titleSlug":"make-the-string-great","translatedTitle":null,"stats":"{\"totalAccepted\": \"134.9K\", \"totalSubmission\": \"213.3K\", \"totalAcceptedRaw\": 134917, \"totalSubmissionRaw\": 213268, \"acRate\": \"63.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1667","questionFrontendId":"1545","title":"Find Kth Bit in Nth Binary String","titleSlug":"find-kth-bit-in-nth-binary-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.5K\", \"totalSubmission\": \"55.6K\", \"totalAcceptedRaw\": 32494, \"totalSubmissionRaw\": 55584, \"acRate\": \"58.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1668","questionFrontendId":"1542","title":"Find Longest Awesome Substring","titleSlug":"find-longest-awesome-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.1K\", \"totalSubmission\": \"26.9K\", \"totalAcceptedRaw\": 11135, \"totalSubmissionRaw\": 26865, \"acRate\": \"41.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1678","questionFrontendId":"1573","title":"Number of Ways to Split a String","titleSlug":"number-of-ways-to-split-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.6K\", \"totalSubmission\": \"72.8K\", \"totalAcceptedRaw\": 23643, \"totalSubmissionRaw\": 72778, \"acRate\": \"32.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1697","questionFrontendId":"1554","title":"Strings Differ by One Character","titleSlug":"strings-differ-by-one-character","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.9K\", \"totalSubmission\": \"51.4K\", \"totalAcceptedRaw\": 21909, \"totalSubmissionRaw\": 51392, \"acRate\": \"42.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1698","questionFrontendId":"1576","title":"Replace All ?'s to Avoid Consecutive Repeating Characters","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.7K\", \"totalSubmission\": \"107K\", \"totalAcceptedRaw\": 51686, \"totalSubmissionRaw\": 106986, \"acRate\": \"48.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1700","questionFrontendId":"1578","title":"Minimum Time to Make Rope Colorful","titleSlug":"minimum-time-to-make-rope-colorful","translatedTitle":null,"stats":"{\"totalAccepted\": \"144.9K\", \"totalSubmission\": \"228.1K\", \"totalAcceptedRaw\": 144852, \"totalSubmissionRaw\": 228129, \"acRate\": \"63.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1707","questionFrontendId":"1585","title":"Check If String Is Transformable With Substring Sort Operations","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"14.3K\", \"totalAcceptedRaw\": 6857, \"totalSubmissionRaw\": 14302, \"acRate\": \"47.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1709","questionFrontendId":"1604","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.1K\", \"totalSubmission\": \"61.9K\", \"totalAcceptedRaw\": 29087, \"totalSubmissionRaw\": 61891, \"acRate\": \"47.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1714","questionFrontendId":"1592","title":"Rearrange Spaces Between Words","titleSlug":"rearrange-spaces-between-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.8K\", \"totalSubmission\": \"107.5K\", \"totalAcceptedRaw\": 46822, \"totalSubmissionRaw\": 107548, \"acRate\": \"43.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1715","questionFrontendId":"1593","title":"Split a String Into the Max Number of Unique Substrings","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.3K\", \"totalSubmission\": \"45.8K\", \"totalAcceptedRaw\": 25313, \"totalSubmissionRaw\": 45758, \"acRate\": \"55.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1720","questionFrontendId":"1598","title":"Crawler Log Folder","titleSlug":"crawler-log-folder","translatedTitle":null,"stats":"{\"totalAccepted\": \"57.6K\", \"totalSubmission\": \"89.3K\", \"totalAcceptedRaw\": 57590, \"totalSubmissionRaw\": 89268, \"acRate\": \"64.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1736","questionFrontendId":"1597","title":"Build Binary Expression Tree From Infix Expression","titleSlug":"build-binary-expression-tree-from-infix-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.8K\", \"totalSubmission\": \"18.9K\", \"totalAcceptedRaw\": 11836, \"totalSubmissionRaw\": 18875, \"acRate\": \"62.7%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1737","questionFrontendId":"1614","title":"Maximum Nesting Depth of the Parentheses","titleSlug":"maximum-nesting-depth-of-the-parentheses","translatedTitle":null,"stats":"{\"totalAccepted\": \"123.9K\", \"totalSubmission\": \"150.5K\", \"totalAcceptedRaw\": 123857, \"totalSubmissionRaw\": 150541, \"acRate\": \"82.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1739","questionFrontendId":"1616","title":"Split Two Strings to Make Palindrome","titleSlug":"split-two-strings-to-make-palindrome","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"63.7K\", \"totalAcceptedRaw\": 19866, \"totalSubmissionRaw\": 63656, \"acRate\": \"31.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1743","questionFrontendId":"1638","title":"Count Substrings That Differ by One Character","titleSlug":"count-substrings-that-differ-by-one-character","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.9K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 23871, \"totalSubmissionRaw\": 33444, \"acRate\": \"71.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1744","questionFrontendId":"1639","title":"Number of Ways to Form a Target String Given a Dictionary","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.4K\", \"totalSubmission\": \"24.1K\", \"totalAcceptedRaw\": 10410, \"totalSubmissionRaw\": 24079, \"acRate\": \"43.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1746","questionFrontendId":"1624","title":"Largest Substring Between Two Equal Characters","titleSlug":"largest-substring-between-two-equal-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"41K\", \"totalSubmission\": \"69.3K\", \"totalAcceptedRaw\": 40956, \"totalSubmissionRaw\": 69289, \"acRate\": \"59.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1747","questionFrontendId":"1625","title":"Lexicographically Smallest String After Applying Operations","titleSlug":"lexicographically-smallest-string-after-applying-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.2K\", \"totalSubmission\": \"18.7K\", \"totalAcceptedRaw\": 12239, \"totalSubmissionRaw\": 18694, \"acRate\": \"65.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1751","questionFrontendId":"1629","title":"Slowest Key","titleSlug":"slowest-key","translatedTitle":null,"stats":"{\"totalAccepted\": \"87.9K\", \"totalSubmission\": \"148.5K\", \"totalAcceptedRaw\": 87901, \"totalSubmissionRaw\": 148484, \"acRate\": \"59.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1756","questionFrontendId":"1653","title":"Minimum Deletions to Make String Balanced","titleSlug":"minimum-deletions-to-make-string-balanced","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.6K\", \"totalSubmission\": \"56.8K\", \"totalAcceptedRaw\": 33576, \"totalSubmissionRaw\": 56812, \"acRate\": \"59.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1764","questionFrontendId":"1668","title":"Maximum Repeating Substring","titleSlug":"maximum-repeating-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"34K\", \"totalSubmission\": \"86K\", \"totalAcceptedRaw\": 33983, \"totalSubmissionRaw\": 85957, \"acRate\": \"39.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1770","questionFrontendId":"1647","title":"Minimum Deletions to Make Character Frequencies Unique","titleSlug":"minimum-deletions-to-make-character-frequencies-unique","translatedTitle":null,"stats":"{\"totalAccepted\": \"169.5K\", \"totalSubmission\": \"286.8K\", \"totalAcceptedRaw\": 169527, \"totalSubmissionRaw\": 286787, \"acRate\": \"59.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1777","questionFrontendId":"1657","title":"Determine if Two Strings Are Close","titleSlug":"determine-if-two-strings-are-close","translatedTitle":null,"stats":"{\"totalAccepted\": \"105.3K\", \"totalSubmission\": \"186.9K\", \"totalAcceptedRaw\": 105273, \"totalSubmissionRaw\": 186937, \"acRate\": \"56.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1781","questionFrontendId":"1662","title":"Check If Two String Arrays are Equivalent","titleSlug":"check-if-two-string-arrays-are-equivalent","translatedTitle":null,"stats":"{\"totalAccepted\": \"264.7K\", \"totalSubmission\": \"317.2K\", \"totalAcceptedRaw\": 264700, \"totalSubmissionRaw\": 317231, \"acRate\": \"83.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1782","questionFrontendId":"1663","title":"Smallest String With A Given Numeric Value","titleSlug":"smallest-string-with-a-given-numeric-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"87K\", \"totalSubmission\": \"130.3K\", \"totalAcceptedRaw\": 87012, \"totalSubmissionRaw\": 130310, \"acRate\": \"66.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1786","questionFrontendId":"1684","title":"Count the Number of Consistent Strings","titleSlug":"count-the-number-of-consistent-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.2K\", \"totalSubmission\": \"151.1K\", \"totalAcceptedRaw\": 124227, \"totalSubmissionRaw\": 151147, \"acRate\": \"82.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1797","questionFrontendId":"1678","title":"Goal Parser Interpretation","titleSlug":"goal-parser-interpretation","translatedTitle":null,"stats":"{\"totalAccepted\": \"171.9K\", \"totalSubmission\": \"198.6K\", \"totalAcceptedRaw\": 171861, \"totalSubmissionRaw\": 198561, \"acRate\": \"86.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1804","questionFrontendId":"1702","title":"Maximum Binary String After Change","titleSlug":"maximum-binary-string-after-change","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"22.9K\", \"totalAcceptedRaw\": 10605, \"totalSubmissionRaw\": 22885, \"acRate\": \"46.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1807","questionFrontendId":"1689","title":"Partitioning Into Minimum Number Of Deci-Binary Numbers","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"169.1K\", \"totalSubmission\": \"189.4K\", \"totalAcceptedRaw\": 169090, \"totalSubmissionRaw\": 189449, \"acRate\": \"89.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1812","questionFrontendId":"1694","title":"Reformat Phone Number","titleSlug":"reformat-phone-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.3K\", \"totalSubmission\": \"46.6K\", \"totalAcceptedRaw\": 30296, \"totalSubmissionRaw\": 46599, \"acRate\": \"65.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1818","questionFrontendId":"1717","title":"Maximum Score From Removing Substrings","titleSlug":"maximum-score-from-removing-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.1K\", \"totalSubmission\": \"26.2K\", \"totalAcceptedRaw\": 12073, \"totalSubmissionRaw\": 26153, \"acRate\": \"46.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1822","questionFrontendId":"1682","title":"Longest Palindromic Subsequence II","titleSlug":"longest-palindromic-subsequence-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"9.1K\", \"totalAcceptedRaw\": 4496, \"totalSubmissionRaw\": 9069, \"acRate\": \"49.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1823","questionFrontendId":"1704","title":"Determine if String Halves Are Alike","titleSlug":"determine-if-string-halves-are-alike","translatedTitle":null,"stats":"{\"totalAccepted\": \"185.7K\", \"totalSubmission\": \"238.8K\", \"totalAcceptedRaw\": 185652, \"totalSubmissionRaw\": 238756, \"acRate\": \"77.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1838","questionFrontendId":"1698","title":"Number of Distinct Substrings in a String","titleSlug":"number-of-distinct-substrings-in-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.8K\", \"totalSubmission\": \"12.4K\", \"totalAcceptedRaw\": 7848, \"totalSubmissionRaw\": 12359, \"acRate\": \"63.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Suffix Array","translatedName":null,"slug":"suffix-array","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1850","questionFrontendId":"1750","title":"Minimum Length of String After Deleting Similar Ends","titleSlug":"minimum-length-of-string-after-deleting-similar-ends","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.3K\", \"totalSubmission\": \"41.6K\", \"totalAcceptedRaw\": 18273, \"totalSubmissionRaw\": 41613, \"acRate\": \"43.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1858","questionFrontendId":"1736","title":"Latest Time by Replacing Hidden Digits","titleSlug":"latest-time-by-replacing-hidden-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.2K\", \"totalSubmission\": \"66.6K\", \"totalAcceptedRaw\": 28247, \"totalSubmissionRaw\": 66638, \"acRate\": \"42.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1859","questionFrontendId":"1737","title":"Change Minimum Characters to Satisfy One of Three Conditions","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.4K\", \"totalSubmission\": \"32.2K\", \"totalAcceptedRaw\": 11365, \"totalSubmissionRaw\": 32179, \"acRate\": \"35.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1871","questionFrontendId":"1745","title":"Palindrome Partitioning IV","titleSlug":"palindrome-partitioning-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.4K\", \"totalSubmission\": \"42.6K\", \"totalAcceptedRaw\": 19370, \"totalSubmissionRaw\": 42621, \"acRate\": \"45.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1873","questionFrontendId":"1763","title":"Longest Nice Substring","titleSlug":"longest-nice-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.7K\", \"totalSubmission\": \"59.5K\", \"totalAcceptedRaw\": 36653, \"totalSubmissionRaw\": 59499, \"acRate\": \"61.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1880","questionFrontendId":"1754","title":"Largest Merge Of Two Strings","titleSlug":"largest-merge-of-two-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.8K\", \"totalSubmission\": \"38.8K\", \"totalAcceptedRaw\": 17760, \"totalSubmissionRaw\": 38790, \"acRate\": \"45.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1884","questionFrontendId":"1758","title":"Minimum Changes To Make Alternating Binary String","titleSlug":"minimum-changes-to-make-alternating-binary-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"34K\", \"totalSubmission\": \"58.2K\", \"totalAcceptedRaw\": 33950, \"totalSubmissionRaw\": 58198, \"acRate\": \"58.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1885","questionFrontendId":"1759","title":"Count Number of Homogenous Substrings","titleSlug":"count-number-of-homogenous-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.4K\", \"totalSubmission\": \"50.4K\", \"totalAcceptedRaw\": 24399, \"totalSubmissionRaw\": 50387, \"acRate\": \"48.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1890","questionFrontendId":"1781","title":"Sum of Beauty of All Substrings","titleSlug":"sum-of-beauty-of-all-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"32.7K\", \"totalAcceptedRaw\": 19850, \"totalSubmissionRaw\": 32658, \"acRate\": \"60.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1894","questionFrontendId":"1768","title":"Merge Strings Alternately","titleSlug":"merge-strings-alternately","translatedTitle":null,"stats":"{\"totalAccepted\": \"95.2K\", \"totalSubmission\": \"123.2K\", \"totalAcceptedRaw\": 95208, \"totalSubmissionRaw\": 123188, \"acRate\": \"77.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1895","questionFrontendId":"1769","title":"Minimum Number of Operations to Move All Balls to Each Box","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box","translatedTitle":null,"stats":"{\"totalAccepted\": \"98K\", \"totalSubmission\": \"115.1K\", \"totalAcceptedRaw\": 97997, \"totalSubmissionRaw\": 115095, \"acRate\": \"85.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1897","questionFrontendId":"1771","title":"Maximize Palindrome Length From Subsequences","titleSlug":"maximize-palindrome-length-from-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"9K\", \"totalSubmission\": \"25.6K\", \"totalAcceptedRaw\": 9048, \"totalSubmissionRaw\": 25647, \"acRate\": \"35.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1899","questionFrontendId":"1773","title":"Count Items Matching a Rule","titleSlug":"count-items-matching-a-rule","translatedTitle":null,"stats":"{\"totalAccepted\": \"150.1K\", \"totalSubmission\": \"177.9K\", \"totalAcceptedRaw\": 150142, \"totalSubmissionRaw\": 177875, \"acRate\": \"84.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1904","questionFrontendId":"1796","title":"Second Largest Digit in a String","titleSlug":"second-largest-digit-in-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"38K\", \"totalSubmission\": \"77.1K\", \"totalAcceptedRaw\": 38013, \"totalSubmissionRaw\": 77069, \"acRate\": \"49.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1910","questionFrontendId":"1784","title":"Check if Binary String Has at Most One Segment of Ones","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.2K\", \"totalSubmission\": \"80.2K\", \"totalAcceptedRaw\": 32196, \"totalSubmissionRaw\": 80173, \"acRate\": \"40.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1915","questionFrontendId":"1790","title":"Check if One String Swap Can Make Strings Equal","titleSlug":"check-if-one-string-swap-can-make-strings-equal","translatedTitle":null,"stats":"{\"totalAccepted\": \"81.1K\", \"totalSubmission\": \"178.7K\", \"totalAcceptedRaw\": 81083, \"totalSubmissionRaw\": 178706, \"acRate\": \"45.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1919","questionFrontendId":"1772","title":"Sort Features by Popularity","titleSlug":"sort-features-by-popularity","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.9K\", \"totalSubmission\": \"7.5K\", \"totalAcceptedRaw\": 4874, \"totalSubmissionRaw\": 7485, \"acRate\": \"65.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1920","questionFrontendId":"1812","title":"Determine Color of a Chessboard Square","titleSlug":"determine-color-of-a-chessboard-square","translatedTitle":null,"stats":"{\"totalAccepted\": \"55.3K\", \"totalSubmission\": \"71.2K\", \"totalAcceptedRaw\": 55297, \"totalSubmissionRaw\": 71188, \"acRate\": \"77.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1923","questionFrontendId":"1813","title":"Sentence Similarity III","titleSlug":"sentence-similarity-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"13K\", \"totalSubmission\": \"38.9K\", \"totalAcceptedRaw\": 12959, \"totalSubmissionRaw\": 38912, \"acRate\": \"33.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1933","questionFrontendId":"1805","title":"Number of Different Integers in a String","titleSlug":"number-of-different-integers-in-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.7K\", \"totalSubmission\": \"97.7K\", \"totalAcceptedRaw\": 35735, \"totalSubmissionRaw\": 97692, \"acRate\": \"36.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1934","questionFrontendId":"1807","title":"Evaluate the Bracket Pairs of a String","titleSlug":"evaluate-the-bracket-pairs-of-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.4K\", \"totalSubmission\": \"36.6K\", \"totalAcceptedRaw\": 24367, \"totalSubmissionRaw\": 36577, \"acRate\": \"66.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1941","questionFrontendId":"1830","title":"Minimum Number of Operations to Make String Sorted","titleSlug":"minimum-number-of-operations-to-make-string-sorted","translatedTitle":null,"stats":"{\"totalAccepted\": \"3K\", \"totalSubmission\": \"6K\", \"totalAcceptedRaw\": 2971, \"totalSubmissionRaw\": 6049, \"acRate\": \"49.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1943","questionFrontendId":"1794","title":"Count Pairs of Equal Substrings With Minimum Difference","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6K\", \"totalSubmission\": \"2.4K\", \"totalAcceptedRaw\": 1550, \"totalSubmissionRaw\": 2382, \"acRate\": \"65.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1944","questionFrontendId":"1816","title":"Truncate Sentence","titleSlug":"truncate-sentence","translatedTitle":null,"stats":"{\"totalAccepted\": \"97.8K\", \"totalSubmission\": \"117.9K\", \"totalAcceptedRaw\": 97834, \"totalSubmissionRaw\": 117944, \"acRate\": \"82.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1949","questionFrontendId":"1804","title":"Implement Trie II (Prefix Tree)","titleSlug":"implement-trie-ii-prefix-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.5K\", \"totalSubmission\": \"19.3K\", \"totalAcceptedRaw\": 11539, \"totalSubmissionRaw\": 19328, \"acRate\": \"59.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1954","questionFrontendId":"1844","title":"Replace All Digits with Characters","titleSlug":"replace-all-digits-with-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"59K\", \"totalSubmission\": \"73.6K\", \"totalAcceptedRaw\": 58991, \"totalSubmissionRaw\": 73561, \"acRate\": \"80.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1960","questionFrontendId":"1832","title":"Check if the Sentence Is Pangram","titleSlug":"check-if-the-sentence-is-pangram","translatedTitle":null,"stats":"{\"totalAccepted\": \"220.6K\", \"totalSubmission\": \"263.9K\", \"totalAcceptedRaw\": 220593, \"totalSubmissionRaw\": 263947, \"acRate\": \"83.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1967","questionFrontendId":"1839","title":"Longest Substring Of All Vowels in Order","titleSlug":"longest-substring-of-all-vowels-in-order","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.1K\", \"totalSubmission\": \"49.5K\", \"totalAcceptedRaw\": 24078, \"totalSubmissionRaw\": 49528, \"acRate\": \"48.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1970","questionFrontendId":"1859","title":"Sorting the Sentence","titleSlug":"sorting-the-sentence","translatedTitle":null,"stats":"{\"totalAccepted\": \"108.6K\", \"totalSubmission\": \"129.2K\", \"totalAcceptedRaw\": 108606, \"totalSubmissionRaw\": 129177, \"acRate\": \"84.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1976","questionFrontendId":"1849","title":"Splitting a String Into Descending Consecutive Values","titleSlug":"splitting-a-string-into-descending-consecutive-values","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.8K\", \"totalSubmission\": \"56.7K\", \"totalAcceptedRaw\": 18772, \"totalSubmissionRaw\": 56697, \"acRate\": \"33.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1978","questionFrontendId":"1850","title":"Minimum Adjacent Swaps to Reach the Kth Smallest Number","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.5K\", \"totalSubmission\": \"24.4K\", \"totalAcceptedRaw\": 17508, \"totalSubmissionRaw\": 24376, \"acRate\": \"71.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1987","questionFrontendId":"1876","title":"Substrings of Size Three with Distinct Characters","titleSlug":"substrings-of-size-three-with-distinct-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"73K\", \"totalSubmission\": \"102.7K\", \"totalAcceptedRaw\": 73023, \"totalSubmissionRaw\": 102744, \"acRate\": \"71.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1994","questionFrontendId":"1864","title":"Minimum Number of Swaps to Make the Binary String Alternating","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.1K\", \"totalSubmission\": \"51.7K\", \"totalAcceptedRaw\": 22146, \"totalSubmissionRaw\": 51749, \"acRate\": \"42.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1997","questionFrontendId":"1842","title":"Next Palindrome Using Same Digits","titleSlug":"next-palindrome-using-same-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.8K\", \"totalSubmission\": \"8.9K\", \"totalAcceptedRaw\": 4756, \"totalSubmissionRaw\": 8950, \"acRate\": \"53.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1999","questionFrontendId":"1869","title":"Longer Contiguous Segments of Ones than Zeros","titleSlug":"longer-contiguous-segments-of-ones-than-zeros","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.3K\", \"totalSubmission\": \"61.7K\", \"totalAcceptedRaw\": 37268, \"totalSubmissionRaw\": 61653, \"acRate\": \"60.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2001","questionFrontendId":"1871","title":"Jump Game VII","titleSlug":"jump-game-vii","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.6K\", \"totalSubmission\": \"134.1K\", \"totalAcceptedRaw\": 33612, \"totalSubmissionRaw\": 134124, \"acRate\": \"25.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2008","questionFrontendId":"1896","title":"Minimum Cost to Change the Final Value of Expression","titleSlug":"minimum-cost-to-change-the-final-value-of-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"6K\", \"totalAcceptedRaw\": 3268, \"totalSubmissionRaw\": 5971, \"acRate\": \"54.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2010","questionFrontendId":"1880","title":"Check if Word Equals Summation of Two Words","titleSlug":"check-if-word-equals-summation-of-two-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"50.8K\", \"totalSubmission\": \"68.8K\", \"totalAcceptedRaw\": 50835, \"totalSubmissionRaw\": 68752, \"acRate\": \"73.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2011","questionFrontendId":"1881","title":"Maximum Value after Insertion","titleSlug":"maximum-value-after-insertion","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.8K\", \"totalSubmission\": \"61.8K\", \"totalAcceptedRaw\": 22752, \"totalSubmissionRaw\": 61754, \"acRate\": \"36.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2017","questionFrontendId":"1888","title":"Minimum Number of Flips to Make the Binary String Alternating","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"46.1K\", \"totalAcceptedRaw\": 17862, \"totalSubmissionRaw\": 46074, \"acRate\": \"38.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2021","questionFrontendId":"1910","title":"Remove All Occurrences of a Substring","titleSlug":"remove-all-occurrences-of-a-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"56.2K\", \"totalSubmission\": \"75.5K\", \"totalAcceptedRaw\": 56179, \"totalSubmissionRaw\": 75451, \"acRate\": \"74.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2025","questionFrontendId":"1897","title":"Redistribute Characters to Make All Strings Equal","titleSlug":"redistribute-characters-to-make-all-strings-equal","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.2K\", \"totalSubmission\": \"47.3K\", \"totalAcceptedRaw\": 28207, \"totalSubmissionRaw\": 47319, \"acRate\": \"59.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2027","questionFrontendId":"1898","title":"Maximum Number of Removable Characters","titleSlug":"maximum-number-of-removable-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.1K\", \"totalSubmission\": \"52.2K\", \"totalAcceptedRaw\": 21149, \"totalSubmissionRaw\": 52215, \"acRate\": \"40.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2032","questionFrontendId":"1903","title":"Largest Odd Number in String","titleSlug":"largest-odd-number-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"54.3K\", \"totalSubmission\": \"97K\", \"totalAcceptedRaw\": 54345, \"totalSubmissionRaw\": 96991, \"acRate\": \"56.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2033","questionFrontendId":"1904","title":"The Number of Full Rounds You Have Played","titleSlug":"the-number-of-full-rounds-you-have-played","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.7K\", \"totalSubmission\": \"41.7K\", \"totalAcceptedRaw\": 18731, \"totalSubmissionRaw\": 41723, \"acRate\": \"44.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2044","questionFrontendId":"1915","title":"Number of Wonderful Substrings","titleSlug":"number-of-wonderful-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.8K\", \"totalSubmission\": \"23.9K\", \"totalAcceptedRaw\": 10803, \"totalSubmissionRaw\": 23880, \"acRate\": \"45.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2053","questionFrontendId":"1941","title":"Check if All Characters Have Equal Number of Occurrences","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences","translatedTitle":null,"stats":"{\"totalAccepted\": \"59.4K\", \"totalSubmission\": \"77.3K\", \"totalAcceptedRaw\": 59398, \"totalSubmissionRaw\": 77306, \"acRate\": \"76.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2059","questionFrontendId":"1930","title":"Unique Length-3 Palindromic Subsequences","titleSlug":"unique-length-3-palindromic-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.9K\", \"totalSubmission\": \"44K\", \"totalAcceptedRaw\": 22879, \"totalSubmissionRaw\": 44026, \"acRate\": \"52.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2070","questionFrontendId":"1933","title":"Check if String Is Decomposable Into Value-Equal Substrings","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"5.7K\", \"totalAcceptedRaw\": 2883, \"totalSubmissionRaw\": 5714, \"acRate\": \"50.5%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2076","questionFrontendId":"1945","title":"Sum of Digits of String After Convert","titleSlug":"sum-of-digits-of-string-after-convert","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.4K\", \"totalSubmission\": \"62.6K\", \"totalAcceptedRaw\": 38411, \"totalSubmissionRaw\": 62598, \"acRate\": \"61.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2077","questionFrontendId":"1946","title":"Largest Number After Mutating Substring","titleSlug":"largest-number-after-mutating-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"17K\", \"totalSubmission\": \"48.8K\", \"totalAcceptedRaw\": 17027, \"totalSubmissionRaw\": 48843, \"acRate\": \"34.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2079","questionFrontendId":"1948","title":"Delete Duplicate Folders in System","titleSlug":"delete-duplicate-folders-in-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.1K\", \"totalSubmission\": \"12.5K\", \"totalAcceptedRaw\": 7054, \"totalSubmissionRaw\": 12452, \"acRate\": \"56.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2088","questionFrontendId":"1974","title":"Minimum Time to Type Word Using Special Typewriter","titleSlug":"minimum-time-to-type-word-using-special-typewriter","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.4K\", \"totalSubmission\": \"40.6K\", \"totalAcceptedRaw\": 29366, \"totalSubmissionRaw\": 40626, \"acRate\": \"72.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2091","questionFrontendId":"1977","title":"Number of Ways to Separate Numbers","titleSlug":"number-of-ways-to-separate-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"21K\", \"totalAcceptedRaw\": 4391, \"totalSubmissionRaw\": 20956, \"acRate\": \"21.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Suffix Array","translatedName":null,"slug":"suffix-array","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2093","questionFrontendId":"1961","title":"Check If String Is a Prefix of Array","titleSlug":"check-if-string-is-a-prefix-of-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"36.7K\", \"totalSubmission\": \"68.7K\", \"totalAcceptedRaw\": 36749, \"totalSubmissionRaw\": 68698, \"acRate\": \"53.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2095","questionFrontendId":"1963","title":"Minimum Number of Swaps to Make the String Balanced","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.1K\", \"totalSubmission\": \"63.7K\", \"totalAcceptedRaw\": 44066, \"totalSubmissionRaw\": 63671, \"acRate\": \"69.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2099","questionFrontendId":"1967","title":"Number of Strings That Appear as Substrings in Word","titleSlug":"number-of-strings-that-appear-as-substrings-in-word","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.5K\", \"totalSubmission\": \"58.1K\", \"totalAcceptedRaw\": 46537, \"totalSubmissionRaw\": 58086, \"acRate\": \"80.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2107","questionFrontendId":"1980","title":"Find Unique Binary String","titleSlug":"find-unique-binary-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"35.3K\", \"totalSubmission\": \"54.1K\", \"totalAcceptedRaw\": 35270, \"totalSubmissionRaw\": 54138, \"acRate\": \"65.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2113","questionFrontendId":"1985","title":"Find the Kth Largest Integer in the Array","titleSlug":"find-the-kth-largest-integer-in-the-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.8K\", \"totalSubmission\": \"100.7K\", \"totalAcceptedRaw\": 44825, \"totalSubmissionRaw\": 100665, \"acRate\": \"44.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Quickselect","translatedName":null,"slug":"quickselect","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2115","questionFrontendId":"1987","title":"Number of Unique Good Subsequences","titleSlug":"number-of-unique-good-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"17.5K\", \"totalAcceptedRaw\": 9159, \"totalSubmissionRaw\": 17536, \"acRate\": \"52.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2128","questionFrontendId":"2000","title":"Reverse Prefix of Word","titleSlug":"reverse-prefix-of-word","translatedTitle":null,"stats":"{\"totalAccepted\": \"60.3K\", \"totalSubmission\": \"76.7K\", \"totalAcceptedRaw\": 60287, \"totalSubmissionRaw\": 76740, \"acRate\": \"78.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2130","questionFrontendId":"2002","title":"Maximum Product of the Length of Two Palindromic Subsequences","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.3K\", \"totalSubmission\": \"31.9K\", \"totalAcceptedRaw\": 17337, \"totalSubmissionRaw\": 31860, \"acRate\": \"54.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2133","questionFrontendId":"2023","title":"Number of Pairs of Strings With Concatenation Equal to Target","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.5K\", \"totalSubmission\": \"41.6K\", \"totalAcceptedRaw\": 30534, \"totalSubmissionRaw\": 41639, \"acRate\": \"73.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2134","questionFrontendId":"2024","title":"Maximize the Confusion of an Exam","titleSlug":"maximize-the-confusion-of-an-exam","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"40.1K\", \"totalAcceptedRaw\": 24180, \"totalSubmissionRaw\": 40079, \"acRate\": \"60.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2137","questionFrontendId":"2011","title":"Final Value of Variable After Performing Operations","titleSlug":"final-value-of-variable-after-performing-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"211.7K\", \"totalSubmission\": \"238.7K\", \"totalAcceptedRaw\": 211725, \"totalSubmissionRaw\": 238743, \"acRate\": \"88.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2140","questionFrontendId":"2014","title":"Longest Subsequence Repeated k Times","titleSlug":"longest-subsequence-repeated-k-times","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"10.3K\", \"totalAcceptedRaw\": 5701, \"totalSubmissionRaw\": 10257, \"acRate\": \"55.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2147","questionFrontendId":"2019","title":"The Score of Students Solving Math Expression","titleSlug":"the-score-of-students-solving-math-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"16.8K\", \"totalAcceptedRaw\": 5676, \"totalSubmissionRaw\": 16803, \"acRate\": \"33.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2149","questionFrontendId":"2038","title":"Remove Colored Pieces if Both Neighbors are the Same Color","titleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color","translatedTitle":null,"stats":"{\"totalAccepted\": \"23.1K\", \"totalSubmission\": \"39.9K\", \"totalAcceptedRaw\": 23138, \"totalSubmissionRaw\": 39885, \"acRate\": \"58.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2154","questionFrontendId":"2027","title":"Minimum Moves to Convert String","titleSlug":"minimum-moves-to-convert-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.4K\", \"totalSubmission\": \"49K\", \"totalAcceptedRaw\": 26412, \"totalSubmissionRaw\": 48974, \"acRate\": \"53.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2157","questionFrontendId":"2030","title":"Smallest K-Length Subsequence With Occurrences of a Letter","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"15.8K\", \"totalAcceptedRaw\": 6116, \"totalSubmissionRaw\": 15756, \"acRate\": \"38.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2163","questionFrontendId":"2053","title":"Kth Distinct String in an Array","titleSlug":"kth-distinct-string-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.1K\", \"totalSubmission\": \"58.4K\", \"totalAcceptedRaw\": 42057, \"totalSubmissionRaw\": 58366, \"acRate\": \"72.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2165","questionFrontendId":"2055","title":"Plates Between Candles","titleSlug":"plates-between-candles","translatedTitle":null,"stats":"{\"totalAccepted\": \"29K\", \"totalSubmission\": \"65K\", \"totalAcceptedRaw\": 28970, \"totalSubmissionRaw\": 64967, \"acRate\": \"44.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2166","questionFrontendId":"2056","title":"Number of Valid Move Combinations On Chessboard","titleSlug":"number-of-valid-move-combinations-on-chessboard","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.4K\", \"totalSubmission\": \"5.8K\", \"totalAcceptedRaw\": 3374, \"totalSubmissionRaw\": 5804, \"acRate\": \"58.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2168","questionFrontendId":"2042","title":"Check if Numbers Are Ascending in a Sentence","titleSlug":"check-if-numbers-are-ascending-in-a-sentence","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.9K\", \"totalSubmission\": \"59.4K\", \"totalAcceptedRaw\": 39901, \"totalSubmissionRaw\": 59395, \"acRate\": \"67.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2173","questionFrontendId":"2047","title":"Number of Valid Words in a Sentence","titleSlug":"number-of-valid-words-in-a-sentence","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"72.1K\", \"totalAcceptedRaw\": 21167, \"totalSubmissionRaw\": 72085, \"acRate\": \"29.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2177","questionFrontendId":"2068","title":"Check Whether Two Strings are Almost Equivalent","titleSlug":"check-whether-two-strings-are-almost-equivalent","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.1K\", \"totalSubmission\": \"49.8K\", \"totalAcceptedRaw\": 32084, \"totalSubmissionRaw\": 49840, \"acRate\": \"64.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2184","questionFrontendId":"2060","title":"Check if an Original String Exists Given Two Encoded Strings","titleSlug":"check-if-an-original-string-exists-given-two-encoded-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.1K\", \"totalSubmission\": \"22.1K\", \"totalAcceptedRaw\": 9063, \"totalSubmissionRaw\": 22150, \"acRate\": \"40.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2186","questionFrontendId":"2062","title":"Count Vowel Substrings of a String","titleSlug":"count-vowel-substrings-of-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.8K\", \"totalSubmission\": \"40.6K\", \"totalAcceptedRaw\": 26807, \"totalSubmissionRaw\": 40621, \"acRate\": \"66.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2187","questionFrontendId":"2063","title":"Vowels of All Substrings","titleSlug":"vowels-of-all-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"38.7K\", \"totalAcceptedRaw\": 21164, \"totalSubmissionRaw\": 38658, \"acRate\": \"54.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2190","questionFrontendId":"2085","title":"Count Common Words With One Occurrence","titleSlug":"count-common-words-with-one-occurrence","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.1K\", \"totalSubmission\": \"61.6K\", \"totalAcceptedRaw\": 43123, \"totalSubmissionRaw\": 61599, \"acRate\": \"70.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2191","questionFrontendId":"2086","title":"Minimum Number of Food Buckets to Feed the Hamsters","titleSlug":"minimum-number-of-food-buckets-to-feed-the-hamsters","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"31.5K\", \"totalAcceptedRaw\": 14155, \"totalSubmissionRaw\": 31540, \"acRate\": \"44.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2197","questionFrontendId":"2075","title":"Decode the Slanted Ciphertext","titleSlug":"decode-the-slanted-ciphertext","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.8K\", \"totalSubmission\": \"21.5K\", \"totalAcceptedRaw\": 10816, \"totalSubmissionRaw\": 21493, \"acRate\": \"50.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2209","questionFrontendId":"2067","title":"Number of Equal Count Substrings","titleSlug":"number-of-equal-count-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.9K\", \"totalSubmission\": \"3.8K\", \"totalAcceptedRaw\": 1858, \"totalSubmissionRaw\": 3843, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2217","questionFrontendId":"2096","title":"Step-By-Step Directions From a Binary Tree Node to Another","titleSlug":"step-by-step-directions-from-a-binary-tree-node-to-another","translatedTitle":null,"stats":"{\"totalAccepted\": \"79.5K\", \"totalSubmission\": \"164.1K\", \"totalAcceptedRaw\": 79514, \"totalSubmissionRaw\": 164104, \"acRate\": \"48.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2219","questionFrontendId":"2114","title":"Maximum Number of Words Found in Sentences","titleSlug":"maximum-number-of-words-found-in-sentences","translatedTitle":null,"stats":"{\"totalAccepted\": \"169K\", \"totalSubmission\": \"193.7K\", \"totalAcceptedRaw\": 168960, \"totalSubmissionRaw\": 193668, \"acRate\": \"87.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2220","questionFrontendId":"2115","title":"Find All Possible Recipes from Given Supplies","titleSlug":"find-all-possible-recipes-from-given-supplies","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.9K\", \"totalSubmission\": \"131.8K\", \"totalAcceptedRaw\": 63897, \"totalSubmissionRaw\": 131785, \"acRate\": \"48.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2221","questionFrontendId":"2116","title":"Check if a Parentheses String Can Be Valid","titleSlug":"check-if-a-parentheses-string-can-be-valid","translatedTitle":null,"stats":"{\"totalAccepted\": \"15K\", \"totalSubmission\": \"48.2K\", \"totalAcceptedRaw\": 14981, \"totalSubmissionRaw\": 48219, \"acRate\": \"31.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2225","questionFrontendId":"2083","title":"Substrings That Begin and End With the Same Letter","titleSlug":"substrings-that-begin-and-end-with-the-same-letter","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.1K\", \"totalSubmission\": \"7.5K\", \"totalAcceptedRaw\": 5121, \"totalSubmissionRaw\": 7549, \"acRate\": \"67.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2226","questionFrontendId":"2103","title":"Rings and Rods","titleSlug":"rings-and-rods","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.5K\", \"totalSubmission\": \"63.3K\", \"totalAcceptedRaw\": 51491, \"totalSubmissionRaw\": 63310, \"acRate\": \"81.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2231","questionFrontendId":"2108","title":"Find First Palindromic String in the Array","titleSlug":"find-first-palindromic-string-in-the-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"80.8K\", \"totalSubmission\": \"102.7K\", \"totalAcceptedRaw\": 80795, \"totalSubmissionRaw\": 102687, \"acRate\": \"78.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2232","questionFrontendId":"2109","title":"Adding Spaces to a String","titleSlug":"adding-spaces-to-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.3K\", \"totalSubmission\": \"53.6K\", \"totalAcceptedRaw\": 30296, \"totalSubmissionRaw\": 53620, \"acRate\": \"56.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2235","questionFrontendId":"2129","title":"Capitalize the Title","titleSlug":"capitalize-the-title","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.3K\", \"totalSubmission\": \"68.2K\", \"totalAcceptedRaw\": 42288, \"totalSubmissionRaw\": 68203, \"acRate\": \"62.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2237","questionFrontendId":"2131","title":"Longest Palindrome by Concatenating Two Letter Words","titleSlug":"longest-palindrome-by-concatenating-two-letter-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"98K\", \"totalSubmission\": \"201.9K\", \"totalAcceptedRaw\": 97963, \"totalSubmissionRaw\": 201949, \"acRate\": \"48.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2239","questionFrontendId":"2120","title":"Execution of All Suffix Instructions Staying in a Grid","titleSlug":"execution-of-all-suffix-instructions-staying-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.9K\", \"totalSubmission\": \"27.4K\", \"totalAcceptedRaw\": 22854, \"totalSubmissionRaw\": 27426, \"acRate\": \"83.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2243","questionFrontendId":"2124","title":"Check if All A's Appears Before All B's","titleSlug":"check-if-all-as-appears-before-all-bs","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.1K\", \"totalSubmission\": \"71.6K\", \"totalAcceptedRaw\": 51096, \"totalSubmissionRaw\": 71561, \"acRate\": \"71.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2244","questionFrontendId":"2125","title":"Number of Laser Beams in a Bank","titleSlug":"number-of-laser-beams-in-a-bank","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.2K\", \"totalSubmission\": \"53.8K\", \"totalAcceptedRaw\": 44207, \"totalSubmissionRaw\": 53771, \"acRate\": \"82.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2251","questionFrontendId":"2147","title":"Number of Ways to Divide a Long Corridor","titleSlug":"number-of-ways-to-divide-a-long-corridor","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.5K\", \"totalSubmission\": \"23.7K\", \"totalAcceptedRaw\": 9476, \"totalSubmissionRaw\": 23736, \"acRate\": \"39.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2256","questionFrontendId":"2135","title":"Count Words Obtained After Adding a Letter","titleSlug":"count-words-obtained-after-adding-a-letter","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.3K\", \"totalSubmission\": \"68.4K\", \"totalAcceptedRaw\": 29298, \"totalSubmissionRaw\": 68420, \"acRate\": \"42.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2260","questionFrontendId":"2138","title":"Divide a String Into Groups of Size k","titleSlug":"divide-a-string-into-groups-of-size-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"34.6K\", \"totalSubmission\": \"52.8K\", \"totalAcceptedRaw\": 34551, \"totalSubmissionRaw\": 52806, \"acRate\": \"65.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2275","questionFrontendId":"2156","title":"Find Substring With Given Hash Value","titleSlug":"find-substring-with-given-hash-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.2K\", \"totalSubmission\": \"50.1K\", \"totalAcceptedRaw\": 11158, \"totalSubmissionRaw\": 50115, \"acRate\": \"22.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2276","questionFrontendId":"2157","title":"Groups of Strings","titleSlug":"groups-of-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.5K\", \"totalSubmission\": \"29.2K\", \"totalAcceptedRaw\": 7509, \"totalSubmissionRaw\": 29246, \"acRate\": \"25.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2286","questionFrontendId":"2167","title":"Minimum Time to Remove All Cars Containing Illegal Goods","titleSlug":"minimum-time-to-remove-all-cars-containing-illegal-goods","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.3K\", \"totalSubmission\": \"25.2K\", \"totalAcceptedRaw\": 10271, \"totalSubmissionRaw\": 25214, \"acRate\": \"40.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2292","questionFrontendId":"2185","title":"Counting Words With a Given Prefix","titleSlug":"counting-words-with-a-given-prefix","translatedTitle":null,"stats":"{\"totalAccepted\": \"59.7K\", \"totalSubmission\": \"77.2K\", \"totalAcceptedRaw\": 59666, \"totalSubmissionRaw\": 77153, \"acRate\": \"77.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2293","questionFrontendId":"2186","title":"Minimum Number of Steps to Make Two Strings Anagram II","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"31K\", \"totalSubmission\": \"43K\", \"totalAcceptedRaw\": 31006, \"totalSubmissionRaw\": 43040, \"acRate\": \"72.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2300","questionFrontendId":"2182","title":"Construct String With Repeat Limit","titleSlug":"construct-string-with-repeat-limit","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.8K\", \"totalSubmission\": \"32K\", \"totalAcceptedRaw\": 16803, \"totalSubmissionRaw\": 32045, \"acRate\": \"52.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2303","questionFrontendId":"2168","title":"Unique Substrings With Equal Digit Frequency","titleSlug":"unique-substrings-with-equal-digit-frequency","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"2.8K\", \"totalAcceptedRaw\": 1680, \"totalSubmissionRaw\": 2833, \"acRate\": \"59.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2304","questionFrontendId":"2194","title":"Cells in a Range on an Excel Sheet","titleSlug":"cells-in-a-range-on-an-excel-sheet","translatedTitle":null,"stats":"{\"totalAccepted\": \"46K\", \"totalSubmission\": \"54.1K\", \"totalAcceptedRaw\": 46013, \"totalSubmissionRaw\": 54068, \"acRate\": \"85.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2309","questionFrontendId":"2207","title":"Maximize Number of Subsequences in a String","titleSlug":"maximize-number-of-subsequences-in-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.4K\", \"totalSubmission\": \"46.1K\", \"totalAcceptedRaw\": 15353, \"totalSubmissionRaw\": 46085, \"acRate\": \"33.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2311","questionFrontendId":"2209","title":"Minimum White Tiles After Covering With Carpets","titleSlug":"minimum-white-tiles-after-covering-with-carpets","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.6K\", \"totalSubmission\": \"28.1K\", \"totalAcceptedRaw\": 9600, \"totalSubmissionRaw\": 28094, \"acRate\": \"34.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2317","questionFrontendId":"2211","title":"Count Collisions on a Road","titleSlug":"count-collisions-on-a-road","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.2K\", \"totalSubmission\": \"45.5K\", \"totalAcceptedRaw\": 19227, \"totalSubmissionRaw\": 45471, \"acRate\": \"42.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2319","questionFrontendId":"2213","title":"Longest Substring of One Repeating Character","titleSlug":"longest-substring-of-one-repeating-character","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.4K\", \"totalSubmission\": \"11K\", \"totalAcceptedRaw\": 3412, \"totalSubmissionRaw\": 11038, \"acRate\": \"30.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2325","questionFrontendId":"2222","title":"Number of Ways to Select Buildings","titleSlug":"number-of-ways-to-select-buildings","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.6K\", \"totalSubmission\": \"49.9K\", \"totalAcceptedRaw\": 25586, \"totalSubmissionRaw\": 49879, \"acRate\": \"51.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2326","questionFrontendId":"2223","title":"Sum of Scores of Built Strings","titleSlug":"sum-of-scores-of-built-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.2K\", \"totalSubmission\": \"13.9K\", \"totalAcceptedRaw\": 5187, \"totalSubmissionRaw\": 13872, \"acRate\": \"37.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Suffix Array","translatedName":null,"slug":"suffix-array","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2328","questionFrontendId":"2232","title":"Minimize Result by Adding Parentheses to Expression","titleSlug":"minimize-result-by-adding-parentheses-to-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.1K\", \"totalSubmission\": \"23K\", \"totalAcceptedRaw\": 15107, \"totalSubmissionRaw\": 22952, \"acRate\": \"65.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2337","questionFrontendId":"2259","title":"Remove Digit From Number to Maximize Result","titleSlug":"remove-digit-from-number-to-maximize-result","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.2K\", \"totalSubmission\": \"104.1K\", \"totalAcceptedRaw\": 48213, \"totalSubmissionRaw\": 104138, \"acRate\": \"46.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2340","questionFrontendId":"2262","title":"Total Appeal of A String","titleSlug":"total-appeal-of-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.5K\", \"totalSubmission\": \"39.6K\", \"totalAcceptedRaw\": 22470, \"totalSubmissionRaw\": 39559, \"acRate\": \"56.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2341","questionFrontendId":"2255","title":"Count Prefixes of a Given String","titleSlug":"count-prefixes-of-a-given-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.5K\", \"totalSubmission\": \"52.7K\", \"totalAcceptedRaw\": 38451, \"totalSubmissionRaw\": 52729, \"acRate\": \"72.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2345","questionFrontendId":"2224","title":"Minimum Number of Operations to Convert Time","titleSlug":"minimum-number-of-operations-to-convert-time","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.4K\", \"totalSubmission\": \"48.1K\", \"totalAcceptedRaw\": 31433, \"totalSubmissionRaw\": 48065, \"acRate\": \"65.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2346","questionFrontendId":"2264","title":"Largest 3-Same-Digit Number in String","titleSlug":"largest-3-same-digit-number-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.7K\", \"totalSubmission\": \"51.6K\", \"totalAcceptedRaw\": 30721, \"totalSubmissionRaw\": 51620, \"acRate\": \"59.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2348","questionFrontendId":"2266","title":"Count Number of Texts","titleSlug":"count-number-of-texts","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.9K\", \"totalSubmission\": \"31.7K\", \"totalAcceptedRaw\": 14906, \"totalSubmissionRaw\": 31670, \"acRate\": \"47.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2361","questionFrontendId":"2243","title":"Calculate Digit Sum of a String","titleSlug":"calculate-digit-sum-of-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.8K\", \"totalSubmission\": \"43.4K\", \"totalAcceptedRaw\": 28803, \"totalSubmissionRaw\": 43420, \"acRate\": \"66.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2364","questionFrontendId":"2246","title":"Longest Path With Different Adjacent Characters","titleSlug":"longest-path-with-different-adjacent-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.1K\", \"totalSubmission\": \"116.7K\", \"totalAcceptedRaw\": 65147, \"totalSubmissionRaw\": 116672, \"acRate\": \"55.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2365","questionFrontendId":"2278","title":"Percentage of Letter in String","titleSlug":"percentage-of-letter-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.8K\", \"totalSubmission\": \"63.3K\", \"totalAcceptedRaw\": 46806, \"totalSubmissionRaw\": 63321, \"acRate\": \"73.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2372","questionFrontendId":"2287","title":"Rearrange Characters to Make Target String","titleSlug":"rearrange-characters-to-make-target-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"30K\", \"totalSubmission\": \"51.7K\", \"totalAcceptedRaw\": 29996, \"totalSubmissionRaw\": 51687, \"acRate\": \"58.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2373","questionFrontendId":"2288","title":"Apply Discount to Prices","titleSlug":"apply-discount-to-prices","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.1K\", \"totalSubmission\": \"61.4K\", \"totalAcceptedRaw\": 17118, \"totalSubmissionRaw\": 61389, \"acRate\": \"27.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2377","questionFrontendId":"2283","title":"Check if Number Has Equal Digit Count and Digit Value","titleSlug":"check-if-number-has-equal-digit-count-and-digit-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.5K\", \"totalSubmission\": \"51.2K\", \"totalAcceptedRaw\": 37496, \"totalSubmissionRaw\": 51184, \"acRate\": \"73.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2378","questionFrontendId":"2284","title":"Sender With Largest Word Count","titleSlug":"sender-with-largest-word-count","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.8K\", \"totalSubmission\": \"46K\", \"totalAcceptedRaw\": 25769, \"totalSubmissionRaw\": 45959, \"acRate\": \"56.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2389","questionFrontendId":"2296","title":"Design a Text Editor","titleSlug":"design-a-text-editor","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.7K\", \"totalSubmission\": \"38.5K\", \"totalAcceptedRaw\": 15665, \"totalSubmissionRaw\": 38510, \"acRate\": \"40.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2390","questionFrontendId":"2306","title":"Naming a Company","titleSlug":"naming-a-company","translatedTitle":null,"stats":"{\"totalAccepted\": \"54.7K\", \"totalSubmission\": \"116.1K\", \"totalAcceptedRaw\": 54658, \"totalSubmissionRaw\": 116079, \"acRate\": \"47.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2391","questionFrontendId":"2299","title":"Strong Password Checker II","titleSlug":"strong-password-checker-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.8K\", \"totalSubmission\": \"52.8K\", \"totalAcceptedRaw\": 29765, \"totalSubmissionRaw\": 52836, \"acRate\": \"56.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2393","questionFrontendId":"2301","title":"Match Substring After Replacement","titleSlug":"match-substring-after-replacement","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.1K\", \"totalSubmission\": \"28.2K\", \"totalAcceptedRaw\": 11110, \"totalSubmissionRaw\": 28169, \"acRate\": \"39.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2395","questionFrontendId":"2311","title":"Longest Binary Subsequence Less Than or Equal to K","titleSlug":"longest-binary-subsequence-less-than-or-equal-to-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"49K\", \"totalAcceptedRaw\": 18189, \"totalSubmissionRaw\": 48985, \"acRate\": \"37.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2401","questionFrontendId":"2315","title":"Count Asterisks","titleSlug":"count-asterisks","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.3K\", \"totalSubmission\": \"51.5K\", \"totalAcceptedRaw\": 42296, \"totalSubmissionRaw\": 51499, \"acRate\": \"82.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2405","questionFrontendId":"2268","title":"Minimum Number of Keypresses","titleSlug":"minimum-number-of-keypresses","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.5K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 10547, \"totalSubmissionRaw\": 14412, \"acRate\": \"73.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2406","questionFrontendId":"2325","title":"Decode the Message","titleSlug":"decode-the-message","translatedTitle":null,"stats":"{\"totalAccepted\": \"53.4K\", \"totalSubmission\": \"63K\", \"totalAcceptedRaw\": 53380, \"totalSubmissionRaw\": 63003, \"acRate\": \"84.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2414","questionFrontendId":"2337","title":"Move Pieces to Obtain a String","titleSlug":"move-pieces-to-obtain-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.6K\", \"totalSubmission\": \"42.9K\", \"totalAcceptedRaw\": 20590, \"totalSubmissionRaw\": 42928, \"acRate\": \"48.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2422","questionFrontendId":"2343","title":"Query Kth Smallest Trimmed Number","titleSlug":"query-kth-smallest-trimmed-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.7K\", \"totalSubmission\": \"50.2K\", \"totalAcceptedRaw\": 20742, \"totalSubmissionRaw\": 50189, \"acRate\": \"41.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Radix Sort","translatedName":null,"slug":"radix-sort","__typename":"TopicTagNode"},{"name":"Quickselect","translatedName":null,"slug":"quickselect","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2427","questionFrontendId":"2351","title":"First Letter to Appear Twice","titleSlug":"first-letter-to-appear-twice","translatedTitle":null,"stats":"{\"totalAccepted\": \"67K\", \"totalSubmission\": \"89.3K\", \"totalAcceptedRaw\": 66982, \"totalSubmissionRaw\": 89312, \"acRate\": \"75.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2444","questionFrontendId":"2370","title":"Longest Ideal Subsequence","titleSlug":"longest-ideal-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.6K\", \"totalSubmission\": \"49.3K\", \"totalAcceptedRaw\": 18607, \"totalSubmissionRaw\": 49261, \"acRate\": \"37.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2456","questionFrontendId":"2375","title":"Construct Smallest Number From DI String","titleSlug":"construct-smallest-number-from-di-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.6K\", \"totalSubmission\": \"28.9K\", \"totalAcceptedRaw\": 21565, \"totalSubmissionRaw\": 28928, \"acRate\": \"74.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2463","questionFrontendId":"2379","title":"Minimum Recolors to Get K Consecutive Black Blocks","titleSlug":"minimum-recolors-to-get-k-consecutive-black-blocks","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.3K\", \"totalSubmission\": \"54.3K\", \"totalAcceptedRaw\": 31325, \"totalSubmissionRaw\": 54277, \"acRate\": \"57.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2464","questionFrontendId":"2380","title":"Time Needed to Rearrange a Binary String","titleSlug":"time-needed-to-rearrange-a-binary-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.1K\", \"totalSubmission\": \"45.1K\", \"totalAcceptedRaw\": 22101, \"totalSubmissionRaw\": 45121, \"acRate\": \"49.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2465","questionFrontendId":"2381","title":"Shifting Letters II","titleSlug":"shifting-letters-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.5K\", \"totalSubmission\": \"41.4K\", \"totalAcceptedRaw\": 14459, \"totalSubmissionRaw\": 41394, \"acRate\": \"34.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2468","questionFrontendId":"2330","title":"Valid Palindrome IV","titleSlug":"valid-palindrome-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.6K\", \"totalSubmission\": \"3.4K\", \"totalAcceptedRaw\": 2604, \"totalSubmissionRaw\": 3441, \"acRate\": \"75.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2470","questionFrontendId":"2390","title":"Removing Stars From a String","titleSlug":"removing-stars-from-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.3K\", \"totalSubmission\": \"60.3K\", \"totalAcceptedRaw\": 39330, \"totalSubmissionRaw\": 60310, \"acRate\": \"65.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2471","questionFrontendId":"2391","title":"Minimum Amount of Time to Collect Garbage","titleSlug":"minimum-amount-of-time-to-collect-garbage","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.8K\", \"totalSubmission\": \"37.6K\", \"totalAcceptedRaw\": 31764, \"totalSubmissionRaw\": 37623, \"acRate\": \"84.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2475","questionFrontendId":"2384","title":"Largest Palindromic Number","titleSlug":"largest-palindromic-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.2K\", \"totalSubmission\": \"64.8K\", \"totalAcceptedRaw\": 20153, \"totalSubmissionRaw\": 64762, \"acRate\": \"31.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2476","questionFrontendId":"2399","title":"Check Distances Between Same Letters","titleSlug":"check-distances-between-same-letters","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.8K\", \"totalSubmission\": \"47.9K\", \"totalAcceptedRaw\": 33840, \"totalSubmissionRaw\": 47949, \"acRate\": \"70.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2487","questionFrontendId":"2405","title":"Optimal Partition of String","titleSlug":"optimal-partition-of-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.2K\", \"totalSubmission\": \"44.1K\", \"totalAcceptedRaw\": 33162, \"totalSubmissionRaw\": 44116, \"acRate\": \"75.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2492","questionFrontendId":"2414","title":"Length of the Longest Alphabetical Continuous Substring","titleSlug":"length-of-the-longest-alphabetical-continuous-substring","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.3K\", \"totalSubmission\": \"55.8K\", \"totalAcceptedRaw\": 31320, \"totalSubmissionRaw\": 55832, \"acRate\": \"56.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2494","questionFrontendId":"2416","title":"Sum of Prefix Scores of Strings","titleSlug":"sum-of-prefix-scores-of-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.4K\", \"totalSubmission\": \"44.5K\", \"totalAcceptedRaw\": 19442, \"totalSubmissionRaw\": 44514, \"acRate\": \"43.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2496","questionFrontendId":"2409","title":"Count Days Spent Together","titleSlug":"count-days-spent-together","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.7K\", \"totalSubmission\": \"38.3K\", \"totalAcceptedRaw\": 16671, \"totalSubmissionRaw\": 38314, \"acRate\": \"43.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2502","questionFrontendId":"2418","title":"Sort the People","titleSlug":"sort-the-people","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.9K\", \"totalSubmission\": \"81.3K\", \"totalAcceptedRaw\": 65943, \"totalSubmissionRaw\": 81260, \"acRate\": \"81.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2510","questionFrontendId":"2430","title":"Maximum Deletions on a String","titleSlug":"maximum-deletions-on-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.3K\", \"totalSubmission\": \"31.8K\", \"totalAcceptedRaw\": 10254, \"totalSubmissionRaw\": 31840, \"acRate\": \"32.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2511","questionFrontendId":"2522","title":"Partition String Into Substrings With Values at Most K","titleSlug":"partition-string-into-substrings-with-values-at-most-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.4K\", \"totalSubmission\": \"33.1K\", \"totalAcceptedRaw\": 15447, \"totalSubmissionRaw\": 33068, \"acRate\": \"46.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2520","questionFrontendId":"2434","title":"Using a Robot to Print the Lexicographically Smallest String","titleSlug":"using-a-robot-to-print-the-lexicographically-smallest-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"35.9K\", \"totalAcceptedRaw\": 13842, \"totalSubmissionRaw\": 35918, \"acRate\": \"38.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2528","questionFrontendId":"2437","title":"Number of Valid Clock Times","titleSlug":"number-of-valid-clock-times","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.8K\", \"totalSubmission\": \"41.2K\", \"totalAcceptedRaw\": 17758, \"totalSubmissionRaw\": 41190, \"acRate\": \"43.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2532","questionFrontendId":"2423","title":"Remove Letter To Equalize Frequency","titleSlug":"remove-letter-to-equalize-frequency","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.3K\", \"totalSubmission\": \"134.6K\", \"totalAcceptedRaw\": 24276, \"totalSubmissionRaw\": 134550, \"acRate\": \"18.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2536","questionFrontendId":"2446","title":"Determine if Two Events Have Conflict","titleSlug":"determine-if-two-events-have-conflict","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.2K\", \"totalSubmission\": \"54.5K\", \"totalAcceptedRaw\": 27191, \"totalSubmissionRaw\": 54520, \"acRate\": \"49.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2543","questionFrontendId":"2456","title":"Most Popular Video Creator","titleSlug":"most-popular-video-creator","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.6K\", \"totalSubmission\": \"40.2K\", \"totalAcceptedRaw\": 17613, \"totalSubmissionRaw\": 40196, \"acRate\": \"43.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2547","questionFrontendId":"2451","title":"Odd String Difference","titleSlug":"odd-string-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"33.1K\", \"totalAcceptedRaw\": 19903, \"totalSubmissionRaw\": 33093, \"acRate\": \"60.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2550","questionFrontendId":"2452","title":"Words Within Two Edits of Dictionary","titleSlug":"words-within-two-edits-of-dictionary","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.5K\", \"totalSubmission\": \"25.6K\", \"totalAcceptedRaw\": 15465, \"totalSubmissionRaw\": 25624, \"acRate\": \"60.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2555","questionFrontendId":"2408","title":"Design SQL","titleSlug":"design-sql","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2K\", \"totalSubmission\": \"1.5K\", \"totalAcceptedRaw\": 1230, \"totalSubmissionRaw\": 1464, \"acRate\": \"84.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2559","questionFrontendId":"2472","title":"Maximum Number of Non-overlapping Palindrome Substrings","titleSlug":"maximum-number-of-non-overlapping-palindrome-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.1K\", \"totalSubmission\": \"24K\", \"totalAcceptedRaw\": 9129, \"totalSubmissionRaw\": 24002, \"acRate\": \"38.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2563","questionFrontendId":"2468","title":"Split Message Based on Limit","titleSlug":"split-message-based-on-limit","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.7K\", \"totalSubmission\": \"7.9K\", \"totalAcceptedRaw\": 3682, \"totalSubmissionRaw\": 7947, \"acRate\": \"46.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2569","questionFrontendId":"2478","title":"Number of Beautiful Partitions","titleSlug":"number-of-beautiful-partitions","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.2K\", \"totalSubmission\": \"23.6K\", \"totalAcceptedRaw\": 7241, \"totalSubmissionRaw\": 23552, \"acRate\": \"30.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2572","questionFrontendId":"2486","title":"Append Characters to String to Make Subsequence","titleSlug":"append-characters-to-string-to-make-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.5K\", \"totalSubmission\": \"30.5K\", \"totalAcceptedRaw\": 19542, \"totalSubmissionRaw\": 30528, \"acRate\": \"64.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2576","questionFrontendId":"2483","title":"Minimum Penalty for a Shop","titleSlug":"minimum-penalty-for-a-shop","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.5K\", \"totalSubmission\": \"22.5K\", \"totalAcceptedRaw\": 12540, \"totalSubmissionRaw\": 22508, \"acRate\": \"55.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2577","questionFrontendId":"2484","title":"Count Palindromic Subsequences","titleSlug":"count-palindromic-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.8K\", \"totalSubmission\": \"14.6K\", \"totalAcceptedRaw\": 4801, \"totalSubmissionRaw\": 14556, \"acRate\": \"33.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2580","questionFrontendId":"2490","title":"Circular Sentence","titleSlug":"circular-sentence","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.2K\", \"totalSubmission\": \"40.5K\", \"totalAcceptedRaw\": 26172, \"totalSubmissionRaw\": 40530, \"acRate\": \"64.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2589","questionFrontendId":"2496","title":"Maximum Value of a String in an Array","titleSlug":"maximum-value-of-a-string-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.8K\", \"totalSubmission\": \"31.6K\", \"totalAcceptedRaw\": 22766, \"totalSubmissionRaw\": 31600, \"acRate\": \"72.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2593","questionFrontendId":"2450","title":"Number of Distinct Binary Strings After Applying Operations","titleSlug":"number-of-distinct-binary-strings-after-applying-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"554\", \"totalSubmission\": \"819\", \"totalAcceptedRaw\": 554, \"totalSubmissionRaw\": 819, \"acRate\": \"67.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2594","questionFrontendId":"2506","title":"Count Pairs Of Similar Strings","titleSlug":"count-pairs-of-similar-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.8K\", \"totalSubmission\": \"35.1K\", \"totalAcceptedRaw\": 24786, \"totalSubmissionRaw\": 35146, \"acRate\": \"70.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2598","questionFrontendId":"2515","title":"Shortest Distance to Target String in a Circular Array","titleSlug":"shortest-distance-to-target-string-in-a-circular-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.6K\", \"totalSubmission\": \"40.1K\", \"totalAcceptedRaw\": 19639, \"totalSubmissionRaw\": 40100, \"acRate\": \"49.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2599","questionFrontendId":"2516","title":"Take K of Each Character From Left and Right","titleSlug":"take-k-of-each-character-from-left-and-right","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.5K\", \"totalSubmission\": \"30.9K\", \"totalAcceptedRaw\": 10457, \"totalSubmissionRaw\": 30850, \"acRate\": \"33.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2603","questionFrontendId":"2512","title":"Reward Top K Students","titleSlug":"reward-top-k-students","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.3K\", \"totalSubmission\": \"26.5K\", \"totalAcceptedRaw\": 12320, \"totalSubmissionRaw\": 26513, \"acRate\": \"46.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2605","questionFrontendId":"2514","title":"Count Anagrams","titleSlug":"count-anagrams","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.5K\", \"totalSubmission\": \"16.3K\", \"totalAcceptedRaw\": 5550, \"totalSubmissionRaw\": 16254, \"acRate\": \"34.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2615","questionFrontendId":"2531","title":"Make Number of Distinct Characters Equal","titleSlug":"make-number-of-distinct-characters-equal","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"52K\", \"totalAcceptedRaw\": 13275, \"totalSubmissionRaw\": 51994, \"acRate\": \"25.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2629","questionFrontendId":"2489","title":"Number of Substrings With Fixed Ratio","titleSlug":"number-of-substrings-with-fixed-ratio","translatedTitle":null,"stats":"{\"totalAccepted\": \"495\", \"totalSubmission\": \"843\", \"totalAcceptedRaw\": 495, \"totalSubmissionRaw\": 843, \"acRate\": \"58.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2632","questionFrontendId":"2546","title":"Apply Bitwise Operations to Make Strings Equal","titleSlug":"apply-bitwise-operations-to-make-strings-equal","translatedTitle":null,"stats":"{\"totalAccepted\": \"15K\", \"totalSubmission\": \"36.9K\", \"totalAcceptedRaw\": 15007, \"totalSubmissionRaw\": 36931, \"acRate\": \"40.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2654","questionFrontendId":"2586","title":"Count the Number of Vowel Strings in Range","titleSlug":"count-the-number-of-vowel-strings-in-range","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.1K\", \"totalSubmission\": \"26.7K\", \"totalAcceptedRaw\": 21074, \"totalSubmissionRaw\": 26656, \"acRate\": \"79.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2683","questionFrontendId":"2539","title":"Count the Number of Good Subsequences","titleSlug":"count-the-number-of-good-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"1.6K\", \"totalAcceptedRaw\": 1274, \"totalSubmissionRaw\": 1647, \"acRate\": \"77.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2691","questionFrontendId":"2559","title":"Count Vowel Strings in Ranges","titleSlug":"count-vowel-strings-in-ranges","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.5K\", \"totalSubmission\": \"38K\", \"totalAcceptedRaw\": 19465, \"totalSubmissionRaw\": 37955, \"acRate\": \"51.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2700","questionFrontendId":"2564","title":"Substring XOR Queries","titleSlug":"substring-xor-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.3K\", \"totalSubmission\": \"27.8K\", \"totalAcceptedRaw\": 9300, \"totalSubmissionRaw\": 27784, \"acRate\": \"33.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2701","questionFrontendId":"2565","title":"Subsequence With the Minimum Score","titleSlug":"subsequence-with-the-minimum-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"13.3K\", \"totalAcceptedRaw\": 4274, \"totalSubmissionRaw\": 13339, \"acRate\": \"32.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2708","questionFrontendId":"2573","title":"Find the String with LCP","titleSlug":"find-the-string-with-lcp","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.6K\", \"totalSubmission\": \"7.3K\", \"totalAcceptedRaw\": 2584, \"totalSubmissionRaw\": 7349, \"acRate\": \"35.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2713","questionFrontendId":"2575","title":"Find the Divisibility Array of a String","titleSlug":"find-the-divisibility-array-of-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.8K\", \"totalSubmission\": \"60.8K\", \"totalAcceptedRaw\": 18753, \"totalSubmissionRaw\": 60764, \"acRate\": \"30.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/tmp/tree-graphql.json b/tmp/tree-graphql.json
new file mode 100644
index 000000000..bcf77c733
--- /dev/null
+++ b/tmp/tree-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"Tree","translatedName":null,"slug":"tree","questions":[{"status":null,"questionId":"94","questionFrontendId":"94","title":"Binary Tree Inorder Traversal","titleSlug":"binary-tree-inorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.9M\", \"totalSubmission\": \"2.6M\", \"totalAcceptedRaw\": 1938413, \"totalSubmissionRaw\": 2629905, \"acRate\": \"73.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"95","questionFrontendId":"95","title":"Unique Binary Search Trees II","titleSlug":"unique-binary-search-trees-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"347.9K\", \"totalSubmission\": \"665.5K\", \"totalAcceptedRaw\": 347904, \"totalSubmissionRaw\": 665456, \"acRate\": \"52.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"96","questionFrontendId":"96","title":"Unique Binary Search Trees","titleSlug":"unique-binary-search-trees","translatedTitle":null,"stats":"{\"totalAccepted\": \"559.5K\", \"totalSubmission\": \"938.3K\", \"totalAcceptedRaw\": 559467, \"totalSubmissionRaw\": 938346, \"acRate\": \"59.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"98","questionFrontendId":"98","title":"Validate Binary Search Tree","titleSlug":"validate-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.9M\", \"totalSubmission\": \"5.8M\", \"totalAcceptedRaw\": 1863971, \"totalSubmissionRaw\": 5831535, \"acRate\": \"32.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"99","questionFrontendId":"99","title":"Recover Binary Search Tree","titleSlug":"recover-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"385.5K\", \"totalSubmission\": \"757.5K\", \"totalAcceptedRaw\": 385544, \"totalSubmissionRaw\": 757487, \"acRate\": \"50.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"100","questionFrontendId":"100","title":"Same Tree","titleSlug":"same-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5M\", \"totalSubmission\": \"2.5M\", \"totalAcceptedRaw\": 1470483, \"totalSubmissionRaw\": 2533188, \"acRate\": \"58.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"101","questionFrontendId":"101","title":"Symmetric Tree","titleSlug":"symmetric-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6M\", \"totalSubmission\": \"2.9M\", \"totalAcceptedRaw\": 1592991, \"totalSubmissionRaw\": 2938030, \"acRate\": \"54.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"102","questionFrontendId":"102","title":"Binary Tree Level Order Traversal","titleSlug":"binary-tree-level-order-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.7M\", \"totalSubmission\": \"2.7M\", \"totalAcceptedRaw\": 1718359, \"totalSubmissionRaw\": 2676223, \"acRate\": \"64.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"103","questionFrontendId":"103","title":"Binary Tree Zigzag Level Order Traversal","titleSlug":"binary-tree-zigzag-level-order-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"934.3K\", \"totalSubmission\": \"1.6M\", \"totalAcceptedRaw\": 934344, \"totalSubmissionRaw\": 1644514, \"acRate\": \"56.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"104","questionFrontendId":"104","title":"Maximum Depth of Binary Tree","titleSlug":"maximum-depth-of-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.3M\", \"totalSubmission\": \"3.1M\", \"totalAcceptedRaw\": 2253172, \"totalSubmissionRaw\": 3050882, \"acRate\": \"73.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"105","questionFrontendId":"105","title":"Construct Binary Tree from Preorder and Inorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"936.4K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 936442, \"totalSubmissionRaw\": 1524460, \"acRate\": \"61.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"106","questionFrontendId":"106","title":"Construct Binary Tree from Inorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"465K\", \"totalSubmission\": \"800.1K\", \"totalAcceptedRaw\": 465028, \"totalSubmissionRaw\": 800148, \"acRate\": \"58.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"107","questionFrontendId":"107","title":"Binary Tree Level Order Traversal II","titleSlug":"binary-tree-level-order-traversal-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"567.5K\", \"totalSubmission\": \"929.8K\", \"totalAcceptedRaw\": 567505, \"totalSubmissionRaw\": 929759, \"acRate\": \"61.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"108","questionFrontendId":"108","title":"Convert Sorted Array to Binary Search Tree","titleSlug":"convert-sorted-array-to-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"963.7K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 963738, \"totalSubmissionRaw\": 1381800, \"acRate\": \"69.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"109","questionFrontendId":"109","title":"Convert Sorted List to Binary Search Tree","titleSlug":"convert-sorted-list-to-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"468.6K\", \"totalSubmission\": \"779.7K\", \"totalAcceptedRaw\": 468618, \"totalSubmissionRaw\": 779716, \"acRate\": \"60.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"110","questionFrontendId":"110","title":"Balanced Binary Tree","titleSlug":"balanced-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 1061177, \"totalSubmissionRaw\": 2169100, \"acRate\": \"48.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"111","questionFrontendId":"111","title":"Minimum Depth of Binary Tree","titleSlug":"minimum-depth-of-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"913.6K\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 913642, \"totalSubmissionRaw\": 2061234, \"acRate\": \"44.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"112","questionFrontendId":"112","title":"Path Sum","titleSlug":"path-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"2.4M\", \"totalAcceptedRaw\": 1139599, \"totalSubmissionRaw\": 2365630, \"acRate\": \"48.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"113","questionFrontendId":"113","title":"Path Sum II","titleSlug":"path-sum-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"730K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 730033, \"totalSubmissionRaw\": 1279923, \"acRate\": \"57.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"114","questionFrontendId":"114","title":"Flatten Binary Tree to Linked List","titleSlug":"flatten-binary-tree-to-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"758K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 757996, \"totalSubmissionRaw\": 1227848, \"acRate\": \"61.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"116","questionFrontendId":"116","title":"Populating Next Right Pointers in Each Node","titleSlug":"populating-next-right-pointers-in-each-node","translatedTitle":null,"stats":"{\"totalAccepted\": \"903.7K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 903689, \"totalSubmissionRaw\": 1498826, \"acRate\": \"60.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"117","questionFrontendId":"117","title":"Populating Next Right Pointers in Each Node II","titleSlug":"populating-next-right-pointers-in-each-node-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"539.3K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 539297, \"totalSubmissionRaw\": 1074426, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"124","questionFrontendId":"124","title":"Binary Tree Maximum Path Sum","titleSlug":"binary-tree-maximum-path-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"949.8K\", \"totalSubmission\": \"2.4M\", \"totalAcceptedRaw\": 949830, \"totalSubmissionRaw\": 2423499, \"acRate\": \"39.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"129","questionFrontendId":"129","title":"Sum Root to Leaf Numbers","titleSlug":"sum-root-to-leaf-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"598K\", \"totalSubmission\": \"981.6K\", \"totalAcceptedRaw\": 597957, \"totalSubmissionRaw\": 981571, \"acRate\": \"60.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"144","questionFrontendId":"144","title":"Binary Tree Preorder Traversal","titleSlug":"binary-tree-preorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 1279305, \"totalSubmissionRaw\": 1917628, \"acRate\": \"66.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"145","questionFrontendId":"145","title":"Binary Tree Postorder Traversal","titleSlug":"binary-tree-postorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"924.9K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 924886, \"totalSubmissionRaw\": 1364034, \"acRate\": \"67.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"156","questionFrontendId":"156","title":"Binary Tree Upside Down","titleSlug":"binary-tree-upside-down","translatedTitle":null,"stats":"{\"totalAccepted\": \"96.3K\", \"totalSubmission\": \"155.5K\", \"totalAcceptedRaw\": 96294, \"totalSubmissionRaw\": 155507, \"acRate\": \"61.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"173","questionFrontendId":"173","title":"Binary Search Tree Iterator","titleSlug":"binary-search-tree-iterator","translatedTitle":null,"stats":"{\"totalAccepted\": \"659.8K\", \"totalSubmission\": \"947.2K\", \"totalAcceptedRaw\": 659778, \"totalSubmissionRaw\": 947231, \"acRate\": \"69.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"},{"name":"Iterator","translatedName":null,"slug":"iterator","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"199","questionFrontendId":"199","title":"Binary Tree Right Side View","titleSlug":"binary-tree-right-side-view","translatedTitle":null,"stats":"{\"totalAccepted\": \"919.2K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 919154, \"totalSubmissionRaw\": 1492530, \"acRate\": \"61.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"222","questionFrontendId":"222","title":"Count Complete Tree Nodes","titleSlug":"count-complete-tree-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"534.5K\", \"totalSubmission\": \"884.6K\", \"totalAcceptedRaw\": 534451, \"totalSubmissionRaw\": 884557, \"acRate\": \"60.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"226","questionFrontendId":"226","title":"Invert Binary Tree","titleSlug":"invert-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5M\", \"totalSubmission\": \"2M\", \"totalAcceptedRaw\": 1495463, \"totalSubmissionRaw\": 2003910, \"acRate\": \"74.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"230","questionFrontendId":"230","title":"Kth Smallest Element in a BST","titleSlug":"kth-smallest-element-in-a-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"1M\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 1049141, \"totalSubmissionRaw\": 1497869, \"acRate\": \"70.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"235","questionFrontendId":"235","title":"Lowest Common Ancestor of a Binary Search Tree","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 1134027, \"totalSubmissionRaw\": 1847797, \"acRate\": \"61.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"236","questionFrontendId":"236","title":"Lowest Common Ancestor of a Binary Tree","titleSlug":"lowest-common-ancestor-of-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.3M\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 1265640, \"totalSubmissionRaw\": 2155910, \"acRate\": \"58.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"250","questionFrontendId":"250","title":"Count Univalue Subtrees","titleSlug":"count-univalue-subtrees","translatedTitle":null,"stats":"{\"totalAccepted\": \"137K\", \"totalSubmission\": \"247.3K\", \"totalAcceptedRaw\": 137043, \"totalSubmissionRaw\": 247334, \"acRate\": \"55.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"255","questionFrontendId":"255","title":"Verify Preorder Sequence in Binary Search Tree","titleSlug":"verify-preorder-sequence-in-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.1K\", \"totalSubmission\": \"145.3K\", \"totalAcceptedRaw\": 70070, \"totalSubmissionRaw\": 145309, \"acRate\": \"48.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"257","questionFrontendId":"257","title":"Binary Tree Paths","titleSlug":"binary-tree-paths","translatedTitle":null,"stats":"{\"totalAccepted\": \"603.6K\", \"totalSubmission\": \"984.7K\", \"totalAcceptedRaw\": 603639, \"totalSubmissionRaw\": 984698, \"acRate\": \"61.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"270","questionFrontendId":"270","title":"Closest Binary Search Tree Value","titleSlug":"closest-binary-search-tree-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"281.9K\", \"totalSubmission\": \"515K\", \"totalAcceptedRaw\": 281901, \"totalSubmissionRaw\": 515004, \"acRate\": \"54.7%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"272","questionFrontendId":"272","title":"Closest Binary Search Tree Value II","titleSlug":"closest-binary-search-tree-value-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"110K\", \"totalSubmission\": \"188.3K\", \"totalAcceptedRaw\": 109964, \"totalSubmissionRaw\": 188323, \"acRate\": \"58.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"285","questionFrontendId":"285","title":"Inorder Successor in BST","titleSlug":"inorder-successor-in-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"300.1K\", \"totalSubmission\": \"616.1K\", \"totalAcceptedRaw\": 300055, \"totalSubmissionRaw\": 616078, \"acRate\": \"48.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"297","questionFrontendId":"297","title":"Serialize and Deserialize Binary Tree","titleSlug":"serialize-and-deserialize-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"727.9K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 727921, \"totalSubmissionRaw\": 1315117, \"acRate\": \"55.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"298","questionFrontendId":"298","title":"Binary Tree Longest Consecutive Sequence","titleSlug":"binary-tree-longest-consecutive-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"137.1K\", \"totalSubmission\": \"259.9K\", \"totalAcceptedRaw\": 137050, \"totalSubmissionRaw\": 259940, \"acRate\": \"52.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"314","questionFrontendId":"314","title":"Binary Tree Vertical Order Traversal","titleSlug":"binary-tree-vertical-order-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"318.2K\", \"totalSubmission\": \"608.7K\", \"totalAcceptedRaw\": 318203, \"totalSubmissionRaw\": 608665, \"acRate\": \"52.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"331","questionFrontendId":"331","title":"Verify Preorder Serialization of a Binary Tree","titleSlug":"verify-preorder-serialization-of-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"127.4K\", \"totalSubmission\": \"286K\", \"totalAcceptedRaw\": 127418, \"totalSubmissionRaw\": 285960, \"acRate\": \"44.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"333","questionFrontendId":"333","title":"Largest BST Subtree","titleSlug":"largest-bst-subtree","translatedTitle":null,"stats":"{\"totalAccepted\": \"95.4K\", \"totalSubmission\": \"223.2K\", \"totalAcceptedRaw\": 95442, \"totalSubmissionRaw\": 223176, \"acRate\": \"42.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"337","questionFrontendId":"337","title":"House Robber III","titleSlug":"house-robber-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"329.6K\", \"totalSubmission\": \"611.1K\", \"totalAcceptedRaw\": 329595, \"totalSubmissionRaw\": 611056, \"acRate\": \"53.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"341","questionFrontendId":"341","title":"Flatten Nested List Iterator","titleSlug":"flatten-nested-list-iterator","translatedTitle":null,"stats":"{\"totalAccepted\": \"358.8K\", \"totalSubmission\": \"580.5K\", \"totalAcceptedRaw\": 358753, \"totalSubmissionRaw\": 580520, \"acRate\": \"61.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Queue","translatedName":null,"slug":"queue","__typename":"TopicTagNode"},{"name":"Iterator","translatedName":null,"slug":"iterator","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"366","questionFrontendId":"366","title":"Find Leaves of Binary Tree","titleSlug":"find-leaves-of-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"234.6K\", \"totalSubmission\": \"292.2K\", \"totalAcceptedRaw\": 234577, \"totalSubmissionRaw\": 292175, \"acRate\": \"80.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"404","questionFrontendId":"404","title":"Sum of Left Leaves","titleSlug":"sum-of-left-leaves","translatedTitle":null,"stats":"{\"totalAccepted\": \"425.3K\", \"totalSubmission\": \"750.7K\", \"totalAcceptedRaw\": 425336, \"totalSubmissionRaw\": 750670, \"acRate\": \"56.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"437","questionFrontendId":"437","title":"Path Sum III","titleSlug":"path-sum-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"443.7K\", \"totalSubmission\": \"923.1K\", \"totalAcceptedRaw\": 443748, \"totalSubmissionRaw\": 923150, \"acRate\": \"48.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"449","questionFrontendId":"449","title":"Serialize and Deserialize BST","titleSlug":"serialize-and-deserialize-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"215.8K\", \"totalSubmission\": \"378.7K\", \"totalAcceptedRaw\": 215815, \"totalSubmissionRaw\": 378697, \"acRate\": \"57.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"450","questionFrontendId":"450","title":"Delete Node in a BST","titleSlug":"delete-node-in-a-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"346.9K\", \"totalSubmission\": \"689.9K\", \"totalAcceptedRaw\": 346942, \"totalSubmissionRaw\": 689923, \"acRate\": \"50.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"501","questionFrontendId":"501","title":"Find Mode in Binary Search Tree","titleSlug":"find-mode-in-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"186.1K\", \"totalSubmission\": \"377.9K\", \"totalAcceptedRaw\": 186078, \"totalSubmissionRaw\": 377907, \"acRate\": \"49.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"508","questionFrontendId":"508","title":"Most Frequent Subtree Sum","titleSlug":"most-frequent-subtree-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.8K\", \"totalSubmission\": \"192.5K\", \"totalAcceptedRaw\": 124782, \"totalSubmissionRaw\": 192529, \"acRate\": \"64.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"509","questionFrontendId":"510","title":"Inorder Successor in BST II","titleSlug":"inorder-successor-in-bst-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"60.2K\", \"totalSubmission\": \"98.7K\", \"totalAcceptedRaw\": 60228, \"totalSubmissionRaw\": 98724, \"acRate\": \"61.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"513","questionFrontendId":"513","title":"Find Bottom Left Tree Value","titleSlug":"find-bottom-left-tree-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"207.9K\", \"totalSubmission\": \"311.1K\", \"totalAcceptedRaw\": 207889, \"totalSubmissionRaw\": 311066, \"acRate\": \"66.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"515","questionFrontendId":"515","title":"Find Largest Value in Each Tree Row","titleSlug":"find-largest-value-in-each-tree-row","translatedTitle":null,"stats":"{\"totalAccepted\": \"223.4K\", \"totalSubmission\": \"345.8K\", \"totalAcceptedRaw\": 223405, \"totalSubmissionRaw\": 345841, \"acRate\": \"64.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"530","questionFrontendId":"530","title":"Minimum Absolute Difference in BST","titleSlug":"minimum-absolute-difference-in-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"199.9K\", \"totalSubmission\": \"348.9K\", \"totalAcceptedRaw\": 199922, \"totalSubmissionRaw\": 348877, \"acRate\": \"57.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"536","questionFrontendId":"536","title":"Construct Binary Tree from String","titleSlug":"construct-binary-tree-from-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"82.8K\", \"totalSubmission\": \"147.3K\", \"totalAcceptedRaw\": 82832, \"totalSubmissionRaw\": 147300, \"acRate\": \"56.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"538","questionFrontendId":"538","title":"Convert BST to Greater Tree","titleSlug":"convert-bst-to-greater-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"264.1K\", \"totalSubmission\": \"389.8K\", \"totalAcceptedRaw\": 264101, \"totalSubmissionRaw\": 389825, \"acRate\": \"67.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"543","questionFrontendId":"543","title":"Diameter of Binary Tree","titleSlug":"diameter-of-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"999.3K\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 999277, \"totalSubmissionRaw\": 1762332, \"acRate\": \"56.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"545","questionFrontendId":"545","title":"Boundary of Binary Tree","titleSlug":"boundary-of-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"118.7K\", \"totalSubmission\": \"266.9K\", \"totalAcceptedRaw\": 118735, \"totalSubmissionRaw\": 266859, \"acRate\": \"44.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"549","questionFrontendId":"549","title":"Binary Tree Longest Consecutive Sequence II","titleSlug":"binary-tree-longest-consecutive-sequence-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"49.8K\", \"totalSubmission\": \"100.7K\", \"totalAcceptedRaw\": 49810, \"totalSubmissionRaw\": 100667, \"acRate\": \"49.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"563","questionFrontendId":"563","title":"Binary Tree Tilt","titleSlug":"binary-tree-tilt","translatedTitle":null,"stats":"{\"totalAccepted\": \"186.7K\", \"totalSubmission\": \"311.4K\", \"totalAcceptedRaw\": 186679, \"totalSubmissionRaw\": 311399, \"acRate\": \"59.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"572","questionFrontendId":"572","title":"Subtree of Another Tree","titleSlug":"subtree-of-another-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"632.7K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 632674, \"totalSubmissionRaw\": 1365640, \"acRate\": \"46.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"582","questionFrontendId":"582","title":"Kill Process","titleSlug":"kill-process","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.4K\", \"totalSubmission\": \"114.1K\", \"totalAcceptedRaw\": 78370, \"totalSubmissionRaw\": 114068, \"acRate\": \"68.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"606","questionFrontendId":"606","title":"Construct String from Binary Tree","titleSlug":"construct-string-from-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"213.6K\", \"totalSubmission\": \"334K\", \"totalAcceptedRaw\": 213587, \"totalSubmissionRaw\": 333989, \"acRate\": \"64.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"617","questionFrontendId":"617","title":"Merge Two Binary Trees","titleSlug":"merge-two-binary-trees","translatedTitle":null,"stats":"{\"totalAccepted\": \"669.3K\", \"totalSubmission\": \"851.1K\", \"totalAcceptedRaw\": 669307, \"totalSubmissionRaw\": 851087, \"acRate\": \"78.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"623","questionFrontendId":"623","title":"Add One Row to Tree","titleSlug":"add-one-row-to-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"148.7K\", \"totalSubmission\": \"250K\", \"totalAcceptedRaw\": 148692, \"totalSubmissionRaw\": 250011, \"acRate\": \"59.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"637","questionFrontendId":"637","title":"Average of Levels in Binary Tree","titleSlug":"average-of-levels-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"383.5K\", \"totalSubmission\": \"534.5K\", \"totalAcceptedRaw\": 383532, \"totalSubmissionRaw\": 534499, \"acRate\": \"71.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"652","questionFrontendId":"652","title":"Find Duplicate Subtrees","titleSlug":"find-duplicate-subtrees","translatedTitle":null,"stats":"{\"totalAccepted\": \"228.1K\", \"totalSubmission\": \"386.9K\", \"totalAcceptedRaw\": 228142, \"totalSubmissionRaw\": 386902, \"acRate\": \"59.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"653","questionFrontendId":"653","title":"Two Sum IV - Input is a BST","titleSlug":"two-sum-iv-input-is-a-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"445.1K\", \"totalSubmission\": \"729.2K\", \"totalAcceptedRaw\": 445113, \"totalSubmissionRaw\": 729202, \"acRate\": \"61.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"654","questionFrontendId":"654","title":"Maximum Binary Tree","titleSlug":"maximum-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"249.9K\", \"totalSubmission\": \"295K\", \"totalAcceptedRaw\": 249947, \"totalSubmissionRaw\": 295018, \"acRate\": \"84.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"655","questionFrontendId":"655","title":"Print Binary Tree","titleSlug":"print-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.9K\", \"totalSubmission\": \"95.1K\", \"totalAcceptedRaw\": 58874, \"totalSubmissionRaw\": 95071, \"acRate\": \"61.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"662","questionFrontendId":"662","title":"Maximum Width of Binary Tree","titleSlug":"maximum-width-of-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"241.8K\", \"totalSubmission\": \"593.6K\", \"totalAcceptedRaw\": 241778, \"totalSubmissionRaw\": 593554, \"acRate\": \"40.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"663","questionFrontendId":"663","title":"Equal Tree Partition","titleSlug":"equal-tree-partition","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.2K\", \"totalSubmission\": \"70.6K\", \"totalAcceptedRaw\": 29238, \"totalSubmissionRaw\": 70590, \"acRate\": \"41.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"666","questionFrontendId":"666","title":"Path Sum IV","titleSlug":"path-sum-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.4K\", \"totalSubmission\": \"36K\", \"totalAcceptedRaw\": 21382, \"totalSubmissionRaw\": 35965, \"acRate\": \"59.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"669","questionFrontendId":"669","title":"Trim a Binary Search Tree","titleSlug":"trim-a-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"262K\", \"totalSubmission\": \"394.8K\", \"totalAcceptedRaw\": 262037, \"totalSubmissionRaw\": 394835, \"acRate\": \"66.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"671","questionFrontendId":"671","title":"Second Minimum Node In a Binary Tree","titleSlug":"second-minimum-node-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"165.9K\", \"totalSubmission\": \"376.2K\", \"totalAcceptedRaw\": 165853, \"totalSubmissionRaw\": 376220, \"acRate\": \"44.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"687","questionFrontendId":"687","title":"Longest Univalue Path","titleSlug":"longest-univalue-path","translatedTitle":null,"stats":"{\"totalAccepted\": \"161.2K\", \"totalSubmission\": \"398.9K\", \"totalAcceptedRaw\": 161171, \"totalSubmissionRaw\": 398855, \"acRate\": \"40.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"743","questionFrontendId":"742","title":"Closest Leaf in a Binary Tree","titleSlug":"closest-leaf-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"41.8K\", \"totalSubmission\": \"91.2K\", \"totalAcceptedRaw\": 41835, \"totalSubmissionRaw\": 91177, \"acRate\": \"45.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"758","questionFrontendId":"426","title":"Convert Binary Search Tree to Sorted Doubly Linked List","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"233.7K\", \"totalSubmission\": \"361.5K\", \"totalAcceptedRaw\": 233675, \"totalSubmissionRaw\": 361492, \"acRate\": \"64.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"},{"name":"Doubly-Linked List","translatedName":null,"slug":"doubly-linked-list","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"764","questionFrontendId":"429","title":"N-ary Tree Level Order Traversal","titleSlug":"n-ary-tree-level-order-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"274K\", \"totalSubmission\": \"387.7K\", \"totalAcceptedRaw\": 273967, \"totalSubmissionRaw\": 387664, \"acRate\": \"70.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"765","questionFrontendId":"428","title":"Serialize and Deserialize N-ary Tree","titleSlug":"serialize-and-deserialize-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"77.9K\", \"totalSubmission\": \"118.1K\", \"totalAcceptedRaw\": 77875, \"totalSubmissionRaw\": 118100, \"acRate\": \"65.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"771","questionFrontendId":"431","title":"Encode N-ary Tree to Binary Tree","titleSlug":"encode-n-ary-tree-to-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.3K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 19349, \"totalSubmissionRaw\": 24526, \"acRate\": \"78.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"772","questionFrontendId":"427","title":"Construct Quad Tree","titleSlug":"construct-quad-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"92.6K\", \"totalSubmission\": \"124.3K\", \"totalAcceptedRaw\": 92628, \"totalSubmissionRaw\": 124326, \"acRate\": \"74.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"773","questionFrontendId":"558","title":"Logical OR of Two Binary Grids Represented as Quad-Trees","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.8K\", \"totalSubmission\": \"26.4K\", \"totalAcceptedRaw\": 12822, \"totalSubmissionRaw\": 26380, \"acRate\": \"48.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"774","questionFrontendId":"559","title":"Maximum Depth of N-ary Tree","titleSlug":"maximum-depth-of-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"244.8K\", \"totalSubmission\": \"341.7K\", \"totalAcceptedRaw\": 244823, \"totalSubmissionRaw\": 341672, \"acRate\": \"71.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"775","questionFrontendId":"589","title":"N-ary Tree Preorder Traversal","titleSlug":"n-ary-tree-preorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"373.9K\", \"totalSubmission\": \"492.5K\", \"totalAcceptedRaw\": 373899, \"totalSubmissionRaw\": 492501, \"acRate\": \"75.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"776","questionFrontendId":"590","title":"N-ary Tree Postorder Traversal","titleSlug":"n-ary-tree-postorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"220.5K\", \"totalSubmission\": \"284.9K\", \"totalAcceptedRaw\": 220546, \"totalSubmissionRaw\": 284943, \"acRate\": \"77.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"783","questionFrontendId":"700","title":"Search in a Binary Search Tree","titleSlug":"search-in-a-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"619.4K\", \"totalSubmission\": \"798.1K\", \"totalAcceptedRaw\": 619431, \"totalSubmissionRaw\": 798096, \"acRate\": \"77.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"784","questionFrontendId":"701","title":"Insert into a Binary Search Tree","titleSlug":"insert-into-a-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"396.4K\", \"totalSubmission\": \"533.3K\", \"totalAcceptedRaw\": 396410, \"totalSubmissionRaw\": 533254, \"acRate\": \"74.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"789","questionFrontendId":"703","title":"Kth Largest Element in a Stream","titleSlug":"kth-largest-element-in-a-stream","translatedTitle":null,"stats":"{\"totalAccepted\": \"340.5K\", \"totalSubmission\": \"613.9K\", \"totalAcceptedRaw\": 340468, \"totalSubmissionRaw\": 613917, \"acRate\": \"55.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"791","questionFrontendId":"776","title":"Split BST","titleSlug":"split-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"53.9K\", \"totalSubmission\": \"74.2K\", \"totalAcceptedRaw\": 53886, \"totalSubmissionRaw\": 74249, \"acRate\": \"72.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"799","questionFrontendId":"783","title":"Minimum Distance Between BST Nodes","titleSlug":"minimum-distance-between-bst-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"209.6K\", \"totalSubmission\": \"353.5K\", \"totalAcceptedRaw\": 209595, \"totalSubmissionRaw\": 353523, \"acRate\": \"59.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"832","questionFrontendId":"814","title":"Binary Tree Pruning","titleSlug":"binary-tree-pruning","translatedTitle":null,"stats":"{\"totalAccepted\": \"223.1K\", \"totalSubmission\": \"308.1K\", \"totalAcceptedRaw\": 223095, \"totalSubmissionRaw\": 308113, \"acRate\": \"72.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"863","questionFrontendId":"834","title":"Sum of Distances in Tree","titleSlug":"sum-of-distances-in-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"80.5K\", \"totalSubmission\": \"135.8K\", \"totalAcceptedRaw\": 80481, \"totalSubmissionRaw\": 135803, \"acRate\": \"59.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"893","questionFrontendId":"863","title":"All Nodes Distance K in Binary Tree","titleSlug":"all-nodes-distance-k-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"296.6K\", \"totalSubmission\": \"476.4K\", \"totalAcceptedRaw\": 296573, \"totalSubmissionRaw\": 476355, \"acRate\": \"62.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"896","questionFrontendId":"865","title":"Smallest Subtree with all the Deepest Nodes","titleSlug":"smallest-subtree-with-all-the-deepest-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"115.3K\", \"totalSubmission\": \"167.4K\", \"totalAcceptedRaw\": 115329, \"totalSubmissionRaw\": 167361, \"acRate\": \"68.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"904","questionFrontendId":"872","title":"Leaf-Similar Trees","titleSlug":"leaf-similar-trees","translatedTitle":null,"stats":"{\"totalAccepted\": \"250.5K\", \"totalSubmission\": \"370.5K\", \"totalAcceptedRaw\": 250470, \"totalSubmissionRaw\": 370459, \"acRate\": \"67.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"925","questionFrontendId":"889","title":"Construct Binary Tree from Preorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"86.7K\", \"totalSubmission\": \"122.2K\", \"totalAcceptedRaw\": 86717, \"totalSubmissionRaw\": 122198, \"acRate\": \"71.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"930","questionFrontendId":"894","title":"All Possible Full Binary Trees","titleSlug":"all-possible-full-binary-trees","translatedTitle":null,"stats":"{\"totalAccepted\": \"105.6K\", \"totalSubmission\": \"132K\", \"totalAcceptedRaw\": 105605, \"totalSubmissionRaw\": 132049, \"acRate\": \"80.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"933","questionFrontendId":"897","title":"Increasing Order Search Tree","titleSlug":"increasing-order-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"244.5K\", \"totalSubmission\": \"311.6K\", \"totalAcceptedRaw\": 244474, \"totalSubmissionRaw\": 311624, \"acRate\": \"78.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"955","questionFrontendId":"919","title":"Complete Binary Tree Inserter","titleSlug":"complete-binary-tree-inserter","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.9K\", \"totalSubmission\": \"69K\", \"totalAcceptedRaw\": 44935, \"totalSubmissionRaw\": 68988, \"acRate\": \"65.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"975","questionFrontendId":"938","title":"Range Sum of BST","titleSlug":"range-sum-of-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"771K\", \"totalSubmission\": \"897.7K\", \"totalAcceptedRaw\": 771015, \"totalSubmissionRaw\": 897745, \"acRate\": \"85.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"988","questionFrontendId":"951","title":"Flip Equivalent Binary Trees","titleSlug":"flip-equivalent-binary-trees","translatedTitle":null,"stats":"{\"totalAccepted\": \"127.7K\", \"totalSubmission\": \"191.2K\", \"totalAcceptedRaw\": 127706, \"totalSubmissionRaw\": 191171, \"acRate\": \"66.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"998","questionFrontendId":"958","title":"Check Completeness of a Binary Tree","titleSlug":"check-completeness-of-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"178.7K\", \"totalSubmission\": \"321.1K\", \"totalAcceptedRaw\": 178674, \"totalSubmissionRaw\": 321067, \"acRate\": \"55.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1005","questionFrontendId":"965","title":"Univalued Binary Tree","titleSlug":"univalued-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"188K\", \"totalSubmission\": \"270K\", \"totalAcceptedRaw\": 188013, \"totalSubmissionRaw\": 270014, \"acRate\": \"69.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1008","questionFrontendId":"968","title":"Binary Tree Cameras","titleSlug":"binary-tree-cameras","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.1K\", \"totalSubmission\": \"255.1K\", \"totalAcceptedRaw\": 119075, \"totalSubmissionRaw\": 255092, \"acRate\": \"46.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1011","questionFrontendId":"971","title":"Flip Binary Tree To Match Preorder Traversal","titleSlug":"flip-binary-tree-to-match-preorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.3K\", \"totalSubmission\": \"76.5K\", \"totalAcceptedRaw\": 38327, \"totalSubmissionRaw\": 76547, \"acRate\": \"50.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1021","questionFrontendId":"979","title":"Distribute Coins in Binary Tree","titleSlug":"distribute-coins-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"100.5K\", \"totalSubmission\": \"139.2K\", \"totalAcceptedRaw\": 100475, \"totalSubmissionRaw\": 139166, \"acRate\": \"72.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1029","questionFrontendId":"987","title":"Vertical Order Traversal of a Binary Tree","titleSlug":"vertical-order-traversal-of-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"324.9K\", \"totalSubmission\": \"721.4K\", \"totalAcceptedRaw\": 324853, \"totalSubmissionRaw\": 721357, \"acRate\": \"45.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1030","questionFrontendId":"988","title":"Smallest String Starting From Leaf","titleSlug":"smallest-string-starting-from-leaf","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.6K\", \"totalSubmission\": \"130.7K\", \"totalAcceptedRaw\": 65584, \"totalSubmissionRaw\": 130696, \"acRate\": \"50.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1035","questionFrontendId":"993","title":"Cousins in Binary Tree","titleSlug":"cousins-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"238.6K\", \"totalSubmission\": \"437K\", \"totalAcceptedRaw\": 238567, \"totalSubmissionRaw\": 437039, \"acRate\": \"54.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1040","questionFrontendId":"998","title":"Maximum Binary Tree II","titleSlug":"maximum-binary-tree-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.1K\", \"totalSubmission\": \"46.2K\", \"totalAcceptedRaw\": 31068, \"totalSubmissionRaw\": 46250, \"acRate\": \"67.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1050","questionFrontendId":"1008","title":"Construct Binary Search Tree from Preorder Traversal","titleSlug":"construct-binary-search-tree-from-preorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"285.7K\", \"totalSubmission\": \"352.2K\", \"totalAcceptedRaw\": 285727, \"totalSubmissionRaw\": 352247, \"acRate\": \"81.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1079","questionFrontendId":"1022","title":"Sum of Root To Leaf Binary Numbers","titleSlug":"sum-of-root-to-leaf-binary-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"186K\", \"totalSubmission\": \"252.8K\", \"totalAcceptedRaw\": 186024, \"totalSubmissionRaw\": 252803, \"acRate\": \"73.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1091","questionFrontendId":"1120","title":"Maximum Average Subtree","titleSlug":"maximum-average-subtree","translatedTitle":null,"stats":"{\"totalAccepted\": \"58.9K\", \"totalSubmission\": \"89.9K\", \"totalAcceptedRaw\": 58935, \"totalSubmissionRaw\": 89896, \"acRate\": \"65.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1092","questionFrontendId":"1026","title":"Maximum Difference Between Node and Ancestor","titleSlug":"maximum-difference-between-node-and-ancestor","translatedTitle":null,"stats":"{\"totalAccepted\": \"200.7K\", \"totalSubmission\": \"265K\", \"totalAcceptedRaw\": 200740, \"totalSubmissionRaw\": 265007, \"acRate\": \"75.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1093","questionFrontendId":"1028","title":"Recover a Tree From Preorder Traversal","titleSlug":"recover-a-tree-from-preorder-traversal","translatedTitle":null,"stats":"{\"totalAccepted\": \"41.8K\", \"totalSubmission\": \"57K\", \"totalAcceptedRaw\": 41771, \"totalSubmissionRaw\": 57034, \"acRate\": \"73.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1114","questionFrontendId":"1038","title":"Binary Search Tree to Greater Sum Tree","titleSlug":"binary-search-tree-to-greater-sum-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"147.3K\", \"totalSubmission\": \"172.3K\", \"totalAcceptedRaw\": 147316, \"totalSubmissionRaw\": 172257, \"acRate\": \"85.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1116","questionFrontendId":"1161","title":"Maximum Level Sum of a Binary Tree","titleSlug":"maximum-level-sum-of-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"125K\", \"totalSubmission\": \"189.6K\", \"totalAcceptedRaw\": 125050, \"totalSubmissionRaw\": 189556, \"acRate\": \"66.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1150","questionFrontendId":"1214","title":"Two Sum BSTs","titleSlug":"two-sum-bsts","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.8K\", \"totalSubmission\": \"58.8K\", \"totalAcceptedRaw\": 38839, \"totalSubmissionRaw\": 58760, \"acRate\": \"66.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1157","questionFrontendId":"1080","title":"Insufficient Nodes in Root to Leaf Paths","titleSlug":"insufficient-nodes-in-root-to-leaf-paths","translatedTitle":null,"stats":"{\"totalAccepted\": \"31K\", \"totalSubmission\": \"57.9K\", \"totalAcceptedRaw\": 30953, \"totalSubmissionRaw\": 57919, \"acRate\": \"53.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1177","questionFrontendId":"1245","title":"Tree Diameter","titleSlug":"tree-diameter","translatedTitle":null,"stats":"{\"totalAccepted\": \"30.1K\", \"totalSubmission\": \"48.9K\", \"totalAcceptedRaw\": 30079, \"totalSubmissionRaw\": 48889, \"acRate\": \"61.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1190","questionFrontendId":"1257","title":"Smallest Common Region","titleSlug":"smallest-common-region","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.5K\", \"totalSubmission\": \"30.3K\", \"totalAcceptedRaw\": 19481, \"totalSubmissionRaw\": 30285, \"acRate\": \"64.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1194","questionFrontendId":"1104","title":"Path In Zigzag Labelled Binary Tree","titleSlug":"path-in-zigzag-labelled-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.9K\", \"totalSubmission\": \"51.9K\", \"totalAcceptedRaw\": 38925, \"totalSubmissionRaw\": 51865, \"acRate\": \"75.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1201","questionFrontendId":"1273","title":"Delete Tree Nodes","titleSlug":"delete-tree-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.3K\", \"totalSubmission\": \"15.3K\", \"totalAcceptedRaw\": 9347, \"totalSubmissionRaw\": 15310, \"acRate\": \"61.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1207","questionFrontendId":"1110","title":"Delete Nodes And Return Forest","titleSlug":"delete-nodes-and-return-forest","translatedTitle":null,"stats":"{\"totalAccepted\": \"179.1K\", \"totalSubmission\": \"258.5K\", \"totalAcceptedRaw\": 179088, \"totalSubmissionRaw\": 258478, \"acRate\": \"69.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1218","questionFrontendId":"1123","title":"Lowest Common Ancestor of Deepest Leaves","titleSlug":"lowest-common-ancestor-of-deepest-leaves","translatedTitle":null,"stats":"{\"totalAccepted\": \"89.4K\", \"totalSubmission\": \"126.1K\", \"totalAcceptedRaw\": 89406, \"totalSubmissionRaw\": 126096, \"acRate\": \"70.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1243","questionFrontendId":"1315","title":"Sum of Nodes with Even-Valued Grandparent","titleSlug":"sum-of-nodes-with-even-valued-grandparent","translatedTitle":null,"stats":"{\"totalAccepted\": \"125.9K\", \"totalSubmission\": \"147.3K\", \"totalAcceptedRaw\": 125912, \"totalSubmissionRaw\": 147306, \"acRate\": \"85.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1248","questionFrontendId":"1145","title":"Binary Tree Coloring Game","titleSlug":"binary-tree-coloring-game","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.6K\", \"totalSubmission\": \"78.5K\", \"totalAcceptedRaw\": 40586, \"totalSubmissionRaw\": 78513, \"acRate\": \"51.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1254","questionFrontendId":"1302","title":"Deepest Leaves Sum","titleSlug":"deepest-leaves-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"267.8K\", \"totalSubmission\": \"309K\", \"totalAcceptedRaw\": 267793, \"totalSubmissionRaw\": 308959, \"acRate\": \"86.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1275","questionFrontendId":"1361","title":"Validate Binary Tree Nodes","titleSlug":"validate-binary-tree-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.3K\", \"totalSubmission\": \"106.1K\", \"totalAcceptedRaw\": 42324, \"totalSubmissionRaw\": 106126, \"acRate\": \"39.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1285","questionFrontendId":"1382","title":"Balance a Binary Search Tree","titleSlug":"balance-a-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"115K\", \"totalSubmission\": \"142.5K\", \"totalAcceptedRaw\": 115045, \"totalSubmissionRaw\": 142542, \"acRate\": \"80.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1296","questionFrontendId":"1483","title":"Kth Ancestor of a Tree Node","titleSlug":"kth-ancestor-of-a-tree-node","translatedTitle":null,"stats":"{\"totalAccepted\": \"26.4K\", \"totalSubmission\": \"78.3K\", \"totalAcceptedRaw\": 26449, \"totalSubmissionRaw\": 78345, \"acRate\": \"33.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1313","questionFrontendId":"1916","title":"Count Ways to Build Rooms in an Ant Colony","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"10.8K\", \"totalAcceptedRaw\": 5323, \"totalSubmissionRaw\": 10780, \"acRate\": \"49.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1387","questionFrontendId":"1261","title":"Find Elements in a Contaminated Binary Tree","titleSlug":"find-elements-in-a-contaminated-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"54.3K\", \"totalSubmission\": \"71.1K\", \"totalAcceptedRaw\": 54310, \"totalSubmissionRaw\": 71144, \"acRate\": \"76.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1427","questionFrontendId":"1305","title":"All Elements in Two Binary Search Trees","titleSlug":"all-elements-in-two-binary-search-trees","translatedTitle":null,"stats":"{\"totalAccepted\": \"186.3K\", \"totalSubmission\": \"233.3K\", \"totalAcceptedRaw\": 186257, \"totalSubmissionRaw\": 233322, \"acRate\": \"79.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1432","questionFrontendId":"1430","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.5K\", \"totalSubmission\": \"91.5K\", \"totalAcceptedRaw\": 42452, \"totalSubmissionRaw\": 91550, \"acRate\": \"46.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1450","questionFrontendId":"1325","title":"Delete Leaves With a Given Value","titleSlug":"delete-leaves-with-a-given-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"85.4K\", \"totalSubmission\": \"114.3K\", \"totalAcceptedRaw\": 85413, \"totalSubmissionRaw\": 114336, \"acRate\": \"74.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1465","questionFrontendId":"1339","title":"Maximum Product of Splitted Binary Tree","titleSlug":"maximum-product-of-splitted-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"113K\", \"totalSubmission\": \"236.4K\", \"totalAcceptedRaw\": 113015, \"totalSubmissionRaw\": 236363, \"acRate\": \"47.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1474","questionFrontendId":"1372","title":"Longest ZigZag Path in a Binary Tree","titleSlug":"longest-zigzag-path-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.7K\", \"totalSubmission\": \"75.9K\", \"totalAcceptedRaw\": 45666, \"totalSubmissionRaw\": 75875, \"acRate\": \"60.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1475","questionFrontendId":"1373","title":"Maximum Sum BST in Binary Tree","titleSlug":"maximum-sum-bst-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.9K\", \"totalSubmission\": \"124.1K\", \"totalAcceptedRaw\": 48929, \"totalSubmissionRaw\": 124062, \"acRate\": \"39.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1484","questionFrontendId":"1367","title":"Linked List in Binary Tree","titleSlug":"linked-list-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.9K\", \"totalSubmission\": \"146.3K\", \"totalAcceptedRaw\": 63913, \"totalSubmissionRaw\": 146330, \"acRate\": \"43.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1492","questionFrontendId":"1376","title":"Time Needed to Inform All Employees","titleSlug":"time-needed-to-inform-all-employees","translatedTitle":null,"stats":"{\"totalAccepted\": \"128K\", \"totalSubmission\": \"219.4K\", \"totalAcceptedRaw\": 127955, \"totalSubmissionRaw\": 219404, \"acRate\": \"58.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1493","questionFrontendId":"1377","title":"Frog Position After T Seconds","titleSlug":"frog-position-after-t-seconds","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"67.7K\", \"totalAcceptedRaw\": 24199, \"totalSubmissionRaw\": 67665, \"acRate\": \"35.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1498","questionFrontendId":"1379","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"187.2K\", \"totalSubmission\": \"215.8K\", \"totalAcceptedRaw\": 187180, \"totalSubmissionRaw\": 215833, \"acRate\": \"86.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1544","questionFrontendId":"1448","title":"Count Good Nodes in Binary Tree","titleSlug":"count-good-nodes-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"308.1K\", \"totalSubmission\": \"414.5K\", \"totalAcceptedRaw\": 308098, \"totalSubmissionRaw\": 414510, \"acRate\": \"74.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1554","questionFrontendId":"1443","title":"Minimum Time to Collect All Apples in a Tree","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"97.9K\", \"totalSubmission\": \"156K\", \"totalAcceptedRaw\": 97888, \"totalSubmissionRaw\": 155957, \"acRate\": \"62.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1568","questionFrontendId":"1457","title":"Pseudo-Palindromic Paths in a Binary Tree","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"113.3K\", \"totalSubmission\": \"167K\", \"totalAcceptedRaw\": 113277, \"totalSubmissionRaw\": 166963, \"acRate\": \"67.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1609","questionFrontendId":"1469","title":"Find All The Lonely Nodes","titleSlug":"find-all-the-lonely-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.2K\", \"totalSubmission\": \"52.5K\", \"totalAcceptedRaw\": 43154, \"totalSubmissionRaw\": 52539, \"acRate\": \"82.1%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1624","questionFrontendId":"1485","title":"Clone Binary Tree With Random Pointer","titleSlug":"clone-binary-tree-with-random-pointer","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.9K\", \"totalSubmission\": \"26.3K\", \"totalAcceptedRaw\": 20921, \"totalSubmissionRaw\": 26255, \"acRate\": \"79.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1634","questionFrontendId":"1490","title":"Clone N-ary Tree","titleSlug":"clone-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.7K\", \"totalSubmission\": \"29.6K\", \"totalAcceptedRaw\": 24675, \"totalSubmissionRaw\": 29562, \"acRate\": \"83.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1643","questionFrontendId":"1519","title":"Number of Nodes in the Sub-Tree With the Same Label","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label","translatedTitle":null,"stats":"{\"totalAccepted\": \"77.8K\", \"totalSubmission\": \"140.6K\", \"totalAcceptedRaw\": 77781, \"totalSubmissionRaw\": 140616, \"acRate\": \"55.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1650","questionFrontendId":"1506","title":"Find Root of N-Ary Tree","titleSlug":"find-root-of-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"29K\", \"totalSubmission\": \"36.9K\", \"totalAcceptedRaw\": 28988, \"totalSubmissionRaw\": 36911, \"acRate\": \"78.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1653","questionFrontendId":"1530","title":"Number of Good Leaf Nodes Pairs","titleSlug":"number-of-good-leaf-nodes-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"34K\", \"totalSubmission\": \"55.7K\", \"totalAcceptedRaw\": 33987, \"totalSubmissionRaw\": 55652, \"acRate\": \"61.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1655","questionFrontendId":"1516","title":"Move Sub-Tree of N-Ary Tree","titleSlug":"move-sub-tree-of-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"2K\", \"totalSubmission\": \"3.2K\", \"totalAcceptedRaw\": 2000, \"totalSubmissionRaw\": 3155, \"acRate\": \"63.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1665","questionFrontendId":"1522","title":"Diameter of N-Ary Tree","titleSlug":"diameter-of-n-ary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.8K\", \"totalSubmission\": \"51.4K\", \"totalAcceptedRaw\": 37787, \"totalSubmissionRaw\": 51414, \"acRate\": \"73.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1692","questionFrontendId":"1569","title":"Number of Ways to Reorder Array to Get Same BST","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"24.4K\", \"totalAcceptedRaw\": 11685, \"totalSubmissionRaw\": 24422, \"acRate\": \"47.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1722","questionFrontendId":"1600","title":"Throne Inheritance","titleSlug":"throne-inheritance","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.7K\", \"totalSubmission\": \"21.5K\", \"totalAcceptedRaw\": 13679, \"totalSubmissionRaw\": 21521, \"acRate\": \"63.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1729","questionFrontendId":"1586","title":"Binary Search Tree Iterator II","titleSlug":"binary-search-tree-iterator-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.5K\", \"totalSubmission\": \"17.7K\", \"totalAcceptedRaw\": 12533, \"totalSubmissionRaw\": 17689, \"acRate\": \"70.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"},{"name":"Iterator","translatedName":null,"slug":"iterator","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1731","questionFrontendId":"1609","title":"Even Odd Tree","titleSlug":"even-odd-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.6K\", \"totalSubmission\": \"78.6K\", \"totalAcceptedRaw\": 42644, \"totalSubmissionRaw\": 78588, \"acRate\": \"54.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1736","questionFrontendId":"1597","title":"Build Binary Expression Tree From Infix Expression","titleSlug":"build-binary-expression-tree-from-infix-expression","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.8K\", \"totalSubmission\": \"18.9K\", \"totalAcceptedRaw\": 11836, \"totalSubmissionRaw\": 18875, \"acRate\": \"62.7%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1740","questionFrontendId":"1617","title":"Count Subtrees With Max Distance Between Cities","titleSlug":"count-subtrees-with-max-distance-between-cities","translatedTitle":null,"stats":"{\"totalAccepted\": \"8K\", \"totalSubmission\": \"12.1K\", \"totalAcceptedRaw\": 7981, \"totalSubmissionRaw\": 12078, \"acRate\": \"66.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1745","questionFrontendId":"1602","title":"Find Nearest Right Node in Binary Tree","titleSlug":"find-nearest-right-node-in-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.1K\", \"totalSubmission\": \"27.9K\", \"totalAcceptedRaw\": 21108, \"totalSubmissionRaw\": 27938, \"acRate\": \"75.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1750","questionFrontendId":"1612","title":"Check If Two Expression Trees are Equivalent","titleSlug":"check-if-two-expression-trees-are-equivalent","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.2K\", \"totalSubmission\": \"8.8K\", \"totalAcceptedRaw\": 6189, \"totalSubmissionRaw\": 8810, \"acRate\": \"70.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1768","questionFrontendId":"1628","title":"Design an Expression Tree With Evaluate Function","titleSlug":"design-an-expression-tree-with-evaluate-function","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.1K\", \"totalSubmission\": \"29.1K\", \"totalAcceptedRaw\": 24080, \"totalSubmissionRaw\": 29074, \"acRate\": \"82.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1780","questionFrontendId":"1644","title":"Lowest Common Ancestor of a Binary Tree II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"56.5K\", \"totalSubmission\": \"94.2K\", \"totalAcceptedRaw\": 56460, \"totalSubmissionRaw\": 94230, \"acRate\": \"59.9%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1790","questionFrontendId":"1650","title":"Lowest Common Ancestor of a Binary Tree III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"157.4K\", \"totalSubmission\": \"203.4K\", \"totalAcceptedRaw\": 157431, \"totalSubmissionRaw\": 203380, \"acRate\": \"77.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1796","questionFrontendId":"1660","title":"Correct a Binary Tree","titleSlug":"correct-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"19.1K\", \"totalAcceptedRaw\": 13830, \"totalSubmissionRaw\": 19071, \"acRate\": \"72.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1810","questionFrontendId":"1666","title":"Change the Root of a Binary Tree","titleSlug":"change-the-root-of-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"4.5K\", \"totalAcceptedRaw\": 3314, \"totalSubmissionRaw\": 4535, \"acRate\": \"73.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1816","questionFrontendId":"1676","title":"Lowest Common Ancestor of a Binary Tree IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"28.3K\", \"totalSubmission\": \"35.6K\", \"totalAcceptedRaw\": 28293, \"totalSubmissionRaw\": 35601, \"acRate\": \"79.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1820","questionFrontendId":"1719","title":"Number Of Ways To Reconstruct A Tree","titleSlug":"number-of-ways-to-reconstruct-a-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.4K\", \"totalSubmission\": \"7.8K\", \"totalAcceptedRaw\": 3406, \"totalSubmissionRaw\": 7800, \"acRate\": \"43.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1875","questionFrontendId":"1766","title":"Tree of Coprimes","titleSlug":"tree-of-coprimes","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.3K\", \"totalSubmission\": \"18.5K\", \"totalAcceptedRaw\": 7275, \"totalSubmissionRaw\": 18502, \"acRate\": \"39.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1883","questionFrontendId":"1740","title":"Find Distance in a Binary Tree","titleSlug":"find-distance-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"18K\", \"totalSubmission\": \"26.1K\", \"totalAcceptedRaw\": 18041, \"totalSubmissionRaw\": 26093, \"acRate\": \"69.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2052","questionFrontendId":"1902","title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.8K\", \"totalSubmission\": \"4.1K\", \"totalAcceptedRaw\": 1819, \"totalSubmissionRaw\": 4089, \"acRate\": \"44.5%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2060","questionFrontendId":"1932","title":"Merge BSTs to Create Single BST","titleSlug":"merge-bsts-to-create-single-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"17.7K\", \"totalAcceptedRaw\": 6305, \"totalSubmissionRaw\": 17747, \"acRate\": \"35.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2104","questionFrontendId":"1993","title":"Operations on Tree","titleSlug":"operations-on-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.2K\", \"totalSubmission\": \"23.2K\", \"totalAcceptedRaw\": 10242, \"totalSubmissionRaw\": 23237, \"acRate\": \"44.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2126","questionFrontendId":"1973","title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.6K\", \"totalSubmission\": \"10.2K\", \"totalAcceptedRaw\": 7645, \"totalSubmissionRaw\": 10173, \"acRate\": \"75.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2131","questionFrontendId":"2003","title":"Smallest Missing Genetic Value in Each Subtree","titleSlug":"smallest-missing-genetic-value-in-each-subtree","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.4K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 6435, \"totalSubmissionRaw\": 14412, \"acRate\": \"44.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2153","questionFrontendId":"2005","title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"466\", \"totalSubmission\": \"734\", \"totalAcceptedRaw\": 466, \"totalSubmissionRaw\": 734, \"acRate\": \"63.5%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"},{"name":"Game Theory","translatedName":null,"slug":"game-theory","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2175","questionFrontendId":"2049","title":"Count Nodes With the Highest Score","titleSlug":"count-nodes-with-the-highest-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.1K\", \"totalSubmission\": \"33.9K\", \"totalAcceptedRaw\": 16121, \"totalSubmissionRaw\": 33853, \"acRate\": \"47.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2217","questionFrontendId":"2096","title":"Step-By-Step Directions From a Binary Tree Node to Another","titleSlug":"step-by-step-directions-from-a-binary-tree-node-to-another","translatedTitle":null,"stats":"{\"totalAccepted\": \"79.5K\", \"totalSubmission\": \"164.1K\", \"totalAcceptedRaw\": 79514, \"totalSubmissionRaw\": 164104, \"acRate\": \"48.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2306","questionFrontendId":"2196","title":"Create Binary Tree From Descriptions","titleSlug":"create-binary-tree-from-descriptions","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.7K\", \"totalSubmission\": \"35.5K\", \"totalAcceptedRaw\": 25701, \"totalSubmissionRaw\": 35531, \"acRate\": \"72.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2347","questionFrontendId":"2265","title":"Count Nodes Equal to Average of Subtree","titleSlug":"count-nodes-equal-to-average-of-subtree","translatedTitle":null,"stats":"{\"totalAccepted\": \"37.6K\", \"totalSubmission\": \"44.1K\", \"totalAcceptedRaw\": 37551, \"totalSubmissionRaw\": 44055, \"acRate\": \"85.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2364","questionFrontendId":"2246","title":"Longest Path With Different Adjacent Characters","titleSlug":"longest-path-with-different-adjacent-characters","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.1K\", \"totalSubmission\": \"116.7K\", \"totalAcceptedRaw\": 65147, \"totalSubmissionRaw\": 116672, \"acRate\": \"55.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2384","questionFrontendId":"2236","title":"Root Equals Sum of Children","titleSlug":"root-equals-sum-of-children","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.2K\", \"totalSubmission\": \"134.5K\", \"totalAcceptedRaw\": 114154, \"totalSubmissionRaw\": 134525, \"acRate\": \"84.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2399","questionFrontendId":"2313","title":"Minimum Flips in Binary Tree to Get Result","titleSlug":"minimum-flips-in-binary-tree-to-get-result","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1K\", \"totalSubmission\": \"1.7K\", \"totalAcceptedRaw\": 1056, \"totalSubmissionRaw\": 1661, \"acRate\": \"63.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2400","questionFrontendId":"2322","title":"Minimum Score After Removals on a Tree","titleSlug":"minimum-score-after-removals-on-a-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"10.6K\", \"totalAcceptedRaw\": 5358, \"totalSubmissionRaw\": 10554, \"acRate\": \"50.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2416","questionFrontendId":"2331","title":"Evaluate Boolean Binary Tree","titleSlug":"evaluate-boolean-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"43.3K\", \"totalSubmission\": \"55.2K\", \"totalAcceptedRaw\": 43317, \"totalSubmissionRaw\": 55158, \"acRate\": \"78.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2420","questionFrontendId":"2277","title":"Closest Node to Path in Tree","titleSlug":"closest-node-to-path-in-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.5K\", \"totalSubmission\": \"3.9K\", \"totalAcceptedRaw\": 2466, \"totalSubmissionRaw\": 3868, \"acRate\": \"63.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2445","questionFrontendId":"2368","title":"Reachable Nodes With Restrictions","titleSlug":"reachable-nodes-with-restrictions","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.2K\", \"totalSubmission\": \"54K\", \"totalAcceptedRaw\": 31231, \"totalSubmissionRaw\": 54027, \"acRate\": \"57.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2461","questionFrontendId":"2385","title":"Amount of Time for Binary Tree to Be Infected","titleSlug":"amount-of-time-for-binary-tree-to-be-infected","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.9K\", \"totalSubmission\": \"40.5K\", \"totalAcceptedRaw\": 22943, \"totalSubmissionRaw\": 40503, \"acRate\": \"56.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2493","questionFrontendId":"2415","title":"Reverse Odd Levels of Binary Tree","titleSlug":"reverse-odd-levels-of-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.6K\", \"totalSubmission\": \"41.1K\", \"totalAcceptedRaw\": 31554, \"totalSubmissionRaw\": 41145, \"acRate\": \"76.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2505","questionFrontendId":"2421","title":"Number of Good Paths","titleSlug":"number-of-good-paths","translatedTitle":null,"stats":"{\"totalAccepted\": \"47.8K\", \"totalSubmission\": \"82.9K\", \"totalAcceptedRaw\": 47759, \"totalSubmissionRaw\": 82944, \"acRate\": \"57.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2517","questionFrontendId":"2378","title":"Choose Edges to Maximize Score in a Tree","titleSlug":"choose-edges-to-maximize-score-in-a-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"860\", \"totalSubmission\": \"1.4K\", \"totalAcceptedRaw\": 860, \"totalSubmissionRaw\": 1426, \"acRate\": \"60.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2531","questionFrontendId":"2440","title":"Create Components With Same Value","titleSlug":"create-components-with-same-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.2K\", \"totalSubmission\": \"7.6K\", \"totalAcceptedRaw\": 4167, \"totalSubmissionRaw\": 7629, \"acRate\": \"54.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2545","questionFrontendId":"2458","title":"Height of Binary Tree After Subtree Removal Queries","titleSlug":"height-of-binary-tree-after-subtree-removal-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.4K\", \"totalSubmission\": \"22.6K\", \"totalAcceptedRaw\": 8376, \"totalSubmissionRaw\": 22614, \"acRate\": \"37.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2558","questionFrontendId":"2471","title":"Minimum Number of Operations to Sort a Binary Tree by Level","titleSlug":"minimum-number-of-operations-to-sort-a-binary-tree-by-level","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.2K\", \"totalSubmission\": \"24.4K\", \"totalAcceptedRaw\": 15187, \"totalSubmissionRaw\": 24373, \"acRate\": \"62.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2564","questionFrontendId":"2467","title":"Most Profitable Path in a Tree","titleSlug":"most-profitable-path-in-a-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"14.3K\", \"totalAcceptedRaw\": 6893, \"totalSubmissionRaw\": 14272, \"acRate\": \"48.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2567","questionFrontendId":"2476","title":"Closest Nodes Queries in a Binary Search Tree","titleSlug":"closest-nodes-queries-in-a-binary-search-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.7K\", \"totalSubmission\": \"36.2K\", \"totalAcceptedRaw\": 14732, \"totalSubmissionRaw\": 36204, \"acRate\": \"40.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2568","questionFrontendId":"2477","title":"Minimum Fuel Cost to Report to the Capital","titleSlug":"minimum-fuel-cost-to-report-to-the-capital","translatedTitle":null,"stats":"{\"totalAccepted\": \"53.5K\", \"totalSubmission\": \"78.9K\", \"totalAcceptedRaw\": 53461, \"totalSubmissionRaw\": 78854, \"acRate\": \"67.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2584","questionFrontendId":"2445","title":"Number of Nodes With Value One","titleSlug":"number-of-nodes-with-value-one","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2K\", \"totalSubmission\": \"1.7K\", \"totalAcceptedRaw\": 1204, \"totalSubmissionRaw\": 1702, \"acRate\": \"70.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2597","questionFrontendId":"2509","title":"Cycle Length Queries in a Tree","titleSlug":"cycle-length-queries-in-a-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.3K\", \"totalSubmission\": \"14.6K\", \"totalAcceptedRaw\": 8299, \"totalSubmissionRaw\": 14550, \"acRate\": \"57.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2623","questionFrontendId":"2479","title":"Maximum XOR of Two Non-Overlapping Subtrees","titleSlug":"maximum-xor-of-two-non-overlapping-subtrees","translatedTitle":null,"stats":"{\"totalAccepted\": \"360\", \"totalSubmission\": \"768\", \"totalAcceptedRaw\": 360, \"totalSubmissionRaw\": 768, \"acRate\": \"46.9%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2627","questionFrontendId":"2538","title":"Difference Between Maximum and Minimum Price Sum","titleSlug":"difference-between-maximum-and-minimum-price-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.9K\", \"totalSubmission\": \"14.1K\", \"totalAcceptedRaw\": 4922, \"totalSubmissionRaw\": 14131, \"acRate\": \"34.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2646","questionFrontendId":"2583","title":"Kth Largest Sum in a Binary Tree","titleSlug":"kth-largest-sum-in-a-binary-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.7K\", \"totalSubmission\": \"37.9K\", \"totalAcceptedRaw\": 17651, \"totalSubmissionRaw\": 37902, \"acRate\": \"46.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2652","questionFrontendId":"2581","title":"Count Number of Possible Root Nodes","titleSlug":"count-number-of-possible-root-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"3K\", \"totalSubmission\": \"6.4K\", \"totalAcceptedRaw\": 3010, \"totalSubmissionRaw\": 6358, \"acRate\": \"47.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/tmp/two-pointers-graphql.json b/tmp/two-pointers-graphql.json
new file mode 100644
index 000000000..b75effc87
--- /dev/null
+++ b/tmp/two-pointers-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","questions":[{"status":null,"questionId":"11","questionFrontendId":"11","title":"Container With Most Water","titleSlug":"container-with-most-water","translatedTitle":null,"stats":"{\"totalAccepted\": \"2M\", \"totalSubmission\": \"3.7M\", \"totalAcceptedRaw\": 2009027, \"totalSubmissionRaw\": 3718468, \"acRate\": \"54.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"15","questionFrontendId":"15","title":"3Sum","titleSlug":"3sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.6M\", \"totalSubmission\": \"7.8M\", \"totalAcceptedRaw\": 2554405, \"totalSubmissionRaw\": 7849967, \"acRate\": \"32.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"16","questionFrontendId":"16","title":"3Sum Closest","titleSlug":"3sum-closest","translatedTitle":null,"stats":"{\"totalAccepted\": \"1M\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 1004216, \"totalSubmissionRaw\": 2192777, \"acRate\": \"45.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"18","questionFrontendId":"18","title":"4Sum","titleSlug":"4sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"715.9K\", \"totalSubmission\": \"2M\", \"totalAcceptedRaw\": 715871, \"totalSubmissionRaw\": 1990148, \"acRate\": \"36.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"19","questionFrontendId":"19","title":"Remove Nth Node From End of List","titleSlug":"remove-nth-node-from-end-of-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.9M\", \"totalSubmission\": \"4.7M\", \"totalAcceptedRaw\": 1939250, \"totalSubmissionRaw\": 4740229, \"acRate\": \"40.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"26","questionFrontendId":"26","title":"Remove Duplicates from Sorted Array","titleSlug":"remove-duplicates-from-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.8M\", \"totalSubmission\": \"5.5M\", \"totalAcceptedRaw\": 2848548, \"totalSubmissionRaw\": 5536166, \"acRate\": \"51.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"27","questionFrontendId":"27","title":"Remove Element","titleSlug":"remove-element","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.7M\", \"totalSubmission\": \"3.2M\", \"totalAcceptedRaw\": 1706899, \"totalSubmissionRaw\": 3226735, \"acRate\": \"52.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"28","questionFrontendId":"28","title":"Find the Index of the First Occurrence in a String","titleSlug":"find-the-index-of-the-first-occurrence-in-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.6M\", \"totalSubmission\": \"4.2M\", \"totalAcceptedRaw\": 1638169, \"totalSubmissionRaw\": 4210561, \"acRate\": \"38.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"31","questionFrontendId":"31","title":"Next Permutation","titleSlug":"next-permutation","translatedTitle":null,"stats":"{\"totalAccepted\": \"1M\", \"totalSubmission\": \"2.7M\", \"totalAcceptedRaw\": 1005065, \"totalSubmissionRaw\": 2681663, \"acRate\": \"37.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"42","questionFrontendId":"42","title":"Trapping Rain Water","titleSlug":"trapping-rain-water","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.5M\", \"totalSubmission\": \"2.5M\", \"totalAcceptedRaw\": 1475865, \"totalSubmissionRaw\": 2493706, \"acRate\": \"59.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"61","questionFrontendId":"61","title":"Rotate List","titleSlug":"rotate-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"697.6K\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 697553, \"totalSubmissionRaw\": 1935129, \"acRate\": \"36.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"75","questionFrontendId":"75","title":"Sort Colors","titleSlug":"sort-colors","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 1365670, \"totalSubmissionRaw\": 2339162, \"acRate\": \"58.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"80","questionFrontendId":"80","title":"Remove Duplicates from Sorted Array II","titleSlug":"remove-duplicates-from-sorted-array-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"492.5K\", \"totalSubmission\": \"943.4K\", \"totalAcceptedRaw\": 492467, \"totalSubmissionRaw\": 943351, \"acRate\": \"52.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"82","questionFrontendId":"82","title":"Remove Duplicates from Sorted List II","titleSlug":"remove-duplicates-from-sorted-list-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"585.6K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 585603, \"totalSubmissionRaw\": 1276983, \"acRate\": \"45.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"86","questionFrontendId":"86","title":"Partition List","titleSlug":"partition-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"441.2K\", \"totalSubmission\": \"849.9K\", \"totalAcceptedRaw\": 441207, \"totalSubmissionRaw\": 849915, \"acRate\": \"51.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"88","questionFrontendId":"88","title":"Merge Sorted Array","titleSlug":"merge-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.9M\", \"totalSubmission\": \"4.1M\", \"totalAcceptedRaw\": 1924442, \"totalSubmissionRaw\": 4139391, \"acRate\": \"46.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"125","questionFrontendId":"125","title":"Valid Palindrome","titleSlug":"valid-palindrome","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.8M\", \"totalSubmission\": \"4.1M\", \"totalAcceptedRaw\": 1837406, \"totalSubmissionRaw\": 4148477, \"acRate\": \"44.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"141","questionFrontendId":"141","title":"Linked List Cycle","titleSlug":"linked-list-cycle","translatedTitle":null,"stats":"{\"totalAccepted\": \"2M\", \"totalSubmission\": \"4.1M\", \"totalAcceptedRaw\": 1966418, \"totalSubmissionRaw\": 4148573, \"acRate\": \"47.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"142","questionFrontendId":"142","title":"Linked List Cycle II","titleSlug":"linked-list-cycle-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"1M\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 1020051, \"totalSubmissionRaw\": 2099589, \"acRate\": \"48.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"143","questionFrontendId":"143","title":"Reorder List","titleSlug":"reorder-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"645.1K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 645075, \"totalSubmissionRaw\": 1232075, \"acRate\": \"52.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"148","questionFrontendId":"148","title":"Sort List","titleSlug":"sort-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"611.2K\", \"totalSubmission\": \"1.1M\", \"totalAcceptedRaw\": 611213, \"totalSubmissionRaw\": 1110991, \"acRate\": \"55.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Merge Sort","translatedName":null,"slug":"merge-sort","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"151","questionFrontendId":"151","title":"Reverse Words in a String","titleSlug":"reverse-words-in-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"897.2K\", \"totalSubmission\": \"2.7M\", \"totalAcceptedRaw\": 897213, \"totalSubmissionRaw\": 2749728, \"acRate\": \"32.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"160","questionFrontendId":"160","title":"Intersection of Two Linked Lists","titleSlug":"intersection-of-two-linked-lists","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 1232521, \"totalSubmissionRaw\": 2273657, \"acRate\": \"54.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"161","questionFrontendId":"161","title":"One Edit Distance","titleSlug":"one-edit-distance","translatedTitle":null,"stats":"{\"totalAccepted\": \"187K\", \"totalSubmission\": \"547.8K\", \"totalAcceptedRaw\": 186958, \"totalSubmissionRaw\": 547829, \"acRate\": \"34.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"165","questionFrontendId":"165","title":"Compare Version Numbers","titleSlug":"compare-version-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"345.7K\", \"totalSubmission\": \"969K\", \"totalAcceptedRaw\": 345661, \"totalSubmissionRaw\": 968959, \"acRate\": \"35.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"167","questionFrontendId":"167","title":"Two Sum II - Input Array Is Sorted","titleSlug":"two-sum-ii-input-array-is-sorted","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.3M\", \"totalAcceptedRaw\": 1398154, \"totalSubmissionRaw\": 2329074, \"acRate\": \"60.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"170","questionFrontendId":"170","title":"Two Sum III - Data structure design","titleSlug":"two-sum-iii-data-structure-design","translatedTitle":null,"stats":"{\"totalAccepted\": \"139.9K\", \"totalSubmission\": \"374.1K\", \"totalAcceptedRaw\": 139886, \"totalSubmissionRaw\": 374090, \"acRate\": \"37.4%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"186","questionFrontendId":"186","title":"Reverse Words in a String II","titleSlug":"reverse-words-in-a-string-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"146.4K\", \"totalSubmission\": \"277.1K\", \"totalAcceptedRaw\": 146411, \"totalSubmissionRaw\": 277137, \"acRate\": \"52.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"189","questionFrontendId":"189","title":"Rotate Array","titleSlug":"rotate-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"3.6M\", \"totalAcceptedRaw\": 1436124, \"totalSubmissionRaw\": 3648270, \"acRate\": \"39.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"202","questionFrontendId":"202","title":"Happy Number","titleSlug":"happy-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"2M\", \"totalAcceptedRaw\": 1103717, \"totalSubmissionRaw\": 2015361, \"acRate\": \"54.8%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"234","questionFrontendId":"234","title":"Palindrome Linked List","titleSlug":"palindrome-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"2.8M\", \"totalAcceptedRaw\": 1393619, \"totalSubmissionRaw\": 2779640, \"acRate\": \"50.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"244","questionFrontendId":"244","title":"Shortest Word Distance II","titleSlug":"shortest-word-distance-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"146.1K\", \"totalSubmission\": \"240.2K\", \"totalAcceptedRaw\": 146141, \"totalSubmissionRaw\": 240211, \"acRate\": \"60.8%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"246","questionFrontendId":"246","title":"Strobogrammatic Number","titleSlug":"strobogrammatic-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"158.3K\", \"totalSubmission\": \"331.7K\", \"totalAcceptedRaw\": 158338, \"totalSubmissionRaw\": 331655, \"acRate\": \"47.7%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"251","questionFrontendId":"251","title":"Flatten 2D Vector","titleSlug":"flatten-2d-vector","translatedTitle":null,"stats":"{\"totalAccepted\": \"118.5K\", \"totalSubmission\": \"241.2K\", \"totalAcceptedRaw\": 118485, \"totalSubmissionRaw\": 241220, \"acRate\": \"49.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Iterator","translatedName":null,"slug":"iterator","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"253","questionFrontendId":"253","title":"Meeting Rooms II","titleSlug":"meeting-rooms-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"767K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 767005, \"totalSubmissionRaw\": 1517236, \"acRate\": \"50.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"259","questionFrontendId":"259","title":"3Sum Smaller","titleSlug":"3sum-smaller","translatedTitle":null,"stats":"{\"totalAccepted\": \"133.4K\", \"totalSubmission\": \"263.2K\", \"totalAcceptedRaw\": 133353, \"totalSubmissionRaw\": 263193, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"272","questionFrontendId":"272","title":"Closest Binary Search Tree Value II","titleSlug":"closest-binary-search-tree-value-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"110K\", \"totalSubmission\": \"188.3K\", \"totalAcceptedRaw\": 109964, \"totalSubmissionRaw\": 188323, \"acRate\": \"58.4%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"277","questionFrontendId":"277","title":"Find the Celebrity","titleSlug":"find-the-celebrity","translatedTitle":null,"stats":"{\"totalAccepted\": \"245.7K\", \"totalSubmission\": \"527K\", \"totalAcceptedRaw\": 245687, \"totalSubmissionRaw\": 527038, \"acRate\": \"46.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"283","questionFrontendId":"283","title":"Move Zeroes","titleSlug":"move-zeroes","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.1M\", \"totalSubmission\": \"3.5M\", \"totalAcceptedRaw\": 2146846, \"totalSubmissionRaw\": 3496472, \"acRate\": \"61.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"287","questionFrontendId":"287","title":"Find the Duplicate Number","titleSlug":"find-the-duplicate-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 1130742, \"totalSubmissionRaw\": 1913383, \"acRate\": \"59.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"295","questionFrontendId":"295","title":"Find Median from Data Stream","titleSlug":"find-median-from-data-stream","translatedTitle":null,"stats":"{\"totalAccepted\": \"616.5K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 616522, \"totalSubmissionRaw\": 1198271, \"acRate\": \"51.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Data Stream","translatedName":null,"slug":"data-stream","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"344","questionFrontendId":"344","title":"Reverse String","titleSlug":"reverse-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"2M\", \"totalSubmission\": \"2.6M\", \"totalAcceptedRaw\": 2022579, \"totalSubmissionRaw\": 2637990, \"acRate\": \"76.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"345","questionFrontendId":"345","title":"Reverse Vowels of a String","titleSlug":"reverse-vowels-of-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"486.4K\", \"totalSubmission\": \"971.8K\", \"totalAcceptedRaw\": 486374, \"totalSubmissionRaw\": 971803, \"acRate\": \"50.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"349","questionFrontendId":"349","title":"Intersection of Two Arrays","titleSlug":"intersection-of-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"824.6K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 824619, \"totalSubmissionRaw\": 1163783, \"acRate\": \"70.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"350","questionFrontendId":"350","title":"Intersection of Two Arrays II","titleSlug":"intersection-of-two-arrays-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"1M\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 1026502, \"totalSubmissionRaw\": 1835394, \"acRate\": \"55.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"360","questionFrontendId":"360","title":"Sort Transformed Array","titleSlug":"sort-transformed-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"61.6K\", \"totalSubmission\": \"112.1K\", \"totalAcceptedRaw\": 61611, \"totalSubmissionRaw\": 112063, \"acRate\": \"55.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"392","questionFrontendId":"392","title":"Is Subsequence","titleSlug":"is-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"791.5K\", \"totalSubmission\": \"1.7M\", \"totalAcceptedRaw\": 791508, \"totalSubmissionRaw\": 1658595, \"acRate\": \"47.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"408","questionFrontendId":"408","title":"Valid Word Abbreviation","titleSlug":"valid-word-abbreviation","translatedTitle":null,"stats":"{\"totalAccepted\": \"117.7K\", \"totalSubmission\": \"338K\", \"totalAcceptedRaw\": 117710, \"totalSubmissionRaw\": 337994, \"acRate\": \"34.8%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"443","questionFrontendId":"443","title":"String Compression","titleSlug":"string-compression","translatedTitle":null,"stats":"{\"totalAccepted\": \"368.5K\", \"totalSubmission\": \"706.8K\", \"totalAcceptedRaw\": 368457, \"totalSubmissionRaw\": 706751, \"acRate\": \"52.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"455","questionFrontendId":"455","title":"Assign Cookies","titleSlug":"assign-cookies","translatedTitle":null,"stats":"{\"totalAccepted\": \"213.8K\", \"totalSubmission\": \"427.6K\", \"totalAcceptedRaw\": 213795, \"totalSubmissionRaw\": 427567, \"acRate\": \"50.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"457","questionFrontendId":"457","title":"Circular Array Loop","titleSlug":"circular-array-loop","translatedTitle":null,"stats":"{\"totalAccepted\": \"68.6K\", \"totalSubmission\": \"210.5K\", \"totalAcceptedRaw\": 68568, \"totalSubmissionRaw\": 210471, \"acRate\": \"32.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"475","questionFrontendId":"475","title":"Heaters","titleSlug":"heaters","translatedTitle":null,"stats":"{\"totalAccepted\": \"100.1K\", \"totalSubmission\": \"274.8K\", \"totalAcceptedRaw\": 100072, \"totalSubmissionRaw\": 274829, \"acRate\": \"36.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"481","questionFrontendId":"481","title":"Magical String","titleSlug":"magical-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.5K\", \"totalSubmission\": \"62.1K\", \"totalAcceptedRaw\": 31473, \"totalSubmissionRaw\": 62063, \"acRate\": \"50.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"522","questionFrontendId":"522","title":"Longest Uncommon Subsequence II","titleSlug":"longest-uncommon-subsequence-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.8K\", \"totalSubmission\": \"115.7K\", \"totalAcceptedRaw\": 46844, \"totalSubmissionRaw\": 115706, \"acRate\": \"40.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"524","questionFrontendId":"524","title":"Longest Word in Dictionary through Deleting","titleSlug":"longest-word-in-dictionary-through-deleting","translatedTitle":null,"stats":"{\"totalAccepted\": \"140K\", \"totalSubmission\": \"274.4K\", \"totalAcceptedRaw\": 140046, \"totalSubmissionRaw\": 274393, \"acRate\": \"51.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"528","questionFrontendId":"1721","title":"Swapping Nodes in a Linked List","titleSlug":"swapping-nodes-in-a-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"205K\", \"totalSubmission\": \"305.1K\", \"totalAcceptedRaw\": 205032, \"totalSubmissionRaw\": 305077, \"acRate\": \"67.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"532","questionFrontendId":"532","title":"K-diff Pairs in an Array","titleSlug":"k-diff-pairs-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"287.7K\", \"totalSubmission\": \"699.9K\", \"totalAcceptedRaw\": 287711, \"totalSubmissionRaw\": 699894, \"acRate\": \"41.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"541","questionFrontendId":"541","title":"Reverse String II","titleSlug":"reverse-string-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"191.1K\", \"totalSubmission\": \"378.6K\", \"totalAcceptedRaw\": 191096, \"totalSubmissionRaw\": 378602, \"acRate\": \"50.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"556","questionFrontendId":"556","title":"Next Greater Element III","titleSlug":"next-greater-element-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"124.2K\", \"totalSubmission\": \"365.1K\", \"totalAcceptedRaw\": 124200, \"totalSubmissionRaw\": 365078, \"acRate\": \"34.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"557","questionFrontendId":"557","title":"Reverse Words in a String III","titleSlug":"reverse-words-in-a-string-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"668.7K\", \"totalSubmission\": \"816.7K\", \"totalAcceptedRaw\": 668707, \"totalSubmissionRaw\": 816698, \"acRate\": \"81.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"567","questionFrontendId":"567","title":"Permutation in String","titleSlug":"permutation-in-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"624.7K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 624728, \"totalSubmissionRaw\": 1408151, \"acRate\": \"44.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"581","questionFrontendId":"581","title":"Shortest Unsorted Continuous Subarray","titleSlug":"shortest-unsorted-continuous-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"298.7K\", \"totalSubmission\": \"820.3K\", \"totalAcceptedRaw\": 298714, \"totalSubmissionRaw\": 820281, \"acRate\": \"36.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"611","questionFrontendId":"611","title":"Valid Triangle Number","titleSlug":"valid-triangle-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"165.9K\", \"totalSubmission\": \"328.4K\", \"totalAcceptedRaw\": 165878, \"totalSubmissionRaw\": 328376, \"acRate\": \"50.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"633","questionFrontendId":"633","title":"Sum of Square Numbers","titleSlug":"sum-of-square-numbers","translatedTitle":null,"stats":"{\"totalAccepted\": \"166.6K\", \"totalSubmission\": \"484.1K\", \"totalAcceptedRaw\": 166561, \"totalSubmissionRaw\": 484130, \"acRate\": \"34.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"653","questionFrontendId":"653","title":"Two Sum IV - Input is a BST","titleSlug":"two-sum-iv-input-is-a-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"445.1K\", \"totalSubmission\": \"729.2K\", \"totalAcceptedRaw\": 445113, \"totalSubmissionRaw\": 729202, \"acRate\": \"61.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"658","questionFrontendId":"658","title":"Find K Closest Elements","titleSlug":"find-k-closest-elements","translatedTitle":null,"stats":"{\"totalAccepted\": \"421.4K\", \"totalSubmission\": \"900.2K\", \"totalAcceptedRaw\": 421412, \"totalSubmissionRaw\": 900220, \"acRate\": \"46.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sliding Window","translatedName":null,"slug":"sliding-window","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"680","questionFrontendId":"680","title":"Valid Palindrome II","titleSlug":"valid-palindrome-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"582.4K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 582437, \"totalSubmissionRaw\": 1480464, \"acRate\": \"39.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"696","questionFrontendId":"696","title":"Count Binary Substrings","titleSlug":"count-binary-substrings","translatedTitle":null,"stats":"{\"totalAccepted\": \"182K\", \"totalSubmission\": \"277.7K\", \"totalAcceptedRaw\": 182030, \"totalSubmissionRaw\": 277684, \"acRate\": \"65.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"719","questionFrontendId":"719","title":"Find K-th Smallest Pair Distance","titleSlug":"find-k-th-smallest-pair-distance","translatedTitle":null,"stats":"{\"totalAccepted\": \"74.1K\", \"totalSubmission\": \"201.8K\", \"totalAcceptedRaw\": 74084, \"totalSubmissionRaw\": 201821, \"acRate\": \"36.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"723","questionFrontendId":"723","title":"Candy Crush","titleSlug":"candy-crush","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.2K\", \"totalSubmission\": \"82.5K\", \"totalAcceptedRaw\": 63210, \"totalSubmissionRaw\": 82506, \"acRate\": \"76.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"768","questionFrontendId":"763","title":"Partition Labels","titleSlug":"partition-labels","translatedTitle":null,"stats":"{\"totalAccepted\": \"456.9K\", \"totalSubmission\": \"572.9K\", \"totalAcceptedRaw\": 456930, \"totalSubmissionRaw\": 572908, \"acRate\": \"79.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"793","questionFrontendId":"777","title":"Swap Adjacent in LR String","titleSlug":"swap-adjacent-in-lr-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"68.9K\", \"totalSubmission\": \"187K\", \"totalAcceptedRaw\": 68906, \"totalSubmissionRaw\": 187031, \"acRate\": \"36.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"811","questionFrontendId":"795","title":"Number of Subarrays with Bounded Maximum","titleSlug":"number-of-subarrays-with-bounded-maximum","translatedTitle":null,"stats":"{\"totalAccepted\": \"60.3K\", \"totalSubmission\": \"114.2K\", \"totalAcceptedRaw\": 60269, \"totalSubmissionRaw\": 114160, \"acRate\": \"52.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"827","questionFrontendId":"809","title":"Expressive Words","titleSlug":"expressive-words","translatedTitle":null,"stats":"{\"totalAccepted\": \"106.8K\", \"totalSubmission\": \"231.1K\", \"totalAcceptedRaw\": 106800, \"totalSubmissionRaw\": 231052, \"acRate\": \"46.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"841","questionFrontendId":"821","title":"Shortest Distance to a Character","titleSlug":"shortest-distance-to-a-character","translatedTitle":null,"stats":"{\"totalAccepted\": \"155.2K\", \"totalSubmission\": \"217.6K\", \"totalAcceptedRaw\": 155206, \"totalSubmissionRaw\": 217571, \"acRate\": \"71.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"852","questionFrontendId":"825","title":"Friends Of Appropriate Ages","titleSlug":"friends-of-appropriate-ages","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.7K\", \"totalSubmission\": \"152.6K\", \"totalAcceptedRaw\": 70689, \"totalSubmissionRaw\": 152584, \"acRate\": \"46.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"853","questionFrontendId":"826","title":"Most Profit Assigning Work","titleSlug":"most-profit-assigning-work","translatedTitle":null,"stats":"{\"totalAccepted\": \"52.8K\", \"totalSubmission\": \"117.8K\", \"totalAcceptedRaw\": 52810, \"totalSubmissionRaw\": 117798, \"acRate\": \"44.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"861","questionFrontendId":"832","title":"Flipping an Image","titleSlug":"flipping-an-image","translatedTitle":null,"stats":"{\"totalAccepted\": \"352.4K\", \"totalSubmission\": \"436.4K\", \"totalAcceptedRaw\": 352387, \"totalSubmissionRaw\": 436417, \"acRate\": \"80.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"868","questionFrontendId":"838","title":"Push Dominoes","titleSlug":"push-dominoes","translatedTitle":null,"stats":"{\"totalAccepted\": \"111.6K\", \"totalSubmission\": \"195.9K\", \"totalAcceptedRaw\": 111586, \"totalSubmissionRaw\": 195868, \"acRate\": \"57.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"874","questionFrontendId":"844","title":"Backspace String Compare","titleSlug":"backspace-string-compare","translatedTitle":null,"stats":"{\"totalAccepted\": \"614.2K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 614158, \"totalSubmissionRaw\": 1278182, \"acRate\": \"48.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"875","questionFrontendId":"845","title":"Longest Mountain in Array","titleSlug":"longest-mountain-in-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"108.4K\", \"totalSubmission\": \"269.6K\", \"totalAcceptedRaw\": 108405, \"totalSubmissionRaw\": 269596, \"acRate\": \"40.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"901","questionFrontendId":"870","title":"Advantage Shuffle","titleSlug":"advantage-shuffle","translatedTitle":null,"stats":"{\"totalAccepted\": \"59.8K\", \"totalSubmission\": \"115.3K\", \"totalAcceptedRaw\": 59785, \"totalSubmissionRaw\": 115308, \"acRate\": \"51.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"908","questionFrontendId":"876","title":"Middle of the Linked List","titleSlug":"middle-of-the-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2M\", \"totalSubmission\": \"1.7M\", \"totalAcceptedRaw\": 1247484, \"totalSubmissionRaw\": 1652734, \"acRate\": \"75.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"917","questionFrontendId":"881","title":"Boats to Save People","titleSlug":"boats-to-save-people","translatedTitle":null,"stats":"{\"totalAccepted\": \"173.4K\", \"totalSubmission\": \"326.8K\", \"totalAcceptedRaw\": 173407, \"totalSubmissionRaw\": 326835, \"acRate\": \"53.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"941","questionFrontendId":"905","title":"Sort Array By Parity","titleSlug":"sort-array-by-parity","translatedTitle":null,"stats":"{\"totalAccepted\": \"588.7K\", \"totalSubmission\": \"778.7K\", \"totalAcceptedRaw\": 588664, \"totalSubmissionRaw\": 778692, \"acRate\": \"75.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"953","questionFrontendId":"917","title":"Reverse Only Letters","titleSlug":"reverse-only-letters","translatedTitle":null,"stats":"{\"totalAccepted\": \"159.1K\", \"totalSubmission\": \"256.8K\", \"totalAcceptedRaw\": 159081, \"totalSubmissionRaw\": 256808, \"acRate\": \"61.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"958","questionFrontendId":"922","title":"Sort Array By Parity II","titleSlug":"sort-array-by-parity-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"213.8K\", \"totalSubmission\": \"302.6K\", \"totalAcceptedRaw\": 213847, \"totalSubmissionRaw\": 302555, \"acRate\": \"70.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"959","questionFrontendId":"923","title":"3Sum With Multiplicity","titleSlug":"3sum-with-multiplicity","translatedTitle":null,"stats":"{\"totalAccepted\": \"95.4K\", \"totalSubmission\": \"210.5K\", \"totalAcceptedRaw\": 95352, \"totalSubmissionRaw\": 210469, \"acRate\": \"45.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"961","questionFrontendId":"925","title":"Long Pressed Name","titleSlug":"long-pressed-name","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.8K\", \"totalSubmission\": \"346.2K\", \"totalAcceptedRaw\": 114808, \"totalSubmissionRaw\": 346195, \"acRate\": \"33.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"979","questionFrontendId":"942","title":"DI String Match","titleSlug":"di-string-match","translatedTitle":null,"stats":"{\"totalAccepted\": \"128.6K\", \"totalSubmission\": \"166.4K\", \"totalAcceptedRaw\": 128585, \"totalSubmissionRaw\": 166435, \"acRate\": \"77.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"985","questionFrontendId":"948","title":"Bag of Tokens","titleSlug":"bag-of-tokens","translatedTitle":null,"stats":"{\"totalAccepted\": \"100.2K\", \"totalSubmission\": \"192.4K\", \"totalAcceptedRaw\": 100213, \"totalSubmissionRaw\": 192421, \"acRate\": \"52.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1009","questionFrontendId":"969","title":"Pancake Sorting","titleSlug":"pancake-sorting","translatedTitle":null,"stats":"{\"totalAccepted\": \"82.7K\", \"totalSubmission\": \"118K\", \"totalAcceptedRaw\": 82721, \"totalSubmissionRaw\": 118018, \"acRate\": \"70.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1019","questionFrontendId":"977","title":"Squares of a Sorted Array","titleSlug":"squares-of-a-sorted-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.4M\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 1359168, \"totalSubmissionRaw\": 1890450, \"acRate\": \"71.9%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1028","questionFrontendId":"986","title":"Interval List Intersections","titleSlug":"interval-list-intersections","translatedTitle":null,"stats":"{\"totalAccepted\": \"349.2K\", \"totalSubmission\": \"489.5K\", \"totalAcceptedRaw\": 349189, \"totalSubmissionRaw\": 489459, \"acRate\": \"71.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1051","questionFrontendId":"1055","title":"Shortest Way to Form String","titleSlug":"shortest-way-to-form-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.2K\", \"totalSubmission\": \"131K\", \"totalAcceptedRaw\": 78202, \"totalSubmissionRaw\": 130990, \"acRate\": \"59.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1080","questionFrontendId":"1023","title":"Camelcase Matching","titleSlug":"camelcase-matching","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.6K\", \"totalSubmission\": \"63.8K\", \"totalAcceptedRaw\": 38623, \"totalSubmissionRaw\": 63767, \"acRate\": \"60.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Trie","translatedName":null,"slug":"trie","__typename":"TopicTagNode"},{"name":"String Matching","translatedName":null,"slug":"string-matching","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1083","questionFrontendId":"1099","title":"Two Sum Less Than K","titleSlug":"two-sum-less-than-k","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.6K\", \"totalSubmission\": \"187.8K\", \"totalAcceptedRaw\": 114602, \"totalSubmissionRaw\": 187804, \"acRate\": \"61.0%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1113","questionFrontendId":"1040","title":"Moving Stones Until Consecutive II","titleSlug":"moving-stones-until-consecutive-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"15.4K\", \"totalAcceptedRaw\": 8595, \"totalSubmissionRaw\": 15395, \"acRate\": \"55.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1129","questionFrontendId":"1048","title":"Longest String Chain","titleSlug":"longest-string-chain","translatedTitle":null,"stats":"{\"totalAccepted\": \"302.1K\", \"totalSubmission\": \"509.9K\", \"totalAcceptedRaw\": 302070, \"totalSubmissionRaw\": 509934, \"acRate\": \"59.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1133","questionFrontendId":"1163","title":"Last Substring in Lexicographical Order","titleSlug":"last-substring-in-lexicographical-order","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.5K\", \"totalSubmission\": \"90.6K\", \"totalAcceptedRaw\": 31518, \"totalSubmissionRaw\": 90644, \"acRate\": \"34.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1150","questionFrontendId":"1214","title":"Two Sum BSTs","titleSlug":"two-sum-bsts","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.8K\", \"totalSubmission\": \"58.8K\", \"totalAcceptedRaw\": 38839, \"totalSubmissionRaw\": 58760, \"acRate\": \"66.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1165","questionFrontendId":"1229","title":"Meeting Scheduler","titleSlug":"meeting-scheduler","translatedTitle":null,"stats":"{\"totalAccepted\": \"70.8K\", \"totalSubmission\": \"128.2K\", \"totalAcceptedRaw\": 70827, \"totalSubmissionRaw\": 128196, \"acRate\": \"55.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1168","questionFrontendId":"1089","title":"Duplicate Zeros","titleSlug":"duplicate-zeros","translatedTitle":null,"stats":"{\"totalAccepted\": \"339.7K\", \"totalSubmission\": \"659.5K\", \"totalAcceptedRaw\": 339683, \"totalSubmissionRaw\": 659470, \"acRate\": \"51.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1251","questionFrontendId":"1147","title":"Longest Chunked Palindrome Decomposition","titleSlug":"longest-chunked-palindrome-decomposition","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.8K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 19821, \"totalSubmissionRaw\": 33394, \"acRate\": \"59.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Rolling Hash","translatedName":null,"slug":"rolling-hash","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1266","questionFrontendId":"10004","title":"Design a Rate Limiting System","titleSlug":"design-a-rate-limiting-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"902\", \"totalSubmission\": \"2.5K\", \"totalAcceptedRaw\": 902, \"totalSubmissionRaw\": 2545, \"acRate\": \"35.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1356","questionFrontendId":"2193","title":"Minimum Number of Moves to Make Palindrome","titleSlug":"minimum-number-of-moves-to-make-palindrome","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.9K\", \"totalSubmission\": \"32.9K\", \"totalAcceptedRaw\": 16895, \"totalSubmissionRaw\": 32935, \"acRate\": \"51.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1358","questionFrontendId":"1237","title":"Find Positive Integer Solution for a Given Equation","titleSlug":"find-positive-integer-solution-for-a-given-equation","translatedTitle":null,"stats":"{\"totalAccepted\": \"57.2K\", \"totalSubmission\": \"82.6K\", \"totalAcceptedRaw\": 57219, \"totalSubmissionRaw\": 82634, \"acRate\": \"69.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Interactive","translatedName":null,"slug":"interactive","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1404","questionFrontendId":"1265","title":"Print Immutable Linked List in Reverse","titleSlug":"print-immutable-linked-list-in-reverse","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.6K\", \"totalSubmission\": \"51.6K\", \"totalAcceptedRaw\": 48606, \"totalSubmissionRaw\": 51580, \"acRate\": \"94.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Recursion","translatedName":null,"slug":"recursion","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1454","questionFrontendId":"1332","title":"Remove Palindromic Subsequences","titleSlug":"remove-palindromic-subsequences","translatedTitle":null,"stats":"{\"totalAccepted\": \"119.3K\", \"totalSubmission\": \"156.6K\", \"totalAcceptedRaw\": 119307, \"totalSubmissionRaw\": 156554, \"acRate\": \"76.2%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1468","questionFrontendId":"1346","title":"Check If N and Its Double Exist","titleSlug":"check-if-n-and-its-double-exist","translatedTitle":null,"stats":"{\"totalAccepted\": \"272.7K\", \"totalSubmission\": \"746.9K\", \"totalAcceptedRaw\": 272653, \"totalSubmissionRaw\": 746897, \"acRate\": \"36.5%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1486","questionFrontendId":"1385","title":"Find the Distance Value Between Two Arrays","titleSlug":"find-the-distance-value-between-two-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"78.5K\", \"totalSubmission\": \"118.2K\", \"totalAcceptedRaw\": 78467, \"totalSubmissionRaw\": 118199, \"acRate\": \"66.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1581","questionFrontendId":"1471","title":"The k Strongest Values in an Array","titleSlug":"the-k-strongest-values-in-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"33K\", \"totalSubmission\": \"54.7K\", \"totalAcceptedRaw\": 33022, \"totalSubmissionRaw\": 54653, \"acRate\": \"60.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1615","questionFrontendId":"1508","title":"Range Sum of Sorted Subarray Sums","titleSlug":"range-sum-of-sorted-subarray-sums","translatedTitle":null,"stats":"{\"totalAccepted\": \"32.1K\", \"totalSubmission\": \"54.3K\", \"totalAcceptedRaw\": 32070, \"totalSubmissionRaw\": 54333, \"acRate\": \"59.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1621","questionFrontendId":"1498","title":"Number of Subsequences That Satisfy the Given Sum Condition","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition","translatedTitle":null,"stats":"{\"totalAccepted\": \"40.5K\", \"totalSubmission\": \"107.8K\", \"totalAcceptedRaw\": 40463, \"totalSubmissionRaw\": 107780, \"acRate\": \"37.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1659","questionFrontendId":"1537","title":"Get the Maximum Score","titleSlug":"get-the-maximum-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.1K\", \"totalSubmission\": \"53.8K\", \"totalAcceptedRaw\": 21144, \"totalSubmissionRaw\": 53756, \"acRate\": \"39.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1679","questionFrontendId":"1574","title":"Shortest Subarray to be Removed to Make Array Sorted","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.7K\", \"totalSubmission\": \"66.8K\", \"totalAcceptedRaw\": 24721, \"totalSubmissionRaw\": 66827, \"acRate\": \"37.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1699","questionFrontendId":"1577","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","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"44.6K\", \"totalAcceptedRaw\": 17874, \"totalSubmissionRaw\": 44569, \"acRate\": \"40.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1713","questionFrontendId":"1570","title":"Dot Product of Two Sparse Vectors","titleSlug":"dot-product-of-two-sparse-vectors","translatedTitle":null,"stats":"{\"totalAccepted\": \"183K\", \"totalSubmission\": \"202.6K\", \"totalAcceptedRaw\": 183016, \"totalSubmissionRaw\": 202582, \"acRate\": \"90.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1739","questionFrontendId":"1616","title":"Split Two Strings to Make Palindrome","titleSlug":"split-two-strings-to-make-palindrome","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"63.7K\", \"totalAcceptedRaw\": 19866, \"totalSubmissionRaw\": 63656, \"acRate\": \"31.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1774","questionFrontendId":"1634","title":"Add Two Polynomials Represented as Linked Lists","titleSlug":"add-two-polynomials-represented-as-linked-lists","translatedTitle":null,"stats":"{\"totalAccepted\": \"8.7K\", \"totalSubmission\": \"16K\", \"totalAcceptedRaw\": 8687, \"totalSubmissionRaw\": 15967, \"acRate\": \"54.4%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1798","questionFrontendId":"1679","title":"Max Number of K-Sum Pairs","titleSlug":"max-number-of-k-sum-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"121.5K\", \"totalSubmission\": \"212.1K\", \"totalAcceptedRaw\": 121487, \"totalSubmissionRaw\": 212103, \"acRate\": \"57.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1831","questionFrontendId":"1712","title":"Ways to Split Array Into Three Subarrays","titleSlug":"ways-to-split-array-into-three-subarrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.2K\", \"totalSubmission\": \"83.1K\", \"totalAcceptedRaw\": 27156, \"totalSubmissionRaw\": 83139, \"acRate\": \"32.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1850","questionFrontendId":"1750","title":"Minimum Length of String After Deleting Similar Ends","titleSlug":"minimum-length-of-string-after-deleting-similar-ends","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.3K\", \"totalSubmission\": \"41.6K\", \"totalAcceptedRaw\": 18273, \"totalSubmissionRaw\": 41613, \"acRate\": \"43.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1880","questionFrontendId":"1754","title":"Largest Merge Of Two Strings","titleSlug":"largest-merge-of-two-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.8K\", \"totalSubmission\": \"38.8K\", \"totalAcceptedRaw\": 17760, \"totalSubmissionRaw\": 38790, \"acRate\": \"45.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1881","questionFrontendId":"1755","title":"Closest Subsequence Sum","titleSlug":"closest-subsequence-sum","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"32K\", \"totalAcceptedRaw\": 11748, \"totalSubmissionRaw\": 32027, \"acRate\": \"36.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1891","questionFrontendId":"1782","title":"Count Pairs Of Nodes","titleSlug":"count-pairs-of-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"14K\", \"totalAcceptedRaw\": 5388, \"totalSubmissionRaw\": 14017, \"acRate\": \"38.4%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1894","questionFrontendId":"1768","title":"Merge Strings Alternately","titleSlug":"merge-strings-alternately","translatedTitle":null,"stats":"{\"totalAccepted\": \"95.2K\", \"totalSubmission\": \"123.2K\", \"totalAcceptedRaw\": 95208, \"totalSubmissionRaw\": 123188, \"acRate\": \"77.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1918","questionFrontendId":"1793","title":"Maximum Score of a Good Subarray","titleSlug":"maximum-score-of-a-good-subarray","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.4K\", \"totalSubmission\": \"36.3K\", \"totalAcceptedRaw\": 19408, \"totalSubmissionRaw\": 36265, \"acRate\": \"53.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1923","questionFrontendId":"1813","title":"Sentence Similarity III","titleSlug":"sentence-similarity-iii","translatedTitle":null,"stats":"{\"totalAccepted\": \"13K\", \"totalSubmission\": \"38.9K\", \"totalAcceptedRaw\": 12959, \"totalSubmissionRaw\": 38912, \"acRate\": \"33.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1972","questionFrontendId":"1861","title":"Rotating the Box","titleSlug":"rotating-the-box","translatedTitle":null,"stats":"{\"totalAccepted\": \"39.7K\", \"totalSubmission\": \"60.8K\", \"totalAcceptedRaw\": 39719, \"totalSubmissionRaw\": 60837, \"acRate\": \"65.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1978","questionFrontendId":"1850","title":"Minimum Adjacent Swaps to Reach the Kth Smallest Number","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"17.5K\", \"totalSubmission\": \"24.4K\", \"totalAcceptedRaw\": 17508, \"totalSubmissionRaw\": 24376, \"acRate\": \"71.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1980","questionFrontendId":"1826","title":"Faulty Sensor","titleSlug":"faulty-sensor","translatedTitle":null,"stats":"{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"7.1K\", \"totalAcceptedRaw\": 3519, \"totalSubmissionRaw\": 7073, \"acRate\": \"49.8%\"}","difficulty":"Easy","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1984","questionFrontendId":"1855","title":"Maximum Distance Between a Pair of Values","titleSlug":"maximum-distance-between-a-pair-of-values","translatedTitle":null,"stats":"{\"totalAccepted\": \"40K\", \"totalSubmission\": \"75.3K\", \"totalAcceptedRaw\": 39958, \"totalSubmissionRaw\": 75265, \"acRate\": \"53.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1988","questionFrontendId":"1877","title":"Minimize Maximum Pair Sum in Array","titleSlug":"minimize-maximum-pair-sum-in-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"70K\", \"totalSubmission\": \"87.6K\", \"totalAcceptedRaw\": 69969, \"totalSubmissionRaw\": 87552, \"acRate\": \"79.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1992","questionFrontendId":"2046","title":"Sort Linked List Already Sorted Using Absolute Values","titleSlug":"sort-linked-list-already-sorted-using-absolute-values","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.8K\", \"totalSubmission\": \"7K\", \"totalAcceptedRaw\": 4766, \"totalSubmissionRaw\": 6950, \"acRate\": \"68.6%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1997","questionFrontendId":"1842","title":"Next Palindrome Using Same Digits","titleSlug":"next-palindrome-using-same-digits","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.8K\", \"totalSubmission\": \"8.9K\", \"totalAcceptedRaw\": 4756, \"totalSubmissionRaw\": 8950, \"acRate\": \"53.1%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2001","questionFrontendId":"1871","title":"Jump Game VII","titleSlug":"jump-game-vii","translatedTitle":null,"stats":"{\"totalAccepted\": \"33.6K\", \"totalSubmission\": \"134.1K\", \"totalAcceptedRaw\": 33612, \"totalSubmissionRaw\": 134124, \"acRate\": \"25.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2019","questionFrontendId":"1868","title":"Product of Two Run-Length Encoded Arrays","titleSlug":"product-of-two-run-length-encoded-arrays","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.6K\", \"totalSubmission\": \"44.4K\", \"totalAcceptedRaw\": 25641, \"totalSubmissionRaw\": 44414, \"acRate\": \"57.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2095","questionFrontendId":"1963","title":"Minimum Number of Swaps to Make the String Balanced","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.1K\", \"totalSubmission\": \"63.7K\", \"totalAcceptedRaw\": 44066, \"totalSubmissionRaw\": 63671, \"acRate\": \"69.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2128","questionFrontendId":"2000","title":"Reverse Prefix of Word","titleSlug":"reverse-prefix-of-word","translatedTitle":null,"stats":"{\"totalAccepted\": \"60.3K\", \"totalSubmission\": \"76.7K\", \"totalAcceptedRaw\": 60287, \"totalSubmissionRaw\": 76740, \"acRate\": \"78.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2162","questionFrontendId":"2035","title":"Partition Array Into Two Arrays to Minimize Sum Difference","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.1K\", \"totalSubmission\": \"69.8K\", \"totalAcceptedRaw\": 13133, \"totalSubmissionRaw\": 69768, \"acRate\": \"18.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"},{"name":"Bitmask","translatedName":null,"slug":"bitmask","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2216","questionFrontendId":"2095","title":"Delete the Middle Node of a Linked List","titleSlug":"delete-the-middle-node-of-a-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"178K\", \"totalSubmission\": \"298.8K\", \"totalAcceptedRaw\": 177962, \"totalSubmissionRaw\": 298767, \"acRate\": \"59.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2228","questionFrontendId":"2105","title":"Watering Plants II","titleSlug":"watering-plants-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.2K\", \"totalSubmission\": \"30.6K\", \"totalAcceptedRaw\": 15174, \"totalSubmissionRaw\": 30629, \"acRate\": \"49.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2231","questionFrontendId":"2108","title":"Find First Palindromic String in the Array","titleSlug":"find-first-palindromic-string-in-the-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"80.8K\", \"totalSubmission\": \"102.7K\", \"totalAcceptedRaw\": 80795, \"totalSubmissionRaw\": 102687, \"acRate\": \"78.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2236","questionFrontendId":"2130","title":"Maximum Twin Sum of a Linked List","titleSlug":"maximum-twin-sum-of-a-linked-list","translatedTitle":null,"stats":"{\"totalAccepted\": \"86.6K\", \"totalSubmission\": \"107.4K\", \"totalAcceptedRaw\": 86606, \"totalSubmissionRaw\": 107385, \"acRate\": \"80.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Linked List","translatedName":null,"slug":"linked-list","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2265","questionFrontendId":"2161","title":"Partition Array According to Given Pivot","titleSlug":"partition-array-according-to-given-pivot","translatedTitle":null,"stats":"{\"totalAccepted\": \"45.8K\", \"totalSubmission\": \"54K\", \"totalAcceptedRaw\": 45758, \"totalSubmissionRaw\": 53988, \"acRate\": \"84.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2271","questionFrontendId":"2149","title":"Rearrange Array Elements by Sign","titleSlug":"rearrange-array-elements-by-sign","translatedTitle":null,"stats":"{\"totalAccepted\": \"69.9K\", \"totalSubmission\": \"86.5K\", \"totalAcceptedRaw\": 69909, \"totalSubmissionRaw\": 86491, \"acRate\": \"80.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2330","questionFrontendId":"2234","title":"Maximum Total Beauty of the Gardens","titleSlug":"maximum-total-beauty-of-the-gardens","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"18.6K\", \"totalAcceptedRaw\": 5305, \"totalSubmissionRaw\": 18638, \"acRate\": \"28.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2392","questionFrontendId":"2300","title":"Successful Pairs of Spells and Potions","titleSlug":"successful-pairs-of-spells-and-potions","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"68.7K\", \"totalAcceptedRaw\": 22286, \"totalSubmissionRaw\": 68695, \"acRate\": \"32.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2414","questionFrontendId":"2337","title":"Move Pieces to Obtain a String","titleSlug":"move-pieces-to-obtain-a-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.6K\", \"totalSubmission\": \"42.9K\", \"totalAcceptedRaw\": 20590, \"totalSubmissionRaw\": 42928, \"acRate\": \"48.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2417","questionFrontendId":"2332","title":"The Latest Time to Catch a Bus","titleSlug":"the-latest-time-to-catch-a-bus","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.2K\", \"totalSubmission\": \"56.3K\", \"totalAcceptedRaw\": 13185, \"totalSubmissionRaw\": 56331, \"acRate\": \"23.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2442","questionFrontendId":"2367","title":"Number of Arithmetic Triplets","titleSlug":"number-of-arithmetic-triplets","translatedTitle":null,"stats":"{\"totalAccepted\": \"65K\", \"totalSubmission\": \"77.7K\", \"totalAcceptedRaw\": 64961, \"totalSubmissionRaw\": 77674, \"acRate\": \"83.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Enumeration","translatedName":null,"slug":"enumeration","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2468","questionFrontendId":"2330","title":"Valid Palindrome IV","titleSlug":"valid-palindrome-iv","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.6K\", \"totalSubmission\": \"3.4K\", \"totalAcceptedRaw\": 2604, \"totalSubmissionRaw\": 3441, \"acRate\": \"75.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2481","questionFrontendId":"2396","title":"Strictly Palindromic Number","titleSlug":"strictly-palindromic-number","translatedTitle":null,"stats":"{\"totalAccepted\": \"46.1K\", \"totalSubmission\": \"52.5K\", \"totalAcceptedRaw\": 46106, \"totalSubmissionRaw\": 52485, \"acRate\": \"87.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Brainteaser","translatedName":null,"slug":"brainteaser","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2488","questionFrontendId":"2406","title":"Divide Intervals Into Minimum Number of Groups","titleSlug":"divide-intervals-into-minimum-number-of-groups","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.3K\", \"totalSubmission\": \"44.2K\", \"totalAcceptedRaw\": 20310, \"totalSubmissionRaw\": 44185, \"acRate\": \"46.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2497","questionFrontendId":"2410","title":"Maximum Matching of Players With Trainers","titleSlug":"maximum-matching-of-players-with-trainers","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.7K\", \"totalSubmission\": \"37.3K\", \"totalAcceptedRaw\": 22709, \"totalSubmissionRaw\": 37287, \"acRate\": \"60.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2553","questionFrontendId":"2462","title":"Total Cost to Hire K Workers","titleSlug":"total-cost-to-hire-k-workers","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.9K\", \"totalSubmission\": \"37K\", \"totalAcceptedRaw\": 13890, \"totalSubmissionRaw\": 36989, \"acRate\": \"37.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2561","questionFrontendId":"2465","title":"Number of Distinct Averages","titleSlug":"number-of-distinct-averages","translatedTitle":null,"stats":"{\"totalAccepted\": \"25.3K\", \"totalSubmission\": \"43.3K\", \"totalAcceptedRaw\": 25253, \"totalSubmissionRaw\": 43315, \"acRate\": \"58.3%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2565","questionFrontendId":"2422","title":"Merge Operations to Turn Array Into a Palindrome","titleSlug":"merge-operations-to-turn-array-into-a-palindrome","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.2K\", \"totalSubmission\": \"1.8K\", \"totalAcceptedRaw\": 1220, \"totalSubmissionRaw\": 1750, \"acRate\": \"69.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2572","questionFrontendId":"2486","title":"Append Characters to String to Make Subsequence","titleSlug":"append-characters-to-string-to-make-subsequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.5K\", \"totalSubmission\": \"30.5K\", \"totalAcceptedRaw\": 19542, \"totalSubmissionRaw\": 30528, \"acRate\": \"64.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2581","questionFrontendId":"2491","title":"Divide Players Into Teams of Equal Skill","titleSlug":"divide-players-into-teams-of-equal-skill","translatedTitle":null,"stats":"{\"totalAccepted\": \"22.5K\", \"totalSubmission\": \"38.3K\", \"totalAcceptedRaw\": 22498, \"totalSubmissionRaw\": 38254, \"acRate\": \"58.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2602","questionFrontendId":"2511","title":"Maximum Enemy Forts That Can Be Captured","titleSlug":"maximum-enemy-forts-that-can-be-captured","translatedTitle":null,"stats":"{\"totalAccepted\": \"15K\", \"totalSubmission\": \"40.3K\", \"totalAcceptedRaw\": 15046, \"totalSubmissionRaw\": 40260, \"acRate\": \"37.4%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2634","questionFrontendId":"2540","title":"Minimum Common Value","titleSlug":"minimum-common-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"29.6K\", \"totalSubmission\": \"57.2K\", \"totalAcceptedRaw\": 29563, \"totalSubmissionRaw\": 57239, \"acRate\": \"51.6%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2698","questionFrontendId":"2562","title":"Find the Array Concatenation Value","titleSlug":"find-the-array-concatenation-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.8K\", \"totalSubmission\": \"39.9K\", \"totalAcceptedRaw\": 27803, \"totalSubmissionRaw\": 39889, \"acRate\": \"69.7%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Simulation","translatedName":null,"slug":"simulation","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2699","questionFrontendId":"2563","title":"Count the Number of Fair Pairs","titleSlug":"count-the-number-of-fair-pairs","translatedTitle":null,"stats":"{\"totalAccepted\": \"16.4K\", \"totalSubmission\": \"51.5K\", \"totalAcceptedRaw\": 16374, \"totalSubmissionRaw\": 51502, \"acRate\": \"31.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2701","questionFrontendId":"2565","title":"Subsequence With the Minimum Score","titleSlug":"subsequence-with-the-minimum-score","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"13.3K\", \"totalAcceptedRaw\": 4274, \"totalSubmissionRaw\": 13339, \"acRate\": \"32.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2707","questionFrontendId":"2570","title":"Merge Two 2D Arrays by Summing Values","titleSlug":"merge-two-2d-arrays-by-summing-values","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.7K\", \"totalSubmission\": \"29.7K\", \"totalAcceptedRaw\": 21656, \"totalSubmissionRaw\": 29667, \"acRate\": \"73.0%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2712","questionFrontendId":"2576","title":"Find the Maximum Number of Marked Indices","titleSlug":"find-the-maximum-number-of-marked-indices","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.1K\", \"totalSubmission\": \"35.2K\", \"totalAcceptedRaw\": 13091, \"totalSubmissionRaw\": 35197, \"acRate\": \"37.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Two Pointers","translatedName":null,"slug":"two-pointers","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/tmp/union-find-graphql.json b/tmp/union-find-graphql.json
new file mode 100644
index 000000000..b240919c2
--- /dev/null
+++ b/tmp/union-find-graphql.json
@@ -0,0 +1 @@
+{"data":{"topicTag":{"name":"Union Find","translatedName":null,"slug":"union-find","questions":[{"status":null,"questionId":"128","questionFrontendId":"128","title":"Longest Consecutive Sequence","titleSlug":"longest-consecutive-sequence","translatedTitle":null,"stats":"{\"totalAccepted\": \"1.1M\", \"totalSubmission\": \"2.2M\", \"totalAcceptedRaw\": 1061067, \"totalSubmissionRaw\": 2184758, \"acRate\": \"48.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"130","questionFrontendId":"130","title":"Surrounded Regions","titleSlug":"surrounded-regions","translatedTitle":null,"stats":"{\"totalAccepted\": \"517.6K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 517587, \"totalSubmissionRaw\": 1412315, \"acRate\": \"36.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"200","questionFrontendId":"200","title":"Number of Islands","titleSlug":"number-of-islands","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.1M\", \"totalSubmission\": \"3.7M\", \"totalAcceptedRaw\": 2091353, \"totalSubmissionRaw\": 3673734, \"acRate\": \"56.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"261","questionFrontendId":"261","title":"Graph Valid Tree","titleSlug":"graph-valid-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"332.9K\", \"totalSubmission\": \"706.9K\", \"totalAcceptedRaw\": 332851, \"totalSubmissionRaw\": 706936, \"acRate\": \"47.1%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"305","questionFrontendId":"305","title":"Number of Islands II","titleSlug":"number-of-islands-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"129.7K\", \"totalSubmission\": \"327.5K\", \"totalAcceptedRaw\": 129715, \"totalSubmissionRaw\": 327470, \"acRate\": \"39.6%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"323","questionFrontendId":"323","title":"Number of Connected Components in an Undirected Graph","titleSlug":"number-of-connected-components-in-an-undirected-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"326.8K\", \"totalSubmission\": \"525.3K\", \"totalAcceptedRaw\": 326849, \"totalSubmissionRaw\": 525340, \"acRate\": \"62.2%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"399","questionFrontendId":"399","title":"Evaluate Division","titleSlug":"evaluate-division","translatedTitle":null,"stats":"{\"totalAccepted\": \"328.8K\", \"totalSubmission\": \"551.3K\", \"totalAcceptedRaw\": 328839, \"totalSubmissionRaw\": 551333, \"acRate\": \"59.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Shortest Path","translatedName":null,"slug":"shortest-path","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"547","questionFrontendId":"547","title":"Number of Provinces","titleSlug":"number-of-provinces","translatedTitle":null,"stats":"{\"totalAccepted\": \"601.4K\", \"totalSubmission\": \"944.4K\", \"totalAcceptedRaw\": 601423, \"totalSubmissionRaw\": 944423, \"acRate\": \"63.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"684","questionFrontendId":"684","title":"Redundant Connection","titleSlug":"redundant-connection","translatedTitle":null,"stats":"{\"totalAccepted\": \"264.8K\", \"totalSubmission\": \"425.7K\", \"totalAcceptedRaw\": 264785, \"totalSubmissionRaw\": 425709, \"acRate\": \"62.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"685","questionFrontendId":"685","title":"Redundant Connection II","titleSlug":"redundant-connection-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"60.1K\", \"totalSubmission\": \"176.3K\", \"totalAcceptedRaw\": 60122, \"totalSubmissionRaw\": 176276, \"acRate\": \"34.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"694","questionFrontendId":"694","title":"Number of Distinct Islands","titleSlug":"number-of-distinct-islands","translatedTitle":null,"stats":"{\"totalAccepted\": \"147.1K\", \"totalSubmission\": \"242.1K\", \"totalAcceptedRaw\": 147068, \"totalSubmissionRaw\": 242132, \"acRate\": \"60.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"695","questionFrontendId":"695","title":"Max Area of Island","titleSlug":"max-area-of-island","translatedTitle":null,"stats":"{\"totalAccepted\": \"689.2K\", \"totalSubmission\": \"960.1K\", \"totalAcceptedRaw\": 689163, \"totalSubmissionRaw\": 960101, \"acRate\": \"71.8%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"711","questionFrontendId":"711","title":"Number of Distinct Islands II","titleSlug":"number-of-distinct-islands-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"17.8K\", \"totalAcceptedRaw\": 9240, \"totalSubmissionRaw\": 17821, \"acRate\": \"51.8%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Hash Function","translatedName":null,"slug":"hash-function","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"721","questionFrontendId":"721","title":"Accounts Merge","titleSlug":"accounts-merge","translatedTitle":null,"stats":"{\"totalAccepted\": \"302.4K\", \"totalSubmission\": \"536.8K\", \"totalAcceptedRaw\": 302414, \"totalSubmissionRaw\": 536752, \"acRate\": \"56.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"737","questionFrontendId":"737","title":"Sentence Similarity II","titleSlug":"sentence-similarity-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.1K\", \"totalSubmission\": \"132.8K\", \"totalAcceptedRaw\": 65064, \"totalSubmissionRaw\": 132773, \"acRate\": \"49.0%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"770","questionFrontendId":"765","title":"Couples Holding Hands","titleSlug":"couples-holding-hands","translatedTitle":null,"stats":"{\"totalAccepted\": \"51.9K\", \"totalSubmission\": \"91.3K\", \"totalAcceptedRaw\": 51853, \"totalSubmissionRaw\": 91311, \"acRate\": \"56.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"794","questionFrontendId":"778","title":"Swim in Rising Water","titleSlug":"swim-in-rising-water","translatedTitle":null,"stats":"{\"totalAccepted\": \"114.1K\", \"totalSubmission\": \"190.7K\", \"totalAcceptedRaw\": 114066, \"totalSubmissionRaw\": 190656, \"acRate\": \"59.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"801","questionFrontendId":"785","title":"Is Graph Bipartite?","titleSlug":"is-graph-bipartite","translatedTitle":null,"stats":"{\"totalAccepted\": \"390.5K\", \"totalSubmission\": \"736.1K\", \"totalAcceptedRaw\": 390517, \"totalSubmissionRaw\": 736101, \"acRate\": \"53.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"821","questionFrontendId":"803","title":"Bricks Falling When Hit","titleSlug":"bricks-falling-when-hit","translatedTitle":null,"stats":"{\"totalAccepted\": \"27.6K\", \"totalSubmission\": \"80.4K\", \"totalAcceptedRaw\": 27606, \"totalSubmissionRaw\": 80382, \"acRate\": \"34.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"854","questionFrontendId":"827","title":"Making A Large Island","titleSlug":"making-a-large-island","translatedTitle":null,"stats":"{\"totalAccepted\": \"127.6K\", \"totalSubmission\": \"284.4K\", \"totalAcceptedRaw\": 127622, \"totalSubmissionRaw\": 284388, \"acRate\": \"44.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"869","questionFrontendId":"839","title":"Similar String Groups","titleSlug":"similar-string-groups","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.9K\", \"totalSubmission\": \"133.2K\", \"totalAcceptedRaw\": 63879, \"totalSubmissionRaw\": 133184, \"acRate\": \"48.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"922","questionFrontendId":"886","title":"Possible Bipartition","titleSlug":"possible-bipartition","translatedTitle":null,"stats":"{\"totalAccepted\": \"178.7K\", \"totalSubmission\": \"357.5K\", \"totalAcceptedRaw\": 178691, \"totalSubmissionRaw\": 357474, \"acRate\": \"50.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"960","questionFrontendId":"924","title":"Minimize Malware Spread","titleSlug":"minimize-malware-spread","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.8K\", \"totalSubmission\": \"101.8K\", \"totalAcceptedRaw\": 42842, \"totalSubmissionRaw\": 101803, \"acRate\": \"42.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"964","questionFrontendId":"928","title":"Minimize Malware Spread II","titleSlug":"minimize-malware-spread-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"42.5K\", \"totalAcceptedRaw\": 18155, \"totalSubmissionRaw\": 42506, \"acRate\": \"42.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"984","questionFrontendId":"947","title":"Most Stones Removed with Same Row or Column","titleSlug":"most-stones-removed-with-same-row-or-column","translatedTitle":null,"stats":"{\"totalAccepted\": \"172.2K\", \"totalSubmission\": \"292.4K\", \"totalAcceptedRaw\": 172193, \"totalSubmissionRaw\": 292418, \"acRate\": \"58.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"989","questionFrontendId":"952","title":"Largest Component Size by Common Factor","titleSlug":"largest-component-size-by-common-factor","translatedTitle":null,"stats":"{\"totalAccepted\": \"48.4K\", \"totalSubmission\": \"120.7K\", \"totalAcceptedRaw\": 48439, \"totalSubmissionRaw\": 120726, \"acRate\": \"40.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"999","questionFrontendId":"959","title":"Regions Cut By Slashes","titleSlug":"regions-cut-by-slashes","translatedTitle":null,"stats":"{\"totalAccepted\": \"44.7K\", \"totalSubmission\": \"64.6K\", \"totalAcceptedRaw\": 44715, \"totalSubmissionRaw\": 64634, \"acRate\": \"69.2%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1032","questionFrontendId":"990","title":"Satisfiability of Equality Equations","titleSlug":"satisfiability-of-equality-equations","translatedTitle":null,"stats":"{\"totalAccepted\": \"109.1K\", \"totalSubmission\": \"216K\", \"totalAcceptedRaw\": 109149, \"totalSubmissionRaw\": 215959, \"acRate\": \"50.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1058","questionFrontendId":"1061","title":"Lexicographically Smallest Equivalent String","titleSlug":"lexicographically-smallest-equivalent-string","translatedTitle":null,"stats":"{\"totalAccepted\": \"68K\", \"totalSubmission\": \"88.9K\", \"totalAcceptedRaw\": 68018, \"totalSubmissionRaw\": 88879, \"acRate\": \"76.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1073","questionFrontendId":"1020","title":"Number of Enclaves","titleSlug":"number-of-enclaves","translatedTitle":null,"stats":"{\"totalAccepted\": \"96.3K\", \"totalSubmission\": \"147K\", \"totalAcceptedRaw\": 96281, \"totalSubmissionRaw\": 147013, \"acRate\": \"65.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1085","questionFrontendId":"1101","title":"The Earliest Moment When Everyone Become Friends","titleSlug":"the-earliest-moment-when-everyone-become-friends","translatedTitle":null,"stats":"{\"totalAccepted\": \"62.7K\", \"totalSubmission\": \"96.8K\", \"totalAcceptedRaw\": 62664, \"totalSubmissionRaw\": 96832, \"acRate\": \"64.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1099","questionFrontendId":"1102","title":"Path With Maximum Minimum Value","titleSlug":"path-with-maximum-minimum-value","translatedTitle":null,"stats":"{\"totalAccepted\": \"56.1K\", \"totalSubmission\": \"105.3K\", \"totalAcceptedRaw\": 56109, \"totalSubmissionRaw\": 105287, \"acRate\": \"53.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1100","questionFrontendId":"1135","title":"Connecting Cities With Minimum Cost","titleSlug":"connecting-cities-with-minimum-cost","translatedTitle":null,"stats":"{\"totalAccepted\": \"65.4K\", \"totalSubmission\": \"106.7K\", \"totalAcceptedRaw\": 65422, \"totalSubmissionRaw\": 106685, \"acRate\": \"61.3%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Minimum Spanning Tree","translatedName":null,"slug":"minimum-spanning-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1144","questionFrontendId":"1168","title":"Optimize Water Distribution in a Village","titleSlug":"optimize-water-distribution-in-a-village","translatedTitle":null,"stats":"{\"totalAccepted\": \"38.8K\", \"totalSubmission\": \"60.2K\", \"totalAcceptedRaw\": 38832, \"totalSubmissionRaw\": 60203, \"acRate\": \"64.5%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Minimum Spanning Tree","translatedName":null,"slug":"minimum-spanning-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1191","questionFrontendId":"1258","title":"Synonymous Sentences","titleSlug":"synonymous-sentences","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.9K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 18944, \"totalSubmissionRaw\": 33431, \"acRate\": \"56.7%\"}","difficulty":"Medium","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Backtracking","translatedName":null,"slug":"backtracking","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1223","questionFrontendId":"1627","title":"Graph Connectivity With Threshold","titleSlug":"graph-connectivity-with-threshold","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"29.9K\", \"totalAcceptedRaw\": 13817, \"totalSubmissionRaw\": 29882, \"acRate\": \"46.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1257","questionFrontendId":"1632","title":"Rank Transform of a Matrix","titleSlug":"rank-transform-of-a-matrix","translatedTitle":null,"stats":"{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"48.6K\", \"totalAcceptedRaw\": 19894, \"totalSubmissionRaw\": 48593, \"acRate\": \"40.9%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1275","questionFrontendId":"1361","title":"Validate Binary Tree Nodes","titleSlug":"validate-binary-tree-nodes","translatedTitle":null,"stats":"{\"totalAccepted\": \"42.3K\", \"totalSubmission\": \"106.1K\", \"totalAcceptedRaw\": 42324, \"totalSubmissionRaw\": 106126, \"acRate\": \"39.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1308","questionFrontendId":"1202","title":"Smallest String With Swaps","titleSlug":"smallest-string-with-swaps","translatedTitle":null,"stats":"{\"totalAccepted\": \"96.9K\", \"totalSubmission\": \"168.2K\", \"totalAcceptedRaw\": 96903, \"totalSubmissionRaw\": 168244, \"acRate\": \"57.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Hash Table","translatedName":null,"slug":"hash-table","__typename":"TopicTagNode"},{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1347","questionFrontendId":"2204","title":"Distance to a Cycle in Undirected Graph","titleSlug":"distance-to-a-cycle-in-undirected-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"2K\", \"totalSubmission\": \"2.8K\", \"totalAcceptedRaw\": 1995, \"totalSubmissionRaw\": 2838, \"acRate\": \"70.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1380","questionFrontendId":"1254","title":"Number of Closed Islands","titleSlug":"number-of-closed-islands","translatedTitle":null,"stats":"{\"totalAccepted\": \"127.9K\", \"totalSubmission\": \"199.5K\", \"totalAcceptedRaw\": 127871, \"totalSubmissionRaw\": 199502, \"acRate\": \"64.1%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1396","questionFrontendId":"1267","title":"Count Servers that Communicate","titleSlug":"count-servers-that-communicate","translatedTitle":null,"stats":"{\"totalAccepted\": \"50.8K\", \"totalSubmission\": \"85.5K\", \"totalAcceptedRaw\": 50795, \"totalSubmissionRaw\": 85462, \"acRate\": \"59.4%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"},{"name":"Counting","translatedName":null,"slug":"counting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1442","questionFrontendId":"1319","title":"Number of Operations to Make Network Connected","titleSlug":"number-of-operations-to-make-network-connected","translatedTitle":null,"stats":"{\"totalAccepted\": \"115.7K\", \"totalSubmission\": \"196.5K\", \"totalAcceptedRaw\": 115725, \"totalSubmissionRaw\": 196520, \"acRate\": \"58.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1507","questionFrontendId":"1391","title":"Check if There is a Valid Path in a Grid","titleSlug":"check-if-there-is-a-valid-path-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"51.1K\", \"totalAcceptedRaw\": 24159, \"totalSubmissionRaw\": 51128, \"acRate\": \"47.3%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1613","questionFrontendId":"1489","title":"Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree","translatedTitle":null,"stats":"{\"totalAccepted\": \"10.7K\", \"totalSubmission\": \"20.5K\", \"totalAcceptedRaw\": 10749, \"totalSubmissionRaw\": 20460, \"acRate\": \"52.5%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Minimum Spanning Tree","translatedName":null,"slug":"minimum-spanning-tree","__typename":"TopicTagNode"},{"name":"Strongly Connected Component","translatedName":null,"slug":"strongly-connected-component","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1663","questionFrontendId":"1559","title":"Detect Cycles in 2D Grid","titleSlug":"detect-cycles-in-2d-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"31.9K\", \"totalSubmission\": \"66.6K\", \"totalAcceptedRaw\": 31944, \"totalSubmissionRaw\": 66595, \"acRate\": \"48.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1692","questionFrontendId":"1569","title":"Number of Ways to Reorder Array to Get Same BST","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"24.4K\", \"totalAcceptedRaw\": 11685, \"totalSubmissionRaw\": 24422, \"acRate\": \"47.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Divide and Conquer","translatedName":null,"slug":"divide-and-conquer","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Binary Search Tree","translatedName":null,"slug":"binary-search-tree","__typename":"TopicTagNode"},{"name":"Memoization","translatedName":null,"slug":"memoization","__typename":"TopicTagNode"},{"name":"Combinatorics","translatedName":null,"slug":"combinatorics","__typename":"TopicTagNode"},{"name":"Binary Tree","translatedName":null,"slug":"binary-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1701","questionFrontendId":"1579","title":"Remove Max Number of Edges to Keep Graph Fully Traversable","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable","translatedTitle":null,"stats":"{\"totalAccepted\": \"18.4K\", \"totalSubmission\": \"34.5K\", \"totalAcceptedRaw\": 18354, \"totalSubmissionRaw\": 34523, \"acRate\": \"53.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1706","questionFrontendId":"1584","title":"Min Cost to Connect All Points","titleSlug":"min-cost-to-connect-all-points","translatedTitle":null,"stats":"{\"totalAccepted\": \"152.1K\", \"totalSubmission\": \"237.8K\", \"totalAcceptedRaw\": 152120, \"totalSubmissionRaw\": 237783, \"acRate\": \"64.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Minimum Spanning Tree","translatedName":null,"slug":"minimum-spanning-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1753","questionFrontendId":"1631","title":"Path With Minimum Effort","titleSlug":"path-with-minimum-effort","translatedTitle":null,"stats":"{\"totalAccepted\": \"140.9K\", \"totalSubmission\": \"253.4K\", \"totalAcceptedRaw\": 140915, \"totalSubmissionRaw\": 253403, \"acRate\": \"55.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1815","questionFrontendId":"1697","title":"Checking Existence of Edge Length Limited Paths","titleSlug":"checking-existence-of-edge-length-limited-paths","translatedTitle":null,"stats":"{\"totalAccepted\": \"12.4K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 12436, \"totalSubmissionRaw\": 24505, \"acRate\": \"50.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1840","questionFrontendId":"1722","title":"Minimize Hamming Distance After Swap Operations","titleSlug":"minimize-hamming-distance-after-swap-operations","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.1K\", \"totalSubmission\": \"30.9K\", \"totalAcceptedRaw\": 15076, \"totalSubmissionRaw\": 30949, \"acRate\": \"48.7%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1865","questionFrontendId":"1724","title":"Checking Existence of Edge Length Limited Paths II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.3K\", \"totalSubmission\": \"4.4K\", \"totalAcceptedRaw\": 2295, \"totalSubmissionRaw\": 4372, \"acRate\": \"52.5%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Minimum Spanning Tree","translatedName":null,"slug":"minimum-spanning-tree","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"1973","questionFrontendId":"10006","title":"Design an Application Monitoring System","titleSlug":"design-an-application-monitoring-system","translatedTitle":null,"stats":"{\"totalAccepted\": \"213\", \"totalSubmission\": \"877\", \"totalAcceptedRaw\": 213, \"totalSubmissionRaw\": 877, \"acRate\": \"24.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2035","questionFrontendId":"1905","title":"Count Sub Islands","titleSlug":"count-sub-islands","translatedTitle":null,"stats":"{\"totalAccepted\": \"63.8K\", \"totalSubmission\": \"94.3K\", \"totalAcceptedRaw\": 63770, \"totalSubmissionRaw\": 94306, \"acRate\": \"67.6%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2065","questionFrontendId":"2307","title":"Check for Contradictions in Equations","titleSlug":"check-for-contradictions-in-equations","translatedTitle":null,"stats":"{\"totalAccepted\": \"848\", \"totalSubmission\": \"1.9K\", \"totalAcceptedRaw\": 848, \"totalSubmissionRaw\": 1941, \"acRate\": \"43.7%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2101","questionFrontendId":"1970","title":"Last Day Where You Can Still Cross","titleSlug":"last-day-where-you-can-still-cross","translatedTitle":null,"stats":"{\"totalAccepted\": \"11.4K\", \"totalSubmission\": \"23K\", \"totalAcceptedRaw\": 11403, \"totalSubmissionRaw\": 22978, \"acRate\": \"49.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2121","questionFrontendId":"1971","title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"222.4K\", \"totalSubmission\": \"426.6K\", \"totalAcceptedRaw\": 222365, \"totalSubmissionRaw\": 426631, \"acRate\": \"52.1%\"}","difficulty":"Easy","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2125","questionFrontendId":"1998","title":"GCD Sort of an Array","titleSlug":"gcd-sort-of-an-array","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.6K\", \"totalSubmission\": \"14.5K\", \"totalAcceptedRaw\": 6629, \"totalSubmissionRaw\": 14522, \"acRate\": \"45.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Math","translatedName":null,"slug":"math","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2131","questionFrontendId":"2003","title":"Smallest Missing Genetic Value in Each Subtree","titleSlug":"smallest-missing-genetic-value-in-each-subtree","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.4K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 6435, \"totalSubmissionRaw\": 14412, \"acRate\": \"44.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2198","questionFrontendId":"2076","title":"Process Restricted Friend Requests","titleSlug":"process-restricted-friend-requests","translatedTitle":null,"stats":"{\"totalAccepted\": \"13.4K\", \"totalSubmission\": \"25.1K\", \"totalAcceptedRaw\": 13380, \"totalSubmissionRaw\": 25104, \"acRate\": \"53.3%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2213","questionFrontendId":"2092","title":"Find All People With Secret","titleSlug":"find-all-people-with-secret","translatedTitle":null,"stats":"{\"totalAccepted\": \"20.4K\", \"totalSubmission\": \"59.7K\", \"totalAcceptedRaw\": 20415, \"totalSubmissionRaw\": 59709, \"acRate\": \"34.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2276","questionFrontendId":"2157","title":"Groups of Strings","titleSlug":"groups-of-strings","translatedTitle":null,"stats":"{\"totalAccepted\": \"7.5K\", \"totalSubmission\": \"29.2K\", \"totalAcceptedRaw\": 7509, \"totalSubmissionRaw\": 29246, \"acRate\": \"25.7%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Bit Manipulation","translatedName":null,"slug":"bit-manipulation","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2403","questionFrontendId":"2316","title":"Count Unreachable Pairs of Nodes in an Undirected Graph","titleSlug":"count-unreachable-pairs-of-nodes-in-an-undirected-graph","translatedTitle":null,"stats":"{\"totalAccepted\": \"21.7K\", \"totalSubmission\": \"55.7K\", \"totalAcceptedRaw\": 21659, \"totalSubmissionRaw\": 55710, \"acRate\": \"38.9%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2419","questionFrontendId":"2334","title":"Subarray With Elements Greater Than Varying Threshold","titleSlug":"subarray-with-elements-greater-than-varying-threshold","translatedTitle":null,"stats":"{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 5921, \"totalSubmissionRaw\": 14392, \"acRate\": \"41.1%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Stack","translatedName":null,"slug":"stack","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Monotonic Stack","translatedName":null,"slug":"monotonic-stack","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2466","questionFrontendId":"2382","title":"Maximum Segment Sum After Removals","titleSlug":"maximum-segment-sum-after-removals","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"13.2K\", \"totalAcceptedRaw\": 6310, \"totalSubmissionRaw\": 13201, \"acRate\": \"47.8%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Prefix Sum","translatedName":null,"slug":"prefix-sum","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2505","questionFrontendId":"2421","title":"Number of Good Paths","titleSlug":"number-of-good-paths","translatedTitle":null,"stats":"{\"totalAccepted\": \"47.8K\", \"totalSubmission\": \"82.9K\", \"totalAcceptedRaw\": 47759, \"totalSubmissionRaw\": 82944, \"acRate\": \"57.6%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Tree","translatedName":null,"slug":"tree","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2506","questionFrontendId":"2371","title":"Minimize Maximum Value in a Grid","titleSlug":"minimize-maximum-value-in-a-grid","translatedTitle":null,"stats":"{\"totalAccepted\": \"890\", \"totalSubmission\": \"1.2K\", \"totalAcceptedRaw\": 890, \"totalSubmissionRaw\": 1249, \"acRate\": \"71.3%\"}","difficulty":"Hard","isPaidOnly":true,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"},{"name":"Topological Sort","translatedName":null,"slug":"topological-sort","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Matrix","translatedName":null,"slug":"matrix","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2512","questionFrontendId":"2424","title":"Longest Uploaded Prefix","titleSlug":"longest-uploaded-prefix","translatedTitle":null,"stats":"{\"totalAccepted\": \"14.9K\", \"totalSubmission\": \"27.6K\", \"totalAcceptedRaw\": 14892, \"totalSubmissionRaw\": 27592, \"acRate\": \"54.0%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Binary Search","translatedName":null,"slug":"binary-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Design","translatedName":null,"slug":"design","__typename":"TopicTagNode"},{"name":"Binary Indexed Tree","translatedName":null,"slug":"binary-indexed-tree","__typename":"TopicTagNode"},{"name":"Segment Tree","translatedName":null,"slug":"segment-tree","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"},{"name":"Ordered Set","translatedName":null,"slug":"ordered-set","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2582","questionFrontendId":"2492","title":"Minimum Score of a Path Between Two Cities","titleSlug":"minimum-score-of-a-path-between-two-cities","translatedTitle":null,"stats":"{\"totalAccepted\": \"15.7K\", \"totalSubmission\": \"33.7K\", \"totalAcceptedRaw\": 15675, \"totalSubmissionRaw\": 33700, \"acRate\": \"46.5%\"}","difficulty":"Medium","isPaidOnly":false,"topicTags":[{"name":"Depth-First Search","translatedName":null,"slug":"depth-first-search","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2583","questionFrontendId":"2493","title":"Divide Nodes Into the Maximum Number of Groups","titleSlug":"divide-nodes-into-the-maximum-number-of-groups","translatedTitle":null,"stats":"{\"totalAccepted\": \"4.8K\", \"totalSubmission\": \"13.1K\", \"totalAcceptedRaw\": 4835, \"totalSubmissionRaw\": 13057, \"acRate\": \"37.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Graph","translatedName":null,"slug":"graph","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2588","questionFrontendId":"2503","title":"Maximum Number of Points From Grid Queries","titleSlug":"maximum-number-of-points-from-grid-queries","translatedTitle":null,"stats":"{\"totalAccepted\": \"6.2K\", \"totalSubmission\": \"16.6K\", \"totalAcceptedRaw\": 6160, \"totalSubmissionRaw\": 16650, \"acRate\": \"37.0%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"Array","translatedName":null,"slug":"array","__typename":"TopicTagNode"},{"name":"Breadth-First Search","translatedName":null,"slug":"breadth-first-search","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"},{"name":"Sorting","translatedName":null,"slug":"sorting","__typename":"TopicTagNode"},{"name":"Heap (Priority Queue)","translatedName":null,"slug":"heap-priority-queue","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"},{"status":null,"questionId":"2708","questionFrontendId":"2573","title":"Find the String with LCP","titleSlug":"find-the-string-with-lcp","translatedTitle":null,"stats":"{\"totalAccepted\": \"2.6K\", \"totalSubmission\": \"7.3K\", \"totalAcceptedRaw\": 2584, \"totalSubmissionRaw\": 7349, \"acRate\": \"35.2%\"}","difficulty":"Hard","isPaidOnly":false,"topicTags":[{"name":"String","translatedName":null,"slug":"string","__typename":"TopicTagNode"},{"name":"Dynamic Programming","translatedName":null,"slug":"dynamic-programming","__typename":"TopicTagNode"},{"name":"Greedy","translatedName":null,"slug":"greedy","__typename":"TopicTagNode"},{"name":"Union Find","translatedName":null,"slug":"union-find","__typename":"TopicTagNode"}],"companyTags":null,"__typename":"QuestionNode"}],"frequencies":null,"__typename":"TopicTagNode"},"favoritesLists":{"publicFavorites":[],"privateFavorites":[],"__typename":"FavoritesNode"}}}
\ No newline at end of file
diff --git a/website/config.toml b/website/config.toml
index 52297f0ba..975a77050 100644
--- a/website/config.toml
+++ b/website/config.toml
@@ -2,7 +2,7 @@ baseURL = "https://books.halfrost.com/leetcode"
languageCode = "en-us"
title = "LeetCode Cookbook"
theme = "book"
-googleAnalytics = "UA-82753806-3"
+googleAnalytics = ""
enableEmoji = true
enableGitInfo = true
@@ -141,18 +141,18 @@ disablePathToLower = true
# (Optional, experimental, default false) Enables a drop-down menu for translations only if a translation is present.
BookTranslatedOnly = false
-[params.gitalk]
- clientID = "75d9d747f200c623a0e6" # Your client ID
- clientSecret = "e3cc2ff8d8f6ae3c894a827f226188de0d26f37e" # Your client secret
- repo = "S2" # The repo to store comments
- owner = "halfrost" # Your GitHub ID
- admin= "halfrost" # Required. Github repository owner and collaborators. (Users who having write access to this repository)
- id= "location.pathname" # The unique id of the page.
- labels= "gitalk" # Github issue labels. If you used to use Gitment, you can change it
- body= "location.href" # GitHub issue body.
- perPage= 100 # Pagination size, with maximum 100.
- pagerDirection= "last" # Comment sorting direction, available values are 'last' and 'first'.
- createIssueManually= true # If it is 'false', it is auto to make a Github issue when the administrators login.
- distractionFreeMode= true # Enable hot key (cmd|ctrl + enter) submit comment.
- proxy= "https://shielded-brushlands-08810.herokuapp.com/https://github.com/login/oauth/access_token"
-
+#[params.gitalk]
+# clientID = "75d9d747f200c623a0e6" # Your client ID
+# clientSecret = "e3cc2ff8d8f6ae3c894a827f226188de0d26f37e" # Your client secret
+# repo = "S2" # The repo to store comments
+# owner = "halfrost" # Your GitHub ID
+# admin= "halfrost" # Required. Github repository owner and collaborators. (Users who having write access to this repository)
+# id= "location.pathname" # The unique id of the page.
+# labels= "gitalk" # Github issue labels. If you used to use Gitment, you can change it
+# body= "location.href" # GitHub issue body.
+# perPage= 100 # Pagination size, with maximum 100.
+# pagerDirection= "last" # Comment sorting direction, available values are 'last' and 'first'.
+# createIssueManually= true # If it is 'false', it is auto to make a Github issue when the administrators login.
+# distractionFreeMode= true # Enable hot key (cmd|ctrl + enter) submit comment.
+# proxy= "https://shielded-brushlands-08810.herokuapp.com/https://github.com/login/oauth/access_token"
+#
diff --git a/website/content/ChapterFour/0001~0099/0001.Two-Sum.md b/website/content/ChapterFour/0001~0099/0001.Two-Sum.md
index d84bc7af1..dfd6fae36 100644
--- a/website/content/ChapterFour/0001~0099/0001.Two-Sum.md
+++ b/website/content/ChapterFour/0001~0099/0001.Two-Sum.md
@@ -50,8 +50,9 @@ func twoSum(nums []int, target int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0002.Add-Two-Numbers.md b/website/content/ChapterFour/0001~0099/0002.Add-Two-Numbers.md
index a64c6a301..a907decf1 100644
--- a/website/content/ChapterFour/0001~0099/0002.Add-Two-Numbers.md
+++ b/website/content/ChapterFour/0001~0099/0002.Add-Two-Numbers.md
@@ -78,8 +78,9 @@ func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md b/website/content/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md
index f86f9d4d4..a62fb3ac8 100644
--- a/website/content/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md
+++ b/website/content/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md
@@ -139,8 +139,9 @@ func max(a int, b int) int {
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md b/website/content/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md
index ddca884df..d278da8e8 100755
--- a/website/content/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md
+++ b/website/content/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md
@@ -98,8 +98,9 @@ func findMedianSortedArrays(nums1 []int, nums2 []int) float64 {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0005.Longest-Palindromic-Substring.md b/website/content/ChapterFour/0001~0099/0005.Longest-Palindromic-Substring.md
index 1adffa4b2..c4a3dfa5b 100644
--- a/website/content/ChapterFour/0001~0099/0005.Longest-Palindromic-Substring.md
+++ b/website/content/ChapterFour/0001~0099/0005.Longest-Palindromic-Substring.md
@@ -186,8 +186,9 @@ func longestPalindrome3(s string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0006.ZigZag-Conversion.md b/website/content/ChapterFour/0001~0099/0006.ZigZag-Conversion.md
index 8f61aedc3..407545535 100644
--- a/website/content/ChapterFour/0001~0099/0006.ZigZag-Conversion.md
+++ b/website/content/ChapterFour/0001~0099/0006.ZigZag-Conversion.md
@@ -107,8 +107,9 @@ func convert(s string, numRows int) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0007.Reverse-Integer.md b/website/content/ChapterFour/0001~0099/0007.Reverse-Integer.md
index 5f0b783fa..f11736be3 100755
--- a/website/content/ChapterFour/0001~0099/0007.Reverse-Integer.md
+++ b/website/content/ChapterFour/0001~0099/0007.Reverse-Integer.md
@@ -55,8 +55,9 @@ func reverse7(x int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0008.String-to-Integer-atoi.md b/website/content/ChapterFour/0001~0099/0008.String-to-Integer-atoi.md
index 0f37b876a..3e9565f62 100644
--- a/website/content/ChapterFour/0001~0099/0008.String-to-Integer-atoi.md
+++ b/website/content/ChapterFour/0001~0099/0008.String-to-Integer-atoi.md
@@ -192,8 +192,9 @@ func myAtoi(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0009.Palindrome-Number.md b/website/content/ChapterFour/0001~0099/0009.Palindrome-Number.md
index 4cfa1c984..f6792a7d8 100644
--- a/website/content/ChapterFour/0001~0099/0009.Palindrome-Number.md
+++ b/website/content/ChapterFour/0001~0099/0009.Palindrome-Number.md
@@ -96,8 +96,9 @@ func isPalindrome1(x int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0011.Container-With-Most-Water.md b/website/content/ChapterFour/0001~0099/0011.Container-With-Most-Water.md
index 6e81d5b00..a9ee6d009 100644
--- a/website/content/ChapterFour/0001~0099/0011.Container-With-Most-Water.md
+++ b/website/content/ChapterFour/0001~0099/0011.Container-With-Most-Water.md
@@ -59,8 +59,9 @@ func maxArea(height []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0012.Integer-to-Roman.md b/website/content/ChapterFour/0001~0099/0012.Integer-to-Roman.md
index 274c2a126..3b1787d56 100644
--- a/website/content/ChapterFour/0001~0099/0012.Integer-to-Roman.md
+++ b/website/content/ChapterFour/0001~0099/0012.Integer-to-Roman.md
@@ -102,8 +102,9 @@ func intToRoman(num int) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0013.Roman-to-Integer.md b/website/content/ChapterFour/0001~0099/0013.Roman-to-Integer.md
index ae95445d3..c7d72da7f 100644
--- a/website/content/ChapterFour/0001~0099/0013.Roman-to-Integer.md
+++ b/website/content/ChapterFour/0001~0099/0013.Roman-to-Integer.md
@@ -132,8 +132,9 @@ func romanToInt(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0014.Longest-Common-Prefix.md b/website/content/ChapterFour/0001~0099/0014.Longest-Common-Prefix.md
index c6354e451..f444affc7 100644
--- a/website/content/ChapterFour/0001~0099/0014.Longest-Common-Prefix.md
+++ b/website/content/ChapterFour/0001~0099/0014.Longest-Common-Prefix.md
@@ -58,8 +58,9 @@ func longestCommonPrefix(strs []string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0015.3Sum.md b/website/content/ChapterFour/0001~0099/0015.3Sum.md
index 48d53acb3..03da1122d 100644
--- a/website/content/ChapterFour/0001~0099/0015.3Sum.md
+++ b/website/content/ChapterFour/0001~0099/0015.3Sum.md
@@ -118,8 +118,9 @@ func threeSum1(nums []int) [][]int {
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0016.3Sum-Closest.md b/website/content/ChapterFour/0001~0099/0016.3Sum-Closest.md
index c98e985ad..8728e1835 100644
--- a/website/content/ChapterFour/0001~0099/0016.3Sum-Closest.md
+++ b/website/content/ChapterFour/0001~0099/0016.3Sum-Closest.md
@@ -92,8 +92,9 @@ func abs(a int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md b/website/content/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md
index 4bb0f769a..d02c52a7e 100755
--- a/website/content/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md
+++ b/website/content/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md
@@ -144,8 +144,9 @@ func letterFunc(res string, digits string) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0018.4Sum.md b/website/content/ChapterFour/0001~0099/0018.4Sum.md
index 672e26be7..05d9e0fd7 100644
--- a/website/content/ChapterFour/0001~0099/0018.4Sum.md
+++ b/website/content/ChapterFour/0001~0099/0018.4Sum.md
@@ -182,8 +182,9 @@ func fourSum2(nums []int, target int) [][]int {
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md b/website/content/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md
index 0a511762f..56f6e6a09 100644
--- a/website/content/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md
+++ b/website/content/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md
@@ -125,8 +125,9 @@ func removeNthFromEnd1(head *ListNode, n int) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0020.Valid-Parentheses.md b/website/content/ChapterFour/0001~0099/0020.Valid-Parentheses.md
index f1a6faa2c..69a175cd8 100644
--- a/website/content/ChapterFour/0001~0099/0020.Valid-Parentheses.md
+++ b/website/content/ChapterFour/0001~0099/0020.Valid-Parentheses.md
@@ -96,8 +96,9 @@ func isValid(s string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists.md b/website/content/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists.md
index 76cdbff72..2fc8dd6a4 100644
--- a/website/content/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists.md
+++ b/website/content/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists.md
@@ -53,8 +53,9 @@ func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0022.Generate-Parentheses.md b/website/content/ChapterFour/0001~0099/0022.Generate-Parentheses.md
index 882fdd4b7..f1d6b81da 100755
--- a/website/content/ChapterFour/0001~0099/0022.Generate-Parentheses.md
+++ b/website/content/ChapterFour/0001~0099/0022.Generate-Parentheses.md
@@ -60,8 +60,9 @@ func findGenerateParenthesis(lindex, rindex int, str string, res *[]string) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists.md b/website/content/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists.md
index d6c5ef8d8..da41d8a50 100644
--- a/website/content/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists.md
+++ b/website/content/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists.md
@@ -74,8 +74,9 @@ func mergeTwoLists1(l1 *ListNode, l2 *ListNode) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs.md b/website/content/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs.md
index 460110543..44e60b2d0 100644
--- a/website/content/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs.md
+++ b/website/content/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs.md
@@ -58,8 +58,9 @@ func swapPairs(head *ListNode) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group.md b/website/content/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group.md
index 417548b9a..6c6b79aa3 100644
--- a/website/content/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group.md
+++ b/website/content/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group.md
@@ -74,8 +74,9 @@ func reverse(first *ListNode, last *ListNode) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md b/website/content/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md
index 6d6034249..3a69e1d9e 100644
--- a/website/content/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md
+++ b/website/content/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md
@@ -128,8 +128,9 @@ func removeElement1(nums []int, start, val int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0027.Remove-Element.md b/website/content/ChapterFour/0001~0099/0027.Remove-Element.md
index ef1a75df3..1debbf525 100644
--- a/website/content/ChapterFour/0001~0099/0027.Remove-Element.md
+++ b/website/content/ChapterFour/0001~0099/0027.Remove-Element.md
@@ -91,8 +91,9 @@ func removeElement(nums []int, val int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String.md b/website/content/ChapterFour/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String.md
index ee3577638..172ba27ba 100644
--- a/website/content/ChapterFour/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String.md
+++ b/website/content/ChapterFour/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String.md
@@ -86,8 +86,9 @@ func strStr1(haystack string, needle string) int {
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0029.Divide-Two-Integers.md b/website/content/ChapterFour/0001~0099/0029.Divide-Two-Integers.md
index 72f2e1062..207be9ea8 100755
--- a/website/content/ChapterFour/0001~0099/0029.Divide-Two-Integers.md
+++ b/website/content/ChapterFour/0001~0099/0029.Divide-Two-Integers.md
@@ -148,8 +148,9 @@ func divide1(divided int, divisor int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md b/website/content/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md
index 00b3a0e0d..59c5104d8 100644
--- a/website/content/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md
+++ b/website/content/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md
@@ -98,8 +98,9 @@ func copyMap(s map[string]int) map[string]int {
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0031.Next-Permutation.md b/website/content/ChapterFour/0001~0099/0031.Next-Permutation.md
index 4689e75ba..0b4d30483 100644
--- a/website/content/ChapterFour/0001~0099/0031.Next-Permutation.md
+++ b/website/content/ChapterFour/0001~0099/0031.Next-Permutation.md
@@ -131,8 +131,9 @@ func checkPermutationPossibility(nums []int) (idx int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses.md b/website/content/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses.md
index db8cb726b..2fec511e1 100644
--- a/website/content/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses.md
+++ b/website/content/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses.md
@@ -108,8 +108,9 @@ func longestValidParentheses1(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md b/website/content/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md
index df41f1251..63e39cfe3 100755
--- a/website/content/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md
+++ b/website/content/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md
@@ -78,8 +78,9 @@ func search33(nums []int, target int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md b/website/content/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md
index bed0481ab..1f990a64e 100755
--- a/website/content/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md
+++ b/website/content/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md
@@ -121,8 +121,9 @@ func searchLastLessElement(nums []int, target int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0035.Search-Insert-Position.md b/website/content/ChapterFour/0001~0099/0035.Search-Insert-Position.md
index ec99aca71..67be20995 100755
--- a/website/content/ChapterFour/0001~0099/0035.Search-Insert-Position.md
+++ b/website/content/ChapterFour/0001~0099/0035.Search-Insert-Position.md
@@ -65,8 +65,9 @@ func searchInsert(nums []int, target int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0036.Valid-Sudoku.md b/website/content/ChapterFour/0001~0099/0036.Valid-Sudoku.md
index 68ad64cd1..cb2f0ebe2 100755
--- a/website/content/ChapterFour/0001~0099/0036.Valid-Sudoku.md
+++ b/website/content/ChapterFour/0001~0099/0036.Valid-Sudoku.md
@@ -168,8 +168,9 @@ func isValidSudoku1(board [][]byte) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0037.Sudoku-Solver.md b/website/content/ChapterFour/0001~0099/0037.Sudoku-Solver.md
index 541b4efcf..11fb96a20 100755
--- a/website/content/ChapterFour/0001~0099/0037.Sudoku-Solver.md
+++ b/website/content/ChapterFour/0001~0099/0037.Sudoku-Solver.md
@@ -118,8 +118,9 @@ func checkSudoku(board *[][]byte, pos position, val int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0039.Combination-Sum.md b/website/content/ChapterFour/0001~0099/0039.Combination-Sum.md
index 4681f48b6..f2008846e 100755
--- a/website/content/ChapterFour/0001~0099/0039.Combination-Sum.md
+++ b/website/content/ChapterFour/0001~0099/0039.Combination-Sum.md
@@ -87,8 +87,9 @@ func findcombinationSum(nums []int, target, index int, c []int, res *[][]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0040.Combination-Sum-II.md b/website/content/ChapterFour/0001~0099/0040.Combination-Sum-II.md
index 4a0185edb..95b1172d1 100755
--- a/website/content/ChapterFour/0001~0099/0040.Combination-Sum-II.md
+++ b/website/content/ChapterFour/0001~0099/0040.Combination-Sum-II.md
@@ -89,8 +89,9 @@ func findcombinationSum2(nums []int, target, index int, c []int, res *[][]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0041.First-Missing-Positive.md b/website/content/ChapterFour/0001~0099/0041.First-Missing-Positive.md
index 6ab60da34..d557e502c 100644
--- a/website/content/ChapterFour/0001~0099/0041.First-Missing-Positive.md
+++ b/website/content/ChapterFour/0001~0099/0041.First-Missing-Positive.md
@@ -66,8 +66,9 @@ func firstMissingPositive(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md b/website/content/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md
index be6a256ef..ae61cafe0 100644
--- a/website/content/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md
+++ b/website/content/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md
@@ -61,8 +61,9 @@ func trap(height []int) int {
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0043.Multiply-Strings.md b/website/content/ChapterFour/0001~0099/0043.Multiply-Strings.md
index b807342cf..3232c3a52 100644
--- a/website/content/ChapterFour/0001~0099/0043.Multiply-Strings.md
+++ b/website/content/ChapterFour/0001~0099/0043.Multiply-Strings.md
@@ -66,8 +66,9 @@ func multiply(num1 string, num2 string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0045.Jump-Game-II.md b/website/content/ChapterFour/0001~0099/0045.Jump-Game-II.md
index fc910ad23..e86547457 100644
--- a/website/content/ChapterFour/0001~0099/0045.Jump-Game-II.md
+++ b/website/content/ChapterFour/0001~0099/0045.Jump-Game-II.md
@@ -67,8 +67,9 @@ func jump(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0046.Permutations.md b/website/content/ChapterFour/0001~0099/0046.Permutations.md
index 54fceeeb0..2bf5c5463 100755
--- a/website/content/ChapterFour/0001~0099/0046.Permutations.md
+++ b/website/content/ChapterFour/0001~0099/0046.Permutations.md
@@ -66,8 +66,9 @@ func generatePermutation(nums []int, index int, p []int, res *[][]int, used *[]b
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0047.Permutations-II.md b/website/content/ChapterFour/0001~0099/0047.Permutations-II.md
index e6aaccdff..737971551 100755
--- a/website/content/ChapterFour/0001~0099/0047.Permutations-II.md
+++ b/website/content/ChapterFour/0001~0099/0047.Permutations-II.md
@@ -70,8 +70,9 @@ func generatePermutation47(nums []int, index int, p []int, res *[][]int, used *[
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0048.Rotate-Image.md b/website/content/ChapterFour/0001~0099/0048.Rotate-Image.md
index 4e7a4e0ce..9f936524b 100755
--- a/website/content/ChapterFour/0001~0099/0048.Rotate-Image.md
+++ b/website/content/ChapterFour/0001~0099/0048.Rotate-Image.md
@@ -162,8 +162,9 @@ func reverse(nums []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0049.Group-Anagrams.md b/website/content/ChapterFour/0001~0099/0049.Group-Anagrams.md
index d677466da..0fb814e1d 100644
--- a/website/content/ChapterFour/0001~0099/0049.Group-Anagrams.md
+++ b/website/content/ChapterFour/0001~0099/0049.Group-Anagrams.md
@@ -72,8 +72,9 @@ func groupAnagrams(strs []string) [][]string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0050.Powx-n.md b/website/content/ChapterFour/0001~0099/0050.Powx-n.md
index 714c18617..f9fd69605 100755
--- a/website/content/ChapterFour/0001~0099/0050.Powx-n.md
+++ b/website/content/ChapterFour/0001~0099/0050.Powx-n.md
@@ -69,8 +69,9 @@ func myPow(x float64, n int) float64 {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0051.N-Queens.md b/website/content/ChapterFour/0001~0099/0051.N-Queens.md
index eacce3135..6b7517297 100755
--- a/website/content/ChapterFour/0001~0099/0051.N-Queens.md
+++ b/website/content/ChapterFour/0001~0099/0051.N-Queens.md
@@ -141,8 +141,9 @@ func solveNQueens2(n int) (res [][]string) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0052.N-Queens-II.md b/website/content/ChapterFour/0001~0099/0052.N-Queens-II.md
index 4bf016f13..6406c7698 100755
--- a/website/content/ChapterFour/0001~0099/0052.N-Queens-II.md
+++ b/website/content/ChapterFour/0001~0099/0052.N-Queens-II.md
@@ -107,8 +107,9 @@ func putQueen52(n, index int, col, dia1, dia2 *[]bool, row *[]int, res *int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0053.Maximum-Subarray.md b/website/content/ChapterFour/0001~0099/0053.Maximum-Subarray.md
index a02481277..c8fcd0a35 100755
--- a/website/content/ChapterFour/0001~0099/0053.Maximum-Subarray.md
+++ b/website/content/ChapterFour/0001~0099/0053.Maximum-Subarray.md
@@ -75,8 +75,9 @@ func maxSubArray1(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0054.Spiral-Matrix.md b/website/content/ChapterFour/0001~0099/0054.Spiral-Matrix.md
index 5d75a8e6e..bf53e40c3 100755
--- a/website/content/ChapterFour/0001~0099/0054.Spiral-Matrix.md
+++ b/website/content/ChapterFour/0001~0099/0054.Spiral-Matrix.md
@@ -165,8 +165,9 @@ func spiralOrder2(matrix [][]int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0055.Jump-Game.md b/website/content/ChapterFour/0001~0099/0055.Jump-Game.md
index a34c5d262..ad47c5ed0 100644
--- a/website/content/ChapterFour/0001~0099/0055.Jump-Game.md
+++ b/website/content/ChapterFour/0001~0099/0055.Jump-Game.md
@@ -58,8 +58,9 @@ func canJump(nums []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0056.Merge-Intervals.md b/website/content/ChapterFour/0001~0099/0056.Merge-Intervals.md
index 236c252fc..35ccbb107 100644
--- a/website/content/ChapterFour/0001~0099/0056.Merge-Intervals.md
+++ b/website/content/ChapterFour/0001~0099/0056.Merge-Intervals.md
@@ -109,8 +109,9 @@ func quickSort(a []Interval, lo, hi int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0057.Insert-Interval.md b/website/content/ChapterFour/0001~0099/0057.Insert-Interval.md
index f5eb6964e..1ec4328c1 100644
--- a/website/content/ChapterFour/0001~0099/0057.Insert-Interval.md
+++ b/website/content/ChapterFour/0001~0099/0057.Insert-Interval.md
@@ -75,8 +75,9 @@ func insert(intervals []Interval, newInterval Interval) []Interval {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0058.Length-of-Last-Word.md b/website/content/ChapterFour/0001~0099/0058.Length-of-Last-Word.md
index 3d25cf40d..a736cfa7f 100644
--- a/website/content/ChapterFour/0001~0099/0058.Length-of-Last-Word.md
+++ b/website/content/ChapterFour/0001~0099/0058.Length-of-Last-Word.md
@@ -70,8 +70,9 @@ func lengthOfLastWord(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0059.Spiral-Matrix-II.md b/website/content/ChapterFour/0001~0099/0059.Spiral-Matrix-II.md
index 7d6df02a0..aa3c6935b 100755
--- a/website/content/ChapterFour/0001~0099/0059.Spiral-Matrix-II.md
+++ b/website/content/ChapterFour/0001~0099/0059.Spiral-Matrix-II.md
@@ -94,8 +94,9 @@ func generateMatrix(n int) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0060.Permutation-Sequence.md b/website/content/ChapterFour/0001~0099/0060.Permutation-Sequence.md
index ea18f6956..f78b1fbfc 100755
--- a/website/content/ChapterFour/0001~0099/0060.Permutation-Sequence.md
+++ b/website/content/ChapterFour/0001~0099/0060.Permutation-Sequence.md
@@ -96,8 +96,9 @@ func findPermutation(n, index int, k *int, p []int, res *string, used *[]bool) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0061.Rotate-List.md b/website/content/ChapterFour/0001~0099/0061.Rotate-List.md
index 9a0da026f..730d7eb41 100644
--- a/website/content/ChapterFour/0001~0099/0061.Rotate-List.md
+++ b/website/content/ChapterFour/0001~0099/0061.Rotate-List.md
@@ -81,8 +81,9 @@ func rotateRight(head *ListNode, k int) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0062.Unique-Paths.md b/website/content/ChapterFour/0001~0099/0062.Unique-Paths.md
index fcd62db98..c33e9d320 100755
--- a/website/content/ChapterFour/0001~0099/0062.Unique-Paths.md
+++ b/website/content/ChapterFour/0001~0099/0062.Unique-Paths.md
@@ -67,8 +67,9 @@ func uniquePaths(m int, n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0063.Unique-Paths-II.md b/website/content/ChapterFour/0001~0099/0063.Unique-Paths-II.md
index b5353ca87..9cff38a70 100755
--- a/website/content/ChapterFour/0001~0099/0063.Unique-Paths-II.md
+++ b/website/content/ChapterFour/0001~0099/0063.Unique-Paths-II.md
@@ -80,8 +80,9 @@ func uniquePathsWithObstacles(obstacleGrid [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md b/website/content/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md
index 5f833d874..0cedc287d 100755
--- a/website/content/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md
+++ b/website/content/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md
@@ -93,8 +93,9 @@ func minPathSum1(grid [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0065.Valid-Number.md b/website/content/ChapterFour/0001~0099/0065.Valid-Number.md
index 024f13106..972eeb802 100644
--- a/website/content/ChapterFour/0001~0099/0065.Valid-Number.md
+++ b/website/content/ChapterFour/0001~0099/0065.Valid-Number.md
@@ -78,8 +78,9 @@ func isNumber(s string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0066.Plus-One.md b/website/content/ChapterFour/0001~0099/0066.Plus-One.md
index 37761b545..c8893790d 100755
--- a/website/content/ChapterFour/0001~0099/0066.Plus-One.md
+++ b/website/content/ChapterFour/0001~0099/0066.Plus-One.md
@@ -61,8 +61,9 @@ func plusOne(digits []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0067.Add-Binary.md b/website/content/ChapterFour/0001~0099/0067.Add-Binary.md
index f685c2582..e62fadafd 100644
--- a/website/content/ChapterFour/0001~0099/0067.Add-Binary.md
+++ b/website/content/ChapterFour/0001~0099/0067.Add-Binary.md
@@ -76,8 +76,9 @@ func addBinary(a string, b string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0069.Sqrtx.md b/website/content/ChapterFour/0001~0099/0069.Sqrtx.md
index fc0aba54a..fc10cde6e 100755
--- a/website/content/ChapterFour/0001~0099/0069.Sqrtx.md
+++ b/website/content/ChapterFour/0001~0099/0069.Sqrtx.md
@@ -85,8 +85,9 @@ func mySqrt1(x int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0070.Climbing-Stairs.md b/website/content/ChapterFour/0001~0099/0070.Climbing-Stairs.md
index 274f7e02b..8c20a6400 100755
--- a/website/content/ChapterFour/0001~0099/0070.Climbing-Stairs.md
+++ b/website/content/ChapterFour/0001~0099/0070.Climbing-Stairs.md
@@ -55,8 +55,9 @@ func climbStairs(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0071.Simplify-Path.md b/website/content/ChapterFour/0001~0099/0071.Simplify-Path.md
index 750f72c7f..6f37a0855 100644
--- a/website/content/ChapterFour/0001~0099/0071.Simplify-Path.md
+++ b/website/content/ChapterFour/0001~0099/0071.Simplify-Path.md
@@ -117,8 +117,9 @@ func simplifyPath1(path string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md b/website/content/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md
index faa39f428..a730476b1 100644
--- a/website/content/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md
+++ b/website/content/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md
@@ -104,8 +104,9 @@ func setZeroes(matrix [][]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md b/website/content/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md
index df5886ea8..f8a4fd0ff 100755
--- a/website/content/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md
+++ b/website/content/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md
@@ -72,8 +72,9 @@ func searchMatrix(matrix [][]int, target int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0075.Sort-Colors.md b/website/content/ChapterFour/0001~0099/0075.Sort-Colors.md
index 7a980a932..cb45ea74d 100644
--- a/website/content/ChapterFour/0001~0099/0075.Sort-Colors.md
+++ b/website/content/ChapterFour/0001~0099/0075.Sort-Colors.md
@@ -60,8 +60,9 @@ func sortColors(nums []int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md b/website/content/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md
index ebaaaa47b..973a1d669 100644
--- a/website/content/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md
+++ b/website/content/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md
@@ -75,8 +75,9 @@ func minWindow(s string, t string) string {
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0077.Combinations.md b/website/content/ChapterFour/0001~0099/0077.Combinations.md
index 19ff4112e..87c70158a 100755
--- a/website/content/ChapterFour/0001~0099/0077.Combinations.md
+++ b/website/content/ChapterFour/0001~0099/0077.Combinations.md
@@ -60,8 +60,9 @@ func generateCombinations(n, k, start int, c []int, res *[][]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0078.Subsets.md b/website/content/ChapterFour/0001~0099/0078.Subsets.md
index f0ccb1427..704dc3385 100755
--- a/website/content/ChapterFour/0001~0099/0078.Subsets.md
+++ b/website/content/ChapterFour/0001~0099/0078.Subsets.md
@@ -105,8 +105,9 @@ func subsets2(nums []int) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0079.Word-Search.md b/website/content/ChapterFour/0001~0099/0079.Word-Search.md
index d8d123f48..cf4f34c1b 100755
--- a/website/content/ChapterFour/0001~0099/0079.Word-Search.md
+++ b/website/content/ChapterFour/0001~0099/0079.Word-Search.md
@@ -83,8 +83,9 @@ func searchWord(board [][]byte, visited [][]bool, word string, index, x, y int)
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md b/website/content/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md
index 84a5e631a..146aa173c 100644
--- a/website/content/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md
+++ b/website/content/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md
@@ -85,8 +85,9 @@ func removeDuplicates(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II.md b/website/content/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II.md
index 7ed0474b7..d556ef373 100755
--- a/website/content/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II.md
+++ b/website/content/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II.md
@@ -85,8 +85,9 @@ func search(nums []int, target int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md b/website/content/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md
index 4cbc0bf89..d2d76af16 100644
--- a/website/content/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md
+++ b/website/content/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md
@@ -191,8 +191,9 @@ func deleteDuplicates4(head *ListNode) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List.md b/website/content/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List.md
index 434449c9e..9d0490fef 100644
--- a/website/content/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List.md
+++ b/website/content/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List.md
@@ -66,8 +66,9 @@ func deleteDuplicates(head *ListNode) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram.md b/website/content/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram.md
index c2c9e289c..d19dd96d4 100644
--- a/website/content/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram.md
+++ b/website/content/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram.md
@@ -76,8 +76,9 @@ func max(a int, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0086.Partition-List.md b/website/content/ChapterFour/0001~0099/0086.Partition-List.md
index de6bb8fcc..40faa8f83 100644
--- a/website/content/ChapterFour/0001~0099/0086.Partition-List.md
+++ b/website/content/ChapterFour/0001~0099/0086.Partition-List.md
@@ -148,8 +148,9 @@ func genListNode(head *DoublyListNode) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md b/website/content/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md
index 5c05cffa9..43df692f8 100644
--- a/website/content/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md
+++ b/website/content/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md
@@ -57,8 +57,9 @@ func merge(nums1 []int, m int, nums2 []int, n int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0089.Gray-Code.md b/website/content/ChapterFour/0001~0099/0089.Gray-Code.md
index 63b2e39a4..09b8e9de0 100755
--- a/website/content/ChapterFour/0001~0099/0089.Gray-Code.md
+++ b/website/content/ChapterFour/0001~0099/0089.Gray-Code.md
@@ -117,8 +117,9 @@ func grayCode1(n int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0090.Subsets-II.md b/website/content/ChapterFour/0001~0099/0090.Subsets-II.md
index 73c331b1c..6e448a9e3 100755
--- a/website/content/ChapterFour/0001~0099/0090.Subsets-II.md
+++ b/website/content/ChapterFour/0001~0099/0090.Subsets-II.md
@@ -76,8 +76,9 @@ func generateSubsetsWithDup(nums []int, k, start int, c []int, res *[][]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0091.Decode-Ways.md b/website/content/ChapterFour/0001~0099/0091.Decode-Ways.md
index 7ac985062..6f2328286 100755
--- a/website/content/ChapterFour/0001~0099/0091.Decode-Ways.md
+++ b/website/content/ChapterFour/0001~0099/0091.Decode-Ways.md
@@ -69,8 +69,9 @@ func numDecodings(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0092.Reverse-Linked-List-II.md b/website/content/ChapterFour/0001~0099/0092.Reverse-Linked-List-II.md
index d7f3dc7e3..a80fe9483 100644
--- a/website/content/ChapterFour/0001~0099/0092.Reverse-Linked-List-II.md
+++ b/website/content/ChapterFour/0001~0099/0092.Reverse-Linked-List-II.md
@@ -65,8 +65,9 @@ func reverseBetween(head *ListNode, m int, n int) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0093.Restore-IP-Addresses.md b/website/content/ChapterFour/0001~0099/0093.Restore-IP-Addresses.md
index ba641bfe8..67b8fb50f 100755
--- a/website/content/ChapterFour/0001~0099/0093.Restore-IP-Addresses.md
+++ b/website/content/ChapterFour/0001~0099/0093.Restore-IP-Addresses.md
@@ -78,8 +78,9 @@ func getString(ip []int) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md b/website/content/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md
index 7656edd67..291047cf2 100644
--- a/website/content/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md
+++ b/website/content/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md
@@ -73,8 +73,9 @@ func inorder(root *TreeNode, output *[]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md b/website/content/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md
index 4ba09dfdf..f31d17334 100755
--- a/website/content/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md
+++ b/website/content/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md
@@ -78,8 +78,9 @@ func generateBSTree(start, end int) []*TreeNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md b/website/content/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md
index f98628afc..cb6c11444 100755
--- a/website/content/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md
+++ b/website/content/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md
@@ -53,8 +53,9 @@ func numTrees(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0097.Interleaving-String.md b/website/content/ChapterFour/0001~0099/0097.Interleaving-String.md
index 2b6daae8c..bf954d153 100644
--- a/website/content/ChapterFour/0001~0099/0097.Interleaving-String.md
+++ b/website/content/ChapterFour/0001~0099/0097.Interleaving-String.md
@@ -104,8 +104,9 @@ func dfs(s1, s2, s3 string, p1, p2 int, visited map[int]bool) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md b/website/content/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md
index ffc988c57..7e2915959 100755
--- a/website/content/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md
+++ b/website/content/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md
@@ -99,8 +99,9 @@ func inOrder(root *TreeNode, arr *[]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md b/website/content/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md
index 4a28ea15d..6ce5c8a6e 100755
--- a/website/content/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md
+++ b/website/content/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md
@@ -101,8 +101,9 @@ func inOrderTraverse(root, prev, target1, target2 *TreeNode) (*TreeNode, *TreeNo
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0100.Same-Tree.md b/website/content/ChapterFour/0100~0199/0100.Same-Tree.md
index 90227a8eb..b550523ca 100644
--- a/website/content/ChapterFour/0100~0199/0100.Same-Tree.md
+++ b/website/content/ChapterFour/0100~0199/0100.Same-Tree.md
@@ -92,8 +92,9 @@ func isSameTree(p *TreeNode, q *TreeNode) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0101.Symmetric-Tree.md b/website/content/ChapterFour/0100~0199/0101.Symmetric-Tree.md
index 2b9de1e98..abe2b9870 100644
--- a/website/content/ChapterFour/0100~0199/0101.Symmetric-Tree.md
+++ b/website/content/ChapterFour/0100~0199/0101.Symmetric-Tree.md
@@ -123,8 +123,9 @@ func invertTree(root *TreeNode) *TreeNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md b/website/content/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md
index 68f93c42a..6cd56613b 100644
--- a/website/content/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md
+++ b/website/content/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md
@@ -115,8 +115,9 @@ func levelOrder1(root *TreeNode) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md b/website/content/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md
index 0afad6242..1d9e9f37c 100644
--- a/website/content/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md
+++ b/website/content/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md
@@ -171,8 +171,9 @@ func zigzagLevelOrder1(root *TreeNode) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md b/website/content/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md
index 36d39f9f4..99e3c6dff 100644
--- a/website/content/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md
+++ b/website/content/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md
@@ -60,8 +60,9 @@ func maxDepth(root *TreeNode) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md b/website/content/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md
index 556a6da65..3e5e5e07a 100755
--- a/website/content/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md
+++ b/website/content/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md
@@ -98,8 +98,9 @@ func buildPreIn2TreeDFS(pre []int, preStart int, preEnd int, inStart int, inPos
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md b/website/content/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md
index fe051ed8c..1500dcc2c 100755
--- a/website/content/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md
+++ b/website/content/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md
@@ -98,8 +98,9 @@ func buildInPos2TreeDFS(post []int, postStart int, postEnd int, inStart int, inP
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md b/website/content/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md
index 172e977be..1670bc9e9 100644
--- a/website/content/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md
+++ b/website/content/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md
@@ -70,8 +70,9 @@ func levelOrderBottom(root *TreeNode) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md b/website/content/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md
index 3ed5eb093..e9eaba421 100755
--- a/website/content/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md
+++ b/website/content/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md
@@ -52,8 +52,9 @@ func sortedArrayToBST(nums []int) *TreeNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md b/website/content/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md
index dd85b3b16..44cc37afe 100644
--- a/website/content/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md
+++ b/website/content/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md
@@ -97,8 +97,9 @@ func middleNodeAndPreNode(head *ListNode) (middle *ListNode, pre *ListNode) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md b/website/content/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md
index 3aad94369..3203b1ced 100644
--- a/website/content/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md
+++ b/website/content/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md
@@ -90,8 +90,9 @@ func depth(root *TreeNode) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md b/website/content/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md
index 54530d510..aaa19026c 100755
--- a/website/content/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md
+++ b/website/content/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md
@@ -62,8 +62,9 @@ func minDepth(root *TreeNode) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0112.Path-Sum.md b/website/content/ChapterFour/0100~0199/0112.Path-Sum.md
index 5964900af..055af65da 100755
--- a/website/content/ChapterFour/0100~0199/0112.Path-Sum.md
+++ b/website/content/ChapterFour/0100~0199/0112.Path-Sum.md
@@ -59,8 +59,9 @@ func hasPathSum(root *TreeNode, sum int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0113.Path-Sum-II.md b/website/content/ChapterFour/0100~0199/0113.Path-Sum-II.md
index 2b6927fff..ab23093c6 100755
--- a/website/content/ChapterFour/0100~0199/0113.Path-Sum-II.md
+++ b/website/content/ChapterFour/0100~0199/0113.Path-Sum-II.md
@@ -108,8 +108,9 @@ func pathSum1(root *TreeNode, sum int) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md b/website/content/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md
index a466638e6..94ba1901f 100755
--- a/website/content/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md
+++ b/website/content/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md
@@ -191,8 +191,9 @@ func flatten2(root *TreeNode) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0115.Distinct-Subsequences.md b/website/content/ChapterFour/0100~0199/0115.Distinct-Subsequences.md
index b3baae4d5..aace61aae 100644
--- a/website/content/ChapterFour/0100~0199/0115.Distinct-Subsequences.md
+++ b/website/content/ChapterFour/0100~0199/0115.Distinct-Subsequences.md
@@ -101,8 +101,9 @@ func numDistinct1(s, t string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md b/website/content/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md
index 95b54ea29..2b973ea43 100644
--- a/website/content/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md
+++ b/website/content/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md
@@ -118,8 +118,9 @@ func connectTwoNode(node1, node2 *Node) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0118.Pascals-Triangle.md b/website/content/ChapterFour/0100~0199/0118.Pascals-Triangle.md
index 9dee8ab67..ac2edb2e7 100644
--- a/website/content/ChapterFour/0100~0199/0118.Pascals-Triangle.md
+++ b/website/content/ChapterFour/0100~0199/0118.Pascals-Triangle.md
@@ -60,8 +60,9 @@ func generate(numRows int) [][]int {
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0119.Pascals-Triangle-II.md b/website/content/ChapterFour/0100~0199/0119.Pascals-Triangle-II.md
index 368da337e..8e16d8fde 100644
--- a/website/content/ChapterFour/0100~0199/0119.Pascals-Triangle-II.md
+++ b/website/content/ChapterFour/0100~0199/0119.Pascals-Triangle-II.md
@@ -76,8 +76,9 @@ func getRow(rowIndex int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0120.Triangle.md b/website/content/ChapterFour/0100~0199/0120.Triangle.md
index 83498b7e7..a8058b55d 100755
--- a/website/content/ChapterFour/0100~0199/0120.Triangle.md
+++ b/website/content/ChapterFour/0100~0199/0120.Triangle.md
@@ -89,8 +89,9 @@ func minimumTotal1(triangle [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md b/website/content/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md
index b08d1fd2e..ed767858d 100755
--- a/website/content/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md
+++ b/website/content/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md
@@ -82,8 +82,9 @@ func maxProfit1(prices []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II.md b/website/content/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II.md
index 93d77d36d..794362b2f 100755
--- a/website/content/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II.md
+++ b/website/content/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II.md
@@ -60,8 +60,9 @@ func maxProfit122(prices []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md b/website/content/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md
index 51e96ff61..e2e13c5ed 100755
--- a/website/content/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md
+++ b/website/content/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md
@@ -80,8 +80,9 @@ func getPathSum(root *TreeNode, maxSum *int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0125.Valid-Palindrome.md b/website/content/ChapterFour/0100~0199/0125.Valid-Palindrome.md
index b0c7257ac..589456430 100644
--- a/website/content/ChapterFour/0100~0199/0125.Valid-Palindrome.md
+++ b/website/content/ChapterFour/0100~0199/0125.Valid-Palindrome.md
@@ -67,8 +67,9 @@ func isChar(c byte) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0126.Word-Ladder-II.md b/website/content/ChapterFour/0100~0199/0126.Word-Ladder-II.md
index e1d328a52..5cb6da91a 100755
--- a/website/content/ChapterFour/0100~0199/0126.Word-Ladder-II.md
+++ b/website/content/ChapterFour/0100~0199/0126.Word-Ladder-II.md
@@ -130,8 +130,9 @@ func findLadders(beginWord string, endWord string, wordList []string) [][]string
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0127.Word-Ladder.md b/website/content/ChapterFour/0100~0199/0127.Word-Ladder.md
index 7a7db0e87..1a30b9505 100755
--- a/website/content/ChapterFour/0100~0199/0127.Word-Ladder.md
+++ b/website/content/ChapterFour/0100~0199/0127.Word-Ladder.md
@@ -121,8 +121,9 @@ func getCandidates(word string) []string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md b/website/content/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md
index fddce0f06..c1e5909ff 100755
--- a/website/content/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md
+++ b/website/content/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md
@@ -139,8 +139,9 @@ func longestConsecutive2(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md b/website/content/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md
index 312f4a066..1a8d52bd6 100755
--- a/website/content/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md
+++ b/website/content/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md
@@ -92,8 +92,9 @@ func dfs(root *TreeNode,sum int,res *int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0130.Surrounded-Regions.md b/website/content/ChapterFour/0100~0199/0130.Surrounded-Regions.md
index 279e9551b..65933071b 100755
--- a/website/content/ChapterFour/0100~0199/0130.Surrounded-Regions.md
+++ b/website/content/ChapterFour/0100~0199/0130.Surrounded-Regions.md
@@ -126,8 +126,9 @@ func dfs130(i, j int, board [][]byte) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md b/website/content/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md
index eb77f95c5..bcf2f9eca 100755
--- a/website/content/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md
+++ b/website/content/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md
@@ -121,8 +121,9 @@ func isPal(str string, s, e int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0135.Candy.md b/website/content/ChapterFour/0100~0199/0135.Candy.md
index d2df666b9..47255c509 100644
--- a/website/content/ChapterFour/0100~0199/0135.Candy.md
+++ b/website/content/ChapterFour/0100~0199/0135.Candy.md
@@ -74,8 +74,9 @@ func candy(ratings []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0136.Single-Number.md b/website/content/ChapterFour/0100~0199/0136.Single-Number.md
index a5801d4e1..f4cceaccf 100755
--- a/website/content/ChapterFour/0100~0199/0136.Single-Number.md
+++ b/website/content/ChapterFour/0100~0199/0136.Single-Number.md
@@ -46,8 +46,9 @@ func singleNumber(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0137.Single-Number-II.md b/website/content/ChapterFour/0100~0199/0137.Single-Number-II.md
index 9cbca6720..569c24962 100755
--- a/website/content/ChapterFour/0100~0199/0137.Single-Number-II.md
+++ b/website/content/ChapterFour/0100~0199/0137.Single-Number-II.md
@@ -134,8 +134,9 @@ func singleNumberIIIII1(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0138.Copy-List-With-Random-Pointer.md b/website/content/ChapterFour/0100~0199/0138.Copy-List-With-Random-Pointer.md
index e43924798..c4f49b282 100644
--- a/website/content/ChapterFour/0100~0199/0138.Copy-List-With-Random-Pointer.md
+++ b/website/content/ChapterFour/0100~0199/0138.Copy-List-With-Random-Pointer.md
@@ -130,8 +130,9 @@ func copyNodeToLinkedList(head *Node) *Node {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0141.Linked-List-Cycle.md b/website/content/ChapterFour/0100~0199/0141.Linked-List-Cycle.md
index 96c3310bd..eeaa2d646 100644
--- a/website/content/ChapterFour/0100~0199/0141.Linked-List-Cycle.md
+++ b/website/content/ChapterFour/0100~0199/0141.Linked-List-Cycle.md
@@ -55,8 +55,9 @@ func hasCycle(head *ListNode) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md b/website/content/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md
index 3bd614255..fc33432b7 100644
--- a/website/content/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md
+++ b/website/content/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md
@@ -109,8 +109,9 @@ func hasCycle142(head *ListNode) (bool, *ListNode) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0143.Reorder-List.md b/website/content/ChapterFour/0100~0199/0143.Reorder-List.md
index 4e835246c..b8827658a 100644
--- a/website/content/ChapterFour/0100~0199/0143.Reorder-List.md
+++ b/website/content/ChapterFour/0100~0199/0143.Reorder-List.md
@@ -127,8 +127,9 @@ func listToArray(head *ListNode) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md b/website/content/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md
index 36f8e02f2..11ab60bd4 100644
--- a/website/content/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md
+++ b/website/content/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md
@@ -112,8 +112,9 @@ func preorderTraversal2(root *TreeNode) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md b/website/content/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md
index e688f82f1..ba919155e 100644
--- a/website/content/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md
+++ b/website/content/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md
@@ -71,8 +71,9 @@ func postorder(root *TreeNode, output *[]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0146.LRU-Cache.md b/website/content/ChapterFour/0100~0199/0146.LRU-Cache.md
index 7c60b34f8..c599d7e31 100644
--- a/website/content/ChapterFour/0100~0199/0146.LRU-Cache.md
+++ b/website/content/ChapterFour/0100~0199/0146.LRU-Cache.md
@@ -134,8 +134,9 @@ func (this *LRUCache) Remove(node *Node) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0147.Insertion-Sort-List.md b/website/content/ChapterFour/0100~0199/0147.Insertion-Sort-List.md
index 5ef908560..a3365caae 100644
--- a/website/content/ChapterFour/0100~0199/0147.Insertion-Sort-List.md
+++ b/website/content/ChapterFour/0100~0199/0147.Insertion-Sort-List.md
@@ -77,8 +77,9 @@ func insertionSortList(head *ListNode) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0148.Sort-List.md b/website/content/ChapterFour/0100~0199/0148.Sort-List.md
index f92e2b858..64f0ab521 100644
--- a/website/content/ChapterFour/0100~0199/0148.Sort-List.md
+++ b/website/content/ChapterFour/0100~0199/0148.Sort-List.md
@@ -96,8 +96,9 @@ func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md b/website/content/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md
index 0e4614d5a..93faa29d6 100644
--- a/website/content/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md
+++ b/website/content/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md
@@ -92,8 +92,9 @@ func evalRPN(tokens []string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md b/website/content/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md
index cb2545f17..402277236 100755
--- a/website/content/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md
+++ b/website/content/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md
@@ -82,8 +82,9 @@ func reverse151(m *[]string, i int, j int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0152.Maximum-Product-Subarray.md b/website/content/ChapterFour/0100~0199/0152.Maximum-Product-Subarray.md
index 852c8b8a2..96898d512 100755
--- a/website/content/ChapterFour/0100~0199/0152.Maximum-Product-Subarray.md
+++ b/website/content/ChapterFour/0100~0199/0152.Maximum-Product-Subarray.md
@@ -52,8 +52,9 @@ func maxProduct(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array.md b/website/content/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array.md
index c48a82ae8..9df35d697 100755
--- a/website/content/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array.md
+++ b/website/content/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array.md
@@ -108,8 +108,9 @@ func findMin2(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md b/website/content/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md
index 7d2c1235f..8bab88861 100755
--- a/website/content/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md
+++ b/website/content/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md
@@ -67,8 +67,9 @@ func findMin154(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0155.Min-Stack.md b/website/content/ChapterFour/0100~0199/0155.Min-Stack.md
index 606f65003..2452ad8d2 100644
--- a/website/content/ChapterFour/0100~0199/0155.Min-Stack.md
+++ b/website/content/ChapterFour/0100~0199/0155.Min-Stack.md
@@ -87,8 +87,9 @@ func (this *MinStack) GetMin() int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md b/website/content/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md
index 77ea4b624..fd7775d4a 100644
--- a/website/content/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md
+++ b/website/content/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md
@@ -116,8 +116,9 @@ func getIntersectionNode(headA, headB *ListNode) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0162.Find-Peak-Element.md b/website/content/ChapterFour/0100~0199/0162.Find-Peak-Element.md
index 1c3e810fe..0344ad8a7 100755
--- a/website/content/ChapterFour/0100~0199/0162.Find-Peak-Element.md
+++ b/website/content/ChapterFour/0100~0199/0162.Find-Peak-Element.md
@@ -94,8 +94,9 @@ func findPeakElement1(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0164.Maximum-Gap.md b/website/content/ChapterFour/0100~0199/0164.Maximum-Gap.md
index f5ff4d4aa..eb95ed91b 100644
--- a/website/content/ChapterFour/0100~0199/0164.Maximum-Gap.md
+++ b/website/content/ChapterFour/0100~0199/0164.Maximum-Gap.md
@@ -137,8 +137,9 @@ func max(a int, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0167.Two-Sum-II-Input-array-is-sorted.md b/website/content/ChapterFour/0100~0199/0167.Two-Sum-II-Input-array-is-sorted.md
index 18fd28620..ecd085d4a 100644
--- a/website/content/ChapterFour/0100~0199/0167.Two-Sum-II-Input-array-is-sorted.md
+++ b/website/content/ChapterFour/0100~0199/0167.Two-Sum-II-Input-array-is-sorted.md
@@ -69,8 +69,9 @@ func twoSum167_1(numbers []int, target int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title.md b/website/content/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title.md
index 6cfe377e7..61a4b169b 100644
--- a/website/content/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title.md
+++ b/website/content/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title.md
@@ -80,8 +80,9 @@ func convertToTitle(n int) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0169.Majority-Element.md b/website/content/ChapterFour/0100~0199/0169.Majority-Element.md
index 7c24db72a..3d08b42ee 100755
--- a/website/content/ChapterFour/0100~0199/0169.Majority-Element.md
+++ b/website/content/ChapterFour/0100~0199/0169.Majority-Element.md
@@ -67,8 +67,9 @@ func majorityElement1(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number.md b/website/content/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number.md
index 06ec111e0..183868fef 100644
--- a/website/content/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number.md
+++ b/website/content/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number.md
@@ -67,8 +67,9 @@ func titleToNumber(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0172.Factorial-Trailing-Zeroes.md b/website/content/ChapterFour/0100~0199/0172.Factorial-Trailing-Zeroes.md
index 4ac18a762..9a3294835 100755
--- a/website/content/ChapterFour/0100~0199/0172.Factorial-Trailing-Zeroes.md
+++ b/website/content/ChapterFour/0100~0199/0172.Factorial-Trailing-Zeroes.md
@@ -51,8 +51,9 @@ func trailingZeroes(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator.md b/website/content/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator.md
index 559f61217..ede8cc5f1 100755
--- a/website/content/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator.md
+++ b/website/content/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator.md
@@ -133,8 +133,9 @@ func (pq *PriorityQueueOfInt) Pop() interface{} {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0174.Dungeon-Game.md b/website/content/ChapterFour/0100~0199/0174.Dungeon-Game.md
index 30df3397c..77099f6fa 100755
--- a/website/content/ChapterFour/0100~0199/0174.Dungeon-Game.md
+++ b/website/content/ChapterFour/0100~0199/0174.Dungeon-Game.md
@@ -135,8 +135,9 @@ func canCross(dungeon [][]int, start int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0179.Largest-Number.md b/website/content/ChapterFour/0100~0199/0179.Largest-Number.md
index 09f1a0708..c99b6387b 100644
--- a/website/content/ChapterFour/0100~0199/0179.Largest-Number.md
+++ b/website/content/ChapterFour/0100~0199/0179.Largest-Number.md
@@ -122,8 +122,9 @@ func quickSortString(a []string, lo, hi int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md b/website/content/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md
index 5480f7a72..6d9293ab8 100755
--- a/website/content/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md
+++ b/website/content/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md
@@ -71,8 +71,9 @@ func findRepeatedDnaSequences1(s string) []string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0189.Rotate-Array.md b/website/content/ChapterFour/0100~0199/0189.Rotate-Array.md
index 34733ee96..80b246407 100644
--- a/website/content/ChapterFour/0100~0199/0189.Rotate-Array.md
+++ b/website/content/ChapterFour/0100~0199/0189.Rotate-Array.md
@@ -75,8 +75,9 @@ func rotate1(nums []int, k int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0190.Reverse-Bits.md b/website/content/ChapterFour/0100~0199/0190.Reverse-Bits.md
index d73e2f2f1..e9344bb18 100755
--- a/website/content/ChapterFour/0100~0199/0190.Reverse-Bits.md
+++ b/website/content/ChapterFour/0100~0199/0190.Reverse-Bits.md
@@ -53,8 +53,9 @@ func reverseBits(num uint32) uint32 {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0191.Number-of-1-Bits.md b/website/content/ChapterFour/0100~0199/0191.Number-of-1-Bits.md
index d3a45e1d3..92d156ae9 100755
--- a/website/content/ChapterFour/0100~0199/0191.Number-of-1-Bits.md
+++ b/website/content/ChapterFour/0100~0199/0191.Number-of-1-Bits.md
@@ -65,8 +65,9 @@ func hammingWeight1(num uint32) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0198.House-Robber.md b/website/content/ChapterFour/0100~0199/0198.House-Robber.md
index 2ee3a7a18..89d65ce9e 100755
--- a/website/content/ChapterFour/0100~0199/0198.House-Robber.md
+++ b/website/content/ChapterFour/0100~0199/0198.House-Robber.md
@@ -94,8 +94,9 @@ func rob(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md b/website/content/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md
index 70be59786..4eb408666 100644
--- a/website/content/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md
+++ b/website/content/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md
@@ -74,8 +74,9 @@ func rightSideView(root *TreeNode) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0200.Number-of-Islands.md b/website/content/ChapterFour/0200~0299/0200.Number-of-Islands.md
index 909363570..c79dec877 100755
--- a/website/content/ChapterFour/0200~0299/0200.Number-of-Islands.md
+++ b/website/content/ChapterFour/0200~0299/0200.Number-of-Islands.md
@@ -81,8 +81,9 @@ func searchIslands(grid [][]byte, visited *[][]bool, x, y int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0201.Bitwise-AND-of-Numbers-Range.md b/website/content/ChapterFour/0200~0299/0201.Bitwise-AND-of-Numbers-Range.md
index 6f064185d..8db0ec21a 100755
--- a/website/content/ChapterFour/0200~0299/0201.Bitwise-AND-of-Numbers-Range.md
+++ b/website/content/ChapterFour/0200~0299/0201.Bitwise-AND-of-Numbers-Range.md
@@ -66,8 +66,9 @@ func rangeBitwiseAnd(m int, n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0202.Happy-Number.md b/website/content/ChapterFour/0200~0299/0202.Happy-Number.md
index db82ed58e..1117e4407 100644
--- a/website/content/ChapterFour/0200~0299/0202.Happy-Number.md
+++ b/website/content/ChapterFour/0200~0299/0202.Happy-Number.md
@@ -64,8 +64,9 @@ func getSquareOfDigits(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0203.Remove-Linked-List-Elements.md b/website/content/ChapterFour/0200~0299/0203.Remove-Linked-List-Elements.md
index d86711619..043e511b0 100644
--- a/website/content/ChapterFour/0200~0299/0203.Remove-Linked-List-Elements.md
+++ b/website/content/ChapterFour/0200~0299/0203.Remove-Linked-List-Elements.md
@@ -56,8 +56,9 @@ func removeElements(head *ListNode, val int) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0204.Count-Primes.md b/website/content/ChapterFour/0200~0299/0204.Count-Primes.md
index fe09cb95c..282565617 100755
--- a/website/content/ChapterFour/0200~0299/0204.Count-Primes.md
+++ b/website/content/ChapterFour/0200~0299/0204.Count-Primes.md
@@ -50,8 +50,9 @@ func countPrimes(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0205.Isomorphic-Strings.md b/website/content/ChapterFour/0200~0299/0205.Isomorphic-Strings.md
index 6854aa2a1..06e140908 100644
--- a/website/content/ChapterFour/0200~0299/0205.Isomorphic-Strings.md
+++ b/website/content/ChapterFour/0200~0299/0205.Isomorphic-Strings.md
@@ -90,8 +90,9 @@ func isIsomorphic(s string, t string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0206.Reverse-Linked-List.md b/website/content/ChapterFour/0200~0299/0206.Reverse-Linked-List.md
index 773f955f9..0e042541e 100644
--- a/website/content/ChapterFour/0200~0299/0206.Reverse-Linked-List.md
+++ b/website/content/ChapterFour/0200~0299/0206.Reverse-Linked-List.md
@@ -47,8 +47,9 @@ func reverseList(head *ListNode) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0207.Course-Schedule.md b/website/content/ChapterFour/0200~0299/0207.Course-Schedule.md
index 52442d3c9..c254cf5dc 100755
--- a/website/content/ChapterFour/0200~0299/0207.Course-Schedule.md
+++ b/website/content/ChapterFour/0200~0299/0207.Course-Schedule.md
@@ -82,8 +82,9 @@ func canFinish(n int, pre [][]int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree.md b/website/content/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree.md
index 9f997351b..8605382b4 100755
--- a/website/content/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree.md
+++ b/website/content/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree.md
@@ -99,8 +99,9 @@ func (this *Trie) StartsWith(prefix string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md b/website/content/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md
index 806093aee..0c296af0a 100644
--- a/website/content/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md
+++ b/website/content/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md
@@ -60,8 +60,9 @@ func min(a int, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0210.Course-Schedule-II.md b/website/content/ChapterFour/0200~0299/0210.Course-Schedule-II.md
index 8f73b2405..ea9192a3f 100755
--- a/website/content/ChapterFour/0200~0299/0210.Course-Schedule-II.md
+++ b/website/content/ChapterFour/0200~0299/0210.Course-Schedule-II.md
@@ -80,8 +80,9 @@ func findOrder(numCourses int, prerequisites [][]int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure.md b/website/content/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure.md
index 311a827ce..851ff0383 100755
--- a/website/content/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure.md
+++ b/website/content/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure.md
@@ -95,8 +95,9 @@ func (this *WordDictionary) Search(word string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0212.Word-Search-II.md b/website/content/ChapterFour/0200~0299/0212.Word-Search-II.md
index 69511f5f4..a1557410b 100755
--- a/website/content/ChapterFour/0200~0299/0212.Word-Search-II.md
+++ b/website/content/ChapterFour/0200~0299/0212.Word-Search-II.md
@@ -103,8 +103,9 @@ func searchWord(board [][]byte, visited [][]bool, word string, index, x, y int)
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0213.House-Robber-II.md b/website/content/ChapterFour/0200~0299/0213.House-Robber-II.md
index e108507ba..776f1f852 100755
--- a/website/content/ChapterFour/0200~0299/0213.House-Robber-II.md
+++ b/website/content/ChapterFour/0200~0299/0213.House-Robber-II.md
@@ -70,8 +70,9 @@ func rob213_1(nums []int, start, end int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array.md b/website/content/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array.md
index 0213a51c2..5cbd322c3 100644
--- a/website/content/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array.md
+++ b/website/content/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array.md
@@ -118,8 +118,9 @@ func selectSmallest1(nums []int, l, r, i int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0216.Combination-Sum-III.md b/website/content/ChapterFour/0200~0299/0216.Combination-Sum-III.md
index c6dbd156b..f37b59900 100755
--- a/website/content/ChapterFour/0200~0299/0216.Combination-Sum-III.md
+++ b/website/content/ChapterFour/0200~0299/0216.Combination-Sum-III.md
@@ -73,8 +73,9 @@ func findcombinationSum3(k, target, index int, c []int, res *[][]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0217.Contains-Duplicate.md b/website/content/ChapterFour/0200~0299/0217.Contains-Duplicate.md
index ddb948e79..2e5eb24f0 100644
--- a/website/content/ChapterFour/0200~0299/0217.Contains-Duplicate.md
+++ b/website/content/ChapterFour/0200~0299/0217.Contains-Duplicate.md
@@ -62,8 +62,9 @@ func containsDuplicate(nums []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0218.The-Skyline-Problem.md b/website/content/ChapterFour/0200~0299/0218.The-Skyline-Problem.md
index e563455f6..f270fd6fd 100755
--- a/website/content/ChapterFour/0200~0299/0218.The-Skyline-Problem.md
+++ b/website/content/ChapterFour/0200~0299/0218.The-Skyline-Problem.md
@@ -375,8 +375,9 @@ func (q *IndexMaxPQ) less(i, j int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md b/website/content/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md
index c40808250..5e658bd02 100644
--- a/website/content/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md
+++ b/website/content/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md
@@ -69,8 +69,9 @@ func containsNearbyDuplicate(nums []int, k int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md b/website/content/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md
index b26d478fc..9eca354af 100644
--- a/website/content/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md
+++ b/website/content/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md
@@ -105,8 +105,9 @@ func containsNearbyAlmostDuplicate1(nums []int, k int, t int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md b/website/content/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md
index a7f148ba7..d00d31acf 100644
--- a/website/content/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md
+++ b/website/content/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md
@@ -82,8 +82,9 @@ func countNodes(root *TreeNode) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0223.Rectangle-Area.md b/website/content/ChapterFour/0200~0299/0223.Rectangle-Area.md
index a85324ad1..ee9c0170a 100755
--- a/website/content/ChapterFour/0200~0299/0223.Rectangle-Area.md
+++ b/website/content/ChapterFour/0200~0299/0223.Rectangle-Area.md
@@ -53,8 +53,9 @@ func area(x0, y0, x1, y1 int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0224.Basic-Calculator.md b/website/content/ChapterFour/0200~0299/0224.Basic-Calculator.md
index 3ae0cccf2..bd3f899a5 100755
--- a/website/content/ChapterFour/0200~0299/0224.Basic-Calculator.md
+++ b/website/content/ChapterFour/0200~0299/0224.Basic-Calculator.md
@@ -165,8 +165,9 @@ func isDigital(v byte) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0225.Implement-Stack-using-Queues.md b/website/content/ChapterFour/0200~0299/0225.Implement-Stack-using-Queues.md
index 47b8177c3..1e3109894 100644
--- a/website/content/ChapterFour/0200~0299/0225.Implement-Stack-using-Queues.md
+++ b/website/content/ChapterFour/0200~0299/0225.Implement-Stack-using-Queues.md
@@ -95,8 +95,9 @@ func (this *MyStack) Empty() bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md b/website/content/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md
index d9f53c25f..6a60d56b1 100644
--- a/website/content/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md
+++ b/website/content/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md
@@ -76,8 +76,9 @@ func invertTree(root *TreeNode) *TreeNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0227.Basic-Calculator-II.md b/website/content/ChapterFour/0200~0299/0227.Basic-Calculator-II.md
index d40024449..65c1bd249 100644
--- a/website/content/ChapterFour/0200~0299/0227.Basic-Calculator-II.md
+++ b/website/content/ChapterFour/0200~0299/0227.Basic-Calculator-II.md
@@ -80,8 +80,9 @@ func calculate(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0228.Summary-Ranges.md b/website/content/ChapterFour/0200~0299/0228.Summary-Ranges.md
index 974e066f2..88df707a7 100644
--- a/website/content/ChapterFour/0200~0299/0228.Summary-Ranges.md
+++ b/website/content/ChapterFour/0200~0299/0228.Summary-Ranges.md
@@ -108,8 +108,9 @@ func summaryRanges(nums []int) (ans []string) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0229.Majority-Element-II.md b/website/content/ChapterFour/0200~0299/0229.Majority-Element-II.md
index fb043de6f..1eb2ef7c9 100755
--- a/website/content/ChapterFour/0200~0299/0229.Majority-Element-II.md
+++ b/website/content/ChapterFour/0200~0299/0229.Majority-Element-II.md
@@ -100,8 +100,9 @@ func majorityElement229_1(nums []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST.md b/website/content/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST.md
index 3383a50fb..aa54f3207 100755
--- a/website/content/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST.md
+++ b/website/content/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST.md
@@ -78,8 +78,9 @@ func inorder230(node *TreeNode, k int, count *int, ans *int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0231.Power-of-Two.md b/website/content/ChapterFour/0200~0299/0231.Power-of-Two.md
index 491f55343..1fb834eea 100755
--- a/website/content/ChapterFour/0200~0299/0231.Power-of-Two.md
+++ b/website/content/ChapterFour/0200~0299/0231.Power-of-Two.md
@@ -70,8 +70,9 @@ func isPowerOfTwo3(num int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0232.Implement-Queue-using-Stacks.md b/website/content/ChapterFour/0200~0299/0232.Implement-Queue-using-Stacks.md
index 71e5bc148..1a83ce477 100644
--- a/website/content/ChapterFour/0200~0299/0232.Implement-Queue-using-Stacks.md
+++ b/website/content/ChapterFour/0200~0299/0232.Implement-Queue-using-Stacks.md
@@ -99,8 +99,9 @@ func (this *MyQueue) fromStackToQueue(s, q *[]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md b/website/content/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md
index 2870f9571..1e5433305 100644
--- a/website/content/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md
+++ b/website/content/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md
@@ -131,8 +131,9 @@ func L2ss(head *ListNode) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md b/website/content/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md
index 77f6cdbfa..f20d29be5 100755
--- a/website/content/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md
+++ b/website/content/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md
@@ -72,8 +72,9 @@ func lowestCommonAncestor(root, p, q *TreeNode) *TreeNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md b/website/content/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md
index 302f3f19a..ed21af7ef 100755
--- a/website/content/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md
+++ b/website/content/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md
@@ -72,8 +72,9 @@ func lowestCommonAncestor236(root, p, q *TreeNode) *TreeNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List.md b/website/content/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List.md
index e8690ff52..e6f884732 100644
--- a/website/content/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List.md
+++ b/website/content/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List.md
@@ -94,8 +94,9 @@ func deleteNode(node *ListNode) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0239.Sliding-Window-Maximum.md b/website/content/ChapterFour/0200~0299/0239.Sliding-Window-Maximum.md
index bf2a3a115..fecf05e61 100755
--- a/website/content/ChapterFour/0200~0299/0239.Sliding-Window-Maximum.md
+++ b/website/content/ChapterFour/0200~0299/0239.Sliding-Window-Maximum.md
@@ -95,8 +95,9 @@ func maxSlidingWindow(nums []int, k int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II.md b/website/content/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II.md
index 55f99caf8..bffab99d8 100755
--- a/website/content/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II.md
+++ b/website/content/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II.md
@@ -89,8 +89,9 @@ func searchMatrix2401(matrix [][]int, target int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0242.Valid-Anagram.md b/website/content/ChapterFour/0200~0299/0242.Valid-Anagram.md
index 15f171934..541a29826 100644
--- a/website/content/ChapterFour/0200~0299/0242.Valid-Anagram.md
+++ b/website/content/ChapterFour/0200~0299/0242.Valid-Anagram.md
@@ -91,8 +91,9 @@ func isAnagram1(s string, t string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md b/website/content/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md
index 22b451cee..608bfa809 100755
--- a/website/content/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md
+++ b/website/content/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md
@@ -71,8 +71,9 @@ func binaryTreePaths(root *TreeNode) []string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0258.Add-Digits.md b/website/content/ChapterFour/0200~0299/0258.Add-Digits.md
index 4e0770ad8..a7b7fe487 100644
--- a/website/content/ChapterFour/0200~0299/0258.Add-Digits.md
+++ b/website/content/ChapterFour/0200~0299/0258.Add-Digits.md
@@ -47,8 +47,9 @@ func addDigits(num int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0260.Single-Number-III.md b/website/content/ChapterFour/0200~0299/0260.Single-Number-III.md
index ed2a461b5..73d72a580 100755
--- a/website/content/ChapterFour/0200~0299/0260.Single-Number-III.md
+++ b/website/content/ChapterFour/0200~0299/0260.Single-Number-III.md
@@ -61,8 +61,9 @@ func singleNumberIII(nums []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0263.Ugly-Number.md b/website/content/ChapterFour/0200~0299/0263.Ugly-Number.md
index 5d2ad1e10..ca0c5f741 100644
--- a/website/content/ChapterFour/0200~0299/0263.Ugly-Number.md
+++ b/website/content/ChapterFour/0200~0299/0263.Ugly-Number.md
@@ -72,8 +72,9 @@ func isUgly(num int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0264.Ugly-Number-II.md b/website/content/ChapterFour/0200~0299/0264.Ugly-Number-II.md
index ff68409f4..ed1e16722 100644
--- a/website/content/ChapterFour/0200~0299/0264.Ugly-Number-II.md
+++ b/website/content/ChapterFour/0200~0299/0264.Ugly-Number-II.md
@@ -69,8 +69,9 @@ func min(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0268.Missing-Number.md b/website/content/ChapterFour/0200~0299/0268.Missing-Number.md
index 05d3fe54c..2c4e1c6a2 100755
--- a/website/content/ChapterFour/0200~0299/0268.Missing-Number.md
+++ b/website/content/ChapterFour/0200~0299/0268.Missing-Number.md
@@ -47,8 +47,9 @@ func missingNumber(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0274.H-Index.md b/website/content/ChapterFour/0200~0299/0274.H-Index.md
index 75cf67b16..4076ec044 100644
--- a/website/content/ChapterFour/0200~0299/0274.H-Index.md
+++ b/website/content/ChapterFour/0200~0299/0274.H-Index.md
@@ -78,8 +78,9 @@ func hIndex1(citations []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0275.H-Index-II.md b/website/content/ChapterFour/0200~0299/0275.H-Index-II.md
index 2ab6406b6..3f46f9b37 100755
--- a/website/content/ChapterFour/0200~0299/0275.H-Index-II.md
+++ b/website/content/ChapterFour/0200~0299/0275.H-Index-II.md
@@ -71,8 +71,9 @@ func hIndex275(citations []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0278.First-Bad-Version.md b/website/content/ChapterFour/0200~0299/0278.First-Bad-Version.md
index 36fd27b46..1fb4a250d 100644
--- a/website/content/ChapterFour/0200~0299/0278.First-Bad-Version.md
+++ b/website/content/ChapterFour/0200~0299/0278.First-Bad-Version.md
@@ -62,8 +62,9 @@ func firstBadVersion(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0279.Perfect-Squares.md b/website/content/ChapterFour/0200~0299/0279.Perfect-Squares.md
index 6ef4ffcc9..9ea27a0e1 100644
--- a/website/content/ChapterFour/0200~0299/0279.Perfect-Squares.md
+++ b/website/content/ChapterFour/0200~0299/0279.Perfect-Squares.md
@@ -78,8 +78,9 @@ func checkAnswer4(x int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0283.Move-Zeroes.md b/website/content/ChapterFour/0200~0299/0283.Move-Zeroes.md
index 16c37efae..7f55f62f3 100644
--- a/website/content/ChapterFour/0200~0299/0283.Move-Zeroes.md
+++ b/website/content/ChapterFour/0200~0299/0283.Move-Zeroes.md
@@ -53,8 +53,9 @@ func moveZeroes(nums []int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0284.Peeking-Iterator.md b/website/content/ChapterFour/0200~0299/0284.Peeking-Iterator.md
index 9693b934b..dd5215a05 100644
--- a/website/content/ChapterFour/0200~0299/0284.Peeking-Iterator.md
+++ b/website/content/ChapterFour/0200~0299/0284.Peeking-Iterator.md
@@ -87,8 +87,9 @@ func (this *PeekingIterator) peek() int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md b/website/content/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md
index d3f95b60b..1f7e51fef 100644
--- a/website/content/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md
+++ b/website/content/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md
@@ -107,8 +107,9 @@ func findDuplicate2(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0290.Word-Pattern.md b/website/content/ChapterFour/0200~0299/0290.Word-Pattern.md
index 15b9cdf3b..b85e08a4a 100644
--- a/website/content/ChapterFour/0200~0299/0290.Word-Pattern.md
+++ b/website/content/ChapterFour/0200~0299/0290.Word-Pattern.md
@@ -98,8 +98,9 @@ func wordPattern(pattern string, str string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md b/website/content/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md
index dc86b67fa..45488fcdc 100644
--- a/website/content/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md
+++ b/website/content/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md
@@ -113,8 +113,9 @@ func (this *Codec) deserializeHelper() *TreeNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0200~0299/0299.Bulls-and-Cows.md b/website/content/ChapterFour/0200~0299/0299.Bulls-and-Cows.md
index 10b6261d4..c46bac01d 100644
--- a/website/content/ChapterFour/0200~0299/0299.Bulls-and-Cows.md
+++ b/website/content/ChapterFour/0200~0299/0299.Bulls-and-Cows.md
@@ -114,8 +114,9 @@ func getHint(secret string, guess string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md b/website/content/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md
index 3692985ac..0f73aef1a 100755
--- a/website/content/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md
+++ b/website/content/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md
@@ -80,8 +80,9 @@ func lengthOfLIS1(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses.md b/website/content/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses.md
index db483d160..35f8d608a 100644
--- a/website/content/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses.md
+++ b/website/content/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses.md
@@ -131,8 +131,9 @@ func min(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0303.Range-Sum-Query-Immutable.md b/website/content/ChapterFour/0300~0399/0303.Range-Sum-Query-Immutable.md
index 8b49288ba..58aa43dfb 100755
--- a/website/content/ChapterFour/0300~0399/0303.Range-Sum-Query-Immutable.md
+++ b/website/content/ChapterFour/0300~0399/0303.Range-Sum-Query-Immutable.md
@@ -110,8 +110,9 @@ func (ma *NumArray) SumRange(i int, j int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0304.Range-Sum-Query-2D-Immutable.md b/website/content/ChapterFour/0300~0399/0304.Range-Sum-Query-2D-Immutable.md
index c70fa06cf..70f6759e1 100644
--- a/website/content/ChapterFour/0300~0399/0304.Range-Sum-Query-2D-Immutable.md
+++ b/website/content/ChapterFour/0300~0399/0304.Range-Sum-Query-2D-Immutable.md
@@ -94,8 +94,9 @@ func (this *NumMatrix) SumRegion(row1 int, col1 int, row2 int, col2 int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0306.Additive-Number.md b/website/content/ChapterFour/0300~0399/0306.Additive-Number.md
index d93b46929..55e511c57 100755
--- a/website/content/ChapterFour/0300~0399/0306.Additive-Number.md
+++ b/website/content/ChapterFour/0300~0399/0306.Additive-Number.md
@@ -89,8 +89,9 @@ func recursiveCheck(num string, x1 int, x2 int, left int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0307.Range-Sum-Query-Mutable.md b/website/content/ChapterFour/0300~0399/0307.Range-Sum-Query-Mutable.md
index 50b02e262..1f150fa12 100755
--- a/website/content/ChapterFour/0300~0399/0307.Range-Sum-Query-Mutable.md
+++ b/website/content/ChapterFour/0300~0399/0307.Range-Sum-Query-Mutable.md
@@ -154,8 +154,9 @@ func (this *NumArray) SumRange(i int, j int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md b/website/content/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md
index ebee3b2d3..52bab39ac 100755
--- a/website/content/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md
+++ b/website/content/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md
@@ -84,8 +84,9 @@ func maxProfit309_1(prices []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md b/website/content/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md
index ac37bace0..fc5c25815 100755
--- a/website/content/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md
+++ b/website/content/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md
@@ -117,8 +117,9 @@ func countSmaller1(nums []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md b/website/content/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md
index 436375e9b..5a1e97680 100755
--- a/website/content/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md
+++ b/website/content/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md
@@ -77,8 +77,9 @@ func maxProduct318(words []string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0319.Bulb-Switcher.md b/website/content/ChapterFour/0300~0399/0319.Bulb-Switcher.md
index 5a4e16e1e..f7b061901 100644
--- a/website/content/ChapterFour/0300~0399/0319.Bulb-Switcher.md
+++ b/website/content/ChapterFour/0300~0399/0319.Bulb-Switcher.md
@@ -58,8 +58,9 @@ func bulbSwitch(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0322.Coin-Change.md b/website/content/ChapterFour/0300~0399/0322.Coin-Change.md
index a1bd78323..02dd61d8d 100755
--- a/website/content/ChapterFour/0300~0399/0322.Coin-Change.md
+++ b/website/content/ChapterFour/0300~0399/0322.Coin-Change.md
@@ -61,8 +61,9 @@ func coinChange(coins []int, amount int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0324.Wiggle-Sort-II.md b/website/content/ChapterFour/0300~0399/0324.Wiggle-Sort-II.md
index 5d5a250eb..7d80565cf 100644
--- a/website/content/ChapterFour/0300~0399/0324.Wiggle-Sort-II.md
+++ b/website/content/ChapterFour/0300~0399/0324.Wiggle-Sort-II.md
@@ -263,8 +263,9 @@ func wiggleSort1(nums []int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0326.Power-of-Three.md b/website/content/ChapterFour/0300~0399/0326.Power-of-Three.md
index 99596c264..0a8384133 100755
--- a/website/content/ChapterFour/0300~0399/0326.Power-of-Three.md
+++ b/website/content/ChapterFour/0300~0399/0326.Power-of-Three.md
@@ -77,8 +77,9 @@ func isPowerOfThree2(num int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0327.Count-of-Range-Sum.md b/website/content/ChapterFour/0300~0399/0327.Count-of-Range-Sum.md
index 6b57a221f..5e3bf0ae8 100755
--- a/website/content/ChapterFour/0300~0399/0327.Count-of-Range-Sum.md
+++ b/website/content/ChapterFour/0300~0399/0327.Count-of-Range-Sum.md
@@ -178,8 +178,9 @@ func countRangeSum2(nums []int, lower int, upper int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0328.Odd-Even-Linked-List.md b/website/content/ChapterFour/0300~0399/0328.Odd-Even-Linked-List.md
index dcf9585a7..b85045b02 100644
--- a/website/content/ChapterFour/0300~0399/0328.Odd-Even-Linked-List.md
+++ b/website/content/ChapterFour/0300~0399/0328.Odd-Even-Linked-List.md
@@ -77,8 +77,9 @@ func oddEvenList(head *ListNode) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md b/website/content/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md
index 8369dbdec..da9a52fbb 100755
--- a/website/content/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md
+++ b/website/content/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md
@@ -106,8 +106,9 @@ func searchPath(board, cache [][]int, lastNum, x, y int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md b/website/content/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md
index 5167b2620..2503e2628 100644
--- a/website/content/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md
+++ b/website/content/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md
@@ -85,8 +85,9 @@ func isValidSerialization(preorder string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0337.House-Robber-III.md b/website/content/ChapterFour/0300~0399/0337.House-Robber-III.md
index 08ee691b6..ed193c82c 100644
--- a/website/content/ChapterFour/0300~0399/0337.House-Robber-III.md
+++ b/website/content/ChapterFour/0300~0399/0337.House-Robber-III.md
@@ -73,8 +73,9 @@ func dfsTreeRob(root *TreeNode) (a, b int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0338.Counting-Bits.md b/website/content/ChapterFour/0300~0399/0338.Counting-Bits.md
index d67be88de..cfe3fe9a6 100755
--- a/website/content/ChapterFour/0300~0399/0338.Counting-Bits.md
+++ b/website/content/ChapterFour/0300~0399/0338.Counting-Bits.md
@@ -54,8 +54,9 @@ func countBits(num int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator.md b/website/content/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator.md
index 5f6fa1c79..17afcf75f 100644
--- a/website/content/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator.md
+++ b/website/content/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator.md
@@ -110,8 +110,9 @@ func (this *NestedIterator) HasNext() bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0342.Power-of-Four.md b/website/content/ChapterFour/0300~0399/0342.Power-of-Four.md
index a8a6f3848..a03b95677 100755
--- a/website/content/ChapterFour/0300~0399/0342.Power-of-Four.md
+++ b/website/content/ChapterFour/0300~0399/0342.Power-of-Four.md
@@ -55,8 +55,9 @@ func isPowerOfFour1(num int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0343.Integer-Break.md b/website/content/ChapterFour/0300~0399/0343.Integer-Break.md
index ff492fa2c..a71c53322 100755
--- a/website/content/ChapterFour/0300~0399/0343.Integer-Break.md
+++ b/website/content/ChapterFour/0300~0399/0343.Integer-Break.md
@@ -53,8 +53,9 @@ func integerBreak(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0344.Reverse-String.md b/website/content/ChapterFour/0300~0399/0344.Reverse-String.md
index e2ed876c5..1d48d4195 100644
--- a/website/content/ChapterFour/0300~0399/0344.Reverse-String.md
+++ b/website/content/ChapterFour/0300~0399/0344.Reverse-String.md
@@ -53,8 +53,9 @@ func reverseString(s []byte) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md b/website/content/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md
index 1c87310a9..1c5edbc53 100644
--- a/website/content/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md
+++ b/website/content/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md
@@ -64,8 +64,9 @@ func isVowel(s byte) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md b/website/content/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md
index fc4474815..417320e47 100644
--- a/website/content/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md
+++ b/website/content/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md
@@ -103,8 +103,9 @@ func (pq *PriorityQueue) Pop() interface{} {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md b/website/content/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md
index b57951ab3..2ad07975d 100644
--- a/website/content/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md
+++ b/website/content/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md
@@ -60,8 +60,9 @@ func intersection(nums1 []int, nums2 []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md b/website/content/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md
index b3b3c30b0..96cd20a28 100644
--- a/website/content/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md
+++ b/website/content/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md
@@ -72,8 +72,9 @@ func intersect(nums1 []int, nums2 []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0352.Data-Stream-as-Disjoint-Intervals.md b/website/content/ChapterFour/0300~0399/0352.Data-Stream-as-Disjoint-Intervals.md
index 14899590d..cdff4b51a 100644
--- a/website/content/ChapterFour/0300~0399/0352.Data-Stream-as-Disjoint-Intervals.md
+++ b/website/content/ChapterFour/0300~0399/0352.Data-Stream-as-Disjoint-Intervals.md
@@ -108,8 +108,9 @@ func (this *SummaryRanges) GetIntervals() [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md b/website/content/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md
index af4abd4a2..55bd98b03 100755
--- a/website/content/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md
+++ b/website/content/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md
@@ -82,8 +82,9 @@ func maxEnvelopes(envelopes [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md b/website/content/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md
index 4ae4f41b1..182e12407 100755
--- a/website/content/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md
+++ b/website/content/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md
@@ -61,8 +61,9 @@ func countNumbersWithUniqueDigits(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0367.Valid-Perfect-Square.md b/website/content/ChapterFour/0300~0399/0367.Valid-Perfect-Square.md
index d46d7c8bd..fb6317ac8 100755
--- a/website/content/ChapterFour/0300~0399/0367.Valid-Perfect-Square.md
+++ b/website/content/ChapterFour/0300~0399/0367.Valid-Perfect-Square.md
@@ -57,8 +57,9 @@ func isPerfectSquare(num int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md b/website/content/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md
index b61958e13..b60115151 100644
--- a/website/content/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md
+++ b/website/content/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md
@@ -86,8 +86,9 @@ func largestDivisibleSubset(nums []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0371.Sum-of-Two-Integers.md b/website/content/ChapterFour/0300~0399/0371.Sum-of-Two-Integers.md
index 52a2bb04f..03e36a773 100755
--- a/website/content/ChapterFour/0300~0399/0371.Sum-of-Two-Integers.md
+++ b/website/content/ChapterFour/0300~0399/0371.Sum-of-Two-Integers.md
@@ -47,8 +47,9 @@ func getSum(a int, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0372.Super-Pow.md b/website/content/ChapterFour/0300~0399/0372.Super-Pow.md
index 2e3c2fddc..39329eaf2 100755
--- a/website/content/ChapterFour/0300~0399/0372.Super-Pow.md
+++ b/website/content/ChapterFour/0300~0399/0372.Super-Pow.md
@@ -106,8 +106,9 @@ func superPow1(a int, b []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums.md b/website/content/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums.md
index ff62bbf4f..23978453d 100755
--- a/website/content/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums.md
+++ b/website/content/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums.md
@@ -126,8 +126,9 @@ func kSmallestPairs1(nums1 []int, nums2 []int, k int) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0374.Guess-Number-Higher-or-Lower.md b/website/content/ChapterFour/0300~0399/0374.Guess-Number-Higher-or-Lower.md
index a904fadd8..8a1abc037 100644
--- a/website/content/ChapterFour/0300~0399/0374.Guess-Number-Higher-or-Lower.md
+++ b/website/content/ChapterFour/0300~0399/0374.Guess-Number-Higher-or-Lower.md
@@ -94,8 +94,9 @@ func guess(num int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0376.Wiggle-Subsequence.md b/website/content/ChapterFour/0300~0399/0376.Wiggle-Subsequence.md
index bc9b7c693..d8bf185ed 100644
--- a/website/content/ChapterFour/0300~0399/0376.Wiggle-Subsequence.md
+++ b/website/content/ChapterFour/0300~0399/0376.Wiggle-Subsequence.md
@@ -76,8 +76,9 @@ func wiggleMaxLength(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0377.Combination-Sum-IV.md b/website/content/ChapterFour/0300~0399/0377.Combination-Sum-IV.md
index 5bf89f8b1..786560c7b 100644
--- a/website/content/ChapterFour/0300~0399/0377.Combination-Sum-IV.md
+++ b/website/content/ChapterFour/0300~0399/0377.Combination-Sum-IV.md
@@ -100,8 +100,9 @@ func findcombinationSum4(nums []int, target, index int, c []int, res *int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md b/website/content/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md
index e0b264fbc..09c142f54 100755
--- a/website/content/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md
+++ b/website/content/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md
@@ -135,8 +135,9 @@ func (p *pq) Pop() interface{} {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0382.Linked-List-Random-Node.md b/website/content/ChapterFour/0300~0399/0382.Linked-List-Random-Node.md
index 449c5aaa8..130002c95 100644
--- a/website/content/ChapterFour/0300~0399/0382.Linked-List-Random-Node.md
+++ b/website/content/ChapterFour/0300~0399/0382.Linked-List-Random-Node.md
@@ -105,8 +105,9 @@ func (this *Solution) GetRandom() int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0383.Ransom-Note.md b/website/content/ChapterFour/0300~0399/0383.Ransom-Note.md
index ef5603c7c..de2573b3f 100644
--- a/website/content/ChapterFour/0300~0399/0383.Ransom-Note.md
+++ b/website/content/ChapterFour/0300~0399/0383.Ransom-Note.md
@@ -64,8 +64,9 @@ func canConstruct(ransomNote string, magazine string) bool {
````
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0384.Shuffle-an-Array.md b/website/content/ChapterFour/0300~0399/0384.Shuffle-an-Array.md
index 908f9049c..226469051 100644
--- a/website/content/ChapterFour/0300~0399/0384.Shuffle-an-Array.md
+++ b/website/content/ChapterFour/0300~0399/0384.Shuffle-an-Array.md
@@ -82,8 +82,9 @@ func (this *Solution) Shuffle() []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0385.Mini-Parser.md b/website/content/ChapterFour/0300~0399/0385.Mini-Parser.md
index eff5eb9d9..0838c9700 100755
--- a/website/content/ChapterFour/0300~0399/0385.Mini-Parser.md
+++ b/website/content/ChapterFour/0300~0399/0385.Mini-Parser.md
@@ -175,8 +175,9 @@ func deserialize(s string) *NestedInteger {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0386.Lexicographical-Numbers.md b/website/content/ChapterFour/0300~0399/0386.Lexicographical-Numbers.md
index dc76ab44f..633f379c3 100755
--- a/website/content/ChapterFour/0300~0399/0386.Lexicographical-Numbers.md
+++ b/website/content/ChapterFour/0300~0399/0386.Lexicographical-Numbers.md
@@ -51,8 +51,9 @@ func dfs386(x, n int, res *[]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md b/website/content/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md
index 8f7954da2..edc368f7e 100755
--- a/website/content/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md
+++ b/website/content/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md
@@ -81,8 +81,9 @@ func firstUniqChar1(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0389.Find-the-Difference.md b/website/content/ChapterFour/0300~0399/0389.Find-the-Difference.md
index d21ed2376..374ee5472 100755
--- a/website/content/ChapterFour/0300~0399/0389.Find-the-Difference.md
+++ b/website/content/ChapterFour/0300~0399/0389.Find-the-Difference.md
@@ -48,8 +48,9 @@ func findTheDifference(s string, t string) byte {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0390.Elimination-Game.md b/website/content/ChapterFour/0300~0399/0390.Elimination-Game.md
index d90aca5b9..25962a257 100644
--- a/website/content/ChapterFour/0300~0399/0390.Elimination-Game.md
+++ b/website/content/ChapterFour/0300~0399/0390.Elimination-Game.md
@@ -74,8 +74,9 @@ func lastRemaining(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0391.Perfect-Rectangle.md b/website/content/ChapterFour/0300~0399/0391.Perfect-Rectangle.md
index 3028424f4..1cfde7832 100644
--- a/website/content/ChapterFour/0300~0399/0391.Perfect-Rectangle.md
+++ b/website/content/ChapterFour/0300~0399/0391.Perfect-Rectangle.md
@@ -114,8 +114,9 @@ func max(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0392.Is-Subsequence.md b/website/content/ChapterFour/0300~0399/0392.Is-Subsequence.md
index 459d38068..58950ffe6 100755
--- a/website/content/ChapterFour/0300~0399/0392.Is-Subsequence.md
+++ b/website/content/ChapterFour/0300~0399/0392.Is-Subsequence.md
@@ -80,8 +80,9 @@ func isSubsequence1(s string, t string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0393.UTF-8-Validation.md b/website/content/ChapterFour/0300~0399/0393.UTF-8-Validation.md
index 1275685b2..fc6b471bf 100755
--- a/website/content/ChapterFour/0300~0399/0393.UTF-8-Validation.md
+++ b/website/content/ChapterFour/0300~0399/0393.UTF-8-Validation.md
@@ -105,8 +105,9 @@ func validUtf8(data []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0394.Decode-String.md b/website/content/ChapterFour/0300~0399/0394.Decode-String.md
index febd7d6e1..6007987e9 100644
--- a/website/content/ChapterFour/0300~0399/0394.Decode-String.md
+++ b/website/content/ChapterFour/0300~0399/0394.Decode-String.md
@@ -81,8 +81,9 @@ func decodeString(s string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0395.Longest-Substring-with-At-Least-K-Repeating-Characters.md b/website/content/ChapterFour/0300~0399/0395.Longest-Substring-with-At-Least-K-Repeating-Characters.md
index 5c3966441..8b2d8bbbb 100644
--- a/website/content/ChapterFour/0300~0399/0395.Longest-Substring-with-At-Least-K-Repeating-Characters.md
+++ b/website/content/ChapterFour/0300~0399/0395.Longest-Substring-with-At-Least-K-Repeating-Characters.md
@@ -112,8 +112,9 @@ func longestSubstring1(s string, k int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0396.Rotate-Function.md b/website/content/ChapterFour/0300~0399/0396.Rotate-Function.md
index 95a661c99..b4059b907 100644
--- a/website/content/ChapterFour/0300~0399/0396.Rotate-Function.md
+++ b/website/content/ChapterFour/0300~0399/0396.Rotate-Function.md
@@ -110,8 +110,9 @@ F(k+1) = (k+1)×nums[0] + k×nums[1] + ... + 0×nums[n-1]
循环遍历`0 ≤ k < n`，计算出不同的`F(k)`并不断更新最大值，就能求出`F(0), F(1), ..., F(n-1)`中的最大值。
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0397.Integer-Replacement.md b/website/content/ChapterFour/0300~0399/0397.Integer-Replacement.md
index 92179b94a..746f363a0 100755
--- a/website/content/ChapterFour/0300~0399/0397.Integer-Replacement.md
+++ b/website/content/ChapterFour/0300~0399/0397.Integer-Replacement.md
@@ -86,8 +86,9 @@ func integerReplacement(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0300~0399/0399.Evaluate-Division.md b/website/content/ChapterFour/0300~0399/0399.Evaluate-Division.md
index b1d2a5988..e1ea7d0a0 100755
--- a/website/content/ChapterFour/0300~0399/0399.Evaluate-Division.md
+++ b/website/content/ChapterFour/0300~0399/0399.Evaluate-Division.md
@@ -117,8 +117,9 @@ func calcEquation(equations [][]string, values []float64, queries [][]string) []
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0400.Nth-Digit.md b/website/content/ChapterFour/0400~0499/0400.Nth-Digit.md
index 543559ac1..f8f19c083 100644
--- a/website/content/ChapterFour/0400~0499/0400.Nth-Digit.md
+++ b/website/content/ChapterFour/0400~0499/0400.Nth-Digit.md
@@ -67,8 +67,9 @@ func findNthDigit(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0401.Binary-Watch.md b/website/content/ChapterFour/0400~0499/0401.Binary-Watch.md
index 07ebddf69..9babc8e82 100755
--- a/website/content/ChapterFour/0400~0499/0401.Binary-Watch.md
+++ b/website/content/ChapterFour/0400~0499/0401.Binary-Watch.md
@@ -176,8 +176,9 @@ func findReadBinaryWatchHour(target, index int, c []int, res *[]string) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0402.Remove-K-Digits.md b/website/content/ChapterFour/0400~0499/0402.Remove-K-Digits.md
index 7e3592c6b..ada8a5c9e 100644
--- a/website/content/ChapterFour/0400~0499/0402.Remove-K-Digits.md
+++ b/website/content/ChapterFour/0400~0499/0402.Remove-K-Digits.md
@@ -88,8 +88,9 @@ func removeKdigits(num string, k int) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md b/website/content/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md
index 7e280d0fa..3264f3974 100755
--- a/website/content/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md
+++ b/website/content/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md
@@ -55,8 +55,9 @@ func sumOfLeftLeaves(root *TreeNode) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md b/website/content/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md
index 62615f8d9..7e62f1c60 100755
--- a/website/content/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md
+++ b/website/content/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md
@@ -80,8 +80,9 @@ func toHex(num int) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0409.Longest-Palindrome.md b/website/content/ChapterFour/0400~0499/0409.Longest-Palindrome.md
index 2f6aa28a3..919e26ede 100755
--- a/website/content/ChapterFour/0400~0499/0409.Longest-Palindrome.md
+++ b/website/content/ChapterFour/0400~0499/0409.Longest-Palindrome.md
@@ -57,8 +57,9 @@ func longestPalindrome(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md b/website/content/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md
index c84eebaa0..3a46a3544 100755
--- a/website/content/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md
+++ b/website/content/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md
@@ -92,8 +92,9 @@ func calSum(mid, m int, nums []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0412.Fizz-Buzz.md b/website/content/ChapterFour/0400~0499/0412.Fizz-Buzz.md
index 72ab8c7c3..51bb03b44 100644
--- a/website/content/ChapterFour/0400~0499/0412.Fizz-Buzz.md
+++ b/website/content/ChapterFour/0400~0499/0412.Fizz-Buzz.md
@@ -69,8 +69,9 @@ func fizzBuzz(n int) []string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0413.Arithmetic-Slices.md b/website/content/ChapterFour/0400~0499/0413.Arithmetic-Slices.md
index 7c3ee5097..7e6408174 100644
--- a/website/content/ChapterFour/0400~0499/0413.Arithmetic-Slices.md
+++ b/website/content/ChapterFour/0400~0499/0413.Arithmetic-Slices.md
@@ -64,8 +64,9 @@ func numberOfArithmeticSlices(A []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0414.Third-Maximum-Number.md b/website/content/ChapterFour/0400~0499/0414.Third-Maximum-Number.md
index cf74dd4b9..336abf480 100644
--- a/website/content/ChapterFour/0400~0499/0414.Third-Maximum-Number.md
+++ b/website/content/ChapterFour/0400~0499/0414.Third-Maximum-Number.md
@@ -72,8 +72,9 @@ func thirdMax(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md b/website/content/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md
index 2947ad58f..52e0ce1dc 100755
--- a/website/content/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md
+++ b/website/content/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md
@@ -76,8 +76,9 @@ func canPartition(nums []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow.md b/website/content/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow.md
index c19fb8751..386dd25c7 100644
--- a/website/content/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow.md
+++ b/website/content/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow.md
@@ -92,8 +92,9 @@ func dfs(matrix [][]int, row, col int, visited *[][]bool, height int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0419.Battleships-in-a-Board.md b/website/content/ChapterFour/0400~0499/0419.Battleships-in-a-Board.md
index 505b3ab0a..d06e095a2 100644
--- a/website/content/ChapterFour/0400~0499/0419.Battleships-in-a-Board.md
+++ b/website/content/ChapterFour/0400~0499/0419.Battleships-in-a-Board.md
@@ -51,8 +51,9 @@ Output: 0
统计出所有左方位和上方位为空的战舰个数，即可得到“战舰群”的数量。
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md b/website/content/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md
index 7abc8d853..3c59fbe68 100755
--- a/website/content/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md
+++ b/website/content/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md
@@ -99,8 +99,9 @@ func findMaximumXOR1(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0423.Reconstruct-Original-Digits-from-English.md b/website/content/ChapterFour/0400~0499/0423.Reconstruct-Original-Digits-from-English.md
index 81309c6a0..77340d37d 100644
--- a/website/content/ChapterFour/0400~0499/0423.Reconstruct-Original-Digits-from-English.md
+++ b/website/content/ChapterFour/0400~0499/0423.Reconstruct-Original-Digits-from-English.md
@@ -103,8 +103,9 @@ func convert(b byte, digits []int, s string, num string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md b/website/content/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md
index d9cc7cbe1..6e795ddd8 100644
--- a/website/content/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md
+++ b/website/content/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md
@@ -85,8 +85,9 @@ func max(a int, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0429.N-ary-Tree-Level-Order-Traversal.md b/website/content/ChapterFour/0400~0499/0429.N-ary-Tree-Level-Order-Traversal.md
index ac4fe90a2..50a337246 100644
--- a/website/content/ChapterFour/0400~0499/0429.N-ary-Tree-Level-Order-Traversal.md
+++ b/website/content/ChapterFour/0400~0499/0429.N-ary-Tree-Level-Order-Traversal.md
@@ -85,8 +85,9 @@ func levelOrder(root *Node) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md b/website/content/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md
index 566f2afde..5cc64270d 100755
--- a/website/content/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md
+++ b/website/content/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md
@@ -183,8 +183,9 @@ func convert(gene string) uint32 {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0434.Number-of-Segments-in-a-String.md b/website/content/ChapterFour/0400~0499/0434.Number-of-Segments-in-a-String.md
index 71d45b7d7..d7cf7058d 100644
--- a/website/content/ChapterFour/0400~0499/0434.Number-of-Segments-in-a-String.md
+++ b/website/content/ChapterFour/0400~0499/0434.Number-of-Segments-in-a-String.md
@@ -70,8 +70,9 @@ func countSegments(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md b/website/content/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md
index 17d409ac3..94a26963f 100755
--- a/website/content/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md
+++ b/website/content/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md
@@ -135,8 +135,9 @@ func eraseOverlapIntervals1(intervals [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0436.Find-Right-Interval.md b/website/content/ChapterFour/0400~0499/0436.Find-Right-Interval.md
index d8b2d726f..278f8bb66 100755
--- a/website/content/ChapterFour/0400~0499/0436.Find-Right-Interval.md
+++ b/website/content/ChapterFour/0400~0499/0436.Find-Right-Interval.md
@@ -142,8 +142,9 @@ func searchFirstGreaterInterval(nums []Interval, target int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0437.Path-Sum-III.md b/website/content/ChapterFour/0400~0499/0437.Path-Sum-III.md
index cf8405325..e1be1704e 100755
--- a/website/content/ChapterFour/0400~0499/0437.Path-Sum-III.md
+++ b/website/content/ChapterFour/0400~0499/0437.Path-Sum-III.md
@@ -120,8 +120,9 @@ func findPath437(root *TreeNode, sum int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md b/website/content/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md
index 93d240934..8cd1148fe 100644
--- a/website/content/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md
+++ b/website/content/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md
@@ -106,8 +106,9 @@ func findAnagrams(s string, p string) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0441.Arranging-Coins.md b/website/content/ChapterFour/0400~0499/0441.Arranging-Coins.md
index 33fdee75b..ba7ed8294 100755
--- a/website/content/ChapterFour/0400~0499/0441.Arranging-Coins.md
+++ b/website/content/ChapterFour/0400~0499/0441.Arranging-Coins.md
@@ -75,8 +75,9 @@ func arrangeCoins1(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md b/website/content/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md
index a4156c6fb..c73c95fb7 100644
--- a/website/content/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md
+++ b/website/content/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md
@@ -181,8 +181,9 @@ func pushStack(l *ListNode) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md b/website/content/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md
index 33f3c1fd9..cb8bb781d 100644
--- a/website/content/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md
+++ b/website/content/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md
@@ -66,8 +66,9 @@ func dis(pa, pb []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array.md b/website/content/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array.md
index 29532c7ef..04c423bf7 100644
--- a/website/content/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array.md
+++ b/website/content/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array.md
@@ -57,8 +57,9 @@ func findDisappearedNumbers(nums []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md b/website/content/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md
index 81a8d91a0..055f7acd5 100644
--- a/website/content/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md
+++ b/website/content/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md
@@ -113,8 +113,9 @@ func frequencySort(s string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements.md b/website/content/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements.md
index f868c33a3..941bbfc5b 100644
--- a/website/content/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements.md
+++ b/website/content/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements.md
@@ -51,8 +51,9 @@ func minMoves(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0454.4Sum-II.md b/website/content/ChapterFour/0400~0499/0454.4Sum-II.md
index bccad3d5a..ae6f5aa11 100644
--- a/website/content/ChapterFour/0400~0499/0454.4Sum-II.md
+++ b/website/content/ChapterFour/0400~0499/0454.4Sum-II.md
@@ -65,8 +65,9 @@ func fourSumCount(A []int, B []int, C []int, D []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0455.Assign-Cookies.md b/website/content/ChapterFour/0400~0499/0455.Assign-Cookies.md
index dfd13b3a0..626cf041d 100755
--- a/website/content/ChapterFour/0400~0499/0455.Assign-Cookies.md
+++ b/website/content/ChapterFour/0400~0499/0455.Assign-Cookies.md
@@ -69,8 +69,9 @@ func findContentChildren(g []int, s []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0456.132-Pattern.md b/website/content/ChapterFour/0400~0499/0456.132-Pattern.md
index abd44ce62..01ee700bd 100755
--- a/website/content/ChapterFour/0400~0499/0456.132-Pattern.md
+++ b/website/content/ChapterFour/0400~0499/0456.132-Pattern.md
@@ -101,8 +101,9 @@ func find132pattern1(nums []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0457.Circular-Array-Loop.md b/website/content/ChapterFour/0400~0499/0457.Circular-Array-Loop.md
index d43a50e6e..b82cacc95 100755
--- a/website/content/ChapterFour/0400~0499/0457.Circular-Array-Loop.md
+++ b/website/content/ChapterFour/0400~0499/0457.Circular-Array-Loop.md
@@ -104,8 +104,9 @@ func getNextIndex(nums []int, index int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0458.Poor-Pigs.md b/website/content/ChapterFour/0400~0499/0458.Poor-Pigs.md
index dcccfda06..406290811 100644
--- a/website/content/ChapterFour/0400~0499/0458.Poor-Pigs.md
+++ b/website/content/ChapterFour/0400~0499/0458.Poor-Pigs.md
@@ -77,8 +77,9 @@ func poorPigs(buckets int, minutesToDie int, minutesToTest int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0460.LFU-Cache.md b/website/content/ChapterFour/0400~0499/0460.LFU-Cache.md
index 5692cc711..206444600 100644
--- a/website/content/ChapterFour/0400~0499/0460.LFU-Cache.md
+++ b/website/content/ChapterFour/0400~0499/0460.LFU-Cache.md
@@ -142,8 +142,9 @@ func (this *LFUCache) Put(key int, value int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0461.Hamming-Distance.md b/website/content/ChapterFour/0400~0499/0461.Hamming-Distance.md
index c36e66eb7..c4fe1336f 100755
--- a/website/content/ChapterFour/0400~0499/0461.Hamming-Distance.md
+++ b/website/content/ChapterFour/0400~0499/0461.Hamming-Distance.md
@@ -53,8 +53,9 @@ func hammingDistance(x int, y int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II.md b/website/content/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II.md
index c43b0bdeb..439f1542f 100644
--- a/website/content/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II.md
+++ b/website/content/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II.md
@@ -66,8 +66,9 @@ func minMoves2(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0463.Island-Perimeter.md b/website/content/ChapterFour/0400~0499/0463.Island-Perimeter.md
index 3ac220658..397b1065d 100755
--- a/website/content/ChapterFour/0400~0499/0463.Island-Perimeter.md
+++ b/website/content/ChapterFour/0400~0499/0463.Island-Perimeter.md
@@ -71,8 +71,9 @@ func islandPerimeter(grid [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0470.Implement-Rand10-Using-Rand7.md b/website/content/ChapterFour/0400~0499/0470.Implement-Rand10-Using-Rand7.md
index 3e3ac3826..703906e93 100755
--- a/website/content/ChapterFour/0400~0499/0470.Implement-Rand10-Using-Rand7.md
+++ b/website/content/ChapterFour/0400~0499/0470.Implement-Rand10-Using-Rand7.md
@@ -100,8 +100,9 @@ func rand101() int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md b/website/content/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md
index 5ac15f049..78a039fe2 100644
--- a/website/content/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md
+++ b/website/content/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md
@@ -94,8 +94,9 @@ func dfs(matchsticks []int, cur, group, sum, total int, visited *[]bool) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md b/website/content/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md
index 7cd4969c7..a9e0403a8 100755
--- a/website/content/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md
+++ b/website/content/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md
@@ -78,8 +78,9 @@ func findMaxForm(strs []string, m int, n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0475.Heaters.md b/website/content/ChapterFour/0400~0499/0475.Heaters.md
index 90e81ad35..de168ab59 100755
--- a/website/content/ChapterFour/0400~0499/0475.Heaters.md
+++ b/website/content/ChapterFour/0400~0499/0475.Heaters.md
@@ -122,8 +122,9 @@ func findRadius1(houses []int, heaters []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0476.Number-Complement.md b/website/content/ChapterFour/0400~0499/0476.Number-Complement.md
index 41198d109..02ba595dc 100755
--- a/website/content/ChapterFour/0400~0499/0476.Number-Complement.md
+++ b/website/content/ChapterFour/0400~0499/0476.Number-Complement.md
@@ -68,8 +68,9 @@ func findComplement1(num int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md b/website/content/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md
index 2ac93c9f7..ca38b89ad 100755
--- a/website/content/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md
+++ b/website/content/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md
@@ -66,8 +66,9 @@ func totalHammingDistance1(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0478.Generate-Random-Point-in-a-Circle.md b/website/content/ChapterFour/0400~0499/0478.Generate-Random-Point-in-a-Circle.md
index c76e82fb7..6a6420876 100644
--- a/website/content/ChapterFour/0400~0499/0478.Generate-Random-Point-in-a-Circle.md
+++ b/website/content/ChapterFour/0400~0499/0478.Generate-Random-Point-in-a-Circle.md
@@ -103,8 +103,9 @@ func angle() float64 {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0480.Sliding-Window-Median.md b/website/content/ChapterFour/0400~0499/0480.Sliding-Window-Median.md
index 01e40d5d3..108a3c8db 100755
--- a/website/content/ChapterFour/0400~0499/0480.Sliding-Window-Median.md
+++ b/website/content/ChapterFour/0400~0499/0480.Sliding-Window-Median.md
@@ -276,8 +276,9 @@ func (h *MaxHeapR) Remove(x int) { heap.Push(&h.hpDel, x) }
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0483.Smallest-Good-Base.md b/website/content/ChapterFour/0400~0499/0483.Smallest-Good-Base.md
index 817478cec..8b394452f 100755
--- a/website/content/ChapterFour/0400~0499/0483.Smallest-Good-Base.md
+++ b/website/content/ChapterFour/0400~0499/0483.Smallest-Good-Base.md
@@ -129,8 +129,9 @@ func smallestGoodBase(n string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0485.Max-Consecutive-Ones.md b/website/content/ChapterFour/0400~0499/0485.Max-Consecutive-Ones.md
index dce4ba166..e10b84153 100644
--- a/website/content/ChapterFour/0400~0499/0485.Max-Consecutive-Ones.md
+++ b/website/content/ChapterFour/0400~0499/0485.Max-Consecutive-Ones.md
@@ -59,8 +59,9 @@ func findMaxConsecutiveOnes(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0488.Zuma-Game.md b/website/content/ChapterFour/0400~0499/0488.Zuma-Game.md
index 3b17baa76..56ce14df4 100644
--- a/website/content/ChapterFour/0400~0499/0488.Zuma-Game.md
+++ b/website/content/ChapterFour/0400~0499/0488.Zuma-Game.md
@@ -141,8 +141,9 @@ func del3(str string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0491.Increasing-Subsequences.md b/website/content/ChapterFour/0400~0499/0491.Increasing-Subsequences.md
index c21bad2f2..3f0782a40 100755
--- a/website/content/ChapterFour/0400~0499/0491.Increasing-Subsequences.md
+++ b/website/content/ChapterFour/0400~0499/0491.Increasing-Subsequences.md
@@ -84,8 +84,9 @@ func generateIncSubsets(nums []int, current int, c []int, res *[][]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0492.Construct-the-Rectangle.md b/website/content/ChapterFour/0400~0499/0492.Construct-the-Rectangle.md
index 5e02ec17e..d45043ebd 100644
--- a/website/content/ChapterFour/0400~0499/0492.Construct-the-Rectangle.md
+++ b/website/content/ChapterFour/0400~0499/0492.Construct-the-Rectangle.md
@@ -72,8 +72,9 @@ func constructRectangle(area int) []int {
``
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0493.Reverse-Pairs.md b/website/content/ChapterFour/0400~0499/0493.Reverse-Pairs.md
index 0e53ce7d5..17e81238e 100755
--- a/website/content/ChapterFour/0400~0499/0493.Reverse-Pairs.md
+++ b/website/content/ChapterFour/0400~0499/0493.Reverse-Pairs.md
@@ -156,8 +156,9 @@ func reversePairs2(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0494.Target-Sum.md b/website/content/ChapterFour/0400~0499/0494.Target-Sum.md
index e104ed18a..6f0af32cd 100644
--- a/website/content/ChapterFour/0400~0499/0494.Target-Sum.md
+++ b/website/content/ChapterFour/0400~0499/0494.Target-Sum.md
@@ -108,8 +108,9 @@ func dfsFindTargetSumWays(nums []int, index int, curSum int, S int, res *int, su
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0495.Teemo-Attacking.md b/website/content/ChapterFour/0400~0499/0495.Teemo-Attacking.md
index b575de2cb..8db694943 100644
--- a/website/content/ChapterFour/0400~0499/0495.Teemo-Attacking.md
+++ b/website/content/ChapterFour/0400~0499/0495.Teemo-Attacking.md
@@ -85,8 +85,9 @@ func findPoisonedDuration(timeSeries []int, duration int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md b/website/content/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md
index 1075380ba..e5bf87aec 100644
--- a/website/content/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md
+++ b/website/content/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md
@@ -80,8 +80,9 @@ func nextGreaterElement(nums1 []int, nums2 []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md b/website/content/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md
index 6d6fa225c..acb8b4a39 100755
--- a/website/content/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md
+++ b/website/content/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md
@@ -134,8 +134,9 @@ func (so *Solution497) Pick() []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0400~0499/0498.Diagonal-Traverse.md b/website/content/ChapterFour/0400~0499/0498.Diagonal-Traverse.md
index 454f91cfe..7d5bfda6a 100755
--- a/website/content/ChapterFour/0400~0499/0498.Diagonal-Traverse.md
+++ b/website/content/ChapterFour/0400~0499/0498.Diagonal-Traverse.md
@@ -191,8 +191,9 @@ func addTraverse(matrix [][]int, i, j int, res *[]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0500.Keyboard-Row.md b/website/content/ChapterFour/0500~0599/0500.Keyboard-Row.md
index 9771d2e2c..f97436b2e 100755
--- a/website/content/ChapterFour/0500~0599/0500.Keyboard-Row.md
+++ b/website/content/ChapterFour/0500~0599/0500.Keyboard-Row.md
@@ -62,8 +62,9 @@ func findWords500(words []string) []string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0503.Next-Greater-Element-II.md b/website/content/ChapterFour/0500~0599/0503.Next-Greater-Element-II.md
index 69675aa8d..50976a078 100644
--- a/website/content/ChapterFour/0500~0599/0503.Next-Greater-Element-II.md
+++ b/website/content/ChapterFour/0500~0599/0503.Next-Greater-Element-II.md
@@ -78,8 +78,9 @@ func nextGreaterElements1(nums []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0504.Base-7.md b/website/content/ChapterFour/0500~0599/0504.Base-7.md
index 30b82e50e..dd8410143 100644
--- a/website/content/ChapterFour/0500~0599/0504.Base-7.md
+++ b/website/content/ChapterFour/0500~0599/0504.Base-7.md
@@ -60,8 +60,9 @@ func convertToBase7(num int) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0506.Relative-Ranks.md b/website/content/ChapterFour/0500~0599/0506.Relative-Ranks.md
index 0e1522f5f..b77ac82a4 100644
--- a/website/content/ChapterFour/0500~0599/0506.Relative-Ranks.md
+++ b/website/content/ChapterFour/0500~0599/0506.Relative-Ranks.md
@@ -84,8 +84,9 @@ func findRelativeRanks(score []int) []string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0507.Perfect-Number.md b/website/content/ChapterFour/0500~0599/0507.Perfect-Number.md
index d48f8bd18..834df9c3b 100644
--- a/website/content/ChapterFour/0500~0599/0507.Perfect-Number.md
+++ b/website/content/ChapterFour/0500~0599/0507.Perfect-Number.md
@@ -64,8 +64,9 @@ func checkPerfectNumber_(num int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md b/website/content/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md
index 2467d23f3..4459fb1fe 100755
--- a/website/content/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md
+++ b/website/content/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md
@@ -123,8 +123,9 @@ func findTreeSum(root *TreeNode, fre map[int]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0509.Fibonacci-Number.md b/website/content/ChapterFour/0500~0599/0509.Fibonacci-Number.md
index 55c0de7d7..d8cc85257 100755
--- a/website/content/ChapterFour/0500~0599/0509.Fibonacci-Number.md
+++ b/website/content/ChapterFour/0500~0599/0509.Fibonacci-Number.md
@@ -190,8 +190,9 @@ func fibb(n int) <- chan int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md b/website/content/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md
index bce46e77b..d6b6f0524 100755
--- a/website/content/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md
+++ b/website/content/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md
@@ -112,8 +112,9 @@ func findBottomLeftValue1(root *TreeNode) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md b/website/content/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md
index 063e06f5e..6d2e967c2 100755
--- a/website/content/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md
+++ b/website/content/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md
@@ -115,8 +115,9 @@ func largestValues3(root *TreeNode) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0518.Coin-Change-II.md b/website/content/ChapterFour/0500~0599/0518.Coin-Change-II.md
index 5fc89a1cd..96de65240 100644
--- a/website/content/ChapterFour/0500~0599/0518.Coin-Change-II.md
+++ b/website/content/ChapterFour/0500~0599/0518.Coin-Change-II.md
@@ -73,8 +73,9 @@ func change(amount int, coins []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0519.Random-Flip-Matrix.md b/website/content/ChapterFour/0500~0599/0519.Random-Flip-Matrix.md
index d72da22bb..dc0b9e99d 100644
--- a/website/content/ChapterFour/0500~0599/0519.Random-Flip-Matrix.md
+++ b/website/content/ChapterFour/0500~0599/0519.Random-Flip-Matrix.md
@@ -98,8 +98,9 @@ func (this *Solution) Reset() {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0520.Detect-Capital.md b/website/content/ChapterFour/0500~0599/0520.Detect-Capital.md
index 33791a2ec..f57f4ed5f 100644
--- a/website/content/ChapterFour/0500~0599/0520.Detect-Capital.md
+++ b/website/content/ChapterFour/0500~0599/0520.Detect-Capital.md
@@ -68,8 +68,9 @@ func detectCapitalUse(word string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum.md b/website/content/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum.md
index 671295e2a..6c3318d3b 100644
--- a/website/content/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum.md
+++ b/website/content/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum.md
@@ -75,8 +75,9 @@ func checkSubarraySum(nums []int, k int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md b/website/content/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md
index 51d40043e..445936fe2 100644
--- a/website/content/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md
+++ b/website/content/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md
@@ -76,8 +76,9 @@ func findLongestWord(s string, d []string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0525.Contiguous-Array.md b/website/content/ChapterFour/0500~0599/0525.Contiguous-Array.md
index 412f71fad..4b8b8d0b3 100644
--- a/website/content/ChapterFour/0500~0599/0525.Contiguous-Array.md
+++ b/website/content/ChapterFour/0500~0599/0525.Contiguous-Array.md
@@ -67,8 +67,9 @@ func max(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md b/website/content/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md
index f3188ead0..b02232b7d 100755
--- a/website/content/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md
+++ b/website/content/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md
@@ -110,8 +110,9 @@ func checkDivisible(num, d int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0528.Random-Pick-with-Weight.md b/website/content/ChapterFour/0500~0599/0528.Random-Pick-with-Weight.md
index 3b83ea432..afa2f96c5 100755
--- a/website/content/ChapterFour/0500~0599/0528.Random-Pick-with-Weight.md
+++ b/website/content/ChapterFour/0500~0599/0528.Random-Pick-with-Weight.md
@@ -108,8 +108,9 @@ func (so *Solution528) PickIndex() int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0529.Minesweeper.md b/website/content/ChapterFour/0500~0599/0529.Minesweeper.md
index 88540208a..6605bc17e 100644
--- a/website/content/ChapterFour/0500~0599/0529.Minesweeper.md
+++ b/website/content/ChapterFour/0500~0599/0529.Minesweeper.md
@@ -135,8 +135,9 @@ func isInBoard(board [][]byte, x, y int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST.md b/website/content/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST.md
index 5dcd943f9..e693817c8 100644
--- a/website/content/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST.md
+++ b/website/content/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST.md
@@ -94,8 +94,9 @@ func abs(a int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md b/website/content/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md
index abbfb45ad..444744269 100644
--- a/website/content/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md
+++ b/website/content/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md
@@ -95,8 +95,9 @@ func findPairs(nums []int, k int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL.md b/website/content/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL.md
index edb658941..a756b0cd9 100644
--- a/website/content/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL.md
+++ b/website/content/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL.md
@@ -60,8 +60,9 @@ func (this *Codec) decode(shortUrl string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0537.Complex-Number-Multiplication.md b/website/content/ChapterFour/0500~0599/0537.Complex-Number-Multiplication.md
index 46592cf55..a724f5800 100644
--- a/website/content/ChapterFour/0500~0599/0537.Complex-Number-Multiplication.md
+++ b/website/content/ChapterFour/0500~0599/0537.Complex-Number-Multiplication.md
@@ -73,8 +73,9 @@ func parse(s string) (int, int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md b/website/content/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md
index c69654019..e94a8737d 100644
--- a/website/content/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md
+++ b/website/content/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md
@@ -106,8 +106,9 @@ func dfs538(root *TreeNode, sum *int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0540.Single-Element-in-a-Sorted-Array.md b/website/content/ChapterFour/0500~0599/0540.Single-Element-in-a-Sorted-Array.md
index b092e6466..45b510d25 100644
--- a/website/content/ChapterFour/0500~0599/0540.Single-Element-in-a-Sorted-Array.md
+++ b/website/content/ChapterFour/0500~0599/0540.Single-Element-in-a-Sorted-Array.md
@@ -64,8 +64,9 @@ func singleNonDuplicate(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0541.Reverse-String-II.md b/website/content/ChapterFour/0500~0599/0541.Reverse-String-II.md
index ad726de6d..0f6d95ae2 100755
--- a/website/content/ChapterFour/0500~0599/0541.Reverse-String-II.md
+++ b/website/content/ChapterFour/0500~0599/0541.Reverse-String-II.md
@@ -68,8 +68,9 @@ func revers(s string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0542.01-Matrix.md b/website/content/ChapterFour/0500~0599/0542.01-Matrix.md
index 09f41a810..f4440de88 100755
--- a/website/content/ChapterFour/0500~0599/0542.01-Matrix.md
+++ b/website/content/ChapterFour/0500~0599/0542.01-Matrix.md
@@ -202,8 +202,9 @@ func updateMatrixDP(matrix [][]int) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0543.Diameter-of-Binary-Tree.md b/website/content/ChapterFour/0500~0599/0543.Diameter-of-Binary-Tree.md
index ced821989..847ad6735 100644
--- a/website/content/ChapterFour/0500~0599/0543.Diameter-of-Binary-Tree.md
+++ b/website/content/ChapterFour/0500~0599/0543.Diameter-of-Binary-Tree.md
@@ -87,8 +87,9 @@ func max(a int, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0547.Number-of-Provinces.md b/website/content/ChapterFour/0500~0599/0547.Number-of-Provinces.md
index 60011312f..d07fd3716 100755
--- a/website/content/ChapterFour/0500~0599/0547.Number-of-Provinces.md
+++ b/website/content/ChapterFour/0500~0599/0547.Number-of-Provinces.md
@@ -111,8 +111,9 @@ func dfs547(M [][]int, cur int, visited []bool) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0551.Student-Attendance-Record-I.md b/website/content/ChapterFour/0500~0599/0551.Student-Attendance-Record-I.md
index 6d5a09651..415512b2c 100644
--- a/website/content/ChapterFour/0500~0599/0551.Student-Attendance-Record-I.md
+++ b/website/content/ChapterFour/0500~0599/0551.Student-Attendance-Record-I.md
@@ -86,8 +86,9 @@ func checkRecord(s string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0554.Brick-Wall.md b/website/content/ChapterFour/0500~0599/0554.Brick-Wall.md
index 88f47f615..bc6ab17d4 100644
--- a/website/content/ChapterFour/0500~0599/0554.Brick-Wall.md
+++ b/website/content/ChapterFour/0500~0599/0554.Brick-Wall.md
@@ -68,8 +68,9 @@ func leastBricks(wall [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III.md b/website/content/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III.md
index 0f277d761..ebb5739ac 100755
--- a/website/content/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III.md
+++ b/website/content/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III.md
@@ -57,8 +57,9 @@ func revers(s string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree.md b/website/content/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree.md
index fec8b6e83..28be61b6b 100644
--- a/website/content/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree.md
+++ b/website/content/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree.md
@@ -78,8 +78,9 @@ func bfs(root *Node) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0560.Subarray-Sum-Equals-K.md b/website/content/ChapterFour/0500~0599/0560.Subarray-Sum-Equals-K.md
index 024667f09..a7cedc3b3 100644
--- a/website/content/ChapterFour/0500~0599/0560.Subarray-Sum-Equals-K.md
+++ b/website/content/ChapterFour/0500~0599/0560.Subarray-Sum-Equals-K.md
@@ -58,8 +58,9 @@ func subarraySum(nums []int, k int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0561.Array-Partition.md b/website/content/ChapterFour/0500~0599/0561.Array-Partition.md
index 04b71df09..fb2a9ab68 100644
--- a/website/content/ChapterFour/0500~0599/0561.Array-Partition.md
+++ b/website/content/ChapterFour/0500~0599/0561.Array-Partition.md
@@ -58,8 +58,9 @@ func arrayPairSum(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md b/website/content/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md
index dfe47b0de..9c68a6838 100755
--- a/website/content/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md
+++ b/website/content/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md
@@ -83,8 +83,9 @@ func findTiltDFS(root *TreeNode, sum *int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0566.Reshape-the-Matrix.md b/website/content/ChapterFour/0500~0599/0566.Reshape-the-Matrix.md
index 7097fecec..f5212508b 100755
--- a/website/content/ChapterFour/0500~0599/0566.Reshape-the-Matrix.md
+++ b/website/content/ChapterFour/0500~0599/0566.Reshape-the-Matrix.md
@@ -102,8 +102,9 @@ func reshape(nums [][]int, r, c int) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0567.Permutation-in-String.md b/website/content/ChapterFour/0500~0599/0567.Permutation-in-String.md
index 35262e5db..31beea919 100644
--- a/website/content/ChapterFour/0500~0599/0567.Permutation-in-String.md
+++ b/website/content/ChapterFour/0500~0599/0567.Permutation-in-String.md
@@ -87,8 +87,9 @@ func checkInclusion(s1 string, s2 string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree.md b/website/content/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree.md
index 9781a1795..b013ecc98 100755
--- a/website/content/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree.md
+++ b/website/content/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree.md
@@ -87,8 +87,9 @@ func isSubtree(s *TreeNode, t *TreeNode) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0575.Distribute-Candies.md b/website/content/ChapterFour/0500~0599/0575.Distribute-Candies.md
index cdbf391ed..dfe227dcc 100755
--- a/website/content/ChapterFour/0500~0599/0575.Distribute-Candies.md
+++ b/website/content/ChapterFour/0500~0599/0575.Distribute-Candies.md
@@ -59,8 +59,9 @@ func distributeCandies(candies []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0576.Out-of-Boundary-Paths.md b/website/content/ChapterFour/0500~0599/0576.Out-of-Boundary-Paths.md
index c58ba3fd3..994cd8bea 100644
--- a/website/content/ChapterFour/0500~0599/0576.Out-of-Boundary-Paths.md
+++ b/website/content/ChapterFour/0500~0599/0576.Out-of-Boundary-Paths.md
@@ -89,8 +89,9 @@ func dfs(x, y, maxMove, m, n int, visited [][][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md b/website/content/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md
index 88bece34b..91a23396c 100644
--- a/website/content/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md
+++ b/website/content/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md
@@ -107,8 +107,9 @@ func min(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0583.Delete-Operation-for-Two-Strings.md b/website/content/ChapterFour/0500~0599/0583.Delete-Operation-for-Two-Strings.md
index 98678815b..776bde82a 100644
--- a/website/content/ChapterFour/0500~0599/0583.Delete-Operation-for-Two-Strings.md
+++ b/website/content/ChapterFour/0500~0599/0583.Delete-Operation-for-Two-Strings.md
@@ -78,8 +78,9 @@ func min(x, y int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal.md b/website/content/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal.md
index 0bef5c6a2..79593962a 100644
--- a/website/content/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal.md
+++ b/website/content/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal.md
@@ -90,8 +90,9 @@ func preorderdfs(root *Node, res *[]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md b/website/content/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md
index 963aef862..cb19b17ac 100755
--- a/website/content/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md
+++ b/website/content/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md
@@ -57,8 +57,9 @@ func findLHS(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0598.Range-Addition-II.md b/website/content/ChapterFour/0500~0599/0598.Range-Addition-II.md
index c4ca5720b..a5256d158 100644
--- a/website/content/ChapterFour/0500~0599/0598.Range-Addition-II.md
+++ b/website/content/ChapterFour/0500~0599/0598.Range-Addition-II.md
@@ -82,8 +82,9 @@ func min(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md b/website/content/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md
index a33f1d285..1b1bf55d8 100755
--- a/website/content/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md
+++ b/website/content/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md
@@ -77,8 +77,9 @@ func findRestaurant(list1 []string, list2 []string) []string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0605.Can-Place-Flowers.md b/website/content/ChapterFour/0600~0699/0605.Can-Place-Flowers.md
index fe4ee14a7..40060041b 100644
--- a/website/content/ChapterFour/0600~0699/0605.Can-Place-Flowers.md
+++ b/website/content/ChapterFour/0600~0699/0605.Can-Place-Flowers.md
@@ -60,8 +60,9 @@ func canPlaceFlowers(flowerbed []int, n int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System.md b/website/content/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System.md
index 0e7cc04ab..b375f509f 100644
--- a/website/content/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System.md
+++ b/website/content/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System.md
@@ -93,8 +93,9 @@ func findDuplicate(paths []string) [][]string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md b/website/content/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md
index 417b341fd..2b88749e0 100644
--- a/website/content/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md
+++ b/website/content/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md
@@ -37,8 +37,9 @@ func triangleNumber(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees.md b/website/content/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees.md
index 8e535838c..d1acaad43 100644
--- a/website/content/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees.md
+++ b/website/content/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees.md
@@ -80,8 +80,9 @@ func mergeTrees(root1 *TreeNode, root2 *TreeNode) *TreeNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0622.Design-Circular-Queue.md b/website/content/ChapterFour/0600~0699/0622.Design-Circular-Queue.md
index 54dfe8f24..a67d911de 100644
--- a/website/content/ChapterFour/0600~0699/0622.Design-Circular-Queue.md
+++ b/website/content/ChapterFour/0600~0699/0622.Design-Circular-Queue.md
@@ -147,8 +147,9 @@ func (this *MyCircularQueue) IsFull() bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree.md b/website/content/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree.md
index 356232ccb..891891fc4 100644
--- a/website/content/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree.md
+++ b/website/content/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree.md
@@ -110,8 +110,9 @@ func addTreeRow(root *TreeNode, v, d int, currLevel *int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md b/website/content/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md
index 8eedbe1ea..304e18b65 100755
--- a/website/content/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md
+++ b/website/content/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md
@@ -103,8 +103,9 @@ func maximumProduct1(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0630.Course-Schedule-III.md b/website/content/ChapterFour/0600~0699/0630.Course-Schedule-III.md
index 2179af424..2397a2235 100644
--- a/website/content/ChapterFour/0600~0699/0630.Course-Schedule-III.md
+++ b/website/content/ChapterFour/0600~0699/0630.Course-Schedule-III.md
@@ -96,8 +96,9 @@ func (s *Schedule) Push(x interface{}) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md b/website/content/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md
index def61bb38..8af2ca2ae 100755
--- a/website/content/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md
+++ b/website/content/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md
@@ -113,8 +113,9 @@ func (p SortByVal) Less(i, j int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md b/website/content/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md
index de723caef..2d52c2fa3 100755
--- a/website/content/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md
+++ b/website/content/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md
@@ -53,8 +53,9 @@ func judgeSquareSum(c int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md b/website/content/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md
index ebe7628c7..90d207447 100755
--- a/website/content/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md
+++ b/website/content/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md
@@ -100,8 +100,9 @@ func exclusiveTime(n int, logs []string) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md b/website/content/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md
index 256e1e0b5..9ccd7b3d8 100644
--- a/website/content/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md
+++ b/website/content/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md
@@ -85,8 +85,9 @@ func averageOfLevels(root *TreeNode) []float64 {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0638.Shopping-Offers.md b/website/content/ChapterFour/0600~0699/0638.Shopping-Offers.md
index 292f03ddf..617be013d 100644
--- a/website/content/ChapterFour/0600~0699/0638.Shopping-Offers.md
+++ b/website/content/ChapterFour/0600~0699/0638.Shopping-Offers.md
@@ -129,8 +129,9 @@ func dfsShoppingOffers(price []int, special [][]int, needs []int, pay int, res *
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0643.Maximum-Average-Subarray-I.md b/website/content/ChapterFour/0600~0699/0643.Maximum-Average-Subarray-I.md
index 63ec049f0..cefb16adc 100644
--- a/website/content/ChapterFour/0600~0699/0643.Maximum-Average-Subarray-I.md
+++ b/website/content/ChapterFour/0600~0699/0643.Maximum-Average-Subarray-I.md
@@ -52,8 +52,9 @@ func max(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0645.Set-Mismatch.md b/website/content/ChapterFour/0600~0699/0645.Set-Mismatch.md
index 93d481833..b4f379b90 100755
--- a/website/content/ChapterFour/0600~0699/0645.Set-Mismatch.md
+++ b/website/content/ChapterFour/0600~0699/0645.Set-Mismatch.md
@@ -62,8 +62,9 @@ func findErrorNums(nums []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0647.Palindromic-Substrings.md b/website/content/ChapterFour/0600~0699/0647.Palindromic-Substrings.md
index 10eadcfae..aaaaf9952 100644
--- a/website/content/ChapterFour/0600~0699/0647.Palindromic-Substrings.md
+++ b/website/content/ChapterFour/0600~0699/0647.Palindromic-Substrings.md
@@ -64,8 +64,9 @@ func countPalindrome(s string, left, right int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0648.Replace-Words.md b/website/content/ChapterFour/0600~0699/0648.Replace-Words.md
index e16a17162..c6e02e8d9 100755
--- a/website/content/ChapterFour/0600~0699/0648.Replace-Words.md
+++ b/website/content/ChapterFour/0600~0699/0648.Replace-Words.md
@@ -111,8 +111,9 @@ func replaceWords1(dict []string, sentence string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md b/website/content/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md
index 4d13db566..1d3b865b2 100755
--- a/website/content/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md
+++ b/website/content/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md
@@ -75,8 +75,9 @@ func findTargetDFS(root *TreeNode, k int, m map[int]int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md b/website/content/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md
index 4fe0f821a..c5337cdef 100755
--- a/website/content/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md
+++ b/website/content/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md
@@ -82,8 +82,9 @@ func findClosestElements1(arr []int, k int, x int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0661.Image-Smoother.md b/website/content/ChapterFour/0600~0699/0661.Image-Smoother.md
index 048d5da9d..662fa8bdc 100644
--- a/website/content/ChapterFour/0600~0699/0661.Image-Smoother.md
+++ b/website/content/ChapterFour/0600~0699/0661.Image-Smoother.md
@@ -111,8 +111,9 @@ func smooth(x, y int, M [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md b/website/content/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md
index d7257d840..9e91c3ebd 100755
--- a/website/content/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md
+++ b/website/content/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md
@@ -152,8 +152,9 @@ func widthOfBinaryTree(root *TreeNode) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0665.Non-decreasing-Array.md b/website/content/ChapterFour/0600~0699/0665.Non-decreasing-Array.md
index a698b301f..5f182bf67 100644
--- a/website/content/ChapterFour/0600~0699/0665.Non-decreasing-Array.md
+++ b/website/content/ChapterFour/0600~0699/0665.Non-decreasing-Array.md
@@ -59,8 +59,9 @@ func checkPossibility(nums []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II.md b/website/content/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II.md
index 7417a3ec8..6de910806 100644
--- a/website/content/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II.md
+++ b/website/content/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II.md
@@ -62,8 +62,9 @@ func constructArray(n int, k int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table.md b/website/content/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table.md
index 0dbd4cfdb..ebf503f4a 100755
--- a/website/content/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table.md
+++ b/website/content/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table.md
@@ -84,8 +84,9 @@ func counterKthNum(m, n, mid int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0669.Trim-a-Binary-Search-Tree.md b/website/content/ChapterFour/0600~0699/0669.Trim-a-Binary-Search-Tree.md
index 12b162fbc..1e353dc01 100644
--- a/website/content/ChapterFour/0600~0699/0669.Trim-a-Binary-Search-Tree.md
+++ b/website/content/ChapterFour/0600~0699/0669.Trim-a-Binary-Search-Tree.md
@@ -100,8 +100,9 @@ func trimBST(root *TreeNode, low int, high int) *TreeNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0674.Longest-Continuous-Increasing-Subsequence.md b/website/content/ChapterFour/0600~0699/0674.Longest-Continuous-Increasing-Subsequence.md
index 016217491..ff043ed88 100644
--- a/website/content/ChapterFour/0600~0699/0674.Longest-Continuous-Increasing-Subsequence.md
+++ b/website/content/ChapterFour/0600~0699/0674.Longest-Continuous-Increasing-Subsequence.md
@@ -69,8 +69,9 @@ func max(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary.md b/website/content/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary.md
index 74961388c..2ce76da41 100755
--- a/website/content/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary.md
+++ b/website/content/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary.md
@@ -87,8 +87,9 @@ func (this *MagicDictionary) Search(word string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0677.Map-Sum-Pairs.md b/website/content/ChapterFour/0600~0699/0677.Map-Sum-Pairs.md
index 2fa80a36b..601fa7b32 100644
--- a/website/content/ChapterFour/0600~0699/0677.Map-Sum-Pairs.md
+++ b/website/content/ChapterFour/0600~0699/0677.Map-Sum-Pairs.md
@@ -100,8 +100,9 @@ func (this *MapSum) Sum(prefix string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0682.Baseball-Game.md b/website/content/ChapterFour/0600~0699/0682.Baseball-Game.md
index 17efc69b7..401b93b62 100644
--- a/website/content/ChapterFour/0600~0699/0682.Baseball-Game.md
+++ b/website/content/ChapterFour/0600~0699/0682.Baseball-Game.md
@@ -106,8 +106,9 @@ func calPoints(ops []string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0684.Redundant-Connection.md b/website/content/ChapterFour/0600~0699/0684.Redundant-Connection.md
index 4fff04a31..8925c4796 100755
--- a/website/content/ChapterFour/0600~0699/0684.Redundant-Connection.md
+++ b/website/content/ChapterFour/0600~0699/0684.Redundant-Connection.md
@@ -85,8 +85,9 @@ func findRedundantConnection(edges [][]int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0685.Redundant-Connection-II.md b/website/content/ChapterFour/0600~0699/0685.Redundant-Connection-II.md
index f24a372a4..e37ceebf5 100755
--- a/website/content/ChapterFour/0600~0699/0685.Redundant-Connection-II.md
+++ b/website/content/ChapterFour/0600~0699/0685.Redundant-Connection-II.md
@@ -110,8 +110,9 @@ func findRoot(parent *[]int, k int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0690.Employee-Importance.md b/website/content/ChapterFour/0600~0699/0690.Employee-Importance.md
index df80e9bc7..ae4a8366c 100644
--- a/website/content/ChapterFour/0600~0699/0690.Employee-Importance.md
+++ b/website/content/ChapterFour/0600~0699/0690.Employee-Importance.md
@@ -62,8 +62,9 @@ func getImportance(employees []*Employee, id int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0692.Top-K-Frequent-Words.md b/website/content/ChapterFour/0600~0699/0692.Top-K-Frequent-Words.md
index 1d8f09791..f38b98013 100644
--- a/website/content/ChapterFour/0600~0699/0692.Top-K-Frequent-Words.md
+++ b/website/content/ChapterFour/0600~0699/0692.Top-K-Frequent-Words.md
@@ -98,8 +98,9 @@ func (pq *PQ) Pop() interface{} {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0693.Binary-Number-with-Alternating-Bits.md b/website/content/ChapterFour/0600~0699/0693.Binary-Number-with-Alternating-Bits.md
index b77b30872..35860d83a 100755
--- a/website/content/ChapterFour/0600~0699/0693.Binary-Number-with-Alternating-Bits.md
+++ b/website/content/ChapterFour/0600~0699/0693.Binary-Number-with-Alternating-Bits.md
@@ -80,8 +80,9 @@ func hasAlternatingBits1(n int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0695.Max-Area-of-Island.md b/website/content/ChapterFour/0600~0699/0695.Max-Area-of-Island.md
index 05c391e04..e496260d4 100644
--- a/website/content/ChapterFour/0600~0699/0695.Max-Area-of-Island.md
+++ b/website/content/ChapterFour/0600~0699/0695.Max-Area-of-Island.md
@@ -90,8 +90,9 @@ func areaOfIsland(grid [][]int, x, y int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0696.Count-Binary-Substrings.md b/website/content/ChapterFour/0600~0699/0696.Count-Binary-Substrings.md
index 0bc7aaca8..a2958e3b7 100644
--- a/website/content/ChapterFour/0600~0699/0696.Count-Binary-Substrings.md
+++ b/website/content/ChapterFour/0600~0699/0696.Count-Binary-Substrings.md
@@ -69,8 +69,9 @@ func min(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0697.Degree-of-an-Array.md b/website/content/ChapterFour/0600~0699/0697.Degree-of-an-Array.md
index b9533ece3..3d83ddeee 100644
--- a/website/content/ChapterFour/0600~0699/0697.Degree-of-an-Array.md
+++ b/website/content/ChapterFour/0600~0699/0697.Degree-of-an-Array.md
@@ -80,8 +80,9 @@ func findShortestSubArray(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0600~0699/0699.Falling-Squares.md b/website/content/ChapterFour/0600~0699/0699.Falling-Squares.md
index 83772c54a..08b518d44 100755
--- a/website/content/ChapterFour/0600~0699/0699.Falling-Squares.md
+++ b/website/content/ChapterFour/0600~0699/0699.Falling-Squares.md
@@ -145,8 +145,9 @@ func discretization(positions [][]int) map[int]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0700.Search-in-a-Binary-Search-Tree.md b/website/content/ChapterFour/0700~0799/0700.Search-in-a-Binary-Search-Tree.md
index dd0072acb..860ead94f 100644
--- a/website/content/ChapterFour/0700~0799/0700.Search-in-a-Binary-Search-Tree.md
+++ b/website/content/ChapterFour/0700~0799/0700.Search-in-a-Binary-Search-Tree.md
@@ -73,8 +73,9 @@ func searchBST(root *TreeNode, val int) *TreeNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0701.Insert-into-a-Binary-Search-Tree.md b/website/content/ChapterFour/0700~0799/0701.Insert-into-a-Binary-Search-Tree.md
index bbfc43a22..d32709fb6 100644
--- a/website/content/ChapterFour/0700~0799/0701.Insert-into-a-Binary-Search-Tree.md
+++ b/website/content/ChapterFour/0700~0799/0701.Insert-into-a-Binary-Search-Tree.md
@@ -88,8 +88,9 @@ func insertIntoBST(root *TreeNode, val int) *TreeNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0703.Kth-Largest-Element-in-a-Stream.md b/website/content/ChapterFour/0700~0799/0703.Kth-Largest-Element-in-a-Stream.md
index 0cce2cbfa..c09e8b2f2 100644
--- a/website/content/ChapterFour/0700~0799/0703.Kth-Largest-Element-in-a-Stream.md
+++ b/website/content/ChapterFour/0700~0799/0703.Kth-Largest-Element-in-a-Stream.md
@@ -93,8 +93,9 @@ func (kl *KthLargest) Add(val int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0704.Binary-Search.md b/website/content/ChapterFour/0700~0799/0704.Binary-Search.md
index 383ad604b..6b6134592 100755
--- a/website/content/ChapterFour/0700~0799/0704.Binary-Search.md
+++ b/website/content/ChapterFour/0700~0799/0704.Binary-Search.md
@@ -67,8 +67,9 @@ func search704(nums []int, target int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0705.Design-HashSet.md b/website/content/ChapterFour/0700~0799/0705.Design-HashSet.md
index c535d896a..214d82a9a 100755
--- a/website/content/ChapterFour/0700~0799/0705.Design-HashSet.md
+++ b/website/content/ChapterFour/0700~0799/0705.Design-HashSet.md
@@ -94,8 +94,9 @@ func (this *MyHashSet) Contains(key int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0706.Design-HashMap.md b/website/content/ChapterFour/0700~0799/0706.Design-HashMap.md
index e6b441607..fd3278d26 100755
--- a/website/content/ChapterFour/0700~0799/0706.Design-HashMap.md
+++ b/website/content/ChapterFour/0700~0799/0706.Design-HashMap.md
@@ -151,8 +151,9 @@ func (this *MyHashMap) Hash(value int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0707.Design-Linked-List.md b/website/content/ChapterFour/0700~0799/0707.Design-Linked-List.md
index 93aaf77b9..a288db4b7 100644
--- a/website/content/ChapterFour/0700~0799/0707.Design-Linked-List.md
+++ b/website/content/ChapterFour/0700~0799/0707.Design-Linked-List.md
@@ -156,8 +156,9 @@ func (this *MyLinkedList) DeleteAtIndex(index int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0709.To-Lower-Case.md b/website/content/ChapterFour/0700~0799/0709.To-Lower-Case.md
index b88578cf6..b4cb550f0 100644
--- a/website/content/ChapterFour/0700~0799/0709.To-Lower-Case.md
+++ b/website/content/ChapterFour/0700~0799/0709.To-Lower-Case.md
@@ -55,8 +55,9 @@ func toLowerCase(s string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md b/website/content/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md
index d0e9356c8..7b962d2c9 100644
--- a/website/content/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md
+++ b/website/content/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md
@@ -145,8 +145,9 @@ func (this *Solution) Pick() int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K.md b/website/content/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K.md
index 11c50a4b8..d422a6635 100644
--- a/website/content/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K.md
+++ b/website/content/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K.md
@@ -65,8 +65,9 @@ func numSubarrayProductLessThanK(nums []int, k int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md b/website/content/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md
index 055c8f848..37af91e92 100755
--- a/website/content/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md
+++ b/website/content/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md
@@ -80,8 +80,9 @@ func maxProfit714_1(prices []int, fee int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0715.Range-Module.md b/website/content/ChapterFour/0700~0799/0715.Range-Module.md
index 27defe3dd..85df03092 100755
--- a/website/content/ChapterFour/0700~0799/0715.Range-Module.md
+++ b/website/content/ChapterFour/0700~0799/0715.Range-Module.md
@@ -270,8 +270,9 @@ func query(node *SegmentTreeNode, start, end int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0717.1-bit-and-2-bit-Characters.md b/website/content/ChapterFour/0700~0799/0717.1-bit-and-2-bit-Characters.md
index baf0dc106..cde090698 100755
--- a/website/content/ChapterFour/0700~0799/0717.1-bit-and-2-bit-Characters.md
+++ b/website/content/ChapterFour/0700~0799/0717.1-bit-and-2-bit-Characters.md
@@ -65,8 +65,9 @@ func isOneBitCharacter(bits []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md b/website/content/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md
index 004d6f820..685d27d3c 100755
--- a/website/content/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md
+++ b/website/content/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md
@@ -123,8 +123,9 @@ func findLength1(A []int, B []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md b/website/content/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md
index 3f85a6de9..32cc2e114 100755
--- a/website/content/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md
+++ b/website/content/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md
@@ -97,8 +97,9 @@ func findDistanceCount1(nums []int, num int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md b/website/content/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md
index f35712bb4..9e0345195 100755
--- a/website/content/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md
+++ b/website/content/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md
@@ -72,8 +72,9 @@ func longestWord(words []string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0721.Accounts-Merge.md b/website/content/ChapterFour/0700~0799/0721.Accounts-Merge.md
index a7cb56781..5bb1fd24d 100755
--- a/website/content/ChapterFour/0700~0799/0721.Accounts-Merge.md
+++ b/website/content/ChapterFour/0700~0799/0721.Accounts-Merge.md
@@ -149,8 +149,9 @@ func accountsMerge1(accounts [][]string) [][]string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0724.Find-Pivot-Index.md b/website/content/ChapterFour/0700~0799/0724.Find-Pivot-Index.md
index 23a7aeee6..e04a21807 100644
--- a/website/content/ChapterFour/0700~0799/0724.Find-Pivot-Index.md
+++ b/website/content/ChapterFour/0700~0799/0724.Find-Pivot-Index.md
@@ -74,8 +74,9 @@ func pivotIndex(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0725.Split-Linked-List-in-Parts.md b/website/content/ChapterFour/0700~0799/0725.Split-Linked-List-in-Parts.md
index 310afd70e..97e79f3e0 100644
--- a/website/content/ChapterFour/0700~0799/0725.Split-Linked-List-in-Parts.md
+++ b/website/content/ChapterFour/0700~0799/0725.Split-Linked-List-in-Parts.md
@@ -142,8 +142,9 @@ func getLength(l *ListNode) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0726.Number-of-Atoms.md b/website/content/ChapterFour/0700~0799/0726.Number-of-Atoms.md
index da6ec1a93..82610a800 100755
--- a/website/content/ChapterFour/0700~0799/0726.Number-of-Atoms.md
+++ b/website/content/ChapterFour/0700~0799/0726.Number-of-Atoms.md
@@ -186,8 +186,9 @@ func isLowerLetter(v byte) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0728.Self-Dividing-Numbers.md b/website/content/ChapterFour/0700~0799/0728.Self-Dividing-Numbers.md
index 0a7871712..f445f3aa2 100644
--- a/website/content/ChapterFour/0700~0799/0728.Self-Dividing-Numbers.md
+++ b/website/content/ChapterFour/0700~0799/0728.Self-Dividing-Numbers.md
@@ -68,8 +68,9 @@ func selfDividingNum(num int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0729.My-Calendar-I.md b/website/content/ChapterFour/0700~0799/0729.My-Calendar-I.md
index 0579c76da..9ec13a24a 100755
--- a/website/content/ChapterFour/0700~0799/0729.My-Calendar-I.md
+++ b/website/content/ChapterFour/0700~0799/0729.My-Calendar-I.md
@@ -180,8 +180,9 @@ func (this *MyCalendar) Book(start int, end int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0732.My-Calendar-III.md b/website/content/ChapterFour/0700~0799/0732.My-Calendar-III.md
index 170edfd72..12cd64699 100755
--- a/website/content/ChapterFour/0700~0799/0732.My-Calendar-III.md
+++ b/website/content/ChapterFour/0700~0799/0732.My-Calendar-III.md
@@ -142,8 +142,9 @@ func (st *SegmentTree732) book(start, end int, maxHeight *int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0733.Flood-Fill.md b/website/content/ChapterFour/0700~0799/0733.Flood-Fill.md
index 9fee69a41..93817a3da 100755
--- a/website/content/ChapterFour/0700~0799/0733.Flood-Fill.md
+++ b/website/content/ChapterFour/0700~0799/0733.Flood-Fill.md
@@ -81,8 +81,9 @@ func dfs733(image [][]int, x, y int, newColor int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0735.Asteroid-Collision.md b/website/content/ChapterFour/0700~0799/0735.Asteroid-Collision.md
index 7a9227f5f..f3a911ac3 100644
--- a/website/content/ChapterFour/0700~0799/0735.Asteroid-Collision.md
+++ b/website/content/ChapterFour/0700~0799/0735.Asteroid-Collision.md
@@ -105,8 +105,9 @@ func asteroidCollision(asteroids []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0739.Daily-Temperatures.md b/website/content/ChapterFour/0700~0799/0739.Daily-Temperatures.md
index 4a15a20bd..f76743111 100644
--- a/website/content/ChapterFour/0700~0799/0739.Daily-Temperatures.md
+++ b/website/content/ChapterFour/0700~0799/0739.Daily-Temperatures.md
@@ -59,8 +59,9 @@ func dailyTemperatures1(T []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target.md b/website/content/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target.md
index daa8ce502..617cbeb5c 100755
--- a/website/content/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target.md
+++ b/website/content/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target.md
@@ -92,8 +92,9 @@ func nextGreatestLetter(letters []byte, target byte) byte {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0745.Prefix-and-Suffix-Search.md b/website/content/ChapterFour/0700~0799/0745.Prefix-and-Suffix-Search.md
index 6934034ef..3b61812af 100755
--- a/website/content/ChapterFour/0700~0799/0745.Prefix-and-Suffix-Search.md
+++ b/website/content/ChapterFour/0700~0799/0745.Prefix-and-Suffix-Search.md
@@ -98,8 +98,9 @@ func (this *WordFilter_) F_(prefix string, suffix string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md b/website/content/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md
index b4f00e291..eec711c6d 100755
--- a/website/content/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md
+++ b/website/content/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md
@@ -71,8 +71,9 @@ func minCostClimbingStairs1(cost []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0747.Largest-Number-At-Least-Twice-of-Others.md b/website/content/ChapterFour/0700~0799/0747.Largest-Number-At-Least-Twice-of-Others.md
index 759e8cb7f..e8bd7981c 100644
--- a/website/content/ChapterFour/0700~0799/0747.Largest-Number-At-Least-Twice-of-Others.md
+++ b/website/content/ChapterFour/0700~0799/0747.Largest-Number-At-Least-Twice-of-Others.md
@@ -75,8 +75,9 @@ func dominantIndex(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md b/website/content/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md
index 54e53357a..4d83b2774 100755
--- a/website/content/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md
+++ b/website/content/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md
@@ -102,8 +102,9 @@ func match(lp [26]int, w string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0752.Open-the-Lock.md b/website/content/ChapterFour/0700~0799/0752.Open-the-Lock.md
index 3c442ae7f..0b263557c 100644
--- a/website/content/ChapterFour/0700~0799/0752.Open-the-Lock.md
+++ b/website/content/ChapterFour/0700~0799/0752.Open-the-Lock.md
@@ -131,8 +131,9 @@ func strToInt(str string) int16 {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0753.Cracking-the-Safe.md b/website/content/ChapterFour/0700~0799/0753.Cracking-the-Safe.md
index 3a919ce78..1a068bfc2 100644
--- a/website/content/ChapterFour/0700~0799/0753.Cracking-the-Safe.md
+++ b/website/content/ChapterFour/0700~0799/0753.Cracking-the-Safe.md
@@ -92,8 +92,9 @@ func dfsCrackSafe(depth, n, k int, str *[]byte, visit *map[string]bool) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md b/website/content/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md
index 8694d1fee..b3c27d1ae 100755
--- a/website/content/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md
+++ b/website/content/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md
@@ -92,8 +92,9 @@ func dfsT(bottom, above string, pyramid map[string][]string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md b/website/content/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md
index a4c571cf2..310a7f01f 100755
--- a/website/content/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md
+++ b/website/content/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md
@@ -78,8 +78,9 @@ func isPrime(x int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0763.Partition-Labels.md b/website/content/ChapterFour/0700~0799/0763.Partition-Labels.md
index 68b1b7b24..2df189535 100644
--- a/website/content/ChapterFour/0700~0799/0763.Partition-Labels.md
+++ b/website/content/ChapterFour/0700~0799/0763.Partition-Labels.md
@@ -92,8 +92,9 @@ func partitionLabels1(S string) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md b/website/content/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md
index 988f3eaea..d1910edc3 100755
--- a/website/content/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md
+++ b/website/content/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md
@@ -93,8 +93,9 @@ func minSwapsCouples(row []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0766.Toeplitz-Matrix.md b/website/content/ChapterFour/0700~0799/0766.Toeplitz-Matrix.md
index e18758dac..8e16ce214 100755
--- a/website/content/ChapterFour/0700~0799/0766.Toeplitz-Matrix.md
+++ b/website/content/ChapterFour/0700~0799/0766.Toeplitz-Matrix.md
@@ -79,8 +79,9 @@ func isToeplitzMatrix(matrix [][]int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0767.Reorganize-String.md b/website/content/ChapterFour/0700~0799/0767.Reorganize-String.md
index c3bb92342..6b60641be 100644
--- a/website/content/ChapterFour/0700~0799/0767.Reorganize-String.md
+++ b/website/content/ChapterFour/0700~0799/0767.Reorganize-String.md
@@ -149,8 +149,9 @@ func frequencySort767(s string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0771.Jewels-and-Stones.md b/website/content/ChapterFour/0700~0799/0771.Jewels-and-Stones.md
index 1d6f568c1..ef9f57c53 100755
--- a/website/content/ChapterFour/0700~0799/0771.Jewels-and-Stones.md
+++ b/website/content/ChapterFour/0700~0799/0771.Jewels-and-Stones.md
@@ -74,8 +74,9 @@ func numJewelsInStones1(J string, S string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md b/website/content/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md
index 03345b905..daa9e1cf2 100644
--- a/website/content/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md
+++ b/website/content/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md
@@ -64,8 +64,9 @@ func abs(a int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md b/website/content/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md
index 6ac095ff3..1134f569c 100755
--- a/website/content/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md
+++ b/website/content/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md
@@ -132,8 +132,9 @@ func swimInWater1(grid [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md b/website/content/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md
index cf8d19323..ba3f72e9b 100755
--- a/website/content/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md
+++ b/website/content/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md
@@ -69,8 +69,9 @@ func numRabbits(ans []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes.md b/website/content/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes.md
index ae6f93087..19186b26d 100644
--- a/website/content/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes.md
+++ b/website/content/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes.md
@@ -95,8 +95,9 @@ func abs(a int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md b/website/content/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md
index 5954779f4..9da0fa1f8 100755
--- a/website/content/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md
+++ b/website/content/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md
@@ -120,8 +120,9 @@ func toUpper(s string, i int) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md b/website/content/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md
index 748451eef..521e15360 100644
--- a/website/content/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md
+++ b/website/content/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md
@@ -98,8 +98,9 @@ func dfs(n int, graph [][]int, colors []int, parentCol int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md b/website/content/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md
index ac61759e4..a26c4c104 100755
--- a/website/content/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md
+++ b/website/content/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md
@@ -119,8 +119,9 @@ func (a SortByFraction) Less(i, j int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0791.Custom-Sort-String.md b/website/content/ChapterFour/0700~0799/0791.Custom-Sort-String.md
index 80de5408e..81fdf3d86 100644
--- a/website/content/ChapterFour/0700~0799/0791.Custom-Sort-String.md
+++ b/website/content/ChapterFour/0700~0799/0791.Custom-Sort-String.md
@@ -55,8 +55,9 @@ func customSortString(order string, str string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences.md b/website/content/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences.md
index 9f773b9e2..20719fa98 100644
--- a/website/content/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences.md
+++ b/website/content/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences.md
@@ -66,8 +66,9 @@ func numMatchingSubseq(s string, words []string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function.md b/website/content/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function.md
index deca87330..9845d7790 100755
--- a/website/content/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function.md
+++ b/website/content/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function.md
@@ -101,8 +101,9 @@ func preimageSizeFZF1(K int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0794.Valid-Tic-Tac-Toe-State.md b/website/content/ChapterFour/0700~0799/0794.Valid-Tic-Tac-Toe-State.md
index 6bc24866a..d615dae2c 100644
--- a/website/content/ChapterFour/0700~0799/0794.Valid-Tic-Tac-Toe-State.md
+++ b/website/content/ChapterFour/0700~0799/0794.Valid-Tic-Tac-Toe-State.md
@@ -119,8 +119,9 @@ func process(board []string, c byte) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0700~0799/0795.Number-of-Subarrays-with-Bounded-Maximum.md b/website/content/ChapterFour/0700~0799/0795.Number-of-Subarrays-with-Bounded-Maximum.md
index 3b206fcca..f8d43b034 100644
--- a/website/content/ChapterFour/0700~0799/0795.Number-of-Subarrays-with-Bounded-Maximum.md
+++ b/website/content/ChapterFour/0700~0799/0795.Number-of-Subarrays-with-Bounded-Maximum.md
@@ -54,8 +54,9 @@ func getAnswerPerBound(nums []int, bound int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States.md b/website/content/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States.md
index 1a3d0cd79..7b75647bd 100644
--- a/website/content/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States.md
+++ b/website/content/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States.md
@@ -73,8 +73,9 @@ func dfsEventualSafeNodes(graph [][]int, idx int, color []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit.md b/website/content/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit.md
index f05f3978f..20915be21 100755
--- a/website/content/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit.md
+++ b/website/content/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit.md
@@ -125,8 +125,9 @@ func getUnionFindFromGrid(grid [][]int, x, y int, uf template.UnionFindCount) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0807.Max-Increase-to-Keep-City-Skyline.md b/website/content/ChapterFour/0800~0899/0807.Max-Increase-to-Keep-City-Skyline.md
index cb19b053a..93551b384 100644
--- a/website/content/ChapterFour/0800~0899/0807.Max-Increase-to-Keep-City-Skyline.md
+++ b/website/content/ChapterFour/0800~0899/0807.Max-Increase-to-Keep-City-Skyline.md
@@ -97,8 +97,9 @@ func min(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md b/website/content/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md
index 2c2d62d0f..9cb8bacec 100644
--- a/website/content/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md
+++ b/website/content/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md
@@ -60,8 +60,9 @@ func xorGame(nums []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md b/website/content/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md
index 12232f80e..7f74aa497 100755
--- a/website/content/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md
+++ b/website/content/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md
@@ -143,8 +143,9 @@ func splitDomain(domain string, domains map[string]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md b/website/content/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md
index 6519d1581..6e9966f94 100644
--- a/website/content/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md
+++ b/website/content/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md
@@ -70,8 +70,9 @@ func max(a, b float64) float64 {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0815.Bus-Routes.md b/website/content/ChapterFour/0800~0899/0815.Bus-Routes.md
index 29ab7cfa8..e91b18baa 100755
--- a/website/content/ChapterFour/0800~0899/0815.Bus-Routes.md
+++ b/website/content/ChapterFour/0800~0899/0815.Bus-Routes.md
@@ -88,8 +88,9 @@ func numBusesToDestination(routes [][]int, S int, T int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0816.Ambiguous-Coordinates.md b/website/content/ChapterFour/0800~0899/0816.Ambiguous-Coordinates.md
index 3c10a9ec1..2afc0de01 100644
--- a/website/content/ChapterFour/0800~0899/0816.Ambiguous-Coordinates.md
+++ b/website/content/ChapterFour/0800~0899/0816.Ambiguous-Coordinates.md
@@ -95,8 +95,9 @@ func build(s string) []string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0817.Linked-List-Components.md b/website/content/ChapterFour/0800~0899/0817.Linked-List-Components.md
index 9527d1750..2ec430bf9 100644
--- a/website/content/ChapterFour/0800~0899/0817.Linked-List-Components.md
+++ b/website/content/ChapterFour/0800~0899/0817.Linked-List-Components.md
@@ -109,8 +109,9 @@ func toMap(G []int) map[int]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0819.Most-Common-Word.md b/website/content/ChapterFour/0800~0899/0819.Most-Common-Word.md
index fc0a4bc2d..cdbc59b0b 100755
--- a/website/content/ChapterFour/0800~0899/0819.Most-Common-Word.md
+++ b/website/content/ChapterFour/0800~0899/0819.Most-Common-Word.md
@@ -89,8 +89,9 @@ func mostCommonWord(paragraph string, banned []string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0820.Short-Encoding-of-Words.md b/website/content/ChapterFour/0800~0899/0820.Short-Encoding-of-Words.md
index fcacf0d03..6764441da 100644
--- a/website/content/ChapterFour/0800~0899/0820.Short-Encoding-of-Words.md
+++ b/website/content/ChapterFour/0800~0899/0820.Short-Encoding-of-Words.md
@@ -143,8 +143,9 @@ func minimumLengthEncoding1(words []string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0821.Shortest-Distance-to-a-Character.md b/website/content/ChapterFour/0800~0899/0821.Shortest-Distance-to-a-Character.md
index 1f88563da..10a3cf527 100644
--- a/website/content/ChapterFour/0800~0899/0821.Shortest-Distance-to-a-Character.md
+++ b/website/content/ChapterFour/0800~0899/0821.Shortest-Distance-to-a-Character.md
@@ -102,8 +102,9 @@ func min(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors.md b/website/content/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors.md
index d58e146da..f689e2ce6 100644
--- a/website/content/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors.md
+++ b/website/content/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors.md
@@ -121,8 +121,9 @@ func numFactoredBinaryTrees1(arr []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages.md b/website/content/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages.md
index 4f278efa1..58a099be5 100644
--- a/website/content/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages.md
+++ b/website/content/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages.md
@@ -141,8 +141,9 @@ func numFriendRequests2(ages []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md b/website/content/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md
index fa7464dbd..068934672 100644
--- a/website/content/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md
+++ b/website/content/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md
@@ -107,8 +107,9 @@ func maxProfitAssignment(difficulty []int, profit []int, worker []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md b/website/content/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md
index 6f5f28d42..69f648b0e 100644
--- a/website/content/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md
+++ b/website/content/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md
@@ -101,8 +101,9 @@ func uniqueLetterString1(S string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0830.Positions-of-Large-Groups.md b/website/content/ChapterFour/0800~0899/0830.Positions-of-Large-Groups.md
index 5efa20eda..3d25dd73b 100644
--- a/website/content/ChapterFour/0800~0899/0830.Positions-of-Large-Groups.md
+++ b/website/content/ChapterFour/0800~0899/0830.Positions-of-Large-Groups.md
@@ -80,8 +80,9 @@ func largeGroupPositions(S string) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0832.Flipping-an-Image.md b/website/content/ChapterFour/0800~0899/0832.Flipping-an-Image.md
index 3c3bc5aa9..a92fa04cd 100644
--- a/website/content/ChapterFour/0800~0899/0832.Flipping-an-Image.md
+++ b/website/content/ChapterFour/0800~0899/0832.Flipping-an-Image.md
@@ -63,8 +63,9 @@ func flipAndInvertImage(A [][]int) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md b/website/content/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md
index f4c5a0497..e300d1dbe 100755
--- a/website/content/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md
+++ b/website/content/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md
@@ -101,8 +101,9 @@ func deepSecondSearch(root int, visited []bool, count, res []int, tree [][]int)
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0836.Rectangle-Overlap.md b/website/content/ChapterFour/0800~0899/0836.Rectangle-Overlap.md
index 0475596b1..2582de61a 100755
--- a/website/content/ChapterFour/0800~0899/0836.Rectangle-Overlap.md
+++ b/website/content/ChapterFour/0800~0899/0836.Rectangle-Overlap.md
@@ -54,8 +54,9 @@ func isRectangleOverlap(rec1 []int, rec2 []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0838.Push-Dominoes.md b/website/content/ChapterFour/0800~0899/0838.Push-Dominoes.md
index 773914eff..b9a02b250 100644
--- a/website/content/ChapterFour/0800~0899/0838.Push-Dominoes.md
+++ b/website/content/ChapterFour/0800~0899/0838.Push-Dominoes.md
@@ -144,8 +144,9 @@ func pushDominoes1(dominoes string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0839.Similar-String-Groups.md b/website/content/ChapterFour/0800~0899/0839.Similar-String-Groups.md
index c369de1d9..ac3ded47f 100755
--- a/website/content/ChapterFour/0800~0899/0839.Similar-String-Groups.md
+++ b/website/content/ChapterFour/0800~0899/0839.Similar-String-Groups.md
@@ -98,8 +98,9 @@ func isSimilar(a, b string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0841.Keys-and-Rooms.md b/website/content/ChapterFour/0800~0899/0841.Keys-and-Rooms.md
index 8e4f23f93..82033e9c6 100644
--- a/website/content/ChapterFour/0800~0899/0841.Keys-and-Rooms.md
+++ b/website/content/ChapterFour/0800~0899/0841.Keys-and-Rooms.md
@@ -80,8 +80,9 @@ func dfsVisitAllRooms(es [][]int, visited map[int]bool, from int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md b/website/content/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md
index a50cc2f3f..5faa46b8a 100755
--- a/website/content/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md
+++ b/website/content/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md
@@ -135,8 +135,9 @@ func findRecursiveCheck(S string, x1 int, x2 int, left int, res *[]int, isComple
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0844.Backspace-String-Compare.md b/website/content/ChapterFour/0800~0899/0844.Backspace-String-Compare.md
index 6adcab297..a5bde54d6 100644
--- a/website/content/ChapterFour/0800~0899/0844.Backspace-String-Compare.md
+++ b/website/content/ChapterFour/0800~0899/0844.Backspace-String-Compare.md
@@ -111,8 +111,9 @@ func backspaceCompare(S string, T string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md b/website/content/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md
index 8854bef47..cd7cbafeb 100644
--- a/website/content/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md
+++ b/website/content/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md
@@ -91,8 +91,9 @@ func longestMountain(A []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0846.Hand-of-Straights.md b/website/content/ChapterFour/0800~0899/0846.Hand-of-Straights.md
index f26eb6cc6..ae7c72dc4 100644
--- a/website/content/ChapterFour/0800~0899/0846.Hand-of-Straights.md
+++ b/website/content/ChapterFour/0800~0899/0846.Hand-of-Straights.md
@@ -68,8 +68,9 @@ func isNStraightHand(hand []int, groupSize int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0850.Rectangle-Area-II.md b/website/content/ChapterFour/0800~0899/0850.Rectangle-Area-II.md
index b16e51fe7..c6ae75843 100755
--- a/website/content/ChapterFour/0800~0899/0850.Rectangle-Area-II.md
+++ b/website/content/ChapterFour/0800~0899/0850.Rectangle-Area-II.md
@@ -293,8 +293,9 @@ func (sat *SegmentAreaTree) updateInTree(treeIndex, left, right, updateLeft, upd
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0851.Loud-and-Rich.md b/website/content/ChapterFour/0800~0899/0851.Loud-and-Rich.md
index ca43a9ef0..b32ec8c1c 100644
--- a/website/content/ChapterFour/0800~0899/0851.Loud-and-Rich.md
+++ b/website/content/ChapterFour/0800~0899/0851.Loud-and-Rich.md
@@ -108,8 +108,9 @@ func loudAndRich(richer [][]int, quiet []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array.md b/website/content/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array.md
index 12aa32deb..ff6910a34 100755
--- a/website/content/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array.md
+++ b/website/content/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array.md
@@ -91,8 +91,9 @@ func peakIndexInMountainArray1(A []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0853.Car-Fleet.md b/website/content/ChapterFour/0800~0899/0853.Car-Fleet.md
index b3532036f..634862b9f 100755
--- a/website/content/ChapterFour/0800~0899/0853.Car-Fleet.md
+++ b/website/content/ChapterFour/0800~0899/0853.Car-Fleet.md
@@ -98,8 +98,9 @@ func carFleet(target int, position []int, speed []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0856.Score-of-Parentheses.md b/website/content/ChapterFour/0800~0899/0856.Score-of-Parentheses.md
index d94ee68f1..edb1f2f32 100644
--- a/website/content/ChapterFour/0800~0899/0856.Score-of-Parentheses.md
+++ b/website/content/ChapterFour/0800~0899/0856.Score-of-Parentheses.md
@@ -102,8 +102,9 @@ func scoreOfParentheses(S string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0859.Buddy-Strings.md b/website/content/ChapterFour/0800~0899/0859.Buddy-Strings.md
index 9c8ddd17f..61fd983b7 100644
--- a/website/content/ChapterFour/0800~0899/0859.Buddy-Strings.md
+++ b/website/content/ChapterFour/0800~0899/0859.Buddy-Strings.md
@@ -87,8 +87,9 @@ func buddyStrings(s string, goal string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K.md b/website/content/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K.md
index 0f0090725..ee93bd022 100644
--- a/website/content/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K.md
+++ b/website/content/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K.md
@@ -90,8 +90,9 @@ func shortestSubarray(A []int, K int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md b/website/content/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md
index 2944f0e14..dd96f5513 100644
--- a/website/content/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md
+++ b/website/content/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md
@@ -96,8 +96,9 @@ func findChild(root *TreeNode, K int, visit *[]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md b/website/content/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md
index 7c05689b1..88beedc22 100755
--- a/website/content/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md
+++ b/website/content/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md
@@ -231,8 +231,9 @@ func isKey(board [][]byte, x, y int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0867.Transpose-Matrix.md b/website/content/ChapterFour/0800~0899/0867.Transpose-Matrix.md
index 8560e9169..b8b9e4bb1 100755
--- a/website/content/ChapterFour/0800~0899/0867.Transpose-Matrix.md
+++ b/website/content/ChapterFour/0800~0899/0867.Transpose-Matrix.md
@@ -57,8 +57,9 @@ func transpose(A [][]int) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0869.Reordered-Power-of-2.md b/website/content/ChapterFour/0800~0899/0869.Reordered-Power-of-2.md
index 183d1daf8..a048504bd 100644
--- a/website/content/ChapterFour/0800~0899/0869.Reordered-Power-of-2.md
+++ b/website/content/ChapterFour/0800~0899/0869.Reordered-Power-of-2.md
@@ -93,8 +93,9 @@ func isSame(t, s string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0870.Advantage-Shuffle.md b/website/content/ChapterFour/0800~0899/0870.Advantage-Shuffle.md
index 6d9ccecb1..fbba87703 100644
--- a/website/content/ChapterFour/0800~0899/0870.Advantage-Shuffle.md
+++ b/website/content/ChapterFour/0800~0899/0870.Advantage-Shuffle.md
@@ -72,8 +72,9 @@ func advantageCount1(A []int, B []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0872.Leaf-Similar-Trees.md b/website/content/ChapterFour/0800~0899/0872.Leaf-Similar-Trees.md
index 04f5b7f27..01c0a3f11 100644
--- a/website/content/ChapterFour/0800~0899/0872.Leaf-Similar-Trees.md
+++ b/website/content/ChapterFour/0800~0899/0872.Leaf-Similar-Trees.md
@@ -62,8 +62,9 @@ func dfsLeaf(root *TreeNode, leaf *[]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0874.Walking-Robot-Simulation.md b/website/content/ChapterFour/0800~0899/0874.Walking-Robot-Simulation.md
index 61df07cec..4561ec474 100644
--- a/website/content/ChapterFour/0800~0899/0874.Walking-Robot-Simulation.md
+++ b/website/content/ChapterFour/0800~0899/0874.Walking-Robot-Simulation.md
@@ -135,8 +135,9 @@ func robotSim(commands []int, obstacles [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0875.Koko-Eating-Bananas.md b/website/content/ChapterFour/0800~0899/0875.Koko-Eating-Bananas.md
index 734bf16d3..73d650858 100755
--- a/website/content/ChapterFour/0800~0899/0875.Koko-Eating-Bananas.md
+++ b/website/content/ChapterFour/0800~0899/0875.Koko-Eating-Bananas.md
@@ -101,8 +101,9 @@ func maxInArr(xs []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List.md b/website/content/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List.md
index 264d75801..e6c716234 100644
--- a/website/content/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List.md
+++ b/website/content/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List.md
@@ -82,8 +82,9 @@ func middleNode(head *ListNode) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0877.Stone-Game.md b/website/content/ChapterFour/0800~0899/0877.Stone-Game.md
index 104eedb8f..413fd129e 100644
--- a/website/content/ChapterFour/0800~0899/0877.Stone-Game.md
+++ b/website/content/ChapterFour/0800~0899/0877.Stone-Game.md
@@ -50,8 +50,9 @@ func stoneGame(piles []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0878.Nth-Magical-Number.md b/website/content/ChapterFour/0800~0899/0878.Nth-Magical-Number.md
index 18bad9d0e..080446c1e 100755
--- a/website/content/ChapterFour/0800~0899/0878.Nth-Magical-Number.md
+++ b/website/content/ChapterFour/0800~0899/0878.Nth-Magical-Number.md
@@ -81,8 +81,9 @@ func calNthMagicalCount(num, a, b int64) int64 {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0880.Decoded-String-at-Index.md b/website/content/ChapterFour/0800~0899/0880.Decoded-String-at-Index.md
index 08ca3315c..c5406debf 100644
--- a/website/content/ChapterFour/0800~0899/0880.Decoded-String-at-Index.md
+++ b/website/content/ChapterFour/0800~0899/0880.Decoded-String-at-Index.md
@@ -104,8 +104,9 @@ func decodeAtIndex(S string, K int) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0881.Boats-to-Save-People.md b/website/content/ChapterFour/0800~0899/0881.Boats-to-Save-People.md
index ddc07e9f3..3350d0764 100644
--- a/website/content/ChapterFour/0800~0899/0881.Boats-to-Save-People.md
+++ b/website/content/ChapterFour/0800~0899/0881.Boats-to-Save-People.md
@@ -90,8 +90,9 @@ func numRescueBoats(people []int, limit int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences.md b/website/content/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences.md
index 40c260249..02475ddb5 100755
--- a/website/content/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences.md
+++ b/website/content/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences.md
@@ -66,8 +66,9 @@ func uncommonFromSentences(A string, B string) []string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0885.Spiral-Matrix-III.md b/website/content/ChapterFour/0800~0899/0885.Spiral-Matrix-III.md
index 48444a0d4..f3b30b05e 100755
--- a/website/content/ChapterFour/0800~0899/0885.Spiral-Matrix-III.md
+++ b/website/content/ChapterFour/0800~0899/0885.Spiral-Matrix-III.md
@@ -84,8 +84,9 @@ func spiralMatrixIII(R int, C int, r0 int, c0 int) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0887.Super-Egg-Drop.md b/website/content/ChapterFour/0800~0899/0887.Super-Egg-Drop.md
index 1e1672237..5366430d8 100755
--- a/website/content/ChapterFour/0800~0899/0887.Super-Egg-Drop.md
+++ b/website/content/ChapterFour/0800~0899/0887.Super-Egg-Drop.md
@@ -145,8 +145,9 @@ func superEggDrop1(K int, N int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md b/website/content/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md
index f47316529..dcdef2b97 100644
--- a/website/content/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md
+++ b/website/content/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md
@@ -110,8 +110,9 @@ func max(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern.md b/website/content/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern.md
index 1931ae16a..b67a6ebcd 100644
--- a/website/content/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern.md
+++ b/website/content/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern.md
@@ -78,8 +78,9 @@ func match(w, p string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md b/website/content/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md
index a0baf573d..34cb9b4a4 100644
--- a/website/content/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md
+++ b/website/content/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md
@@ -68,8 +68,9 @@ func sumSubseqWidths(A []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes.md b/website/content/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes.md
index 9fa02621f..fc52ad33d 100644
--- a/website/content/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes.md
+++ b/website/content/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes.md
@@ -108,8 +108,9 @@ func min(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack.md b/website/content/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack.md
index 069117500..d4bc80112 100644
--- a/website/content/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack.md
+++ b/website/content/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack.md
@@ -113,8 +113,9 @@ func (this *FreqStack) Pop() int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0896.Monotonic-Array.md b/website/content/ChapterFour/0800~0899/0896.Monotonic-Array.md
index 931017500..aaabb66d9 100644
--- a/website/content/ChapterFour/0800~0899/0896.Monotonic-Array.md
+++ b/website/content/ChapterFour/0800~0899/0896.Monotonic-Array.md
@@ -99,8 +99,9 @@ func dec(A []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md b/website/content/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md
index cfac7507d..5a2feab21 100755
--- a/website/content/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md
+++ b/website/content/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md
@@ -123,8 +123,9 @@ func inorder(root *TreeNode, output *[]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md b/website/content/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md
index bf494c573..11cbaf984 100755
--- a/website/content/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md
+++ b/website/content/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md
@@ -143,8 +143,9 @@ func subarrayBitwiseORs1(A []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0901.Online-Stock-Span.md b/website/content/ChapterFour/0900~0999/0901.Online-Stock-Span.md
index 1ba0fcd96..f31581fd4 100644
--- a/website/content/ChapterFour/0900~0999/0901.Online-Stock-Span.md
+++ b/website/content/ChapterFour/0900~0999/0901.Online-Stock-Span.md
@@ -111,8 +111,9 @@ func (this *StockSpanner) Next(price int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md b/website/content/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md
index 7f155d1b3..fe005a8b0 100644
--- a/website/content/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md
+++ b/website/content/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md
@@ -115,8 +115,9 @@ func totalFruit(tree []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md b/website/content/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md
index 1fd0096d1..1080e50eb 100644
--- a/website/content/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md
+++ b/website/content/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md
@@ -124,8 +124,9 @@ func sumSubarrayMins2(A []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0909.Snakes-and-Ladders.md b/website/content/ChapterFour/0900~0999/0909.Snakes-and-Ladders.md
index ebba1cb5d..81d092fa2 100644
--- a/website/content/ChapterFour/0900~0999/0909.Snakes-and-Ladders.md
+++ b/website/content/ChapterFour/0900~0999/0909.Snakes-and-Ladders.md
@@ -110,8 +110,9 @@ func getRowCol(id, n int) (r, c int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0910.Smallest-Range-II.md b/website/content/ChapterFour/0900~0999/0910.Smallest-Range-II.md
index 1f9f33035..cfae6168c 100644
--- a/website/content/ChapterFour/0900~0999/0910.Smallest-Range-II.md
+++ b/website/content/ChapterFour/0900~0999/0910.Smallest-Range-II.md
@@ -82,8 +82,9 @@ func min(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0911.Online-Election.md b/website/content/ChapterFour/0900~0999/0911.Online-Election.md
index a00cd7365..963e59dbc 100755
--- a/website/content/ChapterFour/0900~0999/0911.Online-Election.md
+++ b/website/content/ChapterFour/0900~0999/0911.Online-Election.md
@@ -99,8 +99,9 @@ func (tvc *TopVotedCandidate) Q(t int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md b/website/content/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md
index f8cac7562..45bc828fc 100644
--- a/website/content/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md
+++ b/website/content/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md
@@ -105,8 +105,9 @@ func gcd(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0916.Word-Subsets.md b/website/content/ChapterFour/0900~0999/0916.Word-Subsets.md
index 8e54db5cb..4b2707fc5 100644
--- a/website/content/ChapterFour/0900~0999/0916.Word-Subsets.md
+++ b/website/content/ChapterFour/0900~0999/0916.Word-Subsets.md
@@ -103,8 +103,9 @@ func wordSubsets(A []string, B []string) []string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray.md b/website/content/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray.md
index 955a68679..4f5c43c3a 100755
--- a/website/content/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray.md
+++ b/website/content/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray.md
@@ -125,8 +125,9 @@ func max(nums ...int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md b/website/content/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md
index 27e214453..f84b36f86 100755
--- a/website/content/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md
+++ b/website/content/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md
@@ -85,8 +85,9 @@ func numMusicPlaylists(N int, L int, K int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid.md b/website/content/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid.md
index f11d433ee..ea16db610 100644
--- a/website/content/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid.md
+++ b/website/content/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid.md
@@ -88,8 +88,9 @@ func minAddToMakeValid(S string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II.md b/website/content/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II.md
index c89384dd7..01348927e 100644
--- a/website/content/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II.md
+++ b/website/content/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II.md
@@ -61,8 +61,9 @@ func sortArrayByParityII(A []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md b/website/content/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md
index 6cacce754..f05f3058c 100644
--- a/website/content/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md
+++ b/website/content/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md
@@ -102,8 +102,9 @@ func threeSumMulti(A []int, target int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md b/website/content/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md
index b5835a932..7b1da1e51 100755
--- a/website/content/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md
+++ b/website/content/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md
@@ -119,8 +119,9 @@ func minMalwareSpread(graph [][]int, initial []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0925.Long-Pressed-Name.md b/website/content/ChapterFour/0900~0999/0925.Long-Pressed-Name.md
index 1634e0602..9279da480 100644
--- a/website/content/ChapterFour/0900~0999/0925.Long-Pressed-Name.md
+++ b/website/content/ChapterFour/0900~0999/0925.Long-Pressed-Name.md
@@ -107,8 +107,9 @@ func isLongPressedName(name string, typed string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0927.Three-Equal-Parts.md b/website/content/ChapterFour/0900~0999/0927.Three-Equal-Parts.md
index 9cdabc5d9..43d3b34a8 100755
--- a/website/content/ChapterFour/0900~0999/0927.Three-Equal-Parts.md
+++ b/website/content/ChapterFour/0900~0999/0927.Three-Equal-Parts.md
@@ -113,8 +113,9 @@ func threeEqualParts(A []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md b/website/content/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md
index ad047b303..b0fef68ab 100755
--- a/website/content/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md
+++ b/website/content/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md
@@ -137,8 +137,9 @@ func minMalwareSpread2(graph [][]int, initial []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md b/website/content/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md
index b79ee1608..770eb6801 100644
--- a/website/content/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md
+++ b/website/content/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md
@@ -65,8 +65,9 @@ func numSubarraysWithSum(A []int, S int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0933.Number-of-Recent-Calls.md b/website/content/ChapterFour/0900~0999/0933.Number-of-Recent-Calls.md
index a5b0005a5..3735fa22c 100644
--- a/website/content/ChapterFour/0900~0999/0933.Number-of-Recent-Calls.md
+++ b/website/content/ChapterFour/0900~0999/0933.Number-of-Recent-Calls.md
@@ -74,8 +74,9 @@ func (this *RecentCounter) Ping(t int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0938.Range-Sum-of-BST.md b/website/content/ChapterFour/0900~0999/0938.Range-Sum-of-BST.md
index a0c1644ec..6053f7f28 100644
--- a/website/content/ChapterFour/0900~0999/0938.Range-Sum-of-BST.md
+++ b/website/content/ChapterFour/0900~0999/0938.Range-Sum-of-BST.md
@@ -80,8 +80,9 @@ func preOrder(root *TreeNode, low, high int, res *int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0942.DI-String-Match.md b/website/content/ChapterFour/0900~0999/0942.DI-String-Match.md
index ccc5bfa53..f75e7fcf3 100755
--- a/website/content/ChapterFour/0900~0999/0942.DI-String-Match.md
+++ b/website/content/ChapterFour/0900~0999/0942.DI-String-Match.md
@@ -73,8 +73,9 @@ func diStringMatch(S string) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0946.Validate-Stack-Sequences.md b/website/content/ChapterFour/0900~0999/0946.Validate-Stack-Sequences.md
index a71eed54f..ff3edcf15 100644
--- a/website/content/ChapterFour/0900~0999/0946.Validate-Stack-Sequences.md
+++ b/website/content/ChapterFour/0900~0999/0946.Validate-Stack-Sequences.md
@@ -64,8 +64,9 @@ func validateStackSequences(pushed []int, popped []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md b/website/content/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md
index e19800760..2da05e61e 100755
--- a/website/content/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md
+++ b/website/content/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md
@@ -82,8 +82,9 @@ func removeStones(stones [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0949.Largest-Time-for-Given-Digits.md b/website/content/ChapterFour/0900~0999/0949.Largest-Time-for-Given-Digits.md
index 4dee6fdb1..f333895aa 100644
--- a/website/content/ChapterFour/0900~0999/0949.Largest-Time-for-Given-Digits.md
+++ b/website/content/ChapterFour/0900~0999/0949.Largest-Time-for-Given-Digits.md
@@ -78,8 +78,9 @@ func largestTimeFromDigits(A []int) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md b/website/content/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md
index f40b90a1c..f310ee806 100755
--- a/website/content/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md
+++ b/website/content/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md
@@ -119,8 +119,9 @@ func largestComponentSize1(A []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md b/website/content/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md
index f50c0855a..642fcd2c5 100755
--- a/website/content/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md
+++ b/website/content/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md
@@ -81,8 +81,9 @@ func isAlienSorted(words []string, order string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0958.Check-Completeness-of-a-Binary-Tree.md b/website/content/ChapterFour/0900~0999/0958.Check-Completeness-of-a-Binary-Tree.md
index d9a30b23b..69e64fd66 100644
--- a/website/content/ChapterFour/0900~0999/0958.Check-Completeness-of-a-Binary-Tree.md
+++ b/website/content/ChapterFour/0900~0999/0958.Check-Completeness-of-a-Binary-Tree.md
@@ -89,8 +89,9 @@ func isCompleteTree(root *TreeNode) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md b/website/content/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md
index 1aba869f9..a0c9cf4ca 100755
--- a/website/content/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md
+++ b/website/content/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md
@@ -150,8 +150,9 @@ func getFaceIdx(size, i, j, k int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md b/website/content/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md
index e6f46cf28..74620d1d2 100755
--- a/website/content/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md
+++ b/website/content/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md
@@ -60,8 +60,9 @@ func repeatedNTimes(A []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0966.Vowel-Spellchecker.md b/website/content/ChapterFour/0900~0999/0966.Vowel-Spellchecker.md
index 645daa8d6..2231cd748 100644
--- a/website/content/ChapterFour/0900~0999/0966.Vowel-Spellchecker.md
+++ b/website/content/ChapterFour/0900~0999/0966.Vowel-Spellchecker.md
@@ -127,8 +127,9 @@ func devowel(word string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md b/website/content/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md
index 3806dc55a..788ef282d 100755
--- a/website/content/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md
+++ b/website/content/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md
@@ -103,8 +103,9 @@ func minCameraCoverDFS(root *TreeNode, res *int) status {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0969.Pancake-Sorting.md b/website/content/ChapterFour/0900~0999/0969.Pancake-Sorting.md
index 29ed06f44..31cf7c1a2 100644
--- a/website/content/ChapterFour/0900~0999/0969.Pancake-Sorting.md
+++ b/website/content/ChapterFour/0900~0999/0969.Pancake-Sorting.md
@@ -96,8 +96,9 @@ func find(nums []int, t int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0970.Powerful-Integers.md b/website/content/ChapterFour/0900~0999/0970.Powerful-Integers.md
index 444df1b99..4f8dd6690 100755
--- a/website/content/ChapterFour/0900~0999/0970.Powerful-Integers.md
+++ b/website/content/ChapterFour/0900~0999/0970.Powerful-Integers.md
@@ -88,8 +88,9 @@ func pow(x, i int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal.md b/website/content/ChapterFour/0900~0999/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal.md
index 5433a7ae8..5bd6ad380 100644
--- a/website/content/ChapterFour/0900~0999/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal.md
+++ b/website/content/ChapterFour/0900~0999/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal.md
@@ -106,8 +106,9 @@ func travelTree(root *TreeNode, index *int, voyage []int, res *[]int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md b/website/content/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md
index 8a50e28fc..b6bdbe938 100644
--- a/website/content/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md
+++ b/website/content/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md
@@ -71,8 +71,9 @@ func KClosest(points [][]int, K int) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md b/website/content/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md
index 02ade12a3..d7fdc6700 100644
--- a/website/content/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md
+++ b/website/content/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md
@@ -78,8 +78,9 @@ func largestPerimeter(A []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array.md b/website/content/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array.md
index 3b279c16a..f3b011558 100644
--- a/website/content/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array.md
+++ b/website/content/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array.md
@@ -86,8 +86,9 @@ func sortedSquares1(A []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md b/website/content/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md
index 58ff3044d..116b841be 100755
--- a/website/content/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md
+++ b/website/content/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md
@@ -106,8 +106,9 @@ func maxTurbulenceSize1(arr []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree.md b/website/content/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree.md
index c76f68080..43cd0cf31 100755
--- a/website/content/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree.md
+++ b/website/content/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree.md
@@ -96,8 +96,9 @@ func distributeCoinsDFS(root *TreeNode, res *int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0980.Unique-Paths-III.md b/website/content/ChapterFour/0900~0999/0980.Unique-Paths-III.md
index cd74994ff..ce4685610 100755
--- a/website/content/ChapterFour/0900~0999/0980.Unique-Paths-III.md
+++ b/website/content/ChapterFour/0900~0999/0980.Unique-Paths-III.md
@@ -131,8 +131,9 @@ func findUniquePathIII(board [][]int, visited [][]bool, path []int, empty, start
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md b/website/content/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md
index 4ef63e1d7..5f83f7109 100755
--- a/website/content/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md
+++ b/website/content/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md
@@ -124,8 +124,9 @@ func (t TimeMap) Get(key string, timestamp int) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0984.String-Without-AAA-or-BBB.md b/website/content/ChapterFour/0900~0999/0984.String-Without-AAA-or-BBB.md
index df90e6f04..4ae6f754f 100755
--- a/website/content/ChapterFour/0900~0999/0984.String-Without-AAA-or-BBB.md
+++ b/website/content/ChapterFour/0900~0999/0984.String-Without-AAA-or-BBB.md
@@ -93,8 +93,9 @@ func strWithout3a3b(A int, B int) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0985.Sum-of-Even-Numbers-After-Queries.md b/website/content/ChapterFour/0900~0999/0985.Sum-of-Even-Numbers-After-Queries.md
index 07f6c748e..d578b20e0 100644
--- a/website/content/ChapterFour/0900~0999/0985.Sum-of-Even-Numbers-After-Queries.md
+++ b/website/content/ChapterFour/0900~0999/0985.Sum-of-Even-Numbers-After-Queries.md
@@ -72,8 +72,9 @@ func sumEvenAfterQueries(A []int, queries [][]int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0986.Interval-List-Intersections.md b/website/content/ChapterFour/0900~0999/0986.Interval-List-Intersections.md
index 304c9ce37..0c0af4e9f 100644
--- a/website/content/ChapterFour/0900~0999/0986.Interval-List-Intersections.md
+++ b/website/content/ChapterFour/0900~0999/0986.Interval-List-Intersections.md
@@ -73,8 +73,9 @@ func intervalIntersection(A []Interval, B []Interval) []Interval {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md b/website/content/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md
index aba6488b5..48e29cca8 100644
--- a/website/content/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md
+++ b/website/content/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md
@@ -136,8 +136,9 @@ func verticalTraversal(root *TreeNode) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md b/website/content/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md
index ab9a6d8a2..c418622b0 100644
--- a/website/content/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md
+++ b/website/content/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md
@@ -84,8 +84,9 @@ func reverse(A []int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md b/website/content/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md
index bca338729..7403f9075 100755
--- a/website/content/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md
+++ b/website/content/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md
@@ -99,8 +99,9 @@ func equationsPossible(equations []string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0991.Broken-Calculator.md b/website/content/ChapterFour/0900~0999/0991.Broken-Calculator.md
index e5dfd8dc9..cc02c3aab 100644
--- a/website/content/ChapterFour/0900~0999/0991.Broken-Calculator.md
+++ b/website/content/ChapterFour/0900~0999/0991.Broken-Calculator.md
@@ -83,8 +83,9 @@ func brokenCalc(X int, Y int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md b/website/content/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md
index d9c975512..9aed93dc5 100644
--- a/website/content/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md
+++ b/website/content/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md
@@ -113,8 +113,9 @@ func subarraysWithKDistinctSlideWindow(A []int, K int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md b/website/content/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md
index 8a75f3e20..7502aaccf 100755
--- a/website/content/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md
+++ b/website/content/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md
@@ -163,8 +163,9 @@ func dfsCousins(root *TreeNode, val, depth, last int, parent, res *int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md b/website/content/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md
index 31066661c..0daaec77f 100755
--- a/website/content/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md
+++ b/website/content/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md
@@ -97,8 +97,9 @@ func minKBitFlips(A []int, K int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md b/website/content/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md
index c305fa181..9614c734e 100755
--- a/website/content/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md
+++ b/website/content/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md
@@ -107,8 +107,9 @@ func checkSquare(num int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0997.Find-the-Town-Judge.md b/website/content/ChapterFour/0900~0999/0997.Find-the-Town-Judge.md
index 495f18cad..a495a628f 100644
--- a/website/content/ChapterFour/0900~0999/0997.Find-the-Town-Judge.md
+++ b/website/content/ChapterFour/0900~0999/0997.Find-the-Town-Judge.md
@@ -87,8 +87,9 @@ func findJudge(n int, trust [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/0900~0999/0999.Available-Captures-for-Rook.md b/website/content/ChapterFour/0900~0999/0999.Available-Captures-for-Rook.md
index 8797ca961..4f9a475d3 100644
--- a/website/content/ChapterFour/0900~0999/0999.Available-Captures-for-Rook.md
+++ b/website/content/ChapterFour/0900~0999/0999.Available-Captures-for-Rook.md
@@ -99,8 +99,9 @@ func caputure(board [][]byte, x, y int, bx, by int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1002.Find-Common-Characters.md b/website/content/ChapterFour/1000~1099/1002.Find-Common-Characters.md
index 2e1f62b4d..6b5546241 100755
--- a/website/content/ChapterFour/1000~1099/1002.Find-Common-Characters.md
+++ b/website/content/ChapterFour/1000~1099/1002.Find-Common-Characters.md
@@ -74,8 +74,9 @@ func commonChars(A []string) []string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions.md b/website/content/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions.md
index 69a4c6786..31249adfe 100644
--- a/website/content/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions.md
+++ b/website/content/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions.md
@@ -107,8 +107,9 @@ func isValid1003(S string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md b/website/content/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md
index c7c40384d..bfefcc135 100644
--- a/website/content/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md
+++ b/website/content/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md
@@ -80,8 +80,9 @@ func longestOnes(A []int, K int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations.md b/website/content/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations.md
index 7cb38aaab..f6b3a75aa 100644
--- a/website/content/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations.md
+++ b/website/content/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations.md
@@ -83,8 +83,9 @@ func largestSumAfterKNegations(A []int, K int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1006.Clumsy-Factorial.md b/website/content/ChapterFour/1000~1099/1006.Clumsy-Factorial.md
index 737ec2205..228bafd69 100644
--- a/website/content/ChapterFour/1000~1099/1006.Clumsy-Factorial.md
+++ b/website/content/ChapterFour/1000~1099/1006.Clumsy-Factorial.md
@@ -75,8 +75,9 @@ func clumsy(N int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1009.Complement-of-Base-10-Integer.md b/website/content/ChapterFour/1000~1099/1009.Complement-of-Base-10-Integer.md
index b448d6c2b..c315f8391 100644
--- a/website/content/ChapterFour/1000~1099/1009.Complement-of-Base-10-Integer.md
+++ b/website/content/ChapterFour/1000~1099/1009.Complement-of-Base-10-Integer.md
@@ -67,8 +67,9 @@ func bitwiseComplement(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60.md b/website/content/ChapterFour/1000~1099/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60.md
index b8edb0ebb..80a895212 100644
--- a/website/content/ChapterFour/1000~1099/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60.md
+++ b/website/content/ChapterFour/1000~1099/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60.md
@@ -63,8 +63,9 @@ func numPairsDivisibleBy60(time []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md b/website/content/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md
index c812630ac..d5a23e516 100755
--- a/website/content/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md
+++ b/website/content/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md
@@ -115,8 +115,9 @@ func calSum(mid, m int, nums []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1017.Convert-to-Base-2.md b/website/content/ChapterFour/1000~1099/1017.Convert-to-Base-2.md
index d6aaa9ade..3a68e51cb 100755
--- a/website/content/ChapterFour/1000~1099/1017.Convert-to-Base-2.md
+++ b/website/content/ChapterFour/1000~1099/1017.Convert-to-Base-2.md
@@ -75,8 +75,9 @@ func baseNeg2(N int) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1018.Binary-Prefix-Divisible-By-5.md b/website/content/ChapterFour/1000~1099/1018.Binary-Prefix-Divisible-By-5.md
index 5afbdaa2a..89eac5ef2 100644
--- a/website/content/ChapterFour/1000~1099/1018.Binary-Prefix-Divisible-By-5.md
+++ b/website/content/ChapterFour/1000~1099/1018.Binary-Prefix-Divisible-By-5.md
@@ -70,8 +70,9 @@ func prefixesDivBy5(a []int) []bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md b/website/content/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md
index a4f1ec424..d6c77b515 100644
--- a/website/content/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md
+++ b/website/content/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md
@@ -94,8 +94,9 @@ func nextLargerNodes(head *ListNode) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1020.Number-of-Enclaves.md b/website/content/ChapterFour/1000~1099/1020.Number-of-Enclaves.md
index 85dcb5ff9..df54527ae 100644
--- a/website/content/ChapterFour/1000~1099/1020.Number-of-Enclaves.md
+++ b/website/content/ChapterFour/1000~1099/1020.Number-of-Enclaves.md
@@ -93,8 +93,9 @@ func dfsNumEnclaves(A [][]int, x, y int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses.md b/website/content/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses.md
index 7742aec2c..91651057d 100644
--- a/website/content/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses.md
+++ b/website/content/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses.md
@@ -123,8 +123,9 @@ func removeOuterParentheses1(S string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1022.Sum-of-Root-To-Leaf-Binary-Numbers.md b/website/content/ChapterFour/1000~1099/1022.Sum-of-Root-To-Leaf-Binary-Numbers.md
index 299a22219..09364f71a 100644
--- a/website/content/ChapterFour/1000~1099/1022.Sum-of-Root-To-Leaf-Binary-Numbers.md
+++ b/website/content/ChapterFour/1000~1099/1022.Sum-of-Root-To-Leaf-Binary-Numbers.md
@@ -54,8 +54,9 @@ Output: 0
- 如果当前访问结点不是叶结点，则返回左子树和右子树所对应的结果之和。
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1025.Divisor-Game.md b/website/content/ChapterFour/1000~1099/1025.Divisor-Game.md
index 868900959..93673a8be 100755
--- a/website/content/ChapterFour/1000~1099/1025.Divisor-Game.md
+++ b/website/content/ChapterFour/1000~1099/1025.Divisor-Game.md
@@ -62,8 +62,9 @@ func divisorGame(N int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md b/website/content/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md
index 325536b0d..96c6baadc 100644
--- a/website/content/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md
+++ b/website/content/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md
@@ -74,8 +74,9 @@ func dfsAncestorDiff(root *TreeNode, res *int) (int, int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md b/website/content/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md
index a7195a543..995b479af 100755
--- a/website/content/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md
+++ b/website/content/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md
@@ -135,8 +135,9 @@ func dfsBuildPreorderTree(S string, index, level *int, cur *TreeNode) (newIndex
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md b/website/content/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md
index a54d2fddd..28be4e9bb 100755
--- a/website/content/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md
+++ b/website/content/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md
@@ -84,8 +84,9 @@ func allCellsDistOrder(R int, C int, r0 int, c0 int) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1034.Coloring-A-Border.md b/website/content/ChapterFour/1000~1099/1034.Coloring-A-Border.md
index cfcb67675..dca0563ee 100644
--- a/website/content/ChapterFour/1000~1099/1034.Coloring-A-Border.md
+++ b/website/content/ChapterFour/1000~1099/1034.Coloring-A-Border.md
@@ -108,8 +108,9 @@ func dfs(x, y int, gInfo gridInfo, dirs []point, vis [][]bool, borders *[]point)
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1037.Valid-Boomerang.md b/website/content/ChapterFour/1000~1099/1037.Valid-Boomerang.md
index d01462887..e9a0568dc 100644
--- a/website/content/ChapterFour/1000~1099/1037.Valid-Boomerang.md
+++ b/website/content/ChapterFour/1000~1099/1037.Valid-Boomerang.md
@@ -49,8 +49,9 @@ func isBoomerang(points [][]int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree.md b/website/content/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree.md
index 31c0a5142..f79e4bbd7 100644
--- a/website/content/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree.md
+++ b/website/content/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree.md
@@ -107,8 +107,9 @@ func dfs1038(root *TreeNode, sum *int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md b/website/content/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md
index 9d03de77e..e2cb01008 100755
--- a/website/content/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md
+++ b/website/content/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md
@@ -121,8 +121,9 @@ func numMovesStonesII(stones []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String.md b/website/content/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String.md
index 5508dc6ff..81351e9c2 100644
--- a/website/content/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String.md
+++ b/website/content/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String.md
@@ -57,8 +57,9 @@ func removeDuplicates1047(S string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1048.Longest-String-Chain.md b/website/content/ChapterFour/1000~1099/1048.Longest-String-Chain.md
index 703bf3794..f794c9237 100644
--- a/website/content/ChapterFour/1000~1099/1048.Longest-String-Chain.md
+++ b/website/content/ChapterFour/1000~1099/1048.Longest-String-Chain.md
@@ -96,8 +96,9 @@ func isPredecessor(long, short string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md b/website/content/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md
index 4645224f1..64ed6ca35 100755
--- a/website/content/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md
+++ b/website/content/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md
@@ -79,8 +79,9 @@ func lastStoneWeightII(stones []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1051.Height-Checker.md b/website/content/ChapterFour/1000~1099/1051.Height-Checker.md
index cb5879d46..bf7317758 100644
--- a/website/content/ChapterFour/1000~1099/1051.Height-Checker.md
+++ b/website/content/ChapterFour/1000~1099/1051.Height-Checker.md
@@ -72,8 +72,9 @@ func heightChecker(heights []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner.md b/website/content/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner.md
index 4e48b5af8..57185906d 100755
--- a/website/content/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner.md
+++ b/website/content/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner.md
@@ -106,8 +106,9 @@ func sumSatisfied(customers []int, grumpy []int, start, end int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1054.Distant-Barcodes.md b/website/content/ChapterFour/1000~1099/1054.Distant-Barcodes.md
index ea71fd103..2b546a73c 100755
--- a/website/content/ChapterFour/1000~1099/1054.Distant-Barcodes.md
+++ b/website/content/ChapterFour/1000~1099/1054.Distant-Barcodes.md
@@ -92,8 +92,9 @@ func barcodesFrequencySort(s []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md b/website/content/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md
index ef540b112..7790d289a 100755
--- a/website/content/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md
+++ b/website/content/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md
@@ -146,8 +146,9 @@ func intToNegabinary(num int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md b/website/content/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md
index 82fa07ba8..abff2e9f6 100755
--- a/website/content/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md
+++ b/website/content/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md
@@ -146,8 +146,9 @@ func sumSubmatrix(matrix [][]int, startx, starty, endx, endy int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1078.Occurrences-After-Bigram.md b/website/content/ChapterFour/1000~1099/1078.Occurrences-After-Bigram.md
index 877eeff77..79768fae4 100755
--- a/website/content/ChapterFour/1000~1099/1078.Occurrences-After-Bigram.md
+++ b/website/content/ChapterFour/1000~1099/1078.Occurrences-After-Bigram.md
@@ -64,8 +64,9 @@ func findOcurrences(text string, first string, second string) []string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md b/website/content/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md
index 1227f74ca..dce6e249e 100755
--- a/website/content/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md
+++ b/website/content/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md
@@ -107,8 +107,9 @@ func findTile(tiles, tmp []byte, used *[]bool, index int, res *int, tMap map[str
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1089.Duplicate-Zeros.md b/website/content/ChapterFour/1000~1099/1089.Duplicate-Zeros.md
index 1bc3b7757..a9d013835 100644
--- a/website/content/ChapterFour/1000~1099/1089.Duplicate-Zeros.md
+++ b/website/content/ChapterFour/1000~1099/1089.Duplicate-Zeros.md
@@ -58,8 +58,9 @@ func duplicateZeros(arr []int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1091.Shortest-Path-in-Binary-Matrix.md b/website/content/ChapterFour/1000~1099/1091.Shortest-Path-in-Binary-Matrix.md
index 849bb15e4..ce14991f9 100644
--- a/website/content/ChapterFour/1000~1099/1091.Shortest-Path-in-Binary-Matrix.md
+++ b/website/content/ChapterFour/1000~1099/1091.Shortest-Path-in-Binary-Matrix.md
@@ -114,8 +114,9 @@ func isInBoard(board [][]int, x, y int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md b/website/content/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md
index 39779662f..70878ea43 100755
--- a/website/content/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md
+++ b/website/content/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md
@@ -98,8 +98,9 @@ func sampleStats(count []int) []float64 {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1104.Path-In-Zigzag-Labelled-Binary-Tree.md b/website/content/ChapterFour/1100~1199/1104.Path-In-Zigzag-Labelled-Binary-Tree.md
index 05076ee8d..0cf78ae0e 100644
--- a/website/content/ChapterFour/1100~1199/1104.Path-In-Zigzag-Labelled-Binary-Tree.md
+++ b/website/content/ChapterFour/1100~1199/1104.Path-In-Zigzag-Labelled-Binary-Tree.md
@@ -92,8 +92,9 @@ func reverse(nums []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md b/website/content/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md
index 8a914c8d0..492b8b45e 100755
--- a/website/content/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md
+++ b/website/content/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md
@@ -68,8 +68,9 @@ func minHeightShelves(books [][]int, shelfWidth int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1108.Defanging-an-IP-Address.md b/website/content/ChapterFour/1100~1199/1108.Defanging-an-IP-Address.md
index 90724672f..e5d7d7348 100755
--- a/website/content/ChapterFour/1100~1199/1108.Defanging-an-IP-Address.md
+++ b/website/content/ChapterFour/1100~1199/1108.Defanging-an-IP-Address.md
@@ -54,8 +54,9 @@ func defangIPaddr(address string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md b/website/content/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md
index 7b317cc4f..8594fc0b9 100644
--- a/website/content/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md
+++ b/website/content/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md
@@ -82,8 +82,9 @@ func dfsDelNodes(root *TreeNode, toDel map[int]bool, isRoot bool, res *[]*TreeNo
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md b/website/content/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md
index 4289e982c..cdd7e02ba 100755
--- a/website/content/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md
+++ b/website/content/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md
@@ -132,8 +132,9 @@ func maxDepthAfterSplit1(seq string) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1122.Relative-Sort-Array.md b/website/content/ChapterFour/1100~1199/1122.Relative-Sort-Array.md
index c36c2f10e..2eb8b487f 100755
--- a/website/content/ChapterFour/1100~1199/1122.Relative-Sort-Array.md
+++ b/website/content/ChapterFour/1100~1199/1122.Relative-Sort-Array.md
@@ -101,8 +101,9 @@ func relativeSortArray1(arr1 []int, arr2 []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md b/website/content/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md
index af07abcaf..84068198b 100755
--- a/website/content/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md
+++ b/website/content/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md
@@ -101,8 +101,9 @@ func lcaDeepestLeavesDFS(lca **TreeNode, maxLevel *int, depth int, root *TreeNod
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md b/website/content/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md
index 396e61e1e..c1b938f44 100755
--- a/website/content/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md
+++ b/website/content/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md
@@ -68,8 +68,9 @@ func numEquivDominoPairs(dominoes [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number.md b/website/content/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number.md
index 74c1b0ed9..259f47db1 100755
--- a/website/content/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number.md
+++ b/website/content/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number.md
@@ -71,8 +71,9 @@ func tribonacci(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1143.Longest-Common-Subsequence.md b/website/content/ChapterFour/1100~1199/1143.Longest-Common-Subsequence.md
index 01e8b2fb8..e96038c5c 100644
--- a/website/content/ChapterFour/1100~1199/1143.Longest-Common-Subsequence.md
+++ b/website/content/ChapterFour/1100~1199/1143.Longest-Common-Subsequence.md
@@ -88,8 +88,9 @@ func max(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md b/website/content/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md
index f04cc161c..ca41cfa2f 100644
--- a/website/content/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md
+++ b/website/content/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md
@@ -82,8 +82,9 @@ func dfsBtreeGameWinningMove(node *TreeNode, left, right *int, x int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1154.Day-of-the-Year.md b/website/content/ChapterFour/1100~1199/1154.Day-of-the-Year.md
index 98e392d01..3dd12b1a7 100755
--- a/website/content/ChapterFour/1100~1199/1154.Day-of-the-Year.md
+++ b/website/content/ChapterFour/1100~1199/1154.Day-of-the-Year.md
@@ -81,8 +81,9 @@ func dayOfYear(date string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md b/website/content/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md
index 0fd147e49..6334d5ef5 100755
--- a/website/content/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md
+++ b/website/content/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md
@@ -196,8 +196,9 @@ func (mc *MajorityChecker) Query(left int, right int, threshold int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md b/website/content/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md
index a0e7603d9..9b5aa5fec 100755
--- a/website/content/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md
+++ b/website/content/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md
@@ -81,8 +81,9 @@ func canBeFormed(w string, c []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md b/website/content/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md
index 987a39a81..3f40014d9 100755
--- a/website/content/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md
+++ b/website/content/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md
@@ -86,8 +86,9 @@ func countFunc(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md b/website/content/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md
index 49e9862b9..7520138d6 100755
--- a/website/content/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md
+++ b/website/content/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md
@@ -140,8 +140,9 @@ func removeZeroSumSublists1(head *ListNode) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1175.Prime-Arrangements.md b/website/content/ChapterFour/1100~1199/1175.Prime-Arrangements.md
index a147da041..fc58672ed 100755
--- a/website/content/ChapterFour/1100~1199/1175.Prime-Arrangements.md
+++ b/website/content/ChapterFour/1100~1199/1175.Prime-Arrangements.md
@@ -65,8 +65,9 @@ func factorial(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md b/website/content/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md
index bf708bb7d..5fc7b5810 100644
--- a/website/content/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md
+++ b/website/content/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md
@@ -119,8 +119,9 @@ func findNum(puzzles []byte, bitMap uint32, totalNum *int, m map[uint32]int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1184.Distance-Between-Bus-Stops.md b/website/content/ChapterFour/1100~1199/1184.Distance-Between-Bus-Stops.md
index 6dbf09a27..b6d803060 100755
--- a/website/content/ChapterFour/1100~1199/1184.Distance-Between-Bus-Stops.md
+++ b/website/content/ChapterFour/1100~1199/1184.Distance-Between-Bus-Stops.md
@@ -82,8 +82,9 @@ func distanceBetweenBusStops(distance []int, start int, destination int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1185.Day-of-the-Week.md b/website/content/ChapterFour/1100~1199/1185.Day-of-the-Week.md
index e7489d101..4a1127551 100755
--- a/website/content/ChapterFour/1100~1199/1185.Day-of-the-Week.md
+++ b/website/content/ChapterFour/1100~1199/1185.Day-of-the-Week.md
@@ -61,8 +61,9 @@ func dayOfTheWeek(day int, month int, year int) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md b/website/content/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md
index ed9b096d8..7bfbc345c 100755
--- a/website/content/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md
+++ b/website/content/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md
@@ -70,8 +70,9 @@ func maxNumberOfBalloons(text string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1100~1199/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses.md b/website/content/ChapterFour/1100~1199/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses.md
index 0e9fdafc6..95fb5c7bd 100644
--- a/website/content/ChapterFour/1100~1199/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses.md
+++ b/website/content/ChapterFour/1100~1199/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses.md
@@ -84,8 +84,9 @@ func reverseParentheses(s string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference.md b/website/content/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference.md
index cfc42996d..8fb1498bc 100755
--- a/website/content/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference.md
+++ b/website/content/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference.md
@@ -77,8 +77,9 @@ func minimumAbsDifference(arr []int) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1201.Ugly-Number-III.md b/website/content/ChapterFour/1200~1299/1201.Ugly-Number-III.md
index a4a3299d5..35d966e7a 100755
--- a/website/content/ChapterFour/1200~1299/1201.Ugly-Number-III.md
+++ b/website/content/ChapterFour/1200~1299/1201.Ugly-Number-III.md
@@ -92,8 +92,9 @@ func gcd(a, b int64) int64 {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md b/website/content/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md
index da9f6cc3b..5e95dc4d8 100755
--- a/website/content/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md
+++ b/website/content/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md
@@ -102,8 +102,9 @@ func smallestStringWithSwaps(s string, pairs [][]int) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies.md b/website/content/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies.md
index 6cbdc8ced..149cbf92d 100644
--- a/website/content/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies.md
+++ b/website/content/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies.md
@@ -191,8 +191,9 @@ func topSort(graph [][]int, deg, items []int) (orders []int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md b/website/content/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md
index acd4c99da..f63bc9cb4 100755
--- a/website/content/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md
+++ b/website/content/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md
@@ -68,8 +68,9 @@ func uniqueOccurrences(arr []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md b/website/content/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md
index 24435f65d..4f9d7a0fe 100755
--- a/website/content/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md
+++ b/website/content/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md
@@ -77,8 +77,9 @@ func equalSubstring(s string, t string, maxCost int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1209.Remove-All-Adjacent-Duplicates-in-String-II.md b/website/content/ChapterFour/1200~1299/1209.Remove-All-Adjacent-Duplicates-in-String-II.md
index 6a59f20e9..6c697e033 100644
--- a/website/content/ChapterFour/1200~1299/1209.Remove-All-Adjacent-Duplicates-in-String-II.md
+++ b/website/content/ChapterFour/1200~1299/1209.Remove-All-Adjacent-Duplicates-in-String-II.md
@@ -106,8 +106,9 @@ func removeDuplicates1(s string, k int) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md b/website/content/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md
index feea53ba6..2dd98f59a 100755
--- a/website/content/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md
+++ b/website/content/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md
@@ -76,8 +76,9 @@ func minCostToMoveChips(chips []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1221.Split-a-String-in-Balanced-Strings.md b/website/content/ChapterFour/1200~1299/1221.Split-a-String-in-Balanced-Strings.md
index d17358657..7ab82f167 100755
--- a/website/content/ChapterFour/1200~1299/1221.Split-a-String-in-Balanced-Strings.md
+++ b/website/content/ChapterFour/1200~1299/1221.Split-a-String-in-Balanced-Strings.md
@@ -73,8 +73,9 @@ func balancedStringSplit(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line.md b/website/content/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line.md
index 07ad32d47..f214cc424 100755
--- a/website/content/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line.md
+++ b/website/content/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line.md
@@ -71,8 +71,9 @@ func checkStraightLine(coordinates [][]int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md b/website/content/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md
index 50847fe1e..c904b647d 100755
--- a/website/content/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md
+++ b/website/content/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md
@@ -93,8 +93,9 @@ func balancedString(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md b/website/content/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md
index ca4826f49..dcb06fbe9 100755
--- a/website/content/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md
+++ b/website/content/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md
@@ -118,8 +118,9 @@ func (s sortJobs) Swap(i, j int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md b/website/content/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md
index 86d530b44..7efc66e46 100644
--- a/website/content/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md
+++ b/website/content/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md
@@ -88,8 +88,9 @@ func max(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md b/website/content/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md
index c1936b889..e7081b2f7 100644
--- a/website/content/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md
+++ b/website/content/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md
@@ -95,8 +95,9 @@ func minRemoveToMakeValid(s string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix.md b/website/content/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix.md
index 61913d739..cd4f656e2 100755
--- a/website/content/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix.md
+++ b/website/content/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix.md
@@ -103,8 +103,9 @@ func oddCells1(n int, m int, indices [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md b/website/content/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md
index 96e175c9a..c2fd83bc0 100755
--- a/website/content/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md
+++ b/website/content/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md
@@ -110,8 +110,9 @@ func isIntInBoard(board [][]int, x, y int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1260.Shift-2D-Grid.md b/website/content/ChapterFour/1200~1299/1260.Shift-2D-Grid.md
index 83fcdef1d..6202e2c19 100644
--- a/website/content/ChapterFour/1200~1299/1260.Shift-2D-Grid.md
+++ b/website/content/ChapterFour/1200~1299/1260.Shift-2D-Grid.md
@@ -90,8 +90,9 @@ func shiftGrid(grid [][]int, k int) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points.md b/website/content/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points.md
index 5b20c53a1..eb4356f1a 100755
--- a/website/content/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points.md
+++ b/website/content/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points.md
@@ -75,8 +75,9 @@ func minTimeToVisitAllPoints(points [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1268.Search-Suggestions-System.md b/website/content/ChapterFour/1200~1299/1268.Search-Suggestions-System.md
index 759f58221..199967332 100644
--- a/website/content/ChapterFour/1200~1299/1268.Search-Suggestions-System.md
+++ b/website/content/ChapterFour/1200~1299/1268.Search-Suggestions-System.md
@@ -89,8 +89,9 @@ func suggestedProducts(products []string, searchWord string) [][]string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md b/website/content/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md
index eda51cd07..b7b372f41 100644
--- a/website/content/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md
+++ b/website/content/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md
@@ -154,8 +154,9 @@ func tictactoe(moves [][]int) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md b/website/content/ChapterFour/1200~1299/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md
index f512f8476..76073eee1 100644
--- a/website/content/ChapterFour/1200~1299/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md
+++ b/website/content/ChapterFour/1200~1299/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md
@@ -59,8 +59,9 @@ func subtractProductAndSum(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md b/website/content/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md
index 044a91c7b..b5af7002f 100644
--- a/website/content/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md
+++ b/website/content/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md
@@ -87,8 +87,9 @@ func calDivisor(nums []int, mid, threshold int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md b/website/content/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md
index 03294b899..a3c7d3680 100644
--- a/website/content/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md
+++ b/website/content/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md
@@ -49,8 +49,9 @@ func findSpecialInteger(arr []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md b/website/content/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md
index af3a2ca0a..83ad6414f 100644
--- a/website/content/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md
+++ b/website/content/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md
@@ -81,8 +81,9 @@ func getDecimalValue(head *ListNode) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination.md b/website/content/ChapterFour/1200~1299/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination.md
index f4cebe1fa..532e57c40 100644
--- a/website/content/ChapterFour/1200~1299/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination.md
+++ b/website/content/ChapterFour/1200~1299/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination.md
@@ -131,8 +131,9 @@ func isInBoard(board [][]int, x, y int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1295.Find-Numbers-with-Even-Number-of-Digits.md b/website/content/ChapterFour/1200~1299/1295.Find-Numbers-with-Even-Number-of-Digits.md
index afb613611..a46e5d2d9 100644
--- a/website/content/ChapterFour/1200~1299/1295.Find-Numbers-with-Even-Number-of-Digits.md
+++ b/website/content/ChapterFour/1200~1299/1295.Find-Numbers-with-Even-Number-of-Digits.md
@@ -63,8 +63,9 @@ func findNumbers(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.md b/website/content/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.md
index ea345986c..4bdd4e773 100644
--- a/website/content/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.md
+++ b/website/content/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.md
@@ -72,8 +72,9 @@ func isPossibleDivide(nums []int, k int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1200~1299/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md b/website/content/ChapterFour/1200~1299/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md
index ea964e728..738d7301b 100644
--- a/website/content/ChapterFour/1200~1299/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md
+++ b/website/content/ChapterFour/1200~1299/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md
@@ -51,8 +51,9 @@ func replaceElements(arr []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md b/website/content/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md
index 3e13fe77b..766651f6e 100644
--- a/website/content/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md
+++ b/website/content/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md
@@ -103,8 +103,9 @@ func min(a int, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md b/website/content/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md
index 6037e30c5..039696e1c 100644
--- a/website/content/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md
+++ b/website/content/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md
@@ -58,8 +58,9 @@ func dfsDeepestLeavesSum(root *TreeNode, level int, maxLevel, sum *int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md b/website/content/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md
index 35a82147a..88471d3d4 100644
--- a/website/content/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md
+++ b/website/content/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md
@@ -62,8 +62,9 @@ func sumZero(n int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees.md b/website/content/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees.md
index a29b324c2..b3f80f99f 100644
--- a/website/content/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees.md
+++ b/website/content/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees.md
@@ -90,8 +90,9 @@ func getAllElements1(root1 *TreeNode, root2 *TreeNode) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1300~1399/1306.Jump-Game-III.md b/website/content/ChapterFour/1300~1399/1306.Jump-Game-III.md
index e34767f0e..dadb5abce 100644
--- a/website/content/ChapterFour/1300~1399/1306.Jump-Game-III.md
+++ b/website/content/ChapterFour/1300~1399/1306.Jump-Game-III.md
@@ -80,8 +80,9 @@ func canReach(arr []int, start int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1300~1399/1310.XOR-Queries-of-a-Subarray.md b/website/content/ChapterFour/1300~1399/1310.XOR-Queries-of-a-Subarray.md
index 4c90917b3..b06dff3b4 100644
--- a/website/content/ChapterFour/1300~1399/1310.XOR-Queries-of-a-Subarray.md
+++ b/website/content/ChapterFour/1300~1399/1310.XOR-Queries-of-a-Subarray.md
@@ -77,8 +77,9 @@ func xorQueries(arr []int, queries [][]int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1300~1399/1313.Decompress-Run-Length-Encoded-List.md b/website/content/ChapterFour/1300~1399/1313.Decompress-Run-Length-Encoded-List.md
index 4d56280fb..9d3cc7faf 100644
--- a/website/content/ChapterFour/1300~1399/1313.Decompress-Run-Length-Encoded-List.md
+++ b/website/content/ChapterFour/1300~1399/1313.Decompress-Run-Length-Encoded-List.md
@@ -60,8 +60,9 @@ func decompressRLElist(nums []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1300~1399/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md b/website/content/ChapterFour/1300~1399/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md
index 889849408..5cd0e2fdc 100644
--- a/website/content/ChapterFour/1300~1399/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md
+++ b/website/content/ChapterFour/1300~1399/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md
@@ -96,8 +96,9 @@ func isNoZero(n int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md b/website/content/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md
index 2adf943ce..7b84267d0 100644
--- a/website/content/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md
+++ b/website/content/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md
@@ -90,8 +90,9 @@ func makeConnected(n int, connections [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md b/website/content/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md
index 7389fe3a5..8428631aa 100644
--- a/website/content/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md
+++ b/website/content/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md
@@ -57,8 +57,9 @@ func diagonalSort(mat [][]int) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences.md b/website/content/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences.md
index 7814cbb69..a3f0737d6 100644
--- a/website/content/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences.md
+++ b/website/content/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences.md
@@ -81,8 +81,9 @@ func removePalindromeSub(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md b/website/content/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md
index a00d8d9b0..875c35ff6 100644
--- a/website/content/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md
+++ b/website/content/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md
@@ -90,8 +90,9 @@ func kWeakestRows(mat [][]int, k int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1300~1399/1353.Maximum-Number-of-Events-That-Can-Be-Attended.md b/website/content/ChapterFour/1300~1399/1353.Maximum-Number-of-Events-That-Can-Be-Attended.md
index c0929cfa3..99a613312 100644
--- a/website/content/ChapterFour/1300~1399/1353.Maximum-Number-of-Events-That-Can-Be-Attended.md
+++ b/website/content/ChapterFour/1300~1399/1353.Maximum-Number-of-Events-That-Can-Be-Attended.md
@@ -113,8 +113,9 @@ func max(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix.md b/website/content/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix.md
index e17321058..824d04168 100644
--- a/website/content/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix.md
+++ b/website/content/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix.md
@@ -87,8 +87,9 @@ func luckyNumbers(matrix [][]int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1300~1399/1383.Maximum-Performance-of-a-Team.md b/website/content/ChapterFour/1300~1399/1383.Maximum-Performance-of-a-Team.md
index d4a3be6d2..1a4a9648c 100644
--- a/website/content/ChapterFour/1300~1399/1383.Maximum-Performance-of-a-Team.md
+++ b/website/content/ChapterFour/1300~1399/1383.Maximum-Performance-of-a-Team.md
@@ -105,8 +105,9 @@ func Max(a, b int64) int64 {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md b/website/content/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md
index 02541558a..1b3e12fed 100644
--- a/website/content/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md
+++ b/website/content/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md
@@ -98,8 +98,9 @@ func abs(a int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1300~1399/1389.Create-Target-Array-in-the-Given-Order.md b/website/content/ChapterFour/1300~1399/1389.Create-Target-Array-in-the-Given-Order.md
index 678e8f053..94318e880 100644
--- a/website/content/ChapterFour/1300~1399/1389.Create-Target-Array-in-the-Given-Order.md
+++ b/website/content/ChapterFour/1300~1399/1389.Create-Target-Array-in-the-Given-Order.md
@@ -90,8 +90,9 @@ func createTargetArray(nums []int, index []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1300~1399/1396.Design-Underground-System.md b/website/content/ChapterFour/1300~1399/1396.Design-Underground-System.md
index 883a83945..5f2908882 100644
--- a/website/content/ChapterFour/1300~1399/1396.Design-Underground-System.md
+++ b/website/content/ChapterFour/1300~1399/1396.Design-Underground-System.md
@@ -155,8 +155,9 @@ func (s *UndergroundSystem) GetAverageTime(startStation string, endStation strin
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1400~1499/1423.Maximum-Points-You-Can-Obtain-from-Cards.md b/website/content/ChapterFour/1400~1499/1423.Maximum-Points-You-Can-Obtain-from-Cards.md
index ecf600ef1..e1fac6352 100644
--- a/website/content/ChapterFour/1400~1499/1423.Maximum-Points-You-Can-Obtain-from-Cards.md
+++ b/website/content/ChapterFour/1400~1499/1423.Maximum-Points-You-Can-Obtain-from-Cards.md
@@ -90,8 +90,9 @@ func maxScore(cardPoints []int, k int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1400~1499/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md b/website/content/ChapterFour/1400~1499/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md
index 430eb24bc..b3c202a06 100644
--- a/website/content/ChapterFour/1400~1499/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md
+++ b/website/content/ChapterFour/1400~1499/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md
@@ -73,8 +73,9 @@ func kLengthApart(nums []int, k int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1400~1499/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit.md b/website/content/ChapterFour/1400~1499/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit.md
index 38a8e77ad..59f4a3479 100644
--- a/website/content/ChapterFour/1400~1499/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit.md
+++ b/website/content/ChapterFour/1400~1499/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit.md
@@ -89,8 +89,9 @@ func longestSubarray(nums []int, limit int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1400~1499/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows.md b/website/content/ChapterFour/1400~1499/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows.md
index 574a8f3a3..49183cb28 100644
--- a/website/content/ChapterFour/1400~1499/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows.md
+++ b/website/content/ChapterFour/1400~1499/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows.md
@@ -144,8 +144,9 @@ func (pq *priorityQueue) Push(i interface{}) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md b/website/content/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md
index e8fcfcce1..79d7880f5 100644
--- a/website/content/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md
+++ b/website/content/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md
@@ -97,8 +97,9 @@ func countTriplets(arr []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1400~1499/1446.Consecutive-Characters.md b/website/content/ChapterFour/1400~1499/1446.Consecutive-Characters.md
index 1d1beb7ff..4f72566da 100644
--- a/website/content/ChapterFour/1400~1499/1446.Consecutive-Characters.md
+++ b/website/content/ChapterFour/1400~1499/1446.Consecutive-Characters.md
@@ -75,8 +75,9 @@ func maxPower(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1400~1499/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md b/website/content/ChapterFour/1400~1499/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md
index 3bba6e43b..fc0b2705a 100644
--- a/website/content/ChapterFour/1400~1499/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md
+++ b/website/content/ChapterFour/1400~1499/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md
@@ -98,8 +98,9 @@ func isPrefixOfWord(sentence string, searchWord string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md b/website/content/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md
index 606ccb6dd..94dce65a2 100644
--- a/website/content/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md
+++ b/website/content/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md
@@ -86,8 +86,9 @@ func hasAllCodes(s string, k int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md b/website/content/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md
index bf04d0caf..c118f9c0a 100644
--- a/website/content/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md
+++ b/website/content/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md
@@ -149,8 +149,9 @@ func isInBoard(dp [][][]int, i, j, k int) int {
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md b/website/content/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md
index d318eb25b..3885dfddc 100644
--- a/website/content/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md
+++ b/website/content/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md
@@ -66,8 +66,9 @@ func maxProduct(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1400~1499/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts.md b/website/content/ChapterFour/1400~1499/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts.md
index 9a4a4bf64..abc8215e4 100644
--- a/website/content/ChapterFour/1400~1499/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts.md
+++ b/website/content/ChapterFour/1400~1499/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts.md
@@ -89,8 +89,9 @@ func maxArea(h int, w int, hcuts []int, vcuts []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1400~1499/1470.Shuffle-the-Array.md b/website/content/ChapterFour/1400~1499/1470.Shuffle-the-Array.md
index fc653d637..d40c5fbc7 100644
--- a/website/content/ChapterFour/1400~1499/1470.Shuffle-the-Array.md
+++ b/website/content/ChapterFour/1400~1499/1470.Shuffle-the-Array.md
@@ -64,8 +64,9 @@ func shuffle(nums []int, n int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1400~1499/1480.Running-Sum-of-1d-Array.md b/website/content/ChapterFour/1400~1499/1480.Running-Sum-of-1d-Array.md
index 6398e56a0..d66b176de 100644
--- a/website/content/ChapterFour/1400~1499/1480.Running-Sum-of-1d-Array.md
+++ b/website/content/ChapterFour/1400~1499/1480.Running-Sum-of-1d-Array.md
@@ -64,8 +64,9 @@ func runningSum(nums []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1400~1499/1482.Minimum-Number-of-Days-to-Make-m-Bouquets.md b/website/content/ChapterFour/1400~1499/1482.Minimum-Number-of-Days-to-Make-m-Bouquets.md
index 92c3ba07c..050dc0c0d 100644
--- a/website/content/ChapterFour/1400~1499/1482.Minimum-Number-of-Days-to-Make-m-Bouquets.md
+++ b/website/content/ChapterFour/1400~1499/1482.Minimum-Number-of-Days-to-Make-m-Bouquets.md
@@ -110,8 +110,9 @@ func minDays(bloomDay []int, m int, k int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1400~1499/1486.XOR-Operation-in-an-Array.md b/website/content/ChapterFour/1400~1499/1486.XOR-Operation-in-an-Array.md
index 5536755fb..6f41d60cd 100644
--- a/website/content/ChapterFour/1400~1499/1486.XOR-Operation-in-an-Array.md
+++ b/website/content/ChapterFour/1400~1499/1486.XOR-Operation-in-an-Array.md
@@ -69,8 +69,9 @@ func xorOperation(n int, start int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md b/website/content/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md
index 009b74b35..62fe7ea54 100644
--- a/website/content/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md
+++ b/website/content/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md
@@ -67,8 +67,9 @@ func numIdenticalPairs(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1500~1599/1518.Water-Bottles.md b/website/content/ChapterFour/1500~1599/1518.Water-Bottles.md
index e7817708c..1d27827b7 100644
--- a/website/content/ChapterFour/1500~1599/1518.Water-Bottles.md
+++ b/website/content/ChapterFour/1500~1599/1518.Water-Bottles.md
@@ -74,8 +74,9 @@ func numWaterBottles(numBottles int, numExchange int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md b/website/content/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md
index c22e07e0c..03d7b5c96 100644
--- a/website/content/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md
+++ b/website/content/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md
@@ -63,8 +63,9 @@ func findKthPositive(arr []int, k int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1500~1599/1551.Minimum-Operations-to-Make-Array-Equal.md b/website/content/ChapterFour/1500~1599/1551.Minimum-Operations-to-Make-Array-Equal.md
index 74ef1db9e..792f319a4 100644
--- a/website/content/ChapterFour/1500~1599/1551.Minimum-Operations-to-Make-Array-Equal.md
+++ b/website/content/ChapterFour/1500~1599/1551.Minimum-Operations-to-Make-Array-Equal.md
@@ -62,8 +62,9 @@ func minOperations(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1500~1599/1572.Matrix-Diagonal-Sum.md b/website/content/ChapterFour/1500~1599/1572.Matrix-Diagonal-Sum.md
index c0fe7ee41..b721b7bcb 100644
--- a/website/content/ChapterFour/1500~1599/1572.Matrix-Diagonal-Sum.md
+++ b/website/content/ChapterFour/1500~1599/1572.Matrix-Diagonal-Sum.md
@@ -77,8 +77,9 @@ func diagonalSum(mat [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String.md b/website/content/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String.md
index 916d942a9..d8e760224 100644
--- a/website/content/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String.md
+++ b/website/content/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String.md
@@ -108,8 +108,9 @@ func numWays(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1500~1599/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters.md b/website/content/ChapterFour/1500~1599/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters.md
index 7d57d2b0a..ef0dcf451 100644
--- a/website/content/ChapterFour/1500~1599/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters.md
+++ b/website/content/ChapterFour/1500~1599/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters.md
@@ -63,8 +63,9 @@ func modifyString(s string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.md b/website/content/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.md
index 8806ed95d..39b1cfac6 100644
--- a/website/content/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.md
+++ b/website/content/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.md
@@ -103,8 +103,9 @@ func maxNumEdgesToRemove(n int, edges [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1600.Throne-Inheritance.md b/website/content/ChapterFour/1600~1699/1600.Throne-Inheritance.md
index c20245511..75c1c7c08 100644
--- a/website/content/ChapterFour/1600~1699/1600.Throne-Inheritance.md
+++ b/website/content/ChapterFour/1600~1699/1600.Throne-Inheritance.md
@@ -120,8 +120,9 @@ func (t *ThroneInheritance) GetInheritanceOrder() (res []string) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1603.Design-Parking-System.md b/website/content/ChapterFour/1600~1699/1603.Design-Parking-System.md
index 274894e60..a45c897db 100644
--- a/website/content/ChapterFour/1600~1699/1603.Design-Parking-System.md
+++ b/website/content/ChapterFour/1600~1699/1603.Design-Parking-System.md
@@ -103,8 +103,9 @@ func (this *ParkingSystem) AddCar(carType int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md b/website/content/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md
index 447f61cc5..a62d48c27 100644
--- a/website/content/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md
+++ b/website/content/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md
@@ -80,8 +80,9 @@ func specialArray(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1609.Even-Odd-Tree.md b/website/content/ChapterFour/1600~1699/1609.Even-Odd-Tree.md
index 66be442a9..640acb097 100644
--- a/website/content/ChapterFour/1600~1699/1609.Even-Odd-Tree.md
+++ b/website/content/ChapterFour/1600~1699/1609.Even-Odd-Tree.md
@@ -150,8 +150,9 @@ func even(nums []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses.md b/website/content/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses.md
index 6800959bc..bb85c7708 100644
--- a/website/content/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses.md
+++ b/website/content/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses.md
@@ -102,8 +102,9 @@ func max(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements.md b/website/content/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements.md
index 27feadef2..4871456fc 100644
--- a/website/content/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements.md
+++ b/website/content/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements.md
@@ -74,8 +74,9 @@ func trimMean(arr []int) float64 {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters.md b/website/content/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters.md
index 0699f7d7a..5b46550f1 100644
--- a/website/content/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters.md
+++ b/website/content/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters.md
@@ -73,8 +73,9 @@ func maxLengthBetweenEqualCharacters(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1629.Slowest-Key.md b/website/content/ChapterFour/1600~1699/1629.Slowest-Key.md
index 3134c791a..1f0cffb3a 100644
--- a/website/content/ChapterFour/1600~1699/1629.Slowest-Key.md
+++ b/website/content/ChapterFour/1600~1699/1629.Slowest-Key.md
@@ -83,8 +83,9 @@ func slowestKey(releaseTimes []int, keysPressed string) byte {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md b/website/content/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md
index e219d8c62..dc29acae8 100644
--- a/website/content/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md
+++ b/website/content/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md
@@ -170,8 +170,9 @@ type edge struct {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md b/website/content/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md
index 517e4a895..89ea4f31d 100644
--- a/website/content/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md
+++ b/website/content/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md
@@ -66,8 +66,9 @@ func frequencySort(nums []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md b/website/content/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md
index 6b85c7d2f..c648c96f3 100644
--- a/website/content/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md
+++ b/website/content/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md
@@ -95,8 +95,9 @@ func canFormArray(arr []int, pieces [][]int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md b/website/content/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md
index 3967392c4..dc7edc7d1 100644
--- a/website/content/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md
+++ b/website/content/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md
@@ -90,8 +90,9 @@ func countVowelStrings1(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1642.Furthest-Building-You-Can-Reach.md b/website/content/ChapterFour/1600~1699/1642.Furthest-Building-You-Can-Reach.md
index 25a330745..c4de5975c 100644
--- a/website/content/ChapterFour/1600~1699/1642.Furthest-Building-You-Can-Reach.md
+++ b/website/content/ChapterFour/1600~1699/1642.Furthest-Building-You-Can-Reach.md
@@ -113,8 +113,9 @@ func (pq *heightDiffPQ) Pop() interface{} {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md b/website/content/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md
index 05c63906c..23f55d493 100644
--- a/website/content/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md
+++ b/website/content/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md
@@ -96,8 +96,9 @@ func getMaximumGenerated(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md b/website/content/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md
index 738cb9175..76962d201 100644
--- a/website/content/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md
+++ b/website/content/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md
@@ -89,8 +89,9 @@ func minDeletions(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md b/website/content/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md
index a341c7c9e..9785d26b9 100644
--- a/website/content/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md
+++ b/website/content/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md
@@ -131,8 +131,9 @@ func maxProfit(inventory []int, orders int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md b/website/content/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md
index cdd804681..d7b5194f8 100644
--- a/website/content/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md
+++ b/website/content/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md
@@ -149,8 +149,9 @@ func min(a int, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md b/website/content/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md
index 8f5dc35f7..c0efa9805 100644
--- a/website/content/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md
+++ b/website/content/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md
@@ -125,8 +125,9 @@ func decrypt(code []int, k int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md b/website/content/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md
index 15d8427ea..d5fdbd26d 100644
--- a/website/content/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md
+++ b/website/content/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md
@@ -90,8 +90,9 @@ func minimumDeletions1(s string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md b/website/content/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md
index bc5f9a413..7bc1cd4c1 100644
--- a/website/content/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md
+++ b/website/content/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md
@@ -101,8 +101,9 @@ func minimumJumps(forbidden []int, a int, b int, x int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md b/website/content/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md
index ca4122a86..583d619d8 100644
--- a/website/content/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md
+++ b/website/content/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md
@@ -112,8 +112,9 @@ func dfs(freq map[int]int, quantity []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md b/website/content/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md
index d71767f07..543c7920c 100644
--- a/website/content/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md
+++ b/website/content/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md
@@ -106,8 +106,9 @@ func (this *OrderedStream) Insert(id int, value string) []string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md b/website/content/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md
index c36f7fa20..1a702735f 100644
--- a/website/content/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md
+++ b/website/content/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md
@@ -114,8 +114,9 @@ func closeStrings(word1 string, word2 string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md b/website/content/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md
index 021824d22..73c1d49ad 100644
--- a/website/content/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md
+++ b/website/content/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md
@@ -96,8 +96,9 @@ func max(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md b/website/content/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md
index 049e5fcf1..456d695cf 100644
--- a/website/content/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md
+++ b/website/content/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md
@@ -185,8 +185,9 @@ func max(a int, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent.md b/website/content/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent.md
index 4b99dc3eb..ec384d1a3 100644
--- a/website/content/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent.md
+++ b/website/content/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent.md
@@ -65,8 +65,9 @@ func arrayStringsAreEqual(word1 []string, word2 []string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1663.Smallest-String-With-A-Given-Numeric-Value.md b/website/content/ChapterFour/1600~1699/1663.Smallest-String-With-A-Given-Numeric-Value.md
index b373c410f..5878976a6 100644
--- a/website/content/ChapterFour/1600~1699/1663.Smallest-String-With-A-Given-Numeric-Value.md
+++ b/website/content/ChapterFour/1600~1699/1663.Smallest-String-With-A-Given-Numeric-Value.md
@@ -102,8 +102,9 @@ func findSmallestString(value int, length, k, index int, str []byte, res *string
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md b/website/content/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md
index 1c6076177..618d5f53e 100644
--- a/website/content/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md
+++ b/website/content/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md
@@ -116,8 +116,9 @@ func waysToMakeFair1(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks.md b/website/content/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks.md
index e201a20d5..d2b402966 100644
--- a/website/content/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks.md
+++ b/website/content/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks.md
@@ -128,8 +128,9 @@ func (task Task) Swap(i, j int) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1668.Maximum-Repeating-Substring.md b/website/content/ChapterFour/1600~1699/1668.Maximum-Repeating-Substring.md
index f86e6bc16..bdeee9f7e 100644
--- a/website/content/ChapterFour/1600~1699/1668.Maximum-Repeating-Substring.md
+++ b/website/content/ChapterFour/1600~1699/1668.Maximum-Repeating-Substring.md
@@ -69,8 +69,9 @@ func maxRepeating(sequence string, word string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1669.Merge-In-Between-Linked-Lists.md b/website/content/ChapterFour/1600~1699/1669.Merge-In-Between-Linked-Lists.md
index 05e4afc49..f595dbe25 100644
--- a/website/content/ChapterFour/1600~1699/1669.Merge-In-Between-Linked-Lists.md
+++ b/website/content/ChapterFour/1600~1699/1669.Merge-In-Between-Linked-Lists.md
@@ -75,8 +75,9 @@ func mergeInBetween(list1 *ListNode, a int, b int, list2 *ListNode) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md b/website/content/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md
index db98ab366..268e8838c 100644
--- a/website/content/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md
+++ b/website/content/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md
@@ -172,8 +172,9 @@ func (this *FrontMiddleBackQueue) PopBack() int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1672.Richest-Customer-Wealth.md b/website/content/ChapterFour/1600~1699/1672.Richest-Customer-Wealth.md
index 72e287b64..015eef5aa 100644
--- a/website/content/ChapterFour/1600~1699/1672.Richest-Customer-Wealth.md
+++ b/website/content/ChapterFour/1600~1699/1672.Richest-Customer-Wealth.md
@@ -72,8 +72,9 @@ func maximumWealth(accounts [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1673.Find-the-Most-Competitive-Subsequence.md b/website/content/ChapterFour/1600~1699/1673.Find-the-Most-Competitive-Subsequence.md
index 02292dd4f..092d01911 100644
--- a/website/content/ChapterFour/1600~1699/1673.Find-the-Most-Competitive-Subsequence.md
+++ b/website/content/ChapterFour/1600~1699/1673.Find-the-Most-Competitive-Subsequence.md
@@ -62,8 +62,9 @@ func mostCompetitive(nums []int, k int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary.md b/website/content/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary.md
index 32997f177..21b829dee 100644
--- a/website/content/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary.md
+++ b/website/content/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary.md
@@ -97,8 +97,9 @@ func max(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1675.Minimize-Deviation-in-Array.md b/website/content/ChapterFour/1600~1699/1675.Minimize-Deviation-in-Array.md
index 974e444a2..c2307de6f 100644
--- a/website/content/ChapterFour/1600~1699/1675.Minimize-Deviation-in-Array.md
+++ b/website/content/ChapterFour/1600~1699/1675.Minimize-Deviation-in-Array.md
@@ -105,8 +105,9 @@ func minimumDeviation(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1678.Goal-Parser-Interpretation.md b/website/content/ChapterFour/1600~1699/1678.Goal-Parser-Interpretation.md
index 54cd358bd..0f3f81cee 100644
--- a/website/content/ChapterFour/1600~1699/1678.Goal-Parser-Interpretation.md
+++ b/website/content/ChapterFour/1600~1699/1678.Goal-Parser-Interpretation.md
@@ -73,8 +73,9 @@ func interpret(command string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md b/website/content/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md
index f95055aa9..f772058b9 100644
--- a/website/content/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md
+++ b/website/content/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md
@@ -98,8 +98,9 @@ func maxOperations_(nums []int, k int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md b/website/content/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md
index 085376b2c..57c6fb1a6 100644
--- a/website/content/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md
+++ b/website/content/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md
@@ -95,8 +95,9 @@ func concatenatedBinary1(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md b/website/content/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md
index e8a267e6b..f5904111a 100644
--- a/website/content/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md
+++ b/website/content/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md
@@ -122,8 +122,9 @@ func generatePermutation1681(nums, counts, order []int, index, sum, eachSize int
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md b/website/content/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md
index afe034b5c..d59707088 100644
--- a/website/content/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md
+++ b/website/content/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md
@@ -79,8 +79,9 @@ func countConsistentStrings(allowed string, words []string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md b/website/content/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md
index 4ab16dc75..360f4d2ee 100644
--- a/website/content/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md
+++ b/website/content/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md
@@ -88,8 +88,9 @@ func getSumAbsoluteDifferences1(nums []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1688.Count-of-Matches-in-Tournament.md b/website/content/ChapterFour/1600~1699/1688.Count-of-Matches-in-Tournament.md
index e8a8c3921..acb8750fd 100644
--- a/website/content/ChapterFour/1600~1699/1688.Count-of-Matches-in-Tournament.md
+++ b/website/content/ChapterFour/1600~1699/1688.Count-of-Matches-in-Tournament.md
@@ -80,8 +80,9 @@ func numberOfMatches1(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.md b/website/content/ChapterFour/1600~1699/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.md
index f3494ed47..8ce72c457 100644
--- a/website/content/ChapterFour/1600~1699/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.md
+++ b/website/content/ChapterFour/1600~1699/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.md
@@ -60,8 +60,9 @@ func minPartitions(n string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1690.Stone-Game-VII.md b/website/content/ChapterFour/1600~1699/1690.Stone-Game-VII.md
index c81e0619f..65fbf9923 100644
--- a/website/content/ChapterFour/1600~1699/1690.Stone-Game-VII.md
+++ b/website/content/ChapterFour/1600~1699/1690.Stone-Game-VII.md
@@ -130,8 +130,9 @@ func max(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids.md b/website/content/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids.md
index 623ab35ec..884010b4d 100644
--- a/website/content/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids.md
+++ b/website/content/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids.md
@@ -106,8 +106,9 @@ func max(x, y int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1694.Reformat-Phone-Number.md b/website/content/ChapterFour/1600~1699/1694.Reformat-Phone-Number.md
index d2705b8a9..791c3a49b 100644
--- a/website/content/ChapterFour/1600~1699/1694.Reformat-Phone-Number.md
+++ b/website/content/ChapterFour/1600~1699/1694.Reformat-Phone-Number.md
@@ -135,8 +135,9 @@ func reformatNumber(number string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md b/website/content/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md
index 7ca5b8842..c04849229 100644
--- a/website/content/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md
+++ b/website/content/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md
@@ -75,8 +75,9 @@ func max(a int, b int) int {
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1600~1699/1696.Jump-Game-VI.md b/website/content/ChapterFour/1600~1699/1696.Jump-Game-VI.md
index 155af11ea..23549365b 100644
--- a/website/content/ChapterFour/1600~1699/1696.Jump-Game-VI.md
+++ b/website/content/ChapterFour/1600~1699/1696.Jump-Game-VI.md
@@ -111,8 +111,9 @@ func max(a, b int) int {
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md b/website/content/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md
index 8ba364f7c..6e99e49a3 100644
--- a/website/content/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md
+++ b/website/content/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md
@@ -79,8 +79,9 @@ func countStudents(students []int, sandwiches []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1704.Determine-if-String-Halves-Are-Alike.md b/website/content/ChapterFour/1700~1799/1704.Determine-if-String-Halves-Are-Alike.md
index e3e454298..3c66fe75c 100644
--- a/website/content/ChapterFour/1700~1799/1704.Determine-if-String-Halves-Are-Alike.md
+++ b/website/content/ChapterFour/1700~1799/1704.Determine-if-String-Halves-Are-Alike.md
@@ -75,8 +75,9 @@ func numVowels(x string) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1705.Maximum-Number-of-Eaten-Apples.md b/website/content/ChapterFour/1700~1799/1705.Maximum-Number-of-Eaten-Apples.md
index fb4094c33..eaa77b35d 100644
--- a/website/content/ChapterFour/1700~1799/1705.Maximum-Number-of-Eaten-Apples.md
+++ b/website/content/ChapterFour/1700~1799/1705.Maximum-Number-of-Eaten-Apples.md
@@ -124,8 +124,9 @@ func (h *hp) Pop() interface{} {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1710.Maximum-Units-on-a-Truck.md b/website/content/ChapterFour/1700~1799/1710.Maximum-Units-on-a-Truck.md
index 2b311d0c0..49a47ef8f 100644
--- a/website/content/ChapterFour/1700~1799/1710.Maximum-Units-on-a-Truck.md
+++ b/website/content/ChapterFour/1700~1799/1710.Maximum-Units-on-a-Truck.md
@@ -77,8 +77,9 @@ func maximumUnits(boxTypes [][]int, truckSize int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1716.Calculate-Money-in-Leetcode-Bank.md b/website/content/ChapterFour/1700~1799/1716.Calculate-Money-in-Leetcode-Bank.md
index 48256ac74..d94ddbd37 100644
--- a/website/content/ChapterFour/1700~1799/1716.Calculate-Money-in-Leetcode-Bank.md
+++ b/website/content/ChapterFour/1700~1799/1716.Calculate-Money-in-Leetcode-Bank.md
@@ -64,8 +64,9 @@ func totalMoney(n int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1720.Decode-XORed-Array.md b/website/content/ChapterFour/1700~1799/1720.Decode-XORed-Array.md
index 130eb3d4f..ee09676fa 100644
--- a/website/content/ChapterFour/1700~1799/1720.Decode-XORed-Array.md
+++ b/website/content/ChapterFour/1700~1799/1720.Decode-XORed-Array.md
@@ -59,8 +59,9 @@ func decode(encoded []int, first int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1721.Swapping-Nodes-in-a-Linked-List.md b/website/content/ChapterFour/1700~1799/1721.Swapping-Nodes-in-a-Linked-List.md
index 70e7b2412..f2a594598 100644
--- a/website/content/ChapterFour/1700~1799/1721.Swapping-Nodes-in-a-Linked-List.md
+++ b/website/content/ChapterFour/1700~1799/1721.Swapping-Nodes-in-a-Linked-List.md
@@ -100,8 +100,9 @@ func swapNodes(head *ListNode, k int) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square.md b/website/content/ChapterFour/1700~1799/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square.md
index 05bb9b25d..47fdc0200 100644
--- a/website/content/ChapterFour/1700~1799/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square.md
+++ b/website/content/ChapterFour/1700~1799/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square.md
@@ -68,8 +68,9 @@ func countGoodRectangles(rectangles [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1732.Find-the-Highest-Altitude.md b/website/content/ChapterFour/1700~1799/1732.Find-the-Highest-Altitude.md
index 7ff314990..7663f2b09 100644
--- a/website/content/ChapterFour/1700~1799/1732.Find-the-Highest-Altitude.md
+++ b/website/content/ChapterFour/1700~1799/1732.Find-the-Highest-Altitude.md
@@ -55,8 +55,9 @@ func largestAltitude(gain []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1734.Decode-XORed-Permutation.md b/website/content/ChapterFour/1700~1799/1734.Decode-XORed-Permutation.md
index eef845b91..ef6c721d1 100644
--- a/website/content/ChapterFour/1700~1799/1734.Decode-XORed-Permutation.md
+++ b/website/content/ChapterFour/1700~1799/1734.Decode-XORed-Permutation.md
@@ -75,8 +75,9 @@ func decode(encoded []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1736.Latest-Time-by-Replacing-Hidden-Digits.md b/website/content/ChapterFour/1700~1799/1736.Latest-Time-by-Replacing-Hidden-Digits.md
index c8d3cf920..38c8b142a 100644
--- a/website/content/ChapterFour/1700~1799/1736.Latest-Time-by-Replacing-Hidden-Digits.md
+++ b/website/content/ChapterFour/1700~1799/1736.Latest-Time-by-Replacing-Hidden-Digits.md
@@ -75,8 +75,9 @@ func maximumTime(time string) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1738.Find-Kth-Largest-XOR-Coordinate-Value.md b/website/content/ChapterFour/1700~1799/1738.Find-Kth-Largest-XOR-Coordinate-Value.md
index c5d0cc20b..181fb74a8 100644
--- a/website/content/ChapterFour/1700~1799/1738.Find-Kth-Largest-XOR-Coordinate-Value.md
+++ b/website/content/ChapterFour/1700~1799/1738.Find-Kth-Largest-XOR-Coordinate-Value.md
@@ -111,8 +111,9 @@ func kthLargestValue1(matrix [][]int, k int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md b/website/content/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md
index 188f72959..1cc8ebe62 100644
--- a/website/content/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md
+++ b/website/content/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md
@@ -81,8 +81,9 @@ func countBalls(lowLimit int, highLimit int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day.md b/website/content/ChapterFour/1700~1799/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day.md
index 1be8f7864..fe93ab105 100644
--- a/website/content/ChapterFour/1700~1799/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day.md
+++ b/website/content/ChapterFour/1700~1799/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day.md
@@ -88,8 +88,9 @@ func canEat(candiesCount []int, queries [][]int) []bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md b/website/content/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md
index 27fade95e..d47f80847 100644
--- a/website/content/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md
+++ b/website/content/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md
@@ -67,8 +67,9 @@ func sumOfUnique(nums []int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated.md b/website/content/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated.md
index b72e4ff6e..c2c792a18 100644
--- a/website/content/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated.md
+++ b/website/content/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated.md
@@ -86,8 +86,9 @@ func check(nums []int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1758.Minimum-Changes-To-Make-Alternating-Binary-String.md b/website/content/ChapterFour/1700~1799/1758.Minimum-Changes-To-Make-Alternating-Binary-String.md
index 7e06a4478..19c3e7c6b 100644
--- a/website/content/ChapterFour/1700~1799/1758.Minimum-Changes-To-Make-Alternating-Binary-String.md
+++ b/website/content/ChapterFour/1700~1799/1758.Minimum-Changes-To-Make-Alternating-Binary-String.md
@@ -70,8 +70,9 @@ func min(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md b/website/content/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md
index 4b574b199..6a0838f48 100644
--- a/website/content/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md
+++ b/website/content/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md
@@ -140,8 +140,9 @@ func checkNiceString(m map[byte]int) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1700~1799/1791.Find-Center-of-Star-Graph.md b/website/content/ChapterFour/1700~1799/1791.Find-Center-of-Star-Graph.md
index 6e91c8abc..e592d34f1 100644
--- a/website/content/ChapterFour/1700~1799/1791.Find-Center-of-Star-Graph.md
+++ b/website/content/ChapterFour/1700~1799/1791.Find-Center-of-Star-Graph.md
@@ -52,8 +52,9 @@ func findCenter(edges [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1800~1899/1816.Truncate-Sentence.md b/website/content/ChapterFour/1800~1899/1816.Truncate-Sentence.md
index 74b52d890..0d319667c 100644
--- a/website/content/ChapterFour/1800~1899/1816.Truncate-Sentence.md
+++ b/website/content/ChapterFour/1800~1899/1816.Truncate-Sentence.md
@@ -76,8 +76,9 @@ func truncateSentence(s string, k int) string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference.md b/website/content/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference.md
index 204e09c1a..9dfcff6fc 100644
--- a/website/content/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference.md
+++ b/website/content/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference.md
@@ -108,8 +108,9 @@ func min(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1800~1899/1846.Maximum-Element-After-Decreasing-and-Rearranging.md b/website/content/ChapterFour/1800~1899/1846.Maximum-Element-After-Decreasing-and-Rearranging.md
index 8b68e57ac..c1b905b96 100644
--- a/website/content/ChapterFour/1800~1899/1846.Maximum-Element-After-Decreasing-and-Rearranging.md
+++ b/website/content/ChapterFour/1800~1899/1846.Maximum-Element-After-Decreasing-and-Rearranging.md
@@ -103,8 +103,9 @@ func min(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array.md b/website/content/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array.md
index 26bc64c66..42172a6f8 100644
--- a/website/content/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array.md
+++ b/website/content/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array.md
@@ -80,8 +80,9 @@ func max(a, b int) int {
}
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md b/website/content/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md
index 31ce16d63..2afbf9909 100644
--- a/website/content/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md
+++ b/website/content/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md
@@ -71,8 +71,9 @@ func minimumDifference(nums []int, k int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/2000~2099/2021.Brightest-Position-on-Street.md b/website/content/ChapterFour/2000~2099/2021.Brightest-Position-on-Street.md
index d223af086..5e8d78906 100644
--- a/website/content/ChapterFour/2000~2099/2021.Brightest-Position-on-Street.md
+++ b/website/content/ChapterFour/2000~2099/2021.Brightest-Position-on-Street.md
@@ -109,8 +109,9 @@ func brightestPosition(lights [][]int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/2000~2099/2022.Convert-1D-Array-Into-2D-Array.md b/website/content/ChapterFour/2000~2099/2022.Convert-1D-Array-Into-2D-Array.md
index 29646b4a0..a5632c479 100644
--- a/website/content/ChapterFour/2000~2099/2022.Convert-1D-Array-Into-2D-Array.md
+++ b/website/content/ChapterFour/2000~2099/2022.Convert-1D-Array-Into-2D-Array.md
@@ -77,8 +77,9 @@ func construct2DArray(original []int, m int, n int) [][]int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/2000~2099/2037.Minimum-Number-of-Moves-to-Seat-Everyone.md b/website/content/ChapterFour/2000~2099/2037.Minimum-Number-of-Moves-to-Seat-Everyone.md
index 8f7878c44..69cc6f019 100644
--- a/website/content/ChapterFour/2000~2099/2037.Minimum-Number-of-Moves-to-Seat-Everyone.md
+++ b/website/content/ChapterFour/2000~2099/2037.Minimum-Number-of-Moves-to-Seat-Everyone.md
@@ -94,8 +94,9 @@ func abs(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/2000~2099/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color.md b/website/content/ChapterFour/2000~2099/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color.md
index 09091fcc8..580b1d0f9 100644
--- a/website/content/ChapterFour/2000~2099/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color.md
+++ b/website/content/ChapterFour/2000~2099/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color.md
@@ -105,8 +105,9 @@ func winnerOfGame(colors string) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/2000~2099/2043.Simple-Bank-System.md b/website/content/ChapterFour/2000~2099/2043.Simple-Bank-System.md
index b756eb8e0..272b8b39c 100644
--- a/website/content/ChapterFour/2000~2099/2043.Simple-Bank-System.md
+++ b/website/content/ChapterFour/2000~2099/2043.Simple-Bank-System.md
@@ -113,8 +113,9 @@ func (this *Bank) Withdraw(account int, money int64) bool {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.md b/website/content/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.md
index 65dcf54fb..880906749 100644
--- a/website/content/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.md
+++ b/website/content/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.md
@@ -145,8 +145,9 @@ func min(i, j int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/2100~2199/2164.Sort-Even-and-Odd-Indices-Independently.md b/website/content/ChapterFour/2100~2199/2164.Sort-Even-and-Odd-Indices-Independently.md
index bb3a1e28c..b970eebf1 100644
--- a/website/content/ChapterFour/2100~2199/2164.Sort-Even-and-Odd-Indices-Independently.md
+++ b/website/content/ChapterFour/2100~2199/2164.Sort-Even-and-Odd-Indices-Independently.md
@@ -93,8 +93,9 @@ func sortEvenOdd(nums []int) []int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/2100~2199/2165.Smallest-Value-of-the-Rearranged-Number.md b/website/content/ChapterFour/2100~2199/2165.Smallest-Value-of-the-Rearranged-Number.md
index d2ce438b0..007d87936 100644
--- a/website/content/ChapterFour/2100~2199/2165.Smallest-Value-of-the-Rearranged-Number.md
+++ b/website/content/ChapterFour/2100~2199/2165.Smallest-Value-of-the-Rearranged-Number.md
@@ -101,8 +101,9 @@ func smallestNumber(num int64) int64 {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/2100~2199/2166.Design-Bitset.md b/website/content/ChapterFour/2100~2199/2166.Design-Bitset.md
index 8fbc2a786..9b2d780cd 100644
--- a/website/content/ChapterFour/2100~2199/2166.Design-Bitset.md
+++ b/website/content/ChapterFour/2100~2199/2166.Design-Bitset.md
@@ -156,8 +156,9 @@ func (this *Bitset) ToString() string {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/2100~2199/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods.md b/website/content/ChapterFour/2100~2199/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods.md
index 867f7fc8e..07241ab53 100644
--- a/website/content/ChapterFour/2100~2199/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods.md
+++ b/website/content/ChapterFour/2100~2199/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods.md
@@ -149,8 +149,9 @@ func min(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/2100~2199/2169.Count-Operations-to-Obtain-Zero.md b/website/content/ChapterFour/2100~2199/2169.Count-Operations-to-Obtain-Zero.md
index 588a18794..02a977464 100644
--- a/website/content/ChapterFour/2100~2199/2169.Count-Operations-to-Obtain-Zero.md
+++ b/website/content/ChapterFour/2100~2199/2169.Count-Operations-to-Obtain-Zero.md
@@ -73,8 +73,9 @@ func countOperations(num1 int, num2 int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/2100~2199/2170.Minimum-Operations-to-Make-the-Array-Alternating.md b/website/content/ChapterFour/2100~2199/2170.Minimum-Operations-to-Make-the-Array-Alternating.md
index e41c64ec8..a76eb3186 100644
--- a/website/content/ChapterFour/2100~2199/2170.Minimum-Operations-to-Make-the-Array-Alternating.md
+++ b/website/content/ChapterFour/2100~2199/2170.Minimum-Operations-to-Make-the-Array-Alternating.md
@@ -130,8 +130,9 @@ func min(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/2100~2199/2171.Removing-Minimum-Number-of-Magic-Beans.md b/website/content/ChapterFour/2100~2199/2171.Removing-Minimum-Number-of-Magic-Beans.md
index 410c13c7c..37bb1dc75 100644
--- a/website/content/ChapterFour/2100~2199/2171.Removing-Minimum-Number-of-Magic-Beans.md
+++ b/website/content/ChapterFour/2100~2199/2171.Removing-Minimum-Number-of-Magic-Beans.md
@@ -90,8 +90,9 @@ func max(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/2100~2199/2180.Count-Integers-With-Even-Digit-Sum.md b/website/content/ChapterFour/2100~2199/2180.Count-Integers-With-Even-Digit-Sum.md
index 4685d7d37..e140868ee 100644
--- a/website/content/ChapterFour/2100~2199/2180.Count-Integers-With-Even-Digit-Sum.md
+++ b/website/content/ChapterFour/2100~2199/2180.Count-Integers-With-Even-Digit-Sum.md
@@ -69,8 +69,9 @@ func addSum(num int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/2100~2199/2181.Merge-Nodes-in-Between-Zeros.md b/website/content/ChapterFour/2100~2199/2181.Merge-Nodes-in-Between-Zeros.md
index 35ef63ea0..803baf335 100644
--- a/website/content/ChapterFour/2100~2199/2181.Merge-Nodes-in-Between-Zeros.md
+++ b/website/content/ChapterFour/2100~2199/2181.Merge-Nodes-in-Between-Zeros.md
@@ -96,8 +96,9 @@ func mergeNodes(head *ListNode) *ListNode {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/2100~2199/2182.Construct-String-With-Repeat-Limit.md b/website/content/ChapterFour/2100~2199/2182.Construct-String-With-Repeat-Limit.md
index 0507b90ee..989ae0296 100644
--- a/website/content/ChapterFour/2100~2199/2182.Construct-String-With-Repeat-Limit.md
+++ b/website/content/ChapterFour/2100~2199/2182.Construct-String-With-Repeat-Limit.md
@@ -98,8 +98,9 @@ func min(a, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterFour/2100~2199/2183.Count-Array-Pairs-Divisible-by-K.md b/website/content/ChapterFour/2100~2199/2183.Count-Array-Pairs-Divisible-by-K.md
index 71d925113..edf65385b 100644
--- a/website/content/ChapterFour/2100~2199/2183.Count-Array-Pairs-Divisible-by-K.md
+++ b/website/content/ChapterFour/2100~2199/2183.Count-Array-Pairs-Divisible-by-K.md
@@ -85,6 +85,7 @@ func gcd(a, b int) int {
```
+
----------------------------------------------
-⬅️上一页
+⬅️previous page
diff --git a/website/content/ChapterFour/_index.md b/website/content/ChapterFour/_index.md
index b3eaba6b8..f2d927de8 100644
--- a/website/content/ChapterFour/_index.md
+++ b/website/content/ChapterFour/_index.md
@@ -18,8 +18,9 @@ weight: 4
让我们在题解的太空遨游吧~
+
----------------------------------------------
diff --git a/website/content/ChapterOne/Algorithm.md b/website/content/ChapterOne/Algorithm.md
index 45b4f74ff..42be85e65 100644
--- a/website/content/ChapterOne/Algorithm.md
+++ b/website/content/ChapterOne/Algorithm.md
@@ -1,34 +1,33 @@
---
-title: 1.2 算法知识
+title: 1.2 Algorithm knowledge
type: docs
weight: 2
---
+# Algorithm knowledge
-# 算法知识
+The following is the knowledge related to the algorithm compiled by the author. Hope to enumerate all common algorithms exhaustively. If there are any omissions, please enlighten me and raise PR. Relevant topics are still being sorted out slowly, and the articles explained are still being created.
-以下是笔者整理的算法相关的知识。希望能把常见的算法都枚举穷尽。如有遗漏，欢迎大家赐教，提 PR。相关题目还在慢慢整理中，讲解的文章还在创作中。
+> Writing questions is just a means to improve algorithmic ability, the ultimate goal should be to improve self-thinking ability, knowledge needs to be condensed into blocks, then summarize these in the first two sections of Chapter 1, let it be sublimated~ I hope readers are reading After finishing the questions and looking back at this form, you can clearly sort out your knowledge system, check for gaps and fill in gaps, and improve them as soon as possible.
-> 刷题只是提升算法能力的手段，最终目的应该是提升自我的思维能力，知识需要凝结成块，那么就把这些总结在第一章这两节中，让它得到升华吧~希望读者在刷完题之后再回过头来看这个表格，能很清晰的梳理自己的知识体系，查缺补漏，尽早完善。
-
-| 算法 | 具体类型 | 相关题目 | 讲解文章 |
+| Algorithms | Concrete Types | Related Topics | Explained Articles |
|:-------:|:-------|:------|:------|
-|排序算法|1. 冒泡排序
2. 插入排序
3. 选择排序
4. 希尔 Shell 排序
5. 快速排序
6. 归并排序
7. 堆排序
8. 线性排序算法
9. 自省排序
10. 间接排序
11. 计数排序
12. 基数排序
13. 桶排序
14. 外部排序 - k 路归并败者树
15. 外部排序 - 最佳归并树|||
-|递归与分治||1. 二分搜索/查找
2. 大整数的乘法
3. Strassen 矩阵乘法
4. 棋盘覆盖
5. 合并排序
6. 快速排序
7. 线性时间选择
8. 最接近点对问题
9. 循环赛日程表
||
-|动态规划||1. 矩阵连乘问题
2. 最长公共子序列
3. 最大子段和
4. 凸多边形最优三角剖分
5. 多边形游戏
6. 图像压缩
7. 电路布线
8. 流水作业调度
9. 0-1 背包问题/背包九讲
10. 最优二叉搜索树
11. 动态规划加速原理
12. 树型 DP
||
-|贪心||1. 活动安排问题
2. 最优装载
3. 哈夫曼编码
4. 单源最短路径
5. 最小生成树
6. 多机调度问题
||
-|回溯法||1. 装载问题
2. 批处理作业调度
3. 符号三角形问题
4. n 后问题
5. 0-1 背包问题
6. 最大团问题
7. 图的 m 着色问题
8. 旅行售货员问题
9. 圆排列问题
10. 电路板排列问题
11. 连续邮资问题
||
-|搜索|1. 枚举
2. DFS
3. BFS
4. 启发式搜索
|||
-|随机化|1. 随机数
2. 数值随机化算法
3. Sherwood 舍伍德算法
4. Las Vegas 拉斯维加斯算法
5. Monte Carlo 蒙特卡罗算法
|1. 计算 π 值
2. 计算定积分
3. 解非线性方程组
4. 线性时间选择算法
5. 跳跃表
6. n 后问题
7. 整数因子分解
8. 主元素问题
9. 素数测试
||
-|图论|1. 遍历 DFS / BFS
2. AOV / AOE 网络
3. Kruskal 算法(最小生成树)
4. Prim 算法(最小生成树)
5. Boruvka 算法(最小生成树)
6. Dijkstra 算法(单源最短路径)
7. Bellman-Ford 算法(单源最短路径)
8. SPFA 算法(单源最短路径)
9. Floyd 算法(多源最短路径)
10. Johnson 算法(多源最短路径)
11. Fleury 算法(欧拉回路)
12. Ford-Fulkerson 算法(最大网络流增广路)
13. Edmonds-Karp 算法(最大网络流)
14. Dinic 算法(最大网络流)
15. 一般预流推进算法
16. 最高标号预流推进 HLPP 算法
17. Primal-Dual 原始对偶算法(最小费用流)18. Kosaraju 算法(有向图强连通分量)
19. Tarjan 算法(有向图强连通分量)
20. Gabow 算法(有向图强连通分量)
21. 匈牙利算法(二分图匹配)
22. Hopcroft－Karp 算法(二分图匹配)
23. kuhn munkras 算法(二分图最佳匹配)
24. Edmonds’ Blossom-Contraction 算法(一般图匹配)
|1. 图遍历
2. 有向图和无向图的强弱连通性
3. 割点/割边
3. AOV 网络和拓扑排序
4. AOE 网络和关键路径
5. 最小代价生成树/次小生成树
6. 最短路径问题/第 K 短路问题
7. 最大网络流问题
8. 最小费用流问题
9. 图着色问题
10. 差分约束系统
11. 欧拉回路
12. 中国邮递员问题
13. 汉密尔顿回路
14. 最佳边割集/最佳点割集/最小边割集/最小点割集/最小路径覆盖/最小点集覆盖
15. 边覆盖集
16. 二分图完美匹配和最大匹配问题
17. 仙人掌图
18. 弦图
19. 稳定婚姻问题
20. 最大团问题
||
-|数论||1. 最大公约数
2. 最小公倍数
3. 分解质因数
4. 素数判定
5. 进制转换
6. 高精度计算
7. 整除问题
8. 同余问题
9. 欧拉函数
10. 扩展欧几里得
11. 置换群
12. 母函数
13. 离散变换
14. 康托展开
15. 矩阵
16. 向量
17. 线性方程组
18. 线性规划
||
-|几何||1. 凸包 - Gift wrapping
2. 凸包 - Graham scan
3. 线段问题
4. 多边形和多面体相关问题
||
-|NP 完全|1. 计算模型
2. P 类与 NP 类问题
3. NP 完全问题
4. NP 完全问题的近似算法
|1. 随机存取机 RAM
2. 随机存取存储程序机 RASP
3. 图灵机
4. 非确定性图灵机
5. P 类与 NP 类语言
6. 多项式时间验证
7. 多项式时间变换
8. Cook定理
9. 合取范式的可满足性问题 CNF-SAT
10. 3 元合取范式的可满足性问题 3-SAT
11. 团问题 CLIQUE
12. 顶点覆盖问题 VERTEX-COVER
13. 子集和问题 SUBSET-SUM
14. 哈密顿回路问题 HAM-CYCLE
15. 旅行售货员问题 TSP
16. 顶点覆盖问题的近似算法
17. 旅行售货员问题近似算法
18. 具有三角不等式性质的旅行售货员问题
19. 一般的旅行售货员问题
20. 集合覆盖问题的近似算法
21. 子集和问题的近似算法
22. 子集和问题的指数时间算法
23. 子集和问题的多项式时间近似格式
||
-|位运算| 位操作包括：
1. 取反（NOT）
2. 按位或（OR）
3. 按位异或（XOR）
4. 按位与（AND）
5. 移位: 是一个二元运算符，用来将一个二进制数中的每一位全部都向一个方向移动指定位，溢出的部分将被舍弃，而空缺的部分填入一定的值。
| 1.数字范围按位与
2.UTF-8 编码验证
3.数字转换为十六进制数
4.找出最长的超赞子字符串
5.数组异或操作
6.幂集
7.位1的个数
8.二进制表示中质数个计算置位
9.子数组异或查询
| [力扣：位运算](https://leetcode-cn.com/tag/bit-manipulation/)|
+|Sorting Algorithm|1. Bubble Sort
2. Insertion Sort
3. Selection Sort
4. Shell Shell Sort
5. Quick Sort
6. Merge Sort
7 . Heap sort
8. Linear sorting algorithm
9. Introspective sorting
10. Indirect sorting
11. Counting sorting
12. Radix sorting
13. Bucket sorting
14 . External sorting -k-way merge loser tree
15. External sorting -optimal merging tree|||
+|Recursion and divide and conquer||1. Binary search/find
2. Multiplication of large integers
3. Strassen matrix multiplication
4. Checkerboard covering
5. Merge sort
6. Fast Sorting
7. Linear Time Selection
8. Closest Point Pair Problem
9. Round Robin Schedule
||
+|Dynamic programming||1. Matrix multiplication problem
2. Longest common subsequence
3. Maximum subsegment sum
4. Optimal triangulation of convex polygon
5. Polygon game
br>6. Image Compression
7. Circuit Routing
8. Pipeline Job Scheduling
9. 0-1 Knapsack Problem/Knapsack Nine Lectures
10. Optimal Binary Search Tree
11 . Dynamic Programming Acceleration Principle
12. Tree DP
||
+|Greedy||1. Activity scheduling problem
2. Optimal loading
3. Huffman coding
4. Single-source shortest path
5. Minimum spanning tree
6. Multi-machine Scheduling problem
||
+|Backtracking||1. Loading Problem
2. Batch Job Scheduling
3. Signed Triangle Problem
4. Post n Problem
5. 0-1 Knapsack Problem
6. Maximum Group problem
7. m-coloring problem of graph
8. traveling salesman problem
9. circle permutation problem
10. circuit board permutation problem
11. continuous postage problem
||
+|Search|1. Enumeration
2. DFS
3. BFS
4. Heuristic Search
|||
+|Randomization|1. Random Number
2. Numerical Randomization Algorithm
3. Sherwood Algorithm
4. Las Vegas Algorithm
5. Monte Carlo Algorithm
|1. Calculate the value of π
2. Calculate the definite integral
3. Solve nonlinear equations
4. Linear time selection algorithm
5. Jump table
6. After n Problem
7. Integer Factorization
8. Principal Element Problem
9. Prime Number Test
||
+|Graph Theory|1. Traverse DFS /BFS
2. AOV /AOE Network
3. Kruskal Algorithm (Minimum Spanning Tree)
4. Prim Algorithm (Minimum Spanning Tree)
5. Boruvka Algorithm (Minimal Spanning Tree)
6. Dijkstra Algorithm (Single-Source Shortest Path)
7. Bellman-Ford Algorithm (Single-Source Shortest Path)
8. SPFA Algorithm (Single-Source Shortest Path)
9 . Floyd's Algorithm (Multiple-Source Shortest Path)
10. Johnson's Algorithm (Multiple-Source Shortest Path)
11. Fleury's Algorithm (Eulerian Circuit)
12. Ford-Fulkerson Algorithm (Maximum Network Flow Augmenting Path )
13. Edmonds-Karp Algorithm (Maximum Network Flow)
14. Dinic Algorithm (Maximum Network Flow)
15. General Preflow Pushing Algorithm
16. Highest Label Preflow Pushing HLPP Algorithm
br>17. Primal-Dual algorithm (minimum cost flow)18. Kosaraju algorithm (directed graph strongly connected components)
19. Tarjan algorithm (directed graph strongly connected components)
20. Gabow algorithm ( Directed graph strong connected components)
21. Hungarian algorithm (bipartite graph matching)
22. Hopcroft－Karp algorithm (bipartite graph matching)
23. kuhn munkras algorithm (bipartite graph matching)
23. kuhn munkras algorithm (bipartite graph matching)
>24. Edmonds' Blossom-Contraction Algorithm (General Graph Matching)
|1. Graph Traversal
2. Strong and Weak Connectivity of Directed and Undirected Graphs
3. Cutting Points/Edges
br>3. AOV Network and Topological Sorting
4. AOE Network and Critical Path
5. Minimum Cost Spanning Tree/Sub-Minimal Spanning Tree
6. Shortest Path Problem/Kth Short Circuit Problem
7 . Maximum Network Flow Problem
8. Minimum Cost Flow Problem
9. Graph Coloring Problem
10. Differential Constraint Systems
11. Euler Circuit
12. Chinese Postman Problem
13 .Hamiltonian circuit
14. Best edge cut set/best point cut set/minimum edge cut set/minimum point cut set/minimum path cover/minimum point set cover
15. Edge cover set
16 . Bipartite Graph Perfect Matching and Maximum Matching Problem
17. Cactus Graph
18. Chord Graph
19. Stable Marriage Problem
20. Maximum Clique Problem
||
+|Number theory||1. Greatest common divisor
2. Least common multiple
3. Decomposition of prime factors
4. Prime number determination
5. Base conversion
6. High-precision calculation
7. Divisibility Problems
8. Congruence Problems
9. Euler Functions
10. Extended Euclidean
11. Permutation Groups
12. Generating Functions
13. Discrete Transformation
14. Cantor Expansion
15. Matrix
16. Vector
17. Linear Equations
18. Linear Programming
||
+|Geometry||1. Convex Hull -Gift wrapping
2. Convex Hull -Graham scan
3. Line Segment Problems
4. Polygon and Polyhedron Related Problems
||
+|NP-Complete|1. Computational Model
2. P-type and NP-type Problems
3. NP-Complete Problems
4. Approximate Algorithms for NP-Complete Problems
|1. Random Access Machine RAM
br>2. Random Access Stored Program Machine RASP
3. Turing Machine
4. Nondeterministic Turing Machine
5. P-type and NP-like Languages
6. Polynomial Time Verification
7. Polynomial Time Transforms
8. Cook's Theorem
9. The Satisfiability Problem of Conjunctive Normal Form CNF-SAT
10. The Satisfiability Problem of Conjunctive Normal Form 3-SAT
11 . Clique Problem CLIQUE
12. Vertex Covering Problem VERTEX-COVER
13. Subset Sum Problem SUBSET-SUM
14. Hamiltonian Circuit Problem HAM-CYCLE
15. Traveling Salesman Problem TSP
>16. Approximate Algorithm for Vertex Covering Problem
17. Approximate Algorithm for Traveling Salesman Problem
18. Traveling Salesman Problem with Triangle Inequality Properties
19. General Traveling Salesman Problem
20. Set Covering Problem Approximation Algorithms for Subset Sums
21. Approximation Algorithms for Subset Sums
22. Exponential Time Algorithms for Subset Sums
23. Polynomial Time Approximation Form for Subset Sums
||
+|Bit operations| Bit operations include:
1. Inversion (NOT)
2. Bitwise OR (OR)
3. Bitwise exclusive OR (XOR)
4. Bitwise AND ( AND)
5. Shift: It is a binary operator, used to move each bit in a binary number to a specified bit in one direction, the overflow part will be discarded, and the vacant part will be filled certain value.
| 1. Number range bitwise AND
2. UTF-8 encoding verification
3. Number conversion to hexadecimal number
4. Find the longest awesome substring
br> 5. Array XOR operation
6. Power set
7. The number of bit 1
8. The calculation and setting of prime numbers in binary representation
9. Sub-array XOR query
>| [Leetcode: Bit Manipulation](https://leetcode-cn.com/tag/bit-manipulation/)|
|------------|------------------------------------------------------------------|-----------------------------------------------------------------|--------------------|
----------------------------------------------
diff --git a/website/content/ChapterOne/Data_Structure.md b/website/content/ChapterOne/Data_Structure.md
index 7ccb955e7..7070df2e8 100644
--- a/website/content/ChapterOne/Data_Structure.md
+++ b/website/content/ChapterOne/Data_Structure.md
@@ -1,32 +1,31 @@
---
-title: 1.1 数据结构知识
+title: 1.1 Data structure knowledge
type: docs
weight: 1
---
+# Data structure knowledge
-# 数据结构知识
+The following is the knowledge related to the data structure compiled by the author. Hope to enumerate all common data structures exhaustively. If there are any omissions, please enlighten me and raise PR. Relevant topics are still being sorted out slowly, and the articles explained are still being created.
-以下是笔者整理的数据结构相关的知识。希望能把常见的数据结构都枚举穷尽。如有遗漏，欢迎大家赐教，提 PR。相关题目还在慢慢整理中，讲解的文章还在创作中。
+> Writing questions is just a means to improve algorithmic ability, the ultimate goal should be to improve self-thinking ability, knowledge needs to be condensed into blocks, then summarize these in the first two sections of Chapter 1, let it be sublimated~ I hope readers are reading After finishing the questions and looking back at this form, you can clearly sort out your knowledge system, check for gaps and fill in gaps, and improve them as soon as possible.
-> 刷题只是提升算法能力的手段，最终目的应该是提升自我的思维能力，知识需要凝结成块，那么就把这些总结在第一章这两节中，让它得到升华吧~希望读者在刷完题之后再回过头来看这个表格，能很清晰的梳理自己的知识体系，查缺补漏，尽早完善。
-
-| 数据结构 | 变种 | 相关题目 | 讲解文章 |
+| Data Structures | Variations | Related Topics | Explained Articles |
|:-------:|:-------|:------|:------|
-|顺序线性表：向量
Vector||||
-|单链表
Singly Linked List|1. 双向链表 Double Linked Lists
2. 静态链表 Static List
3. 对称矩阵 Symmetric Matrix
4. 稀疏矩阵 Sparse Matrix|||
-|哈希表
Hash Table|1. 散列函数 Hash Function
2. 解决碰撞/填充因子 Collision Resolution
|||
-|栈和队列
Stack & Queue|1. 广义表 Generalized List/GList
2. 双端队列 Deque
|||
-|队列
Queue|1. 链表实现 Linked List Implementation
2. 循环数组实现 ArrayQueue
3. 双端队列 Deque
4. 优先队列 Priority Queue
5. 循环队列 Circular Queue|||
-|字符串
String|1. KMP 算法
2. 有限状态自动机
3. 模式匹配有限状态自动机
4. BM 模式匹配算法
5. BM-KMP 算法
6. BF 算法|||
-|树
Tree|1. 二叉树 Binary Tree
2. 并查集 Union-Find
3. Huffman 树|||
-|数组实现的堆
Heap|1. 极大堆和极小堆 Max Heap and Min Heap
2. 极大极小堆
3. 双端堆 Deap
4. d 叉堆|||
-|树实现的堆
Heap|1. 左堆 Leftist Tree/Leftist Heap
2. 扁堆
3. 二项式堆
4. 斐波那契堆 Fibonacco Heap
5. 配对堆 Pairing Heap|||
-|查找
Search|1. 哈希表 Hash
2. 跳跃表 Skip List
3. 排序二叉树 Binary Sort Tree
4. AVL 树
5. B 树 / B+ 树 / B* 树
6. AA 树
7. 红黑树 Red Black Tree
8. 排序二叉堆 Binary Heap
9. Splay 树
10. 双链树 Double Chained Tree
11. Trie 树
12. R 树|||
+|Sequential Linear Table: Vector
Vector||||
+|Singly Linked List
Singly Linked List|1. Double Linked Lists
2. Static List
3. Symmetric Matrix
4. Sparse Matrix|||
+|Hash Table
Hash Table|1. Hash Function
2. Collision Resolution
|||
+|Stack and Queue
Stack & Queue|1. Generalized List/GList
2. Deque
|||
+|Queue
Queue|1. Linked List Implementation
2. Circular Array Realization ArrayQueue
3. Double-ended Queue Deque
4. Priority Queue Priority Queue
5. Circular Queue Circular Queue |||
+|String
String|1. KMP Algorithm
2. Finite State Automata
3. Pattern Matching Finite State Automata
4. BM Pattern Matching Algorithm
5. BM-KMP Algorithm
6. BF algorithm|||
+|Tree
Tree|1. Binary Tree
2. Union-Find
3. Huffman Tree|||
+|Array Realized Heap
Heap|1. Max Heap and Min Heap
2. Max Heap
3. Double-ended Deap
4. d fork heap|||
+|Heap implemented by tree
Heap|1. Leftist Tree/Leftist Heap
2. Flat heap
3. Binomial heap
4. Fibonacco Heap
5. Pairing Heap|||
+|Find
Search|1. Hash table Hash
2. Skip List
3. Binary Sort Tree
4. AVL tree
5. B tree/B+ tree/B*Tree
6. AA Tree
7. Red Black Tree
8. Binary Heap
9. Splay Tree
10. Double Chained Tree
11. Trie tree
12. R tree|||
|--------------------------------------------|--------------------------------------------------------------------------------------------|---------------------------|-----------------------------------|
----------------------------------------------
diff --git a/website/content/ChapterOne/Time_Complexity.md b/website/content/ChapterOne/Time_Complexity.md
index e8cafc01b..d6eddf13f 100644
--- a/website/content/ChapterOne/Time_Complexity.md
+++ b/website/content/ChapterOne/Time_Complexity.md
@@ -1,36 +1,35 @@
---
-title: 1.3 时间复杂度
+title: 1.3 Time Complexity
type: docs
weight: 3
---
+# time complexity and space complexity
-# 时间复杂度和空间复杂度
+## 1. Time complexity data scale
-## 一. 时间复杂度数据规模
+The data size that can solve the problem within 1s: 10^6 ~ 10^7
-1s 内能解决问题的数据规模：10^6 ~ 10^7
+-O(n^2) algorithm can handle data scale of 10^4 level (conservative estimate, it is definitely no problem to deal with 1000 level problems)
+-O(n) algorithm can handle data scale of 10^8 level (conservative estimate, it is definitely no problem to deal with 10^7 level problems)
+-O(nlog n) algorithm can handle data scale of 10^7 level (conservative estimate, it is definitely no problem to deal with 10^6 level problems)
-- O(n^2) 算法可以处理 10^4 级别的数据规模(保守估计，处理 1000 级别的问题肯定没问题)
-- O(n) 算法可以处理 10^8 级别的数据规模(保守估计，处理 10^7 级别的问题肯定没问题)
-- O(nlog n) 算法可以处理 10^7 级别的数据规模(保守估计，处理 10^6 级别的问题肯定没问题)
-
-| | 数据规模|时间复杂度 | 算法举例|
+| | Data size|Time complexity | Algorithm example|
|:------:|:------:|:------:|:------:|
-|1|10|O(n!)|permutation 排列|
-|2|20~30|O(2^n)|combination 组合|
-|3|50|O(n^4)|DFS 搜索、DP 动态规划|
-|4|100|O(n^3)|任意两点最短路径、DP 动态规划|
-|5|1000|O(n^2)|稠密图、DP 动态规划|
-|6|10^6|O(nlog n)|排序，堆，递归与分治|
-|7|10^7|O(n)|DP 动态规划、图遍历、拓扑排序、树遍历|
-|8|10^9|O(sqrt(n))|筛素数、求平方根|
-|9|10^10|O(log n)|二分搜索|
-|10|+∞|O(1)|数学相关算法|
-|------------------------------|------------------------------|------------------------------------------------------------------|------------------------------------------------------------------|
+|1|10|O(n!)|permutation permutation|
+|2|20~30|O(2^n)|combination combination|
+|3|50|O(n^4)|DFS search, DP dynamic programming|
+|4|100|O(n^3)|The shortest path between any two points, DP dynamic programming|
+|5|1000|O(n^2)|Dense graph, DP dynamic programming|
+|6|10^6|O(nlog n)|sorting, heap, recursion and divide and conquer|
+|7|10^7|O(n)|DP dynamic programming, graph traversal, topological sorting, tree traversal|
+|8|10^9|O(sqrt(n))|Sieve prime numbers, find square root|
+|9|10^10|O(log n)|Binary Search|
+|10|+∞|O(1)|Mathematics-related algorithms|
+|------------------------------|------------------------------|------------------------------------------------------------------|-------------------------------------------------------------------|
-一些具有迷惑性的例子：
+Some deceptive examples:
```c
void hello (int n){
@@ -40,28 +39,27 @@ void hello (int n){
}
```
-上面这段代码的时间复杂度是 O(nlog n) 而不是 O(n^2)
+The time complexity of the above code is O(nlog n) instead of O(n^2)
```c
-bool isPrime (int n){
- for( int x = 2 ; x * x <= n ; x ++ )
+bool isPrime(int n){
+for( int x = 2 ; x *x <= n ; x ++ )
if( n % x == 0 )
return false;
return true;
}
```
-上面这段代码的时间复杂度是 O(sqrt(n)) 而不是 O(n)。
-
-再举一个例子，有一个字符串数组，将数组中的每一个字符串按照字母序排序，之后再将整个字符串数组按照字典序排序。两步操作的整体时间复杂度是多少呢？
+The time complexity of the above code is O(sqrt(n)) instead of O(n).
-如果回答是 O(n*nlog n + nlog n) = O(n^2log n)，这个答案是错误的。字符串的长度和数组的长度是没有关系的，所以这两个变量应该单独计算。假设最长的字符串长度为 s，数组中有 n 个字符串。对每个字符串排序的时间复杂度是 O(slog s)，将数组中每个字符串都按照字母序排序的时间复杂度是 O(n * slog s)。
+To give another example, there is an array of strings, sort each string in the array alphabetically, and then sort the entire string array lexicographically. What is the overall time complexity of the two-step operation?
-将整个字符串数组按照字典序排序的时间复杂度是 O(s * nlog n)。排序算法中的 O(nlog n) 是比较的次数，由于比较的是整型数字，所以每次比较是 O(1)。但是字符串按照字典序比较，时间复杂度是 O(s)。所以字符串数组按照字典序排序的时间复杂度是 O(s * nlog n)。所以整体复杂度是 O(n * slog s) + O(s * nlog n) = O(n\*slog s + s\*nlogn) = O(n\*s\*(log s + log n)) = O(n\*s\*log(n\*s)）。
+If the answer is O(n*nlog n + nlog n) = O(n^2log n), the answer is wrong. The length of the string and the length of the array are irrelevant, so these two variables should be calculated separately. Suppose the longest string has length s and there are n strings in the array. The time complexity of sorting each string is O(slog s), and the time complexity of sorting each string in alphabetical order in the array is O(n *slog s).
+The time complexity of sorting the entire string array lexicographically is O(s *nlog n). O(nlog n) in the sorting algorithm is the number of comparisons. Since the comparison is an integer number, each comparison is O(1). But strings are compared lexicographically, and the time complexity is O(s). So the time complexity of sorting an array of strings lexicographically is O(s *nlog n). So the overall complexity is O(n *slog s) + O(s *nlog n) = O(n\*slog s + s\*nlogn) = O(n\*s\*(log s + log n) ) = O(n\*s\*log(n\*s)).
-## 二. 空间复杂度
+## Two. Space complexity
-递归调用是有空间代价的，递归算法需要保存递归栈信息，所以花费的空间复杂度会比非递归算法要高。
+The recursive call has a space cost, and the recursive algorithm needs to save the recursive stack information, so the space complexity spent will be higher than that of the non-recursive algorithm.
```c
int sum( int n ){
@@ -73,66 +71,63 @@ int sum( int n ){
}
```
-上面算法的时间复杂度为 O(n)，空间复杂度 O(1)。
+The time complexity of the above algorithm is O(n), and the space complexity is O(1).
```c
int sum( int n ){
assert( n >= 0 )
if ( n == 0 )
return 0;
- return n + sum( n - 1 );
+ return n + sum( n -1 );
}
```
-上面算法的时间复杂度为 O(n)，空间复杂度 O(n)。
+The time complexity of the above algorithm is O(n), and the space complexity is O(n).
-## 三. 递归的时间复杂度
+## 3. Time complexity of recursion
-### 1. 只有一次递归调用
+### 1. Only one recursive call
-如果递归函数中，只进行了一次递归调用，且递归深度为 depth，在每个递归函数中，时间复杂度为 T，那么总体的时间复杂度为 O(T * depth)
+If only one recursive call is made in the recursive function, and the recursive depth is depth, and in each recursive function, the time complexity is T, then the overall time complexity is O(T *depth)
-举个例子：
+for example:
```c
int binarySearch(int arr[], int l, int r, int target){
- if( l > r )
- return -1;
- int mid = l + ( r - l ) / 2; // 防溢出
+if( l > r )
+return -1;
+ int mid = l + ( r -l ) /2; //prevent overflow
if(arr[mid] == target)
return mid;
else if (arr[mid] > target)
- return binarySearch(arr,l,mid-1,target);
+return binarySearch(arr,l,mid-1,target);
else
- return binarySearch(arr,mid+1,r,target);
+ return binarySearch(arr, mid+1, r, target);
}
```
-在二分查找的递归实现中，只递归调用了自身。递归深度是 log n ，每次递归里面的复杂度是 O(1) 的，所以二分查找的递归实现的时间复杂度为 O(log n) 的。
+In the recursive implementation of binary search, only itself is called recursively. The recursion depth is log n, and the complexity of each recursion is O(1), so the time complexity of the recursive implementation of binary search is O(log n).
-### 2. 只有多次递归调用
+### 2. Only multiple recursive calls
-针对多次递归调用的情况，就需要看它的计算调用的次数了。通常可以画一颗递归树来看。举例：
+For the case of multiple recursive calls, you need to look at the number of times it is calculated and called. Usually you can draw a recursive tree to see. Example:
```c
int f(int n){
assert( n >= 0 );
if( n == 0 )
return 1;
- return f( n - 1 ) + f ( n - 1 );
+ return f( n -1 ) + f ( n -1 );
}
```
-上述这次递归调用的次数为 2^0^ + 2^1^ + 2^2^ + …… + 2^n^ = 2^n+1^ - 1 = O(2^n)
-
-
-> 关于更加复杂的递归的复杂度分析，请参考主定理。主定理中针对各种复杂情况都给出了正确的结论。
+The number of recursive calls above is 2^0^ + 2^1^ + 2^2^ + ... + 2^n^ = 2^n+1^ -1 = O(2^n)
----------------------------------------------
diff --git a/website/content/ChapterOne/_index.md b/website/content/ChapterOne/_index.md
index 6d535294a..c3fca64b9 100644
--- a/website/content/ChapterOne/_index.md
+++ b/website/content/ChapterOne/_index.md
@@ -1,95 +1,86 @@
---
-title: 第一章 序章
+title: Chapter 1 Prologue
type: docs
weight: 1
---
-# 第一章 序章
+# Chapter 1 Prologue
{{< columns >}}
-## 关于 LeetCode
+## About LeetCode
-说到 LeetCode，作为一个程序员来说，应该不陌生，近几年参加面试都会提到它。国内外的程序员用它刷题主要是为了面试。据历史记载，这个网站 2011 年就成立了，马上就要到自己 10 周年的生日了。每周举行周赛，双周赛，月赛，在有限时间内编码，确实非常能考验人的算法能力。一些大公司赞助冠名的比赛获得前几名除了有奖品，还能直接拿到内推的机会。
+Speaking of LeetCode, as a programmer, you should be familiar with it, and it will be mentioned in interviews in recent years. Programmers at home and abroad use it to brush questions mainly for interviews. According to historical records, this website was established in 2011, and it is about to reach its 10th birthday. Weekly competitions, biweekly competitions, and monthly competitions are held every week, and coding within a limited time is really a test of people's algorithmic ability. In addition to prizes for the top few winners of some big companies sponsoring title competitions, they can also directly get the opportunity to be promoted internally.
<--->
-## 什么是 Cookbook
+## What is Cookbook
-直译的话就是烹饪书，教你做各种食谱美食的书。经常看 O'Reilly 技术书的同学对这个名词会很熟悉。一般动手操作，实践类的书都会有这个名字。
+The literal translation is a cookbook, a book that teaches you to make various recipes and delicacies. Students who often read O'Reilly technical books will be familiar with this term. Generally hands-on, practical books will have this name.
{{< /columns >}}
+## Why did you write this open source book
-## 为什么会写这个开源书
+The author has been brushing the questions for a year, and I want to share with you some experience in doing the questions and methods of solving the questions. I want to make friends with people who have the same hobbies, and exchange and study together. For myself, writing problem solutions is also an improvement. Telling a esoteric topic to someone who has no idea at all, and allowing him to fully understand it, can exercise people's ability to express. During the explanation, you may also encounter some questions from the listeners. These questions may be your own knowledge loopholes, and you are forced to make up for them. The author has done relevant sharing in the company, and I feel deeply, and both parties benefited.
-笔者刷题刷了一年了，想和大家分享分享一些做题心得，解题方法。想和有相同爱好的人交个朋友，一起交流学习。对于自己来说，写题解也是一种提高。把一道深奥的题目讲给一点都没有头绪的人，并能让他完全听懂，很能锻炼人的表达能力。在讲解中很可能还会遇到听者的一些提问，这些问题可能是自己的知识漏洞，强迫自己去弥补。笔者在公司做过相关的分享，感受很深，双方受益都还不错。
+> In addition, when I was in college, I hated writing problem solutions the most when I was doing questions. I felt that it was a waste of time and spent more time doing more questions. Now I don't know if it counts as "you have to pay back if you come out to mess around".
-> 另外，在大学期间，笔者做题的时候最讨厌写题解，感觉是浪费时间，用更多的时间去做更多的题。现在不知道算不算是“出来混的，总是要还的”。
+## About the book cover
+Students who often read O'Reilly's animal books know that this cover is a tribute to them. It is indeed for this purpose. O'Reilly's cover animals are all rare animals, and the style of painting is black and white sketch style. These animals are all copyrighted, so I can only find black-and-white sketch-style pictures without copyright on the Internet. It is common to find 40 images in this style. However, there are too many people using it, and the author struggled to find several other pictures of this kind, and this peacock with its tail open is one of them. The meaning of Peacock Open Screen is to hope that after finishing LeetCode, everyone can improve their algorithmic ability and open their own "screen" on the stage of life. The color scheme of the whole book is also green, because this is the color of AC.
-## 关于书的封面
-常看 O'Reilly 动物书的同学一看这个封面就知道是向他们致敬。确实是这个目的。O'Reilly 的封面动物都是稀缺动物，并且画风都是黑白素描风。这些动物都有版权了，所以只能在网上找没有版权的黑白素描风的图片。常见的能找到 40 张这种风格的图片。不过用的人太多了，笔者费劲的找了其他几张这种图片，这张孔雀开屏是其中一张。孔雀开屏的意义是希望大家刷完 LeetCode 以后，提高了自身的算法能力，在人生的舞台上开出自己的“屏”。全书配色也都是绿色，因为这是 AC 的颜色。
+## About the author
+The author is a gopher newcomer who has just been in the industry for a year and a half. Please give me some advice. The university participated in ACM-ICPC for 3 years, but did not get a gold medal due to low qualifications. So in terms of algorithms, I'm a novice in my own evaluation. The biggest gain from participating in ACM-ICPC is to train thinking ability, which will also be used in life. Secondly, I got to know many very smart players in China and saw the gap between myself and them. Finally, there are more than 200 pages, some of which I did not fully understand, and the densely printed [algorithm template](https://github.com/halfrost/leetcode-go/releases/tag/Special). If you learn knowledge, you will own it for life. If you don't learn it, that knowledge is something outside your body.
-
-## 关于作者
-
-笔者是一个刚刚入行一年半的 gopher 新人，还请各位大佬多多指点小弟我。大学参加了 3 年 ACM-ICPC，但是由于资质不高，没有拿到一块金牌。所以在算法方面，我对自己的评价算是新手吧。参加 ACM-ICPC 最大的收获是训练了思维能力，这种能力也会运用到生活中。其次是认识了很多国内很聪明的选手，看到了自己和他们的差距。最后，就是那 200 多页，有些自己都没有完全理解的，打印的密密麻麻的[算法模板](https://github.com/halfrost/leetcode-go/releases/tag/Special)。知识学会了，终身都是自己的，没有学会，那些知识都是身外之物。
-
-笔者从 2019 年 3 月 25 号开始刷题，到 2020 年 3 月 25 号，整整一年的时间。原计划是每天一题。实际上每天有时候不止一题，最终完成了 600+：
+The author started writing questions from March 25, 2019 to March 25, 2020, a whole year. The original plan was one question per day. In fact, there are sometimes more than one question every day, and finally completed 600+:
+> A warm reminder: The author thought that doing one question every day would make the submissions picture all green, but I found out that I was wrong. If you also want to insist and make this picture all green, you must pay attention to the following issues: LeetCode server is in +0 time zone, and this picture is also calculated according to this time zone. In other words, before 8 o'clock in the morning in China, the previous day is counted! It is also because of the time zone that I left these 22 grids blank. For example, there is a hard question that is difficult, and there is a lot of work that day, and it will not be until the next morning when I come home from get off work at night and figure it out. So do another question as the next day's amount. It turns out that these 2 questions are counted as the previous day. Sometimes the author gets up at 6 o'clock in the morning to brush up the questions, and the submission is also the day before.
+>
+> (Of course, these are all in the past, they are not important anymore, they are just some small episodes on the road of struggle)
-> 一个温馨提示：笔者本以为每天做一题，会让这个 submissions 图全绿，但是我发现我错了。如果你也想坚持，让这个图全绿，一定要注意以下的问题：LeetCode 服务器是在 +0 时区的，这个图也是按照这个时区计算的。也就是说，中国每天早上 8 点之前，是算前一天的！也是因为时区的问题，导致我空白了这 22 个格子。比如有一道 Hard 题很难，当天工作也很多，晚上下班回家想出来了就到第二天凌晨了。于是再做一题当做第二天的量。结果会发现这 2 题都算前一天的。有时候笔者早上 6 点起床刷题，提交以后也都是前一天的。
->
-> (当然这些都是过去了，不重要了，全当是奋斗路上的一些小插曲)
-
-2020 年笔者肯定还会继续刷题，因为还没有达到自己的一些目标。可能会朝着 1000 题奋进，也有可能刷到 800 题的时候回头开始二刷，三刷。(不达目的不罢休吧~)
-
-## 关于书中的代码
-
-代码都放在 [github repo](https://github.com/halfrost/leetcode-go/tree/master/leetcode) 中，按题号可以搜索到题目。
-本书题目的代码都已经 beats 100% 了。没有 beats 100% 题解就没有放到本书中了。那些题目笔者会继续优化到 100% 再放进来。
-
-有可能读者会问，为何要追求 beats 100%。笔者认为优化到 beats 100% 才算是把这题做出感觉了。有好几道 Hard 题，笔者都用暴力解法 AC 了，然后只 beats 了 5%。这题就如同没做一样。而且面试中如果给了这样的答案，面试官也不会满意，“还有没有更优解？”。如果通过自己的思考能给出更优解，面试官会更满意一些。
-
-LeetCode 统计代码运行时长会有波动的，相同的代码提交 10 次可能就会 beats 100% 了。笔者开始没有发现这个问题，很多题用正确的代码连续交了很多次，一年提交 3400+ 次，导致我的正确率也变的奇高。😢
+In 2020, the author will definitely continue to write questions, because some of my goals have not been achieved yet. You may work towards 1000 questions, or you may go back and start doing the second or third time when you reach 800 questions. (Don't give up if you don't reach your goal~)
-当然，如果还有其他更优美的解法，也能 beats 100% 的，欢迎提交 PR，笔者和大家一起学习。
+## About the code in the book
+The codes are all placed in [github repo](https://github.com/halfrost/leetcode-go/tree/master/leetcode), and the questions can be searched by question number.
+The code for the title of this book has been beats 100%. If there is no beats 100% solution, it will not be included in this book. The author will continue to optimize those topics to 100% before putting them in.
-## 目标读者
+Readers may ask, why pursue beats 100%. The author thinks that optimizing to 100% beats can be regarded as a feeling for this question. There are several Hard questions, and the author used brute force to solve AC, and then only beats 5%. This question is like not doing it. And if such an answer is given during the interview, the interviewer will not be satisfied, "Is there a better solution?". If you can give a better solution through your own thinking, the interviewer will be more satisfied.
-想通过 LeetCode 提高算法能力的编程爱好者。
+LeetCode statistics code runtime will fluctuate, the same code submitted 10 times may beats 100%. The author didn't find this problem at first, and I submitted many questions with the correct code many times in a row, submitting 3400+ times a year, which caused my correct rate to become extremely high. 😢
+Of course, if there are other more elegant solutions that can beat 100%, welcome to submit a PR, and the author will learn with everyone.
+## target audience
-## 编程语言
+Programming enthusiasts who want to improve their algorithmic ability through LeetCode.
-本书的算法全部用 Go 语言实现。
+## Programming language
+The algorithms in this book are all implemented in Go language.
-## 使用说明
-- 本电子书的左上角有搜索栏，可以迅速帮你找到你想看的章节和题号。
-- 本电子书每页都接入了 Gitalk，每一页的最下方都有评论框可以评论，如果没有显示出来，请检查自己的网络。
-- 关于题解，笔者建议这样使用：先自己读题，思考如何解题。如果 15 分钟还没有思路，那么先看笔者的解题思路，但是不要看代码。有思路以后自己用代码实现一遍。如果完全不会写，那就看笔者提供的代码，找出自己到底哪里不会写，找出问题记下来，这就是自己要弥补的知识漏洞。如果自己实现出来了，提交以后有错误，自己先 debug。AC 以后没有到 100% 也先自己思考如何优化。如果每道题自己都能优化到 100% 了，那么一段时间以后进步会很大。所以总的来说，实在没思路，看解题思路；实在优化不到 100%，看看代码。
+## Instructions for use
-## 互动与勘误
+-There is a search bar in the upper left corner of this e-book, which can quickly help you find the chapter and question number you want to read.
+-Each page of this e-book is connected to Gitalk, and there is a comment box at the bottom of each page for comments. If it is not displayed, please check your own network.
+-Regarding the problem solution, the author recommends using it in this way: first read the problem by yourself, and think about how to solve the problem. If you don't have an idea in 15 minutes, then look at the author's problem-solving ideas first, but don't look at the code. After you have an idea, you can implement it with code yourself. If you can't write at all, then look at the code provided by the author, find out where you can't write, find out the problem and write it down, this is the knowledge gap that you want to make up for. If you realize it by yourself and there is an error after submission, you should debug it yourself first. Before AC reaches 100% in the future, I will first think about how to optimize it. If each question can be optimized to 100%, then the improvement will be great after a period of time. So in general, if you really have no idea, look at the problem-solving ideas; if you really can’t optimize 100%, look at the code.
-如果书中文章有所遗漏，欢迎点击所在页面下边的 edit 按钮进行评论和互动，感谢您的支持与帮助。
+## Interaction and Errata
-## 最后
+If there are any missing articles in the book, please click the edit button at the bottom of the page to comment and interact. Thank you for your support and help.
-一起开始刷题吧~
+## at last
+Let's start brushing questions together~
-本作品采用 [知识署名-非商业性使用-禁止演绎 （BY-NC-ND） 4.0 国际许可协议](https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.zh-Hans) 进行许可。
+This work adopts [Intellectual Attribution-Non-Commercial Use-No Derivatives (BY-NC-ND) 4.0 International License Agreement](https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.zh-Hans ) for permission.
-题解里面的所有题目版权均归 [LeetCode](https://leetcode.com/) 和 [力扣中国](https://leetcode-cn.com/) 所有
----------------------------------------------
-下一页➡️
+next page➡️
diff --git a/website/content/ChapterThree/LFUCache.md b/website/content/ChapterThree/LFUCache.md
index 95dfb6a75..ed1815277 100644
--- a/website/content/ChapterThree/LFUCache.md
+++ b/website/content/ChapterThree/LFUCache.md
@@ -358,11 +358,9 @@ func (this *LFUCache) Put(key int, value int) {
this.nodes[key] = newNode
}
-```
-
----------------------------------------------
diff --git a/website/content/ChapterThree/LRUCache.md b/website/content/ChapterThree/LRUCache.md
index 272748971..8699445af 100644
--- a/website/content/ChapterThree/LRUCache.md
+++ b/website/content/ChapterThree/LRUCache.md
@@ -273,8 +273,9 @@ func (this *LRUCache) Remove(node *Node) {
```
+
----------------------------------------------
diff --git a/website/content/ChapterThree/Segment_Tree.md b/website/content/ChapterThree/Segment_Tree.md
index 162d7e6b6..dc94f3647 100644
--- a/website/content/ChapterThree/Segment_Tree.md
+++ b/website/content/ChapterThree/Segment_Tree.md
@@ -495,8 +495,9 @@ func (st *SegmentCountTree) updateCountInTree(treeIndex, left, right, val int) {
+
----------------------------------------------
diff --git a/website/content/ChapterThree/UnionFind.md b/website/content/ChapterThree/UnionFind.md
index c1e2009b0..a3e813c46 100644
--- a/website/content/ChapterThree/UnionFind.md
+++ b/website/content/ChapterThree/UnionFind.md
@@ -4,13 +4,13 @@ type: docs
weight: 2
---
-# 并查集 UnionFind
+# and lookup UnionFind
```go
package template
// UnionFind defind
-// 路径压缩 + 秩优化
+//path compression + rank optimization
type UnionFind struct {
parent, rank []int
count int
@@ -65,7 +65,7 @@ func (uf *UnionFind) TotalCount() int {
}
// UnionFindCount define
-// 计算每个集合中元素的个数 + 最大集合元素个数
+//Calculate the number of elements in each collection + the maximum number of collection elements
type UnionFindCount struct {
parent, count []int
maxUnionCount int
@@ -90,7 +90,7 @@ func (uf *UnionFindCount) Find(p int) int {
return root
}
-// 不进行秩压缩，时间复杂度爆炸，太高了
+//Without rank compression, the time complexity explodes, too high
// func (uf *UnionFindCount) union(p, q int) {
// proot := uf.find(p)
// qroot := uf.find(q)
@@ -145,8 +145,9 @@ func max(a int, b int) int {
```
+
----------------------------------------------
diff --git a/website/content/ChapterThree/_index.md b/website/content/ChapterThree/_index.md
index b078b1d66..5b8b10435 100644
--- a/website/content/ChapterThree/_index.md
+++ b/website/content/ChapterThree/_index.md
@@ -1,21 +1,22 @@
---
-title: 第三章 一些模板
+title: Chapter 3 Some Templates
type: docs
weight: 3
---
-# 第三章 一些模板
+# Chapter 3 some templates
-这一章会罗列一些整理好的模板。一起来看看吧。
+This chapter will list some organized templates. Let's take a look together.
+
----------------------------------------------
diff --git a/website/content/ChapterTwo/Array.md b/website/content/ChapterTwo/Array.md
index 07d32562f..2db702d60 100644
--- a/website/content/ChapterTwo/Array.md
+++ b/website/content/ChapterTwo/Array.md
@@ -8,422 +8,432 @@ weight: 1
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
-|0001|Two Sum|[Go]({{< relref "/ChapterFour/0001~0099/0001.Two-Sum.md" >}})|Easy| O(n)| O(n)||49.1%|
-|0004|Median of Two Sorted Arrays|[Go]({{< relref "/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md" >}})|Hard||||35.2%|
-|0011|Container With Most Water|[Go]({{< relref "/ChapterFour/0001~0099/0011.Container-With-Most-Water.md" >}})|Medium| O(n)| O(1)||54.3%|
-|0015|3Sum|[Go]({{< relref "/ChapterFour/0001~0099/0015.3Sum.md" >}})|Medium| O(n^2)| O(n)|❤️|32.2%|
-|0016|3Sum Closest|[Go]({{< relref "/ChapterFour/0001~0099/0016.3Sum-Closest.md" >}})|Medium| O(n^2)| O(1)|❤️|46.2%|
-|0018|4Sum|[Go]({{< relref "/ChapterFour/0001~0099/0018.4Sum.md" >}})|Medium| O(n^3)| O(n^2)|❤️|36.5%|
-|0026|Remove Duplicates from Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md" >}})|Easy| O(n)| O(1)||50.3%|
-|0027|Remove Element|[Go]({{< relref "/ChapterFour/0001~0099/0027.Remove-Element.md" >}})|Easy| O(n)| O(1)||52.1%|
-|0031|Next Permutation|[Go]({{< relref "/ChapterFour/0001~0099/0031.Next-Permutation.md" >}})|Medium||||37.1%|
-|0033|Search in Rotated Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md" >}})|Medium||||38.6%|
-|0034|Find First and Last Position of Element in Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md" >}})|Medium||||41.5%|
-|0035|Search Insert Position|[Go]({{< relref "/ChapterFour/0001~0099/0035.Search-Insert-Position.md" >}})|Easy||||42.0%|
-|0036|Valid Sudoku|[Go]({{< relref "/ChapterFour/0001~0099/0036.Valid-Sudoku.md" >}})|Medium||||56.8%|
-|0037|Sudoku Solver|[Go]({{< relref "/ChapterFour/0001~0099/0037.Sudoku-Solver.md" >}})|Hard||||56.6%|
-|0039|Combination Sum|[Go]({{< relref "/ChapterFour/0001~0099/0039.Combination-Sum.md" >}})|Medium| O(n log n)| O(n)||67.6%|
-|0040|Combination Sum II|[Go]({{< relref "/ChapterFour/0001~0099/0040.Combination-Sum-II.md" >}})|Medium| O(n log n)| O(n)||53.3%|
-|0041|First Missing Positive|[Go]({{< relref "/ChapterFour/0001~0099/0041.First-Missing-Positive.md" >}})|Hard| O(n)| O(n)||36.5%|
-|0042|Trapping Rain Water|[Go]({{< relref "/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md" >}})|Hard| O(n)| O(1)|❤️|58.8%|
-|0045|Jump Game II|[Go]({{< relref "/ChapterFour/0001~0099/0045.Jump-Game-II.md" >}})|Medium||||38.5%|
-|0046|Permutations|[Go]({{< relref "/ChapterFour/0001~0099/0046.Permutations.md" >}})|Medium||||74.7%|
-|0047|Permutations II|[Go]({{< relref "/ChapterFour/0001~0099/0047.Permutations-II.md" >}})|Medium||||56.7%|
-|0048|Rotate Image|[Go]({{< relref "/ChapterFour/0001~0099/0048.Rotate-Image.md" >}})|Medium| O(n)| O(1)||69.9%|
-|0049|Group Anagrams|[Go]({{< relref "/ChapterFour/0001~0099/0049.Group-Anagrams.md" >}})|Medium||||65.9%|
-|0051|N-Queens|[Go]({{< relref "/ChapterFour/0001~0099/0051.N-Queens.md" >}})|Hard||||62.9%|
-|0053|Maximum Subarray|[Go]({{< relref "/ChapterFour/0001~0099/0053.Maximum-Subarray.md" >}})|Medium| O(n)| O(n)||50.0%|
-|0054|Spiral Matrix|[Go]({{< relref "/ChapterFour/0001~0099/0054.Spiral-Matrix.md" >}})|Medium| O(n)| O(n^2)||43.6%|
-|0055|Jump Game|[Go]({{< relref "/ChapterFour/0001~0099/0055.Jump-Game.md" >}})|Medium||||38.4%|
-|0056|Merge Intervals|[Go]({{< relref "/ChapterFour/0001~0099/0056.Merge-Intervals.md" >}})|Medium| O(n log n)| O(1)||45.9%|
-|0057|Insert Interval|[Go]({{< relref "/ChapterFour/0001~0099/0057.Insert-Interval.md" >}})|Medium| O(n)| O(1)||37.9%|
-|0059|Spiral Matrix II|[Go]({{< relref "/ChapterFour/0001~0099/0059.Spiral-Matrix-II.md" >}})|Medium| O(n)| O(n^2)||66.5%|
-|0063|Unique Paths II|[Go]({{< relref "/ChapterFour/0001~0099/0063.Unique-Paths-II.md" >}})|Medium| O(n^2)| O(n^2)||39.1%|
-|0064|Minimum Path Sum|[Go]({{< relref "/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md" >}})|Medium| O(n^2)| O(n^2)||60.6%|
-|0066|Plus One|[Go]({{< relref "/ChapterFour/0001~0099/0066.Plus-One.md" >}})|Easy||||43.3%|
-|0073|Set Matrix Zeroes|[Go]({{< relref "/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md" >}})|Medium||||50.0%|
-|0074|Search a 2D Matrix|[Go]({{< relref "/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md" >}})|Medium||||46.8%|
-|0075|Sort Colors|[Go]({{< relref "/ChapterFour/0001~0099/0075.Sort-Colors.md" >}})|Medium| O(n)| O(1)|❤️|57.1%|
-|0078|Subsets|[Go]({{< relref "/ChapterFour/0001~0099/0078.Subsets.md" >}})|Medium| O(n^2)| O(n)|❤️|73.8%|
-|0079|Word Search|[Go]({{< relref "/ChapterFour/0001~0099/0079.Word-Search.md" >}})|Medium| O(n^2)| O(n^2)|❤️|39.8%|
-|0080|Remove Duplicates from Sorted Array II|[Go]({{< relref "/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md" >}})|Medium| O(n)| O(1||51.5%|
+|0001|Two Sum|[Go]({{< relref "/ChapterFour/0001~0099/0001.Two-Sum.md" >}})|Easy| O(n)| O(n)||49.6%|
+|0004|Median of Two Sorted Arrays|[Go]({{< relref "/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md" >}})|Hard||||36.1%|
+|0011|Container With Most Water|[Go]({{< relref "/ChapterFour/0001~0099/0011.Container-With-Most-Water.md" >}})|Medium| O(n)| O(1)||54.0%|
+|0015|3Sum|[Go]({{< relref "/ChapterFour/0001~0099/0015.3Sum.md" >}})|Medium| O(n^2)| O(n)|❤️|32.5%|
+|0016|3Sum Closest|[Go]({{< relref "/ChapterFour/0001~0099/0016.3Sum-Closest.md" >}})|Medium| O(n^2)| O(1)|❤️|45.8%|
+|0018|4Sum|[Go]({{< relref "/ChapterFour/0001~0099/0018.4Sum.md" >}})|Medium| O(n^3)| O(n^2)|❤️|36.0%|
+|0026|Remove Duplicates from Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md" >}})|Easy| O(n)| O(1)||51.5%|
+|0027|Remove Element|[Go]({{< relref "/ChapterFour/0001~0099/0027.Remove-Element.md" >}})|Easy| O(n)| O(1)||52.9%|
+|0031|Next Permutation|[Go]({{< relref "/ChapterFour/0001~0099/0031.Next-Permutation.md" >}})|Medium||||37.5%|
+|0033|Search in Rotated Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md" >}})|Medium||||38.9%|
+|0034|Find First and Last Position of Element in Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md" >}})|Medium||||41.8%|
+|0035|Search Insert Position|[Go]({{< relref "/ChapterFour/0001~0099/0035.Search-Insert-Position.md" >}})|Easy||||43.3%|
+|0036|Valid Sudoku|[Go]({{< relref "/ChapterFour/0001~0099/0036.Valid-Sudoku.md" >}})|Medium||||58.0%|
+|0037|Sudoku Solver|[Go]({{< relref "/ChapterFour/0001~0099/0037.Sudoku-Solver.md" >}})|Hard||||57.6%|
+|0039|Combination Sum|[Go]({{< relref "/ChapterFour/0001~0099/0039.Combination-Sum.md" >}})|Medium| O(n log n)| O(n)||68.5%|
+|0040|Combination Sum II|[Go]({{< relref "/ChapterFour/0001~0099/0040.Combination-Sum-II.md" >}})|Medium| O(n log n)| O(n)||53.4%|
+|0041|First Missing Positive|[Go]({{< relref "/ChapterFour/0001~0099/0041.First-Missing-Positive.md" >}})|Hard| O(n)| O(n)||36.7%|
+|0042|Trapping Rain Water|[Go]({{< relref "/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md" >}})|Hard| O(n)| O(1)|❤️|59.2%|
+|0045|Jump Game II|[Go]({{< relref "/ChapterFour/0001~0099/0045.Jump-Game-II.md" >}})|Medium||||39.8%|
+|0046|Permutations|[Go]({{< relref "/ChapterFour/0001~0099/0046.Permutations.md" >}})|Medium||||75.6%|
+|0047|Permutations II|[Go]({{< relref "/ChapterFour/0001~0099/0047.Permutations-II.md" >}})|Medium||||57.3%|
+|0048|Rotate Image|[Go]({{< relref "/ChapterFour/0001~0099/0048.Rotate-Image.md" >}})|Medium| O(n)| O(1)||70.9%|
+|0049|Group Anagrams|[Go]({{< relref "/ChapterFour/0001~0099/0049.Group-Anagrams.md" >}})|Medium||||66.7%|
+|0051|N-Queens|[Go]({{< relref "/ChapterFour/0001~0099/0051.N-Queens.md" >}})|Hard||||64.0%|
+|0053|Maximum Subarray|[Go]({{< relref "/ChapterFour/0001~0099/0053.Maximum-Subarray.md" >}})|Medium| O(n)| O(n)||50.2%|
+|0054|Spiral Matrix|[Go]({{< relref "/ChapterFour/0001~0099/0054.Spiral-Matrix.md" >}})|Medium| O(n)| O(n^2)||44.8%|
+|0055|Jump Game|[Go]({{< relref "/ChapterFour/0001~0099/0055.Jump-Game.md" >}})|Medium||||38.9%|
+|0056|Merge Intervals|[Go]({{< relref "/ChapterFour/0001~0099/0056.Merge-Intervals.md" >}})|Medium| O(n log n)| O(1)||46.2%|
+|0057|Insert Interval|[Go]({{< relref "/ChapterFour/0001~0099/0057.Insert-Interval.md" >}})|Medium| O(n)| O(1)||39.0%|
+|0059|Spiral Matrix II|[Go]({{< relref "/ChapterFour/0001~0099/0059.Spiral-Matrix-II.md" >}})|Medium| O(n)| O(n^2)||67.3%|
+|0063|Unique Paths II|[Go]({{< relref "/ChapterFour/0001~0099/0063.Unique-Paths-II.md" >}})|Medium| O(n^2)| O(n^2)||39.4%|
+|0064|Minimum Path Sum|[Go]({{< relref "/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md" >}})|Medium| O(n^2)| O(n^2)||61.1%|
+|0066|Plus One|[Go]({{< relref "/ChapterFour/0001~0099/0066.Plus-One.md" >}})|Easy||||43.6%|
+|0073|Set Matrix Zeroes|[Go]({{< relref "/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md" >}})|Medium||||51.1%|
+|0074|Search a 2D Matrix|[Go]({{< relref "/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md" >}})|Medium||||47.6%|
+|0075|Sort Colors|[Go]({{< relref "/ChapterFour/0001~0099/0075.Sort-Colors.md" >}})|Medium| O(n)| O(1)|❤️|58.4%|
+|0078|Subsets|[Go]({{< relref "/ChapterFour/0001~0099/0078.Subsets.md" >}})|Medium| O(n^2)| O(n)|❤️|74.8%|
+|0079|Word Search|[Go]({{< relref "/ChapterFour/0001~0099/0079.Word-Search.md" >}})|Medium| O(n^2)| O(n^2)|❤️|40.2%|
+|0080|Remove Duplicates from Sorted Array II|[Go]({{< relref "/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md" >}})|Medium| O(n)| O(1||52.2%|
|0081|Search in Rotated Sorted Array II|[Go]({{< relref "/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II.md" >}})|Medium||||35.7%|
-|0084|Largest Rectangle in Histogram|[Go]({{< relref "/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram.md" >}})|Hard| O(n)| O(n)|❤️|42.1%|
-|0088|Merge Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md" >}})|Easy| O(n)| O(1)|❤️|45.7%|
-|0090|Subsets II|[Go]({{< relref "/ChapterFour/0001~0099/0090.Subsets-II.md" >}})|Medium| O(n^2)| O(n)|❤️|55.2%|
-|0105|Construct Binary Tree from Preorder and Inorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md" >}})|Medium||||60.7%|
-|0106|Construct Binary Tree from Inorder and Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md" >}})|Medium||||57.4%|
-|0108|Convert Sorted Array to Binary Search Tree|[Go]({{< relref "/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md" >}})|Easy||||69.0%|
-|0118|Pascal's Triangle|[Go]({{< relref "/ChapterFour/0100~0199/0118.Pascals-Triangle.md" >}})|Easy||||69.0%|
-|0119|Pascal's Triangle II|[Go]({{< relref "/ChapterFour/0100~0199/0119.Pascals-Triangle-II.md" >}})|Easy||||59.6%|
-|0120|Triangle|[Go]({{< relref "/ChapterFour/0100~0199/0120.Triangle.md" >}})|Medium| O(n^2)| O(n)||53.9%|
-|0121|Best Time to Buy and Sell Stock|[Go]({{< relref "/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}})|Easy| O(n)| O(1)||54.5%|
-|0122|Best Time to Buy and Sell Stock II|[Go]({{< relref "/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II.md" >}})|Medium| O(n)| O(1)||63.3%|
-|0128|Longest Consecutive Sequence|[Go]({{< relref "/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md" >}})|Medium||||48.9%|
-|0130|Surrounded Regions|[Go]({{< relref "/ChapterFour/0100~0199/0130.Surrounded-Regions.md" >}})|Medium||||35.9%|
-|0135|Candy|[Go]({{< relref "/ChapterFour/0100~0199/0135.Candy.md" >}})|Hard||||40.7%|
-|0136|Single Number|[Go]({{< relref "/ChapterFour/0100~0199/0136.Single-Number.md" >}})|Easy||||70.0%|
-|0137|Single Number II|[Go]({{< relref "/ChapterFour/0100~0199/0137.Single-Number-II.md" >}})|Medium||||57.7%|
-|0150|Evaluate Reverse Polish Notation|[Go]({{< relref "/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md" >}})|Medium||||44.1%|
+|0084|Largest Rectangle in Histogram|[Go]({{< relref "/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram.md" >}})|Hard| O(n)| O(n)|❤️|42.5%|
+|0088|Merge Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md" >}})|Easy| O(n)| O(1)|❤️|46.5%|
+|0090|Subsets II|[Go]({{< relref "/ChapterFour/0001~0099/0090.Subsets-II.md" >}})|Medium| O(n^2)| O(n)|❤️|55.8%|
+|0105|Construct Binary Tree from Preorder and Inorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md" >}})|Medium||||61.4%|
+|0106|Construct Binary Tree from Inorder and Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md" >}})|Medium||||58.1%|
+|0108|Convert Sorted Array to Binary Search Tree|[Go]({{< relref "/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md" >}})|Easy||||69.7%|
+|0118|Pascal's Triangle|[Go]({{< relref "/ChapterFour/0100~0199/0118.Pascals-Triangle.md" >}})|Easy||||70.6%|
+|0119|Pascal's Triangle II|[Go]({{< relref "/ChapterFour/0100~0199/0119.Pascals-Triangle-II.md" >}})|Easy||||60.6%|
+|0120|Triangle|[Go]({{< relref "/ChapterFour/0100~0199/0120.Triangle.md" >}})|Medium| O(n^2)| O(n)||54.4%|
+|0121|Best Time to Buy and Sell Stock|[Go]({{< relref "/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}})|Easy| O(n)| O(1)||54.3%|
+|0122|Best Time to Buy and Sell Stock II|[Go]({{< relref "/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II.md" >}})|Medium| O(n)| O(1)||63.8%|
+|0128|Longest Consecutive Sequence|[Go]({{< relref "/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md" >}})|Medium||||48.6%|
+|0130|Surrounded Regions|[Go]({{< relref "/ChapterFour/0100~0199/0130.Surrounded-Regions.md" >}})|Medium||||36.6%|
+|0135|Candy|[Go]({{< relref "/ChapterFour/0100~0199/0135.Candy.md" >}})|Hard||||41.0%|
+|0136|Single Number|[Go]({{< relref "/ChapterFour/0100~0199/0136.Single-Number.md" >}})|Easy||||70.6%|
+|0137|Single Number II|[Go]({{< relref "/ChapterFour/0100~0199/0137.Single-Number-II.md" >}})|Medium||||58.4%|
+|0150|Evaluate Reverse Polish Notation|[Go]({{< relref "/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md" >}})|Medium||||45.7%|
|0152|Maximum Product Subarray|[Go]({{< relref "/ChapterFour/0100~0199/0152.Maximum-Product-Subarray.md" >}})|Medium| O(n)| O(1)||34.9%|
-|0153|Find Minimum in Rotated Sorted Array|[Go]({{< relref "/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array.md" >}})|Medium||||48.5%|
-|0154|Find Minimum in Rotated Sorted Array II|[Go]({{< relref "/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md" >}})|Hard||||43.4%|
-|0162|Find Peak Element|[Go]({{< relref "/ChapterFour/0100~0199/0162.Find-Peak-Element.md" >}})|Medium||||46.2%|
-|0164|Maximum Gap|[Go]({{< relref "/ChapterFour/0100~0199/0164.Maximum-Gap.md" >}})|Hard||||42.6%|
+|0153|Find Minimum in Rotated Sorted Array|[Go]({{< relref "/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array.md" >}})|Medium||||48.8%|
+|0154|Find Minimum in Rotated Sorted Array II|[Go]({{< relref "/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md" >}})|Hard||||43.5%|
+|0162|Find Peak Element|[Go]({{< relref "/ChapterFour/0100~0199/0162.Find-Peak-Element.md" >}})|Medium||||46.0%|
+|0164|Maximum Gap|[Go]({{< relref "/ChapterFour/0100~0199/0164.Maximum-Gap.md" >}})|Hard||||43.3%|
|0167|Two Sum II - Input Array Is Sorted|[Go]({{< relref "/ChapterFour/0100~0199/0167.Two-Sum-II-Input-Array-Is-Sorted.md" >}})|Medium| O(n)| O(1)||60.0%|
-|0169|Majority Element|[Go]({{< relref "/ChapterFour/0100~0199/0169.Majority-Element.md" >}})|Easy||||63.8%|
-|0174|Dungeon Game|[Go]({{< relref "/ChapterFour/0100~0199/0174.Dungeon-Game.md" >}})|Hard||||37.3%|
-|0189|Rotate Array|[Go]({{< relref "/ChapterFour/0100~0199/0189.Rotate-Array.md" >}})|Medium||||39.2%|
-|0198|House Robber|[Go]({{< relref "/ChapterFour/0100~0199/0198.House-Robber.md" >}})|Medium||||48.7%|
-|0200|Number of Islands|[Go]({{< relref "/ChapterFour/0200~0299/0200.Number-of-Islands.md" >}})|Medium||||56.2%|
+|0169|Majority Element|[Go]({{< relref "/ChapterFour/0100~0199/0169.Majority-Element.md" >}})|Easy||||63.9%|
+|0174|Dungeon Game|[Go]({{< relref "/ChapterFour/0100~0199/0174.Dungeon-Game.md" >}})|Hard||||37.5%|
+|0179|Largest Number|[Go]({{< relref "/ChapterFour/0100~0199/0179.Largest-Number.md" >}})|Medium||||34.5%|
+|0189|Rotate Array|[Go]({{< relref "/ChapterFour/0100~0199/0189.Rotate-Array.md" >}})|Medium||||39.4%|
+|0198|House Robber|[Go]({{< relref "/ChapterFour/0100~0199/0198.House-Robber.md" >}})|Medium||||49.4%|
+|0200|Number of Islands|[Go]({{< relref "/ChapterFour/0200~0299/0200.Number-of-Islands.md" >}})|Medium||||56.9%|
|0204|Count Primes|[Go]({{< relref "/ChapterFour/0200~0299/0204.Count-Primes.md" >}})|Medium||||33.1%|
-|0209|Minimum Size Subarray Sum|[Go]({{< relref "/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md" >}})|Medium| O(n)| O(1)||44.4%|
-|0212|Word Search II|[Go]({{< relref "/ChapterFour/0200~0299/0212.Word-Search-II.md" >}})|Hard||||36.9%|
-|0213|House Robber II|[Go]({{< relref "/ChapterFour/0200~0299/0213.House-Robber-II.md" >}})|Medium||||40.7%|
-|0215|Kth Largest Element in an Array|[Go]({{< relref "/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array.md" >}})|Medium||||65.7%|
-|0216|Combination Sum III|[Go]({{< relref "/ChapterFour/0200~0299/0216.Combination-Sum-III.md" >}})|Medium| O(n)| O(1)|❤️|67.0%|
-|0217|Contains Duplicate|[Go]({{< relref "/ChapterFour/0200~0299/0217.Contains-Duplicate.md" >}})|Easy| O(n)| O(n)||61.3%|
-|0218|The Skyline Problem|[Go]({{< relref "/ChapterFour/0200~0299/0218.The-Skyline-Problem.md" >}})|Hard||||41.5%|
-|0219|Contains Duplicate II|[Go]({{< relref "/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md" >}})|Easy| O(n)| O(n)||42.3%|
-|0220|Contains Duplicate III|[Go]({{< relref "/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md" >}})|Hard||||21.9%|
-|0228|Summary Ranges|[Go]({{< relref "/ChapterFour/0200~0299/0228.Summary-Ranges.md" >}})|Easy||||46.8%|
-|0229|Majority Element II|[Go]({{< relref "/ChapterFour/0200~0299/0229.Majority-Element-II.md" >}})|Medium||||44.0%|
-|0239|Sliding Window Maximum|[Go]({{< relref "/ChapterFour/0200~0299/0239.Sliding-Window-Maximum.md" >}})|Hard||||46.6%|
-|0240|Search a 2D Matrix II|[Go]({{< relref "/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II.md" >}})|Medium||||50.5%|
-|0260|Single Number III|[Go]({{< relref "/ChapterFour/0200~0299/0260.Single-Number-III.md" >}})|Medium||||67.4%|
-|0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy||||61.5%|
-|0274|H-Index|[Go]({{< relref "/ChapterFour/0200~0299/0274.H-Index.md" >}})|Medium||||38.1%|
-|0275|H-Index II|[Go]({{< relref "/ChapterFour/0200~0299/0275.H-Index-II.md" >}})|Medium||||37.4%|
-|0283|Move Zeroes|[Go]({{< relref "/ChapterFour/0200~0299/0283.Move-Zeroes.md" >}})|Easy| O(n)| O(1)||61.3%|
-|0284|Peeking Iterator|[Go]({{< relref "/ChapterFour/0200~0299/0284.Peeking-Iterator.md" >}})|Medium||||58.2%|
+|0209|Minimum Size Subarray Sum|[Go]({{< relref "/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md" >}})|Medium| O(n)| O(1)||44.9%|
+|0212|Word Search II|[Go]({{< relref "/ChapterFour/0200~0299/0212.Word-Search-II.md" >}})|Hard||||36.5%|
+|0213|House Robber II|[Go]({{< relref "/ChapterFour/0200~0299/0213.House-Robber-II.md" >}})|Medium||||41.0%|
+|0215|Kth Largest Element in an Array|[Go]({{< relref "/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array.md" >}})|Medium||||66.1%|
+|0216|Combination Sum III|[Go]({{< relref "/ChapterFour/0200~0299/0216.Combination-Sum-III.md" >}})|Medium| O(n)| O(1)|❤️|67.6%|
+|0217|Contains Duplicate|[Go]({{< relref "/ChapterFour/0200~0299/0217.Contains-Duplicate.md" >}})|Easy| O(n)| O(n)||61.4%|
+|0218|The Skyline Problem|[Go]({{< relref "/ChapterFour/0200~0299/0218.The-Skyline-Problem.md" >}})|Hard||||41.8%|
+|0219|Contains Duplicate II|[Go]({{< relref "/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md" >}})|Easy| O(n)| O(n)||42.5%|
+|0220|Contains Duplicate III|[Go]({{< relref "/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md" >}})|Hard||||22.1%|
+|0228|Summary Ranges|[Go]({{< relref "/ChapterFour/0200~0299/0228.Summary-Ranges.md" >}})|Easy||||47.2%|
+|0229|Majority Element II|[Go]({{< relref "/ChapterFour/0200~0299/0229.Majority-Element-II.md" >}})|Medium||||45.0%|
+|0239|Sliding Window Maximum|[Go]({{< relref "/ChapterFour/0200~0299/0239.Sliding-Window-Maximum.md" >}})|Hard||||46.3%|
+|0240|Search a 2D Matrix II|[Go]({{< relref "/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II.md" >}})|Medium||||51.0%|
+|0260|Single Number III|[Go]({{< relref "/ChapterFour/0200~0299/0260.Single-Number-III.md" >}})|Medium||||67.6%|
+|0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy||||62.4%|
+|0274|H-Index|[Go]({{< relref "/ChapterFour/0200~0299/0274.H-Index.md" >}})|Medium||||38.3%|
+|0275|H-Index II|[Go]({{< relref "/ChapterFour/0200~0299/0275.H-Index-II.md" >}})|Medium||||37.5%|
+|0283|Move Zeroes|[Go]({{< relref "/ChapterFour/0200~0299/0283.Move-Zeroes.md" >}})|Easy| O(n)| O(1)||61.4%|
+|0284|Peeking Iterator|[Go]({{< relref "/ChapterFour/0200~0299/0284.Peeking-Iterator.md" >}})|Medium||||58.6%|
|0287|Find the Duplicate Number|[Go]({{< relref "/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md" >}})|Medium| O(n)| O(1)|❤️|59.1%|
-|0300|Longest Increasing Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md" >}})|Medium||||51.5%|
-|0303|Range Sum Query - Immutable|[Go]({{< relref "/ChapterFour/0300~0399/0303.Range-Sum-Query-Immutable.md" >}})|Easy||||58.0%|
-|0304|Range Sum Query 2D - Immutable|[Go]({{< relref "/ChapterFour/0300~0399/0304.Range-Sum-Query-2D-Immutable.md" >}})|Medium||||52.1%|
+|0300|Longest Increasing Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md" >}})|Medium||||52.1%|
+|0303|Range Sum Query - Immutable|[Go]({{< relref "/ChapterFour/0300~0399/0303.Range-Sum-Query-Immutable.md" >}})|Easy||||59.3%|
+|0304|Range Sum Query 2D - Immutable|[Go]({{< relref "/ChapterFour/0300~0399/0304.Range-Sum-Query-2D-Immutable.md" >}})|Medium||||52.7%|
|0307|Range Sum Query - Mutable|[Go]({{< relref "/ChapterFour/0300~0399/0307.Range-Sum-Query-Mutable.md" >}})|Medium||||40.7%|
-|0309|Best Time to Buy and Sell Stock with Cooldown|[Go]({{< relref "/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md" >}})|Medium||||54.4%|
-|0315|Count of Smaller Numbers After Self|[Go]({{< relref "/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md" >}})|Hard||||42.8%|
-|0318|Maximum Product of Word Lengths|[Go]({{< relref "/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md" >}})|Medium||||60.1%|
-|0322|Coin Change|[Go]({{< relref "/ChapterFour/0300~0399/0322.Coin-Change.md" >}})|Medium||||41.5%|
-|0324|Wiggle Sort II|[Go]({{< relref "/ChapterFour/0300~0399/0324.Wiggle-Sort-II.md" >}})|Medium||||32.9%|
+|0309|Best Time to Buy and Sell Stock with Cooldown|[Go]({{< relref "/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md" >}})|Medium||||56.2%|
+|0315|Count of Smaller Numbers After Self|[Go]({{< relref "/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md" >}})|Hard||||42.6%|
+|0318|Maximum Product of Word Lengths|[Go]({{< relref "/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md" >}})|Medium||||59.9%|
+|0322|Coin Change|[Go]({{< relref "/ChapterFour/0300~0399/0322.Coin-Change.md" >}})|Medium||||42.0%|
+|0324|Wiggle Sort II|[Go]({{< relref "/ChapterFour/0300~0399/0324.Wiggle-Sort-II.md" >}})|Medium||||33.3%|
|0327|Count of Range Sum|[Go]({{< relref "/ChapterFour/0300~0399/0327.Count-of-Range-Sum.md" >}})|Hard||||36.0%|
-|0329|Longest Increasing Path in a Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md" >}})|Hard||||52.1%|
-|0347|Top K Frequent Elements|[Go]({{< relref "/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md" >}})|Medium||||64.8%|
-|0349|Intersection of Two Arrays|[Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}})|Easy||||70.2%|
-|0350|Intersection of Two Arrays II|[Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}})|Easy||||55.5%|
-|0354|Russian Doll Envelopes|[Go]({{< relref "/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md" >}})|Hard||||38.3%|
-|0368|Largest Divisible Subset|[Go]({{< relref "/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md" >}})|Medium||||41.2%|
-|0373|Find K Pairs with Smallest Sums|[Go]({{< relref "/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums.md" >}})|Medium||||38.4%|
-|0376|Wiggle Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0376.Wiggle-Subsequence.md" >}})|Medium||||48.2%|
-|0377|Combination Sum IV|[Go]({{< relref "/ChapterFour/0300~0399/0377.Combination-Sum-IV.md" >}})|Medium||||52.1%|
-|0378|Kth Smallest Element in a Sorted Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md" >}})|Medium||||61.6%|
-|0384|Shuffle an Array|[Go]({{< relref "/ChapterFour/0300~0399/0384.Shuffle-an-Array.md" >}})|Medium||||57.6%|
-|0391|Perfect Rectangle|[Go]({{< relref "/ChapterFour/0300~0399/0391.Perfect-Rectangle.md" >}})|Hard||||32.5%|
-|0393|UTF-8 Validation|[Go]({{< relref "/ChapterFour/0300~0399/0393.UTF-8-Validation.md" >}})|Medium||||45.2%|
-|0396|Rotate Function|[Go]({{< relref "/ChapterFour/0300~0399/0396.Rotate-Function.md" >}})|Medium||||40.4%|
-|0399|Evaluate Division|[Go]({{< relref "/ChapterFour/0300~0399/0399.Evaluate-Division.md" >}})|Medium||||59.5%|
-|0410|Split Array Largest Sum|[Go]({{< relref "/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md" >}})|Hard||||53.2%|
+|0329|Longest Increasing Path in a Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md" >}})|Hard||||52.4%|
+|0347|Top K Frequent Elements|[Go]({{< relref "/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md" >}})|Medium||||64.3%|
+|0349|Intersection of Two Arrays|[Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}})|Easy||||70.9%|
+|0350|Intersection of Two Arrays II|[Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}})|Easy||||55.9%|
+|0354|Russian Doll Envelopes|[Go]({{< relref "/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md" >}})|Hard||||38.0%|
+|0368|Largest Divisible Subset|[Go]({{< relref "/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md" >}})|Medium||||41.5%|
+|0373|Find K Pairs with Smallest Sums|[Go]({{< relref "/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums.md" >}})|Medium||||38.3%|
+|0376|Wiggle Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0376.Wiggle-Subsequence.md" >}})|Medium||||48.3%|
+|0377|Combination Sum IV|[Go]({{< relref "/ChapterFour/0300~0399/0377.Combination-Sum-IV.md" >}})|Medium||||52.2%|
+|0378|Kth Smallest Element in a Sorted Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md" >}})|Medium||||61.8%|
+|0384|Shuffle an Array|[Go]({{< relref "/ChapterFour/0300~0399/0384.Shuffle-an-Array.md" >}})|Medium||||57.8%|
+|0391|Perfect Rectangle|[Go]({{< relref "/ChapterFour/0300~0399/0391.Perfect-Rectangle.md" >}})|Hard||||32.8%|
+|0393|UTF-8 Validation|[Go]({{< relref "/ChapterFour/0300~0399/0393.UTF-8-Validation.md" >}})|Medium||||45.1%|
+|0396|Rotate Function|[Go]({{< relref "/ChapterFour/0300~0399/0396.Rotate-Function.md" >}})|Medium||||41.1%|
+|0399|Evaluate Division|[Go]({{< relref "/ChapterFour/0300~0399/0399.Evaluate-Division.md" >}})|Medium||||59.6%|
+|0410|Split Array Largest Sum|[Go]({{< relref "/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md" >}})|Hard||||53.5%|
|0413|Arithmetic Slices|[Go]({{< relref "/ChapterFour/0400~0499/0413.Arithmetic-Slices.md" >}})|Medium||||65.1%|
-|0414|Third Maximum Number|[Go]({{< relref "/ChapterFour/0400~0499/0414.Third-Maximum-Number.md" >}})|Easy||||32.5%|
-|0416|Partition Equal Subset Sum|[Go]({{< relref "/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md" >}})|Medium||||46.7%|
-|0417|Pacific Atlantic Water Flow|[Go]({{< relref "/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow.md" >}})|Medium||||54.0%|
-|0419|Battleships in a Board|[Go]({{< relref "/ChapterFour/0400~0499/0419.Battleships-in-a-Board.md" >}})|Medium||||74.6%|
-|0421|Maximum XOR of Two Numbers in an Array|[Go]({{< relref "/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md" >}})|Medium||||54.6%|
-|0435|Non-overlapping Intervals|[Go]({{< relref "/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md" >}})|Medium||||49.8%|
-|0436|Find Right Interval|[Go]({{< relref "/ChapterFour/0400~0499/0436.Find-Right-Interval.md" >}})|Medium||||50.3%|
-|0447|Number of Boomerangs|[Go]({{< relref "/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md" >}})|Medium||||54.6%|
-|0448|Find All Numbers Disappeared in an Array|[Go]({{< relref "/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array.md" >}})|Easy||||59.6%|
-|0453|Minimum Moves to Equal Array Elements|[Go]({{< relref "/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements.md" >}})|Medium||||55.6%|
-|0454|4Sum II|[Go]({{< relref "/ChapterFour/0400~0499/0454.4Sum-II.md" >}})|Medium||||57.3%|
-|0455|Assign Cookies|[Go]({{< relref "/ChapterFour/0400~0499/0455.Assign-Cookies.md" >}})|Easy||||50.6%|
+|0414|Third Maximum Number|[Go]({{< relref "/ChapterFour/0400~0499/0414.Third-Maximum-Number.md" >}})|Easy||||33.1%|
+|0416|Partition Equal Subset Sum|[Go]({{< relref "/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md" >}})|Medium||||46.3%|
+|0417|Pacific Atlantic Water Flow|[Go]({{< relref "/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow.md" >}})|Medium||||54.4%|
+|0419|Battleships in a Board|[Go]({{< relref "/ChapterFour/0400~0499/0419.Battleships-in-a-Board.md" >}})|Medium||||74.8%|
+|0421|Maximum XOR of Two Numbers in an Array|[Go]({{< relref "/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md" >}})|Medium||||54.1%|
+|0435|Non-overlapping Intervals|[Go]({{< relref "/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md" >}})|Medium||||50.2%|
+|0436|Find Right Interval|[Go]({{< relref "/ChapterFour/0400~0499/0436.Find-Right-Interval.md" >}})|Medium||||50.7%|
+|0447|Number of Boomerangs|[Go]({{< relref "/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md" >}})|Medium||||54.9%|
+|0448|Find All Numbers Disappeared in an Array|[Go]({{< relref "/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array.md" >}})|Easy||||59.9%|
+|0453|Minimum Moves to Equal Array Elements|[Go]({{< relref "/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements.md" >}})|Medium||||56.0%|
+|0454|4Sum II|[Go]({{< relref "/ChapterFour/0400~0499/0454.4Sum-II.md" >}})|Medium||||57.2%|
+|0455|Assign Cookies|[Go]({{< relref "/ChapterFour/0400~0499/0455.Assign-Cookies.md" >}})|Easy||||50.0%|
|0456|132 Pattern|[Go]({{< relref "/ChapterFour/0400~0499/0456.132-Pattern.md" >}})|Medium||||32.4%|
-|0457|Circular Array Loop|[Go]({{< relref "/ChapterFour/0400~0499/0457.Circular-Array-Loop.md" >}})|Medium||||32.2%|
-|0462|Minimum Moves to Equal Array Elements II|[Go]({{< relref "/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II.md" >}})|Medium||||60.1%|
-|0463|Island Perimeter|[Go]({{< relref "/ChapterFour/0400~0499/0463.Island-Perimeter.md" >}})|Easy||||69.5%|
-|0473|Matchsticks to Square|[Go]({{< relref "/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md" >}})|Medium||||40.4%|
+|0457|Circular Array Loop|[Go]({{< relref "/ChapterFour/0400~0499/0457.Circular-Array-Loop.md" >}})|Medium||||32.6%|
+|0462|Minimum Moves to Equal Array Elements II|[Go]({{< relref "/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II.md" >}})|Medium||||60.0%|
+|0463|Island Perimeter|[Go]({{< relref "/ChapterFour/0400~0499/0463.Island-Perimeter.md" >}})|Easy||||69.7%|
+|0473|Matchsticks to Square|[Go]({{< relref "/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md" >}})|Medium||||40.2%|
|0474|Ones and Zeroes|[Go]({{< relref "/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md" >}})|Medium||||46.7%|
-|0475|Heaters|[Go]({{< relref "/ChapterFour/0400~0499/0475.Heaters.md" >}})|Medium||||36.1%|
-|0477|Total Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md" >}})|Medium||||52.2%|
-|0480|Sliding Window Median|[Go]({{< relref "/ChapterFour/0400~0499/0480.Sliding-Window-Median.md" >}})|Hard||||41.4%|
-|0485|Max Consecutive Ones|[Go]({{< relref "/ChapterFour/0400~0499/0485.Max-Consecutive-Ones.md" >}})|Easy||||56.0%|
-|0491|Increasing Subsequences|[Go]({{< relref "/ChapterFour/0400~0499/0491.Increasing-Subsequences.md" >}})|Medium||||52.0%|
-|0493|Reverse Pairs|[Go]({{< relref "/ChapterFour/0400~0499/0493.Reverse-Pairs.md" >}})|Hard||||30.8%|
-|0494|Target Sum|[Go]({{< relref "/ChapterFour/0400~0499/0494.Target-Sum.md" >}})|Medium||||45.6%|
-|0495|Teemo Attacking|[Go]({{< relref "/ChapterFour/0400~0499/0495.Teemo-Attacking.md" >}})|Easy||||57.0%|
-|0496|Next Greater Element I|[Go]({{< relref "/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md" >}})|Easy||||71.3%|
-|0498|Diagonal Traverse|[Go]({{< relref "/ChapterFour/0400~0499/0498.Diagonal-Traverse.md" >}})|Medium||||58.0%|
-|0500|Keyboard Row|[Go]({{< relref "/ChapterFour/0500~0599/0500.Keyboard-Row.md" >}})|Easy||||69.0%|
-|0503|Next Greater Element II|[Go]({{< relref "/ChapterFour/0500~0599/0503.Next-Greater-Element-II.md" >}})|Medium||||63.1%|
-|0506|Relative Ranks|[Go]({{< relref "/ChapterFour/0500~0599/0506.Relative-Ranks.md" >}})|Easy||||58.9%|
-|0518|Coin Change II|[Go]({{< relref "/ChapterFour/0500~0599/0518.Coin-Change-II.md" >}})|Medium||||59.8%|
-|0523|Continuous Subarray Sum|[Go]({{< relref "/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum.md" >}})|Medium||||27.7%|
-|0524|Longest Word in Dictionary through Deleting|[Go]({{< relref "/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})|Medium||||51.2%|
+|0475|Heaters|[Go]({{< relref "/ChapterFour/0400~0499/0475.Heaters.md" >}})|Medium||||36.4%|
+|0477|Total Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md" >}})|Medium||||52.1%|
+|0480|Sliding Window Median|[Go]({{< relref "/ChapterFour/0400~0499/0480.Sliding-Window-Median.md" >}})|Hard||||41.3%|
+|0485|Max Consecutive Ones|[Go]({{< relref "/ChapterFour/0400~0499/0485.Max-Consecutive-Ones.md" >}})|Easy||||56.5%|
+|0491|Non-decreasing Subsequences|[Go]({{< relref "/ChapterFour/0400~0499/0491.Non-decreasing-Subsequences.md" >}})|Medium||||60.1%|
+|0493|Reverse Pairs|[Go]({{< relref "/ChapterFour/0400~0499/0493.Reverse-Pairs.md" >}})|Hard||||30.9%|
+|0494|Target Sum|[Go]({{< relref "/ChapterFour/0400~0499/0494.Target-Sum.md" >}})|Medium||||45.7%|
+|0495|Teemo Attacking|[Go]({{< relref "/ChapterFour/0400~0499/0495.Teemo-Attacking.md" >}})|Easy||||56.9%|
+|0496|Next Greater Element I|[Go]({{< relref "/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md" >}})|Easy||||71.5%|
+|0497|Random Point in Non-overlapping Rectangles|[Go]({{< relref "/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md" >}})|Medium||||39.4%|
+|0498|Diagonal Traverse|[Go]({{< relref "/ChapterFour/0400~0499/0498.Diagonal-Traverse.md" >}})|Medium||||58.3%|
+|0500|Keyboard Row|[Go]({{< relref "/ChapterFour/0500~0599/0500.Keyboard-Row.md" >}})|Easy||||69.5%|
+|0503|Next Greater Element II|[Go]({{< relref "/ChapterFour/0500~0599/0503.Next-Greater-Element-II.md" >}})|Medium||||63.2%|
+|0506|Relative Ranks|[Go]({{< relref "/ChapterFour/0500~0599/0506.Relative-Ranks.md" >}})|Easy||||60.3%|
+|0518|Coin Change II|[Go]({{< relref "/ChapterFour/0500~0599/0518.Coin-Change-II.md" >}})|Medium||||60.5%|
+|0523|Continuous Subarray Sum|[Go]({{< relref "/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum.md" >}})|Medium||||28.5%|
+|0524|Longest Word in Dictionary through Deleting|[Go]({{< relref "/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})|Medium||||51.0%|
|0525|Contiguous Array|[Go]({{< relref "/ChapterFour/0500~0599/0525.Contiguous-Array.md" >}})|Medium||||46.8%|
-|0526|Beautiful Arrangement|[Go]({{< relref "/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md" >}})|Medium||||64.6%|
-|0529|Minesweeper|[Go]({{< relref "/ChapterFour/0500~0599/0529.Minesweeper.md" >}})|Medium||||65.5%|
-|0532|K-diff Pairs in an Array|[Go]({{< relref "/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md" >}})|Medium| O(n)| O(n)||40.7%|
-|0540|Single Element in a Sorted Array|[Go]({{< relref "/ChapterFour/0500~0599/0540.Single-Element-in-a-Sorted-Array.md" >}})|Medium||||58.5%|
-|0542|01 Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0542.01-Matrix.md" >}})|Medium||||44.2%|
-|0554|Brick Wall|[Go]({{< relref "/ChapterFour/0500~0599/0554.Brick-Wall.md" >}})|Medium||||53.1%|
-|0560|Subarray Sum Equals K|[Go]({{< relref "/ChapterFour/0500~0599/0560.Subarray-Sum-Equals-K.md" >}})|Medium||||44.0%|
-|0561|Array Partition|[Go]({{< relref "/ChapterFour/0500~0599/0561.Array-Partition.md" >}})|Easy||||76.6%|
-|0566|Reshape the Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0566.Reshape-the-Matrix.md" >}})|Easy| O(n^2)| O(n^2)||62.7%|
-|0575|Distribute Candies|[Go]({{< relref "/ChapterFour/0500~0599/0575.Distribute-Candies.md" >}})|Easy||||66.1%|
-|0581|Shortest Unsorted Continuous Subarray|[Go]({{< relref "/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md" >}})|Medium||||36.2%|
-|0594|Longest Harmonious Subsequence|[Go]({{< relref "/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md" >}})|Easy||||53.1%|
-|0598|Range Addition II|[Go]({{< relref "/ChapterFour/0500~0599/0598.Range-Addition-II.md" >}})|Easy||||55.0%|
-|0599|Minimum Index Sum of Two Lists|[Go]({{< relref "/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md" >}})|Easy||||52.8%|
-|0605|Can Place Flowers|[Go]({{< relref "/ChapterFour/0600~0699/0605.Can-Place-Flowers.md" >}})|Easy||||33.0%|
+|0526|Beautiful Arrangement|[Go]({{< relref "/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md" >}})|Medium||||64.5%|
+|0528|Random Pick with Weight|[Go]({{< relref "/ChapterFour/0500~0599/0528.Random-Pick-with-Weight.md" >}})|Medium||||46.1%|
+|0529|Minesweeper|[Go]({{< relref "/ChapterFour/0500~0599/0529.Minesweeper.md" >}})|Medium||||65.7%|
+|0532|K-diff Pairs in an Array|[Go]({{< relref "/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md" >}})|Medium| O(n)| O(n)||41.1%|
+|0540|Single Element in a Sorted Array|[Go]({{< relref "/ChapterFour/0500~0599/0540.Single-Element-in-a-Sorted-Array.md" >}})|Medium||||59.1%|
+|0542|01 Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0542.01-Matrix.md" >}})|Medium||||44.7%|
+|0554|Brick Wall|[Go]({{< relref "/ChapterFour/0500~0599/0554.Brick-Wall.md" >}})|Medium||||53.5%|
+|0560|Subarray Sum Equals K|[Go]({{< relref "/ChapterFour/0500~0599/0560.Subarray-Sum-Equals-K.md" >}})|Medium||||43.7%|
+|0561|Array Partition|[Go]({{< relref "/ChapterFour/0500~0599/0561.Array-Partition.md" >}})|Easy||||77.1%|
+|0566|Reshape the Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0566.Reshape-the-Matrix.md" >}})|Easy| O(n^2)| O(n^2)||62.8%|
+|0575|Distribute Candies|[Go]({{< relref "/ChapterFour/0500~0599/0575.Distribute-Candies.md" >}})|Easy||||66.4%|
+|0581|Shortest Unsorted Continuous Subarray|[Go]({{< relref "/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md" >}})|Medium||||36.4%|
+|0594|Longest Harmonious Subsequence|[Go]({{< relref "/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md" >}})|Easy||||53.5%|
+|0598|Range Addition II|[Go]({{< relref "/ChapterFour/0500~0599/0598.Range-Addition-II.md" >}})|Easy||||55.3%|
+|0599|Minimum Index Sum of Two Lists|[Go]({{< relref "/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md" >}})|Easy||||53.3%|
+|0605|Can Place Flowers|[Go]({{< relref "/ChapterFour/0600~0699/0605.Can-Place-Flowers.md" >}})|Easy||||32.5%|
|0609|Find Duplicate File in System|[Go]({{< relref "/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System.md" >}})|Medium||||67.8%|
-|0611|Valid Triangle Number|[Go]({{< relref "/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md" >}})|Medium||||50.4%|
-|0622|Design Circular Queue|[Go]({{< relref "/ChapterFour/0600~0699/0622.Design-Circular-Queue.md" >}})|Medium||||51.8%|
-|0628|Maximum Product of Three Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md" >}})|Easy| O(n)| O(1)||46.4%|
+|0611|Valid Triangle Number|[Go]({{< relref "/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md" >}})|Medium||||50.5%|
+|0622|Design Circular Queue|[Go]({{< relref "/ChapterFour/0600~0699/0622.Design-Circular-Queue.md" >}})|Medium||||51.6%|
+|0628|Maximum Product of Three Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md" >}})|Easy| O(n)| O(1)||46.0%|
|0630|Course Schedule III|[Go]({{< relref "/ChapterFour/0600~0699/0630.Course-Schedule-III.md" >}})|Hard||||40.2%|
-|0632|Smallest Range Covering Elements from K Lists|[Go]({{< relref "/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}})|Hard||||60.4%|
-|0636|Exclusive Time of Functions|[Go]({{< relref "/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md" >}})|Medium||||61.0%|
-|0638|Shopping Offers|[Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}})|Medium||||54.2%|
-|0643|Maximum Average Subarray I|[Go]({{< relref "/ChapterFour/0600~0699/0643.Maximum-Average-Subarray-I.md" >}})|Easy||||43.8%|
-|0645|Set Mismatch|[Go]({{< relref "/ChapterFour/0600~0699/0645.Set-Mismatch.md" >}})|Easy||||43.0%|
+|0632|Smallest Range Covering Elements from K Lists|[Go]({{< relref "/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}})|Hard||||60.9%|
+|0636|Exclusive Time of Functions|[Go]({{< relref "/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md" >}})|Medium||||61.2%|
+|0638|Shopping Offers|[Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}})|Medium||||53.3%|
+|0643|Maximum Average Subarray I|[Go]({{< relref "/ChapterFour/0600~0699/0643.Maximum-Average-Subarray-I.md" >}})|Easy||||43.7%|
+|0645|Set Mismatch|[Go]({{< relref "/ChapterFour/0600~0699/0645.Set-Mismatch.md" >}})|Easy||||42.8%|
|0648|Replace Words|[Go]({{< relref "/ChapterFour/0600~0699/0648.Replace-Words.md" >}})|Medium||||62.7%|
-|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||46.7%|
-|0661|Image Smoother|[Go]({{< relref "/ChapterFour/0600~0699/0661.Image-Smoother.md" >}})|Easy||||55.0%|
-|0665|Non-decreasing Array|[Go]({{< relref "/ChapterFour/0600~0699/0665.Non-decreasing-Array.md" >}})|Medium||||24.1%|
-|0667|Beautiful Arrangement II|[Go]({{< relref "/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II.md" >}})|Medium||||59.7%|
-|0674|Longest Continuous Increasing Subsequence|[Go]({{< relref "/ChapterFour/0600~0699/0674.Longest-Continuous-Increasing-Subsequence.md" >}})|Easy||||49.1%|
-|0682|Baseball Game|[Go]({{< relref "/ChapterFour/0600~0699/0682.Baseball-Game.md" >}})|Easy||||73.6%|
-|0695|Max Area of Island|[Go]({{< relref "/ChapterFour/0600~0699/0695.Max-Area-of-Island.md" >}})|Medium||||71.7%|
-|0697|Degree of an Array|[Go]({{< relref "/ChapterFour/0600~0699/0697.Degree-of-an-Array.md" >}})|Easy||||55.8%|
-|0699|Falling Squares|[Go]({{< relref "/ChapterFour/0600~0699/0699.Falling-Squares.md" >}})|Hard||||44.4%|
-|0704|Binary Search|[Go]({{< relref "/ChapterFour/0700~0799/0704.Binary-Search.md" >}})|Easy||||55.1%|
-|0705|Design HashSet|[Go]({{< relref "/ChapterFour/0700~0799/0705.Design-HashSet.md" >}})|Easy||||66.0%|
-|0706|Design HashMap|[Go]({{< relref "/ChapterFour/0700~0799/0706.Design-HashMap.md" >}})|Easy||||65.1%|
-|0713|Subarray Product Less Than K|[Go]({{< relref "/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K.md" >}})|Medium| O(n)| O(1)||45.1%|
-|0714|Best Time to Buy and Sell Stock with Transaction Fee|[Go]({{< relref "/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md" >}})|Medium| O(n)| O(1)||64.3%|
-|0717|1-bit and 2-bit Characters|[Go]({{< relref "/ChapterFour/0700~0799/0717.1-bit-and-2-bit-Characters.md" >}})|Easy||||46.0%|
-|0718|Maximum Length of Repeated Subarray|[Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}})|Medium||||51.6%|
-|0719|Find K-th Smallest Pair Distance|[Go]({{< relref "/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md" >}})|Hard||||36.3%|
-|0720|Longest Word in Dictionary|[Go]({{< relref "/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md" >}})|Medium||||51.8%|
+|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||46.8%|
+|0661|Image Smoother|[Go]({{< relref "/ChapterFour/0600~0699/0661.Image-Smoother.md" >}})|Easy||||55.4%|
+|0665|Non-decreasing Array|[Go]({{< relref "/ChapterFour/0600~0699/0665.Non-decreasing-Array.md" >}})|Medium||||24.3%|
+|0667|Beautiful Arrangement II|[Go]({{< relref "/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II.md" >}})|Medium||||59.8%|
+|0674|Longest Continuous Increasing Subsequence|[Go]({{< relref "/ChapterFour/0600~0699/0674.Longest-Continuous-Increasing-Subsequence.md" >}})|Easy||||49.3%|
+|0682|Baseball Game|[Go]({{< relref "/ChapterFour/0600~0699/0682.Baseball-Game.md" >}})|Easy||||74.2%|
+|0695|Max Area of Island|[Go]({{< relref "/ChapterFour/0600~0699/0695.Max-Area-of-Island.md" >}})|Medium||||71.8%|
+|0697|Degree of an Array|[Go]({{< relref "/ChapterFour/0600~0699/0697.Degree-of-an-Array.md" >}})|Easy||||55.9%|
+|0699|Falling Squares|[Go]({{< relref "/ChapterFour/0600~0699/0699.Falling-Squares.md" >}})|Hard||||44.5%|
+|0704|Binary Search|[Go]({{< relref "/ChapterFour/0700~0799/0704.Binary-Search.md" >}})|Easy||||55.4%|
+|0705|Design HashSet|[Go]({{< relref "/ChapterFour/0700~0799/0705.Design-HashSet.md" >}})|Easy||||65.7%|
+|0706|Design HashMap|[Go]({{< relref "/ChapterFour/0700~0799/0706.Design-HashMap.md" >}})|Easy||||64.7%|
+|0710|Random Pick with Blacklist|[Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}})|Hard||||33.5%|
+|0713|Subarray Product Less Than K|[Go]({{< relref "/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K.md" >}})|Medium| O(n)| O(1)||45.7%|
+|0714|Best Time to Buy and Sell Stock with Transaction Fee|[Go]({{< relref "/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md" >}})|Medium| O(n)| O(1)||65.0%|
+|0717|1-bit and 2-bit Characters|[Go]({{< relref "/ChapterFour/0700~0799/0717.1-bit-and-2-bit-Characters.md" >}})|Easy||||45.7%|
+|0718|Maximum Length of Repeated Subarray|[Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}})|Medium||||51.3%|
+|0719|Find K-th Smallest Pair Distance|[Go]({{< relref "/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md" >}})|Hard||||36.7%|
+|0720|Longest Word in Dictionary|[Go]({{< relref "/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md" >}})|Medium||||51.9%|
|0721|Accounts Merge|[Go]({{< relref "/ChapterFour/0700~0799/0721.Accounts-Merge.md" >}})|Medium||||56.3%|
-|0724|Find Pivot Index|[Go]({{< relref "/ChapterFour/0700~0799/0724.Find-Pivot-Index.md" >}})|Easy||||53.4%|
-|0733|Flood Fill|[Go]({{< relref "/ChapterFour/0700~0799/0733.Flood-Fill.md" >}})|Easy||||60.4%|
+|0724|Find Pivot Index|[Go]({{< relref "/ChapterFour/0700~0799/0724.Find-Pivot-Index.md" >}})|Easy||||54.5%|
+|0733|Flood Fill|[Go]({{< relref "/ChapterFour/0700~0799/0733.Flood-Fill.md" >}})|Easy||||61.8%|
|0735|Asteroid Collision|[Go]({{< relref "/ChapterFour/0700~0799/0735.Asteroid-Collision.md" >}})|Medium||||44.4%|
-|0739|Daily Temperatures|[Go]({{< relref "/ChapterFour/0700~0799/0739.Daily-Temperatures.md" >}})|Medium||||66.5%|
-|0744|Find Smallest Letter Greater Than Target|[Go]({{< relref "/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target.md" >}})|Easy||||44.6%|
-|0746|Min Cost Climbing Stairs|[Go]({{< relref "/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md" >}})|Easy| O(n)| O(1)||62.3%|
-|0747|Largest Number At Least Twice of Others|[Go]({{< relref "/ChapterFour/0700~0799/0747.Largest-Number-At-Least-Twice-of-Others.md" >}})|Easy||||46.3%|
+|0739|Daily Temperatures|[Go]({{< relref "/ChapterFour/0700~0799/0739.Daily-Temperatures.md" >}})|Medium||||66.3%|
+|0744|Find Smallest Letter Greater Than Target|[Go]({{< relref "/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target.md" >}})|Easy||||45.6%|
+|0746|Min Cost Climbing Stairs|[Go]({{< relref "/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md" >}})|Easy| O(n)| O(1)||63.1%|
+|0747|Largest Number At Least Twice of Others|[Go]({{< relref "/ChapterFour/0700~0799/0747.Largest-Number-At-Least-Twice-of-Others.md" >}})|Easy||||47.0%|
|0748|Shortest Completing Word|[Go]({{< relref "/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md" >}})|Easy||||59.2%|
-|0752|Open the Lock|[Go]({{< relref "/ChapterFour/0700~0799/0752.Open-the-Lock.md" >}})|Medium||||55.5%|
-|0766|Toeplitz Matrix|[Go]({{< relref "/ChapterFour/0700~0799/0766.Toeplitz-Matrix.md" >}})|Easy| O(n)| O(1)||68.1%|
-|0775|Global and Local Inversions|[Go]({{< relref "/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md" >}})|Medium||||43.8%|
-|0778|Swim in Rising Water|[Go]({{< relref "/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md" >}})|Hard||||59.6%|
-|0781|Rabbits in Forest|[Go]({{< relref "/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md" >}})|Medium||||55.3%|
-|0786|K-th Smallest Prime Fraction|[Go]({{< relref "/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md" >}})|Medium||||50.7%|
-|0794|Valid Tic-Tac-Toe State|[Go]({{< relref "/ChapterFour/0700~0799/0794.Valid-Tic-Tac-Toe-State.md" >}})|Medium||||35.2%|
-|0795|Number of Subarrays with Bounded Maximum|[Go]({{< relref "/ChapterFour/0700~0799/0795.Number-of-Subarrays-with-Bounded-Maximum.md" >}})|Medium||||52.7%|
+|0752|Open the Lock|[Go]({{< relref "/ChapterFour/0700~0799/0752.Open-the-Lock.md" >}})|Medium||||55.6%|
+|0766|Toeplitz Matrix|[Go]({{< relref "/ChapterFour/0700~0799/0766.Toeplitz-Matrix.md" >}})|Easy| O(n)| O(1)||68.7%|
+|0775|Global and Local Inversions|[Go]({{< relref "/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md" >}})|Medium||||43.3%|
+|0778|Swim in Rising Water|[Go]({{< relref "/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md" >}})|Hard||||59.8%|
+|0781|Rabbits in Forest|[Go]({{< relref "/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md" >}})|Medium||||54.8%|
+|0786|K-th Smallest Prime Fraction|[Go]({{< relref "/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md" >}})|Medium||||51.6%|
+|0794|Valid Tic-Tac-Toe State|[Go]({{< relref "/ChapterFour/0700~0799/0794.Valid-Tic-Tac-Toe-State.md" >}})|Medium||||35.1%|
+|0795|Number of Subarrays with Bounded Maximum|[Go]({{< relref "/ChapterFour/0700~0799/0795.Number-of-Subarrays-with-Bounded-Maximum.md" >}})|Medium||||52.8%|
|0803|Bricks Falling When Hit|[Go]({{< relref "/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit.md" >}})|Hard||||34.3%|
-|0807|Max Increase to Keep City Skyline|[Go]({{< relref "/ChapterFour/0800~0899/0807.Max-Increase-to-Keep-City-Skyline.md" >}})|Medium||||86.0%|
-|0810|Chalkboard XOR Game|[Go]({{< relref "/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md" >}})|Hard||||55.1%|
-|0811|Subdomain Visit Count|[Go]({{< relref "/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md" >}})|Medium||||75.1%|
-|0812|Largest Triangle Area|[Go]({{< relref "/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md" >}})|Easy||||60.0%|
-|0815|Bus Routes|[Go]({{< relref "/ChapterFour/0800~0899/0815.Bus-Routes.md" >}})|Hard||||45.7%|
-|0817|Linked List Components|[Go]({{< relref "/ChapterFour/0800~0899/0817.Linked-List-Components.md" >}})|Medium||||58.1%|
-|0820|Short Encoding of Words|[Go]({{< relref "/ChapterFour/0800~0899/0820.Short-Encoding-of-Words.md" >}})|Medium||||60.7%|
-|0821|Shortest Distance to a Character|[Go]({{< relref "/ChapterFour/0800~0899/0821.Shortest-Distance-to-a-Character.md" >}})|Easy||||71.4%|
-|0823|Binary Trees With Factors|[Go]({{< relref "/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors.md" >}})|Medium||||50.0%|
-|0825|Friends Of Appropriate Ages|[Go]({{< relref "/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages.md" >}})|Medium||||46.4%|
-|0826|Most Profit Assigning Work|[Go]({{< relref "/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md" >}})|Medium||||44.4%|
-|0832|Flipping an Image|[Go]({{< relref "/ChapterFour/0800~0899/0832.Flipping-an-Image.md" >}})|Easy||||80.4%|
-|0839|Similar String Groups|[Go]({{< relref "/ChapterFour/0800~0899/0839.Similar-String-Groups.md" >}})|Hard||||47.6%|
+|0807|Max Increase to Keep City Skyline|[Go]({{< relref "/ChapterFour/0800~0899/0807.Max-Increase-to-Keep-City-Skyline.md" >}})|Medium||||85.9%|
+|0810|Chalkboard XOR Game|[Go]({{< relref "/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md" >}})|Hard||||56.2%|
+|0811|Subdomain Visit Count|[Go]({{< relref "/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md" >}})|Medium||||75.5%|
+|0812|Largest Triangle Area|[Go]({{< relref "/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md" >}})|Easy||||59.9%|
+|0815|Bus Routes|[Go]({{< relref "/ChapterFour/0800~0899/0815.Bus-Routes.md" >}})|Hard||||45.6%|
+|0817|Linked List Components|[Go]({{< relref "/ChapterFour/0800~0899/0817.Linked-List-Components.md" >}})|Medium||||57.7%|
+|0820|Short Encoding of Words|[Go]({{< relref "/ChapterFour/0800~0899/0820.Short-Encoding-of-Words.md" >}})|Medium||||60.6%|
+|0821|Shortest Distance to a Character|[Go]({{< relref "/ChapterFour/0800~0899/0821.Shortest-Distance-to-a-Character.md" >}})|Easy||||71.3%|
+|0823|Binary Trees With Factors|[Go]({{< relref "/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors.md" >}})|Medium||||49.7%|
+|0825|Friends Of Appropriate Ages|[Go]({{< relref "/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages.md" >}})|Medium||||46.3%|
+|0826|Most Profit Assigning Work|[Go]({{< relref "/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md" >}})|Medium||||44.8%|
+|0832|Flipping an Image|[Go]({{< relref "/ChapterFour/0800~0899/0832.Flipping-an-Image.md" >}})|Easy||||80.7%|
+|0839|Similar String Groups|[Go]({{< relref "/ChapterFour/0800~0899/0839.Similar-String-Groups.md" >}})|Hard||||48.0%|
|0845|Longest Mountain in Array|[Go]({{< relref "/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md" >}})|Medium||||40.2%|
-|0846|Hand of Straights|[Go]({{< relref "/ChapterFour/0800~0899/0846.Hand-of-Straights.md" >}})|Medium||||56.5%|
-|0850|Rectangle Area II|[Go]({{< relref "/ChapterFour/0800~0899/0850.Rectangle-Area-II.md" >}})|Hard||||53.7%|
-|0851|Loud and Rich|[Go]({{< relref "/ChapterFour/0800~0899/0851.Loud-and-Rich.md" >}})|Medium||||58.2%|
-|0852|Peak Index in a Mountain Array|[Go]({{< relref "/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array.md" >}})|Medium||||69.5%|
-|0853|Car Fleet|[Go]({{< relref "/ChapterFour/0800~0899/0853.Car-Fleet.md" >}})|Medium||||50.0%|
+|0846|Hand of Straights|[Go]({{< relref "/ChapterFour/0800~0899/0846.Hand-of-Straights.md" >}})|Medium||||56.2%|
+|0850|Rectangle Area II|[Go]({{< relref "/ChapterFour/0800~0899/0850.Rectangle-Area-II.md" >}})|Hard||||53.9%|
+|0851|Loud and Rich|[Go]({{< relref "/ChapterFour/0800~0899/0851.Loud-and-Rich.md" >}})|Medium||||58.4%|
+|0852|Peak Index in a Mountain Array|[Go]({{< relref "/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array.md" >}})|Medium||||69.1%|
+|0853|Car Fleet|[Go]({{< relref "/ChapterFour/0800~0899/0853.Car-Fleet.md" >}})|Medium||||50.3%|
|0862|Shortest Subarray with Sum at Least K|[Go]({{< relref "/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K.md" >}})|Hard||||26.1%|
-|0864|Shortest Path to Get All Keys|[Go]({{< relref "/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md" >}})|Hard||||45.4%|
-|0867|Transpose Matrix|[Go]({{< relref "/ChapterFour/0800~0899/0867.Transpose-Matrix.md" >}})|Easy| O(n)| O(1)||63.4%|
-|0870|Advantage Shuffle|[Go]({{< relref "/ChapterFour/0800~0899/0870.Advantage-Shuffle.md" >}})|Medium||||51.7%|
-|0874|Walking Robot Simulation|[Go]({{< relref "/ChapterFour/0800~0899/0874.Walking-Robot-Simulation.md" >}})|Medium||||38.4%|
-|0875|Koko Eating Bananas|[Go]({{< relref "/ChapterFour/0800~0899/0875.Koko-Eating-Bananas.md" >}})|Medium||||52.4%|
+|0864|Shortest Path to Get All Keys|[Go]({{< relref "/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md" >}})|Hard||||45.5%|
+|0867|Transpose Matrix|[Go]({{< relref "/ChapterFour/0800~0899/0867.Transpose-Matrix.md" >}})|Easy| O(n)| O(1)||64.1%|
+|0870|Advantage Shuffle|[Go]({{< relref "/ChapterFour/0800~0899/0870.Advantage-Shuffle.md" >}})|Medium||||51.8%|
+|0874|Walking Robot Simulation|[Go]({{< relref "/ChapterFour/0800~0899/0874.Walking-Robot-Simulation.md" >}})|Medium||||38.9%|
+|0875|Koko Eating Bananas|[Go]({{< relref "/ChapterFour/0800~0899/0875.Koko-Eating-Bananas.md" >}})|Medium||||52.3%|
|0877|Stone Game|[Go]({{< relref "/ChapterFour/0800~0899/0877.Stone-Game.md" >}})|Medium||||69.7%|
-|0881|Boats to Save People|[Go]({{< relref "/ChapterFour/0800~0899/0881.Boats-to-Save-People.md" >}})|Medium||||52.7%|
-|0885|Spiral Matrix III|[Go]({{< relref "/ChapterFour/0800~0899/0885.Spiral-Matrix-III.md" >}})|Medium||||73.1%|
-|0888|Fair Candy Swap|[Go]({{< relref "/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md" >}})|Easy||||60.5%|
-|0890|Find and Replace Pattern|[Go]({{< relref "/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern.md" >}})|Medium||||77.9%|
-|0891|Sum of Subsequence Widths|[Go]({{< relref "/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md" >}})|Hard| O(n log n)| O(1)||36.4%|
-|0892|Surface Area of 3D Shapes|[Go]({{< relref "/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes.md" >}})|Easy||||63.1%|
-|0896|Monotonic Array|[Go]({{< relref "/ChapterFour/0800~0899/0896.Monotonic-Array.md" >}})|Easy||||58.2%|
-|0898|Bitwise ORs of Subarrays|[Go]({{< relref "/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md" >}})|Medium||||36.8%|
-|0904|Fruit Into Baskets|[Go]({{< relref "/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md" >}})|Medium||||42.6%|
-|0907|Sum of Subarray Minimums|[Go]({{< relref "/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md" >}})|Medium| O(n)| O(n)|❤️|34.3%|
-|0909|Snakes and Ladders|[Go]({{< relref "/ChapterFour/0900~0999/0909.Snakes-and-Ladders.md" >}})|Medium||||40.9%|
-|0910|Smallest Range II|[Go]({{< relref "/ChapterFour/0900~0999/0910.Smallest-Range-II.md" >}})|Medium||||34.5%|
-|0911|Online Election|[Go]({{< relref "/ChapterFour/0900~0999/0911.Online-Election.md" >}})|Medium||||52.0%|
-|0914|X of a Kind in a Deck of Cards|[Go]({{< relref "/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md" >}})|Easy||||32.1%|
-|0916|Word Subsets|[Go]({{< relref "/ChapterFour/0900~0999/0916.Word-Subsets.md" >}})|Medium||||54.1%|
-|0918|Maximum Sum Circular Subarray|[Go]({{< relref "/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray.md" >}})|Medium||||38.1%|
+|0881|Boats to Save People|[Go]({{< relref "/ChapterFour/0800~0899/0881.Boats-to-Save-People.md" >}})|Medium||||53.1%|
+|0885|Spiral Matrix III|[Go]({{< relref "/ChapterFour/0800~0899/0885.Spiral-Matrix-III.md" >}})|Medium||||73.4%|
+|0888|Fair Candy Swap|[Go]({{< relref "/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md" >}})|Easy||||60.7%|
+|0890|Find and Replace Pattern|[Go]({{< relref "/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern.md" >}})|Medium||||77.6%|
+|0891|Sum of Subsequence Widths|[Go]({{< relref "/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md" >}})|Hard| O(n log n)| O(1)||36.6%|
+|0892|Surface Area of 3D Shapes|[Go]({{< relref "/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes.md" >}})|Easy||||64.0%|
+|0896|Monotonic Array|[Go]({{< relref "/ChapterFour/0800~0899/0896.Monotonic-Array.md" >}})|Easy||||58.4%|
+|0898|Bitwise ORs of Subarrays|[Go]({{< relref "/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md" >}})|Medium||||37.2%|
+|0904|Fruit Into Baskets|[Go]({{< relref "/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md" >}})|Medium||||43.7%|
+|0907|Sum of Subarray Minimums|[Go]({{< relref "/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md" >}})|Medium| O(n)| O(n)|❤️|35.8%|
+|0909|Snakes and Ladders|[Go]({{< relref "/ChapterFour/0900~0999/0909.Snakes-and-Ladders.md" >}})|Medium||||45.1%|
+|0910|Smallest Range II|[Go]({{< relref "/ChapterFour/0900~0999/0910.Smallest-Range-II.md" >}})|Medium||||35.1%|
+|0911|Online Election|[Go]({{< relref "/ChapterFour/0900~0999/0911.Online-Election.md" >}})|Medium||||52.2%|
+|0914|X of a Kind in a Deck of Cards|[Go]({{< relref "/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md" >}})|Easy||||31.3%|
+|0916|Word Subsets|[Go]({{< relref "/ChapterFour/0900~0999/0916.Word-Subsets.md" >}})|Medium||||53.7%|
+|0918|Maximum Sum Circular Subarray|[Go]({{< relref "/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray.md" >}})|Medium||||42.9%|
|0922|Sort Array By Parity II|[Go]({{< relref "/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II.md" >}})|Easy| O(n)| O(1)||70.7%|
-|0923|3Sum With Multiplicity|[Go]({{< relref "/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md" >}})|Medium||||45.4%|
+|0923|3Sum With Multiplicity|[Go]({{< relref "/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md" >}})|Medium||||45.3%|
|0924|Minimize Malware Spread|[Go]({{< relref "/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md" >}})|Hard||||42.1%|
-|0927|Three Equal Parts|[Go]({{< relref "/ChapterFour/0900~0999/0927.Three-Equal-Parts.md" >}})|Hard||||39.6%|
-|0928|Minimize Malware Spread II|[Go]({{< relref "/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md" >}})|Hard||||42.6%|
-|0930|Binary Subarrays With Sum|[Go]({{< relref "/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md" >}})|Medium||||50.9%|
-|0942|DI String Match|[Go]({{< relref "/ChapterFour/0900~0999/0942.DI-String-Match.md" >}})|Easy||||76.6%|
-|0946|Validate Stack Sequences|[Go]({{< relref "/ChapterFour/0900~0999/0946.Validate-Stack-Sequences.md" >}})|Medium||||67.6%|
-|0952|Largest Component Size by Common Factor|[Go]({{< relref "/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md" >}})|Hard||||40.4%|
-|0953|Verifying an Alien Dictionary|[Go]({{< relref "/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md" >}})|Easy||||52.7%|
-|0961|N-Repeated Element in Size 2N Array|[Go]({{< relref "/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md" >}})|Easy||||75.8%|
-|0966|Vowel Spellchecker|[Go]({{< relref "/ChapterFour/0900~0999/0966.Vowel-Spellchecker.md" >}})|Medium||||51.5%|
-|0969|Pancake Sorting|[Go]({{< relref "/ChapterFour/0900~0999/0969.Pancake-Sorting.md" >}})|Medium| O(n)| O(1)|❤️|70.0%|
-|0973|K Closest Points to Origin|[Go]({{< relref "/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md" >}})|Medium||||65.9%|
-|0976|Largest Perimeter Triangle|[Go]({{< relref "/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md" >}})|Easy||||54.7%|
+|0927|Three Equal Parts|[Go]({{< relref "/ChapterFour/0900~0999/0927.Three-Equal-Parts.md" >}})|Hard||||39.5%|
+|0928|Minimize Malware Spread II|[Go]({{< relref "/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md" >}})|Hard||||42.7%|
+|0930|Binary Subarrays With Sum|[Go]({{< relref "/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md" >}})|Medium||||52.0%|
+|0942|DI String Match|[Go]({{< relref "/ChapterFour/0900~0999/0942.DI-String-Match.md" >}})|Easy||||77.3%|
+|0946|Validate Stack Sequences|[Go]({{< relref "/ChapterFour/0900~0999/0946.Validate-Stack-Sequences.md" >}})|Medium||||67.7%|
+|0952|Largest Component Size by Common Factor|[Go]({{< relref "/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md" >}})|Hard||||40.1%|
+|0953|Verifying an Alien Dictionary|[Go]({{< relref "/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md" >}})|Easy||||54.5%|
+|0961|N-Repeated Element in Size 2N Array|[Go]({{< relref "/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md" >}})|Easy||||76.0%|
+|0966|Vowel Spellchecker|[Go]({{< relref "/ChapterFour/0900~0999/0966.Vowel-Spellchecker.md" >}})|Medium||||51.4%|
+|0969|Pancake Sorting|[Go]({{< relref "/ChapterFour/0900~0999/0969.Pancake-Sorting.md" >}})|Medium| O(n)| O(1)|❤️|70.1%|
+|0973|K Closest Points to Origin|[Go]({{< relref "/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md" >}})|Medium||||65.7%|
+|0976|Largest Perimeter Triangle|[Go]({{< relref "/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md" >}})|Easy||||54.6%|
|0977|Squares of a Sorted Array|[Go]({{< relref "/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array.md" >}})|Easy| O(n)| O(1)||71.9%|
-|0978|Longest Turbulent Subarray|[Go]({{< relref "/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md" >}})|Medium||||47.4%|
-|0980|Unique Paths III|[Go]({{< relref "/ChapterFour/0900~0999/0980.Unique-Paths-III.md" >}})|Hard||||79.6%|
-|0985|Sum of Even Numbers After Queries|[Go]({{< relref "/ChapterFour/0900~0999/0985.Sum-of-Even-Numbers-After-Queries.md" >}})|Medium||||68.3%|
-|0986|Interval List Intersections|[Go]({{< relref "/ChapterFour/0900~0999/0986.Interval-List-Intersections.md" >}})|Medium||||71.4%|
-|0989|Add to Array-Form of Integer|[Go]({{< relref "/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md" >}})|Easy||||45.5%|
-|0990|Satisfiability of Equality Equations|[Go]({{< relref "/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md" >}})|Medium||||50.7%|
-|0992|Subarrays with K Different Integers|[Go]({{< relref "/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md" >}})|Hard||||54.3%|
-|0995|Minimum Number of K Consecutive Bit Flips|[Go]({{< relref "/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md" >}})|Hard||||51.1%|
-|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard||||49.3%|
-|0997|Find the Town Judge|[Go]({{< relref "/ChapterFour/0900~0999/0997.Find-the-Town-Judge.md" >}})|Easy||||49.4%|
-|0999|Available Captures for Rook|[Go]({{< relref "/ChapterFour/0900~0999/0999.Available-Captures-for-Rook.md" >}})|Easy||||67.8%|
-|1002|Find Common Characters|[Go]({{< relref "/ChapterFour/1000~1099/1002.Find-Common-Characters.md" >}})|Easy||||68.3%|
-|1004|Max Consecutive Ones III|[Go]({{< relref "/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md" >}})|Medium||||63.5%|
-|1005|Maximize Sum Of Array After K Negations|[Go]({{< relref "/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations.md" >}})|Easy||||51.1%|
-|1010|Pairs of Songs With Total Durations Divisible by 60|[Go]({{< relref "/ChapterFour/1000~1099/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60.md" >}})|Medium||||53.0%|
-|1011|Capacity To Ship Packages Within D Days|[Go]({{< relref "/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md" >}})|Medium||||64.5%|
-|1018|Binary Prefix Divisible By 5|[Go]({{< relref "/ChapterFour/1000~1099/1018.Binary-Prefix-Divisible-By-5.md" >}})|Easy||||47.4%|
-|1019|Next Greater Node In Linked List|[Go]({{< relref "/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md" >}})|Medium||||59.8%|
-|1020|Number of Enclaves|[Go]({{< relref "/ChapterFour/1000~1099/1020.Number-of-Enclaves.md" >}})|Medium||||64.8%|
-|1030|Matrix Cells in Distance Order|[Go]({{< relref "/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md" >}})|Easy||||69.3%|
-|1034|Coloring A Border|[Go]({{< relref "/ChapterFour/1000~1099/1034.Coloring-A-Border.md" >}})|Medium||||48.9%|
-|1037|Valid Boomerang|[Go]({{< relref "/ChapterFour/1000~1099/1037.Valid-Boomerang.md" >}})|Easy||||37.5%|
-|1040|Moving Stones Until Consecutive II|[Go]({{< relref "/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md" >}})|Medium||||55.6%|
+|0978|Longest Turbulent Subarray|[Go]({{< relref "/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md" >}})|Medium||||47.2%|
+|0980|Unique Paths III|[Go]({{< relref "/ChapterFour/0900~0999/0980.Unique-Paths-III.md" >}})|Hard||||81.9%|
+|0985|Sum of Even Numbers After Queries|[Go]({{< relref "/ChapterFour/0900~0999/0985.Sum-of-Even-Numbers-After-Queries.md" >}})|Medium||||68.2%|
+|0986|Interval List Intersections|[Go]({{< relref "/ChapterFour/0900~0999/0986.Interval-List-Intersections.md" >}})|Medium||||71.3%|
+|0989|Add to Array-Form of Integer|[Go]({{< relref "/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md" >}})|Easy||||47.1%|
+|0990|Satisfiability of Equality Equations|[Go]({{< relref "/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md" >}})|Medium||||50.5%|
+|0992|Subarrays with K Different Integers|[Go]({{< relref "/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md" >}})|Hard||||54.7%|
+|0995|Minimum Number of K Consecutive Bit Flips|[Go]({{< relref "/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md" >}})|Hard||||51.2%|
+|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard||||49.2%|
+|0997|Find the Town Judge|[Go]({{< relref "/ChapterFour/0900~0999/0997.Find-the-Town-Judge.md" >}})|Easy||||49.6%|
+|0999|Available Captures for Rook|[Go]({{< relref "/ChapterFour/0900~0999/0999.Available-Captures-for-Rook.md" >}})|Easy||||68.1%|
+|1002|Find Common Characters|[Go]({{< relref "/ChapterFour/1000~1099/1002.Find-Common-Characters.md" >}})|Easy||||68.5%|
+|1004|Max Consecutive Ones III|[Go]({{< relref "/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md" >}})|Medium||||63.2%|
+|1005|Maximize Sum Of Array After K Negations|[Go]({{< relref "/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations.md" >}})|Easy||||50.9%|
+|1010|Pairs of Songs With Total Durations Divisible by 60|[Go]({{< relref "/ChapterFour/1000~1099/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60.md" >}})|Medium||||52.8%|
+|1011|Capacity To Ship Packages Within D Days|[Go]({{< relref "/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md" >}})|Medium||||67.7%|
+|1018|Binary Prefix Divisible By 5|[Go]({{< relref "/ChapterFour/1000~1099/1018.Binary-Prefix-Divisible-By-5.md" >}})|Easy||||46.9%|
+|1019|Next Greater Node In Linked List|[Go]({{< relref "/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md" >}})|Medium||||59.9%|
+|1020|Number of Enclaves|[Go]({{< relref "/ChapterFour/1000~1099/1020.Number-of-Enclaves.md" >}})|Medium||||65.5%|
+|1030|Matrix Cells in Distance Order|[Go]({{< relref "/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md" >}})|Easy||||69.6%|
+|1034|Coloring A Border|[Go]({{< relref "/ChapterFour/1000~1099/1034.Coloring-A-Border.md" >}})|Medium||||49.2%|
+|1037|Valid Boomerang|[Go]({{< relref "/ChapterFour/1000~1099/1037.Valid-Boomerang.md" >}})|Easy||||37.1%|
+|1040|Moving Stones Until Consecutive II|[Go]({{< relref "/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md" >}})|Medium||||55.8%|
|1048|Longest String Chain|[Go]({{< relref "/ChapterFour/1000~1099/1048.Longest-String-Chain.md" >}})|Medium||||59.2%|
-|1049|Last Stone Weight II|[Go]({{< relref "/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md" >}})|Medium||||52.4%|
-|1051|Height Checker|[Go]({{< relref "/ChapterFour/1000~1099/1051.Height-Checker.md" >}})|Easy||||75.0%|
-|1052|Grumpy Bookstore Owner|[Go]({{< relref "/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner.md" >}})|Medium||||57.0%|
-|1054|Distant Barcodes|[Go]({{< relref "/ChapterFour/1000~1099/1054.Distant-Barcodes.md" >}})|Medium||||45.7%|
+|1049|Last Stone Weight II|[Go]({{< relref "/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md" >}})|Medium||||53.1%|
+|1051|Height Checker|[Go]({{< relref "/ChapterFour/1000~1099/1051.Height-Checker.md" >}})|Easy||||75.5%|
+|1052|Grumpy Bookstore Owner|[Go]({{< relref "/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner.md" >}})|Medium||||57.1%|
+|1054|Distant Barcodes|[Go]({{< relref "/ChapterFour/1000~1099/1054.Distant-Barcodes.md" >}})|Medium||||45.8%|
|1073|Adding Two Negabinary Numbers|[Go]({{< relref "/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md" >}})|Medium||||36.4%|
-|1074|Number of Submatrices That Sum to Target|[Go]({{< relref "/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md" >}})|Hard||||69.8%|
+|1074|Number of Submatrices That Sum to Target|[Go]({{< relref "/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md" >}})|Hard||||69.7%|
|1089|Duplicate Zeros|[Go]({{< relref "/ChapterFour/1000~1099/1089.Duplicate-Zeros.md" >}})|Easy||||51.5%|
-|1091|Shortest Path in Binary Matrix|[Go]({{< relref "/ChapterFour/1000~1099/1091.Shortest-Path-in-Binary-Matrix.md" >}})|Medium||||44.5%|
-|1105|Filling Bookcase Shelves|[Go]({{< relref "/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md" >}})|Medium||||59.0%|
-|1122|Relative Sort Array|[Go]({{< relref "/ChapterFour/1100~1199/1122.Relative-Sort-Array.md" >}})|Easy||||68.4%|
-|1128|Number of Equivalent Domino Pairs|[Go]({{< relref "/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md" >}})|Easy||||46.9%|
-|1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard||||42.0%|
-|1160|Find Words That Can Be Formed by Characters|[Go]({{< relref "/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md" >}})|Easy||||67.8%|
-|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||61.3%|
-|1178|Number of Valid Words for Each Puzzle|[Go]({{< relref "/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md" >}})|Hard||||46.6%|
-|1184|Distance Between Bus Stops|[Go]({{< relref "/ChapterFour/1100~1199/1184.Distance-Between-Bus-Stops.md" >}})|Easy||||54.1%|
-|1200|Minimum Absolute Difference|[Go]({{< relref "/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference.md" >}})|Easy||||69.8%|
-|1207|Unique Number of Occurrences|[Go]({{< relref "/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md" >}})|Easy||||70.9%|
-|1217|Minimum Cost to Move Chips to The Same Position|[Go]({{< relref "/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md" >}})|Easy||||72.2%|
-|1232|Check If It Is a Straight Line|[Go]({{< relref "/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line.md" >}})|Easy||||41.2%|
-|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||51.1%|
+|1091|Shortest Path in Binary Matrix|[Go]({{< relref "/ChapterFour/1000~1099/1091.Shortest-Path-in-Binary-Matrix.md" >}})|Medium||||44.6%|
+|1093|Statistics from a Large Sample|[Go]({{< relref "/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md" >}})|Medium||||43.6%|
+|1105|Filling Bookcase Shelves|[Go]({{< relref "/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md" >}})|Medium||||59.3%|
+|1122|Relative Sort Array|[Go]({{< relref "/ChapterFour/1100~1199/1122.Relative-Sort-Array.md" >}})|Easy||||68.6%|
+|1128|Number of Equivalent Domino Pairs|[Go]({{< relref "/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md" >}})|Easy||||47.1%|
+|1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard||||41.7%|
+|1160|Find Words That Can Be Formed by Characters|[Go]({{< relref "/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md" >}})|Easy||||67.5%|
+|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||61.5%|
+|1178|Number of Valid Words for Each Puzzle|[Go]({{< relref "/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md" >}})|Hard||||46.3%|
+|1184|Distance Between Bus Stops|[Go]({{< relref "/ChapterFour/1100~1199/1184.Distance-Between-Bus-Stops.md" >}})|Easy||||54.0%|
+|1200|Minimum Absolute Difference|[Go]({{< relref "/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference.md" >}})|Easy||||69.6%|
+|1207|Unique Number of Occurrences|[Go]({{< relref "/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md" >}})|Easy||||73.5%|
+|1217|Minimum Cost to Move Chips to The Same Position|[Go]({{< relref "/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md" >}})|Easy||||71.9%|
+|1232|Check If It Is a Straight Line|[Go]({{< relref "/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line.md" >}})|Easy||||40.4%|
+|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||53.4%|
|1239|Maximum Length of a Concatenated String with Unique Characters|[Go]({{< relref "/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md" >}})|Medium||||52.2%|
-|1252|Cells with Odd Values in a Matrix|[Go]({{< relref "/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix.md" >}})|Easy||||78.6%|
-|1254|Number of Closed Islands|[Go]({{< relref "/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md" >}})|Medium||||64.2%|
-|1260|Shift 2D Grid|[Go]({{< relref "/ChapterFour/1200~1299/1260.Shift-2D-Grid.md" >}})|Easy||||68.0%|
+|1252|Cells with Odd Values in a Matrix|[Go]({{< relref "/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix.md" >}})|Easy||||78.5%|
+|1254|Number of Closed Islands|[Go]({{< relref "/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md" >}})|Medium||||64.1%|
+|1260|Shift 2D Grid|[Go]({{< relref "/ChapterFour/1200~1299/1260.Shift-2D-Grid.md" >}})|Easy||||67.8%|
|1266|Minimum Time Visiting All Points|[Go]({{< relref "/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points.md" >}})|Easy||||79.1%|
-|1268|Search Suggestions System|[Go]({{< relref "/ChapterFour/1200~1299/1268.Search-Suggestions-System.md" >}})|Medium||||66.6%|
-|1275|Find Winner on a Tic Tac Toe Game|[Go]({{< relref "/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md" >}})|Easy||||54.3%|
-|1283|Find the Smallest Divisor Given a Threshold|[Go]({{< relref "/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md" >}})|Medium||||55.3%|
-|1287|Element Appearing More Than 25% In Sorted Array|[Go]({{< relref "/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md" >}})|Easy||||59.6%|
-|1293|Shortest Path in a Grid with Obstacles Elimination|[Go]({{< relref "/ChapterFour/1200~1299/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination.md" >}})|Hard||||43.6%|
-|1295|Find Numbers with Even Number of Digits|[Go]({{< relref "/ChapterFour/1200~1299/1295.Find-Numbers-with-Even-Number-of-Digits.md" >}})|Easy||||76.9%|
-|1296|Divide Array in Sets of K Consecutive Numbers|[Go]({{< relref "/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.md" >}})|Medium||||56.6%|
-|1299|Replace Elements with Greatest Element on Right Side|[Go]({{< relref "/ChapterFour/1200~1299/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md" >}})|Easy||||74.7%|
-|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||43.1%|
-|1304|Find N Unique Integers Sum up to Zero|[Go]({{< relref "/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md" >}})|Easy||||77.1%|
-|1306|Jump Game III|[Go]({{< relref "/ChapterFour/1300~1399/1306.Jump-Game-III.md" >}})|Medium||||63.0%|
-|1310|XOR Queries of a Subarray|[Go]({{< relref "/ChapterFour/1300~1399/1310.XOR-Queries-of-a-Subarray.md" >}})|Medium||||72.2%|
-|1313|Decompress Run-Length Encoded List|[Go]({{< relref "/ChapterFour/1300~1399/1313.Decompress-Run-Length-Encoded-List.md" >}})|Easy||||85.9%|
-|1329|Sort the Matrix Diagonally|[Go]({{< relref "/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md" >}})|Medium||||83.6%|
-|1337|The K Weakest Rows in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md" >}})|Easy||||73.0%|
-|1353|Maximum Number of Events That Can Be Attended|[Go]({{< relref "/ChapterFour/1300~1399/1353.Maximum-Number-of-Events-That-Can-Be-Attended.md" >}})|Medium||||32.9%|
-|1380|Lucky Numbers in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix.md" >}})|Easy||||70.5%|
-|1383|Maximum Performance of a Team|[Go]({{< relref "/ChapterFour/1300~1399/1383.Maximum-Performance-of-a-Team.md" >}})|Hard||||48.9%|
-|1385|Find the Distance Value Between Two Arrays|[Go]({{< relref "/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md" >}})|Easy||||65.4%|
-|1389|Create Target Array in the Given Order|[Go]({{< relref "/ChapterFour/1300~1399/1389.Create-Target-Array-in-the-Given-Order.md" >}})|Easy||||85.9%|
+|1268|Search Suggestions System|[Go]({{< relref "/ChapterFour/1200~1299/1268.Search-Suggestions-System.md" >}})|Medium||||66.3%|
+|1275|Find Winner on a Tic Tac Toe Game|[Go]({{< relref "/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md" >}})|Easy||||54.2%|
+|1283|Find the Smallest Divisor Given a Threshold|[Go]({{< relref "/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md" >}})|Medium||||56.0%|
+|1287|Element Appearing More Than 25% In Sorted Array|[Go]({{< relref "/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md" >}})|Easy||||59.5%|
+|1293|Shortest Path in a Grid with Obstacles Elimination|[Go]({{< relref "/ChapterFour/1200~1299/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination.md" >}})|Hard||||45.4%|
+|1295|Find Numbers with Even Number of Digits|[Go]({{< relref "/ChapterFour/1200~1299/1295.Find-Numbers-with-Even-Number-of-Digits.md" >}})|Easy||||77.0%|
+|1296|Divide Array in Sets of K Consecutive Numbers|[Go]({{< relref "/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.md" >}})|Medium||||56.5%|
+|1299|Replace Elements with Greatest Element on Right Side|[Go]({{< relref "/ChapterFour/1200~1299/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md" >}})|Easy||||73.5%|
+|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||43.6%|
+|1304|Find N Unique Integers Sum up to Zero|[Go]({{< relref "/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md" >}})|Easy||||77.0%|
+|1306|Jump Game III|[Go]({{< relref "/ChapterFour/1300~1399/1306.Jump-Game-III.md" >}})|Medium||||63.5%|
+|1310|XOR Queries of a Subarray|[Go]({{< relref "/ChapterFour/1300~1399/1310.XOR-Queries-of-a-Subarray.md" >}})|Medium||||72.3%|
+|1313|Decompress Run-Length Encoded List|[Go]({{< relref "/ChapterFour/1300~1399/1313.Decompress-Run-Length-Encoded-List.md" >}})|Easy||||85.8%|
+|1329|Sort the Matrix Diagonally|[Go]({{< relref "/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md" >}})|Medium||||83.4%|
+|1337|The K Weakest Rows in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md" >}})|Easy||||72.1%|
+|1353|Maximum Number of Events That Can Be Attended|[Go]({{< relref "/ChapterFour/1300~1399/1353.Maximum-Number-of-Events-That-Can-Be-Attended.md" >}})|Medium||||32.6%|
+|1380|Lucky Numbers in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix.md" >}})|Easy||||70.6%|
+|1383|Maximum Performance of a Team|[Go]({{< relref "/ChapterFour/1300~1399/1383.Maximum-Performance-of-a-Team.md" >}})|Hard||||48.5%|
+|1385|Find the Distance Value Between Two Arrays|[Go]({{< relref "/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md" >}})|Easy||||66.4%|
+|1389|Create Target Array in the Given Order|[Go]({{< relref "/ChapterFour/1300~1399/1389.Create-Target-Array-in-the-Given-Order.md" >}})|Easy||||85.8%|
|1423|Maximum Points You Can Obtain from Cards|[Go]({{< relref "/ChapterFour/1400~1499/1423.Maximum-Points-You-Can-Obtain-from-Cards.md" >}})|Medium||||52.3%|
-|1437|Check If All 1's Are at Least Length K Places Away|[Go]({{< relref "/ChapterFour/1400~1499/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md" >}})|Easy||||59.2%|
-|1438|Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit|[Go]({{< relref "/ChapterFour/1400~1499/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit.md" >}})|Medium||||48.0%|
+|1437|Check If All 1's Are at Least Length K Places Away|[Go]({{< relref "/ChapterFour/1400~1499/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md" >}})|Easy||||58.8%|
+|1438|Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit|[Go]({{< relref "/ChapterFour/1400~1499/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit.md" >}})|Medium||||48.3%|
|1439|Find the Kth Smallest Sum of a Matrix With Sorted Rows|[Go]({{< relref "/ChapterFour/1400~1499/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows.md" >}})|Hard||||61.4%|
-|1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go]({{< relref "/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md" >}})|Medium||||75.6%|
-|1463|Cherry Pickup II|[Go]({{< relref "/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md" >}})|Hard||||70.2%|
-|1464|Maximum Product of Two Elements in an Array|[Go]({{< relref "/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md" >}})|Easy||||79.3%|
-|1465|Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts|[Go]({{< relref "/ChapterFour/1400~1499/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts.md" >}})|Medium||||40.8%|
-|1470|Shuffle the Array|[Go]({{< relref "/ChapterFour/1400~1499/1470.Shuffle-the-Array.md" >}})|Easy||||88.6%|
-|1480|Running Sum of 1d Array|[Go]({{< relref "/ChapterFour/1400~1499/1480.Running-Sum-of-1d-Array.md" >}})|Easy||||89.7%|
-|1482|Minimum Number of Days to Make m Bouquets|[Go]({{< relref "/ChapterFour/1400~1499/1482.Minimum-Number-of-Days-to-Make-m-Bouquets.md" >}})|Medium||||56.5%|
+|1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go]({{< relref "/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md" >}})|Medium||||76.0%|
+|1463|Cherry Pickup II|[Go]({{< relref "/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md" >}})|Hard||||69.7%|
+|1464|Maximum Product of Two Elements in an Array|[Go]({{< relref "/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md" >}})|Easy||||79.9%|
+|1465|Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts|[Go]({{< relref "/ChapterFour/1400~1499/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts.md" >}})|Medium||||40.9%|
+|1470|Shuffle the Array|[Go]({{< relref "/ChapterFour/1400~1499/1470.Shuffle-the-Array.md" >}})|Easy||||89.0%|
+|1480|Running Sum of 1d Array|[Go]({{< relref "/ChapterFour/1400~1499/1480.Running-Sum-of-1d-Array.md" >}})|Easy||||87.7%|
+|1482|Minimum Number of Days to Make m Bouquets|[Go]({{< relref "/ChapterFour/1400~1499/1482.Minimum-Number-of-Days-to-Make-m-Bouquets.md" >}})|Medium||||54.2%|
|1512|Number of Good Pairs|[Go]({{< relref "/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md" >}})|Easy||||88.2%|
-|1539|Kth Missing Positive Number|[Go]({{< relref "/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md" >}})|Easy||||55.9%|
-|1572|Matrix Diagonal Sum|[Go]({{< relref "/ChapterFour/1500~1599/1572.Matrix-Diagonal-Sum.md" >}})|Easy||||79.7%|
-|1608|Special Array With X Elements Greater Than or Equal X|[Go]({{< relref "/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md" >}})|Easy||||60.0%|
-|1619|Mean of Array After Removing Some Elements|[Go]({{< relref "/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements.md" >}})|Easy||||64.6%|
-|1629|Slowest Key|[Go]({{< relref "/ChapterFour/1600~1699/1629.Slowest-Key.md" >}})|Easy||||59.4%|
-|1631|Path With Minimum Effort|[Go]({{< relref "/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md" >}})|Medium||||55.3%|
-|1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||68.6%|
-|1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||56.1%|
+|1539|Kth Missing Positive Number|[Go]({{< relref "/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md" >}})|Easy||||58.5%|
+|1572|Matrix Diagonal Sum|[Go]({{< relref "/ChapterFour/1500~1599/1572.Matrix-Diagonal-Sum.md" >}})|Easy||||80.2%|
+|1608|Special Array With X Elements Greater Than or Equal X|[Go]({{< relref "/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md" >}})|Easy||||60.4%|
+|1619|Mean of Array After Removing Some Elements|[Go]({{< relref "/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements.md" >}})|Easy||||65.6%|
+|1629|Slowest Key|[Go]({{< relref "/ChapterFour/1600~1699/1629.Slowest-Key.md" >}})|Easy||||59.2%|
+|1631|Path With Minimum Effort|[Go]({{< relref "/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md" >}})|Medium||||55.6%|
+|1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||69.5%|
+|1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||56.2%|
|1642|Furthest Building You Can Reach|[Go]({{< relref "/ChapterFour/1600~1699/1642.Furthest-Building-You-Can-Reach.md" >}})|Medium||||48.3%|
|1646|Get Maximum in Generated Array|[Go]({{< relref "/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md" >}})|Easy||||50.2%|
-|1648|Sell Diminishing-Valued Colored Balls|[Go]({{< relref "/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}})|Medium||||30.5%|
-|1649|Create Sorted Array through Instructions|[Go]({{< relref "/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md" >}})|Hard||||37.2%|
-|1652|Defuse the Bomb|[Go]({{< relref "/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md" >}})|Easy||||61.1%|
-|1654|Minimum Jumps to Reach Home|[Go]({{< relref "/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md" >}})|Medium||||28.6%|
-|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||39.6%|
-|1656|Design an Ordered Stream|[Go]({{< relref "/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md" >}})|Easy||||85.4%|
+|1648|Sell Diminishing-Valued Colored Balls|[Go]({{< relref "/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}})|Medium||||30.4%|
+|1649|Create Sorted Array through Instructions|[Go]({{< relref "/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md" >}})|Hard||||37.3%|
+|1652|Defuse the Bomb|[Go]({{< relref "/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md" >}})|Easy||||62.2%|
+|1654|Minimum Jumps to Reach Home|[Go]({{< relref "/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md" >}})|Medium||||29.0%|
+|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||38.9%|
+|1656|Design an Ordered Stream|[Go]({{< relref "/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md" >}})|Easy||||85.3%|
|1658|Minimum Operations to Reduce X to Zero|[Go]({{< relref "/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md" >}})|Medium||||37.6%|
-|1662|Check If Two String Arrays are Equivalent|[Go]({{< relref "/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent.md" >}})|Easy||||83.2%|
+|1662|Check If Two String Arrays are Equivalent|[Go]({{< relref "/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent.md" >}})|Easy||||83.4%|
|1664|Ways to Make a Fair Array|[Go]({{< relref "/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md" >}})|Medium||||63.5%|
-|1665|Minimum Initial Energy to Finish Tasks|[Go]({{< relref "/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks.md" >}})|Hard||||56.2%|
-|1670|Design Front Middle Back Queue|[Go]({{< relref "/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md" >}})|Medium||||56.4%|
-|1672|Richest Customer Wealth|[Go]({{< relref "/ChapterFour/1600~1699/1672.Richest-Customer-Wealth.md" >}})|Easy||||88.4%|
+|1665|Minimum Initial Energy to Finish Tasks|[Go]({{< relref "/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks.md" >}})|Hard||||56.3%|
+|1670|Design Front Middle Back Queue|[Go]({{< relref "/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md" >}})|Medium||||57.3%|
+|1672|Richest Customer Wealth|[Go]({{< relref "/ChapterFour/1600~1699/1672.Richest-Customer-Wealth.md" >}})|Easy||||87.9%|
|1673|Find the Most Competitive Subsequence|[Go]({{< relref "/ChapterFour/1600~1699/1673.Find-the-Most-Competitive-Subsequence.md" >}})|Medium||||49.3%|
-|1674|Minimum Moves to Make Array Complementary|[Go]({{< relref "/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary.md" >}})|Medium||||38.5%|
-|1675|Minimize Deviation in Array|[Go]({{< relref "/ChapterFour/1600~1699/1675.Minimize-Deviation-in-Array.md" >}})|Hard||||52.1%|
-|1679|Max Number of K-Sum Pairs|[Go]({{< relref "/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md" >}})|Medium||||57.4%|
+|1674|Minimum Moves to Make Array Complementary|[Go]({{< relref "/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary.md" >}})|Medium||||38.6%|
+|1675|Minimize Deviation in Array|[Go]({{< relref "/ChapterFour/1600~1699/1675.Minimize-Deviation-in-Array.md" >}})|Hard||||54.7%|
+|1679|Max Number of K-Sum Pairs|[Go]({{< relref "/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md" >}})|Medium||||57.3%|
|1681|Minimum Incompatibility|[Go]({{< relref "/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md" >}})|Hard||||37.4%|
-|1684|Count the Number of Consistent Strings|[Go]({{< relref "/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md" >}})|Easy||||81.8%|
-|1685|Sum of Absolute Differences in a Sorted Array|[Go]({{< relref "/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md" >}})|Medium||||65.2%|
-|1690|Stone Game VII|[Go]({{< relref "/ChapterFour/1600~1699/1690.Stone-Game-VII.md" >}})|Medium||||58.7%|
-|1691|Maximum Height by Stacking Cuboids|[Go]({{< relref "/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids.md" >}})|Hard||||54.2%|
-|1695|Maximum Erasure Value|[Go]({{< relref "/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md" >}})|Medium||||57.7%|
-|1696|Jump Game VI|[Go]({{< relref "/ChapterFour/1600~1699/1696.Jump-Game-VI.md" >}})|Medium||||46.3%|
-|1700|Number of Students Unable to Eat Lunch|[Go]({{< relref "/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md" >}})|Easy||||67.8%|
-|1705|Maximum Number of Eaten Apples|[Go]({{< relref "/ChapterFour/1700~1799/1705.Maximum-Number-of-Eaten-Apples.md" >}})|Medium||||37.9%|
-|1710|Maximum Units on a Truck|[Go]({{< relref "/ChapterFour/1700~1799/1710.Maximum-Units-on-a-Truck.md" >}})|Easy||||74.0%|
-|1720|Decode XORed Array|[Go]({{< relref "/ChapterFour/1700~1799/1720.Decode-XORed-Array.md" >}})|Easy||||86.0%|
-|1725|Number Of Rectangles That Can Form The Largest Square|[Go]({{< relref "/ChapterFour/1700~1799/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square.md" >}})|Easy||||78.7%|
-|1732|Find the Highest Altitude|[Go]({{< relref "/ChapterFour/1700~1799/1732.Find-the-Highest-Altitude.md" >}})|Easy||||78.7%|
-|1734|Decode XORed Permutation|[Go]({{< relref "/ChapterFour/1700~1799/1734.Decode-XORed-Permutation.md" >}})|Medium||||62.3%|
-|1738|Find Kth Largest XOR Coordinate Value|[Go]({{< relref "/ChapterFour/1700~1799/1738.Find-Kth-Largest-XOR-Coordinate-Value.md" >}})|Medium||||61.5%|
-|1744|Can You Eat Your Favorite Candy on Your Favorite Day?|[Go]({{< relref "/ChapterFour/1700~1799/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day.md" >}})|Medium||||32.8%|
-|1748|Sum of Unique Elements|[Go]({{< relref "/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md" >}})|Easy||||75.6%|
-|1752|Check if Array Is Sorted and Rotated|[Go]({{< relref "/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated.md" >}})|Easy||||49.2%|
-|1816|Truncate Sentence|[Go]({{< relref "/ChapterFour/1800~1899/1816.Truncate-Sentence.md" >}})|Easy||||81.9%|
-|1818|Minimum Absolute Sum Difference|[Go]({{< relref "/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference.md" >}})|Medium||||30.1%|
-|1846|Maximum Element After Decreasing and Rearranging|[Go]({{< relref "/ChapterFour/1800~1899/1846.Maximum-Element-After-Decreasing-and-Rearranging.md" >}})|Medium||||59.0%|
-|1877|Minimize Maximum Pair Sum in Array|[Go]({{< relref "/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array.md" >}})|Medium||||80.3%|
-|1984|Minimum Difference Between Highest and Lowest of K Scores|[Go]({{< relref "/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md" >}})|Easy||||53.5%|
-|2021|Brightest Position on Street|[Go]({{< relref "/ChapterFour/2000~2099/2021.Brightest-Position-on-Street.md" >}})|Medium||||63.0%|
-|2022|Convert 1D Array Into 2D Array|[Go]({{< relref "/ChapterFour/2000~2099/2022.Convert-1D-Array-Into-2D-Array.md" >}})|Easy||||58.4%|
-|2037|Minimum Number of Moves to Seat Everyone|[Go]({{< relref "/ChapterFour/2000~2099/2037.Minimum-Number-of-Moves-to-Seat-Everyone.md" >}})|Easy||||82.1%|
-|2043|Simple Bank System|[Go]({{< relref "/ChapterFour/2000~2099/2043.Simple-Bank-System.md" >}})|Medium||||65.9%|
-|2164|Sort Even and Odd Indices Independently|[Go]({{< relref "/ChapterFour/2100~2199/2164.Sort-Even-and-Odd-Indices-Independently.md" >}})|Easy||||66.6%|
-|2166|Design Bitset|[Go]({{< relref "/ChapterFour/2100~2199/2166.Design-Bitset.md" >}})|Medium||||31.3%|
+|1684|Count the Number of Consistent Strings|[Go]({{< relref "/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md" >}})|Easy||||82.2%|
+|1685|Sum of Absolute Differences in a Sorted Array|[Go]({{< relref "/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md" >}})|Medium||||63.8%|
+|1690|Stone Game VII|[Go]({{< relref "/ChapterFour/1600~1699/1690.Stone-Game-VII.md" >}})|Medium||||58.2%|
+|1691|Maximum Height by Stacking Cuboids|[Go]({{< relref "/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids.md" >}})|Hard||||54.4%|
+|1695|Maximum Erasure Value|[Go]({{< relref "/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md" >}})|Medium||||57.6%|
+|1696|Jump Game VI|[Go]({{< relref "/ChapterFour/1600~1699/1696.Jump-Game-VI.md" >}})|Medium||||46.1%|
+|1700|Number of Students Unable to Eat Lunch|[Go]({{< relref "/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md" >}})|Easy||||68.6%|
+|1705|Maximum Number of Eaten Apples|[Go]({{< relref "/ChapterFour/1700~1799/1705.Maximum-Number-of-Eaten-Apples.md" >}})|Medium||||38.0%|
+|1710|Maximum Units on a Truck|[Go]({{< relref "/ChapterFour/1700~1799/1710.Maximum-Units-on-a-Truck.md" >}})|Easy||||73.8%|
+|1720|Decode XORed Array|[Go]({{< relref "/ChapterFour/1700~1799/1720.Decode-XORed-Array.md" >}})|Easy||||85.8%|
+|1725|Number Of Rectangles That Can Form The Largest Square|[Go]({{< relref "/ChapterFour/1700~1799/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square.md" >}})|Easy||||78.6%|
+|1732|Find the Highest Altitude|[Go]({{< relref "/ChapterFour/1700~1799/1732.Find-the-Highest-Altitude.md" >}})|Easy||||78.8%|
+|1734|Decode XORed Permutation|[Go]({{< relref "/ChapterFour/1700~1799/1734.Decode-XORed-Permutation.md" >}})|Medium||||63.0%|
+|1738|Find Kth Largest XOR Coordinate Value|[Go]({{< relref "/ChapterFour/1700~1799/1738.Find-Kth-Largest-XOR-Coordinate-Value.md" >}})|Medium||||61.0%|
+|1744|Can You Eat Your Favorite Candy on Your Favorite Day?|[Go]({{< relref "/ChapterFour/1700~1799/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day.md" >}})|Medium||||33.0%|
+|1748|Sum of Unique Elements|[Go]({{< relref "/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md" >}})|Easy||||76.2%|
+|1752|Check if Array Is Sorted and Rotated|[Go]({{< relref "/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated.md" >}})|Easy||||50.0%|
+|1816|Truncate Sentence|[Go]({{< relref "/ChapterFour/1800~1899/1816.Truncate-Sentence.md" >}})|Easy||||82.9%|
+|1818|Minimum Absolute Sum Difference|[Go]({{< relref "/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference.md" >}})|Medium||||30.3%|
+|1846|Maximum Element After Decreasing and Rearranging|[Go]({{< relref "/ChapterFour/1800~1899/1846.Maximum-Element-After-Decreasing-and-Rearranging.md" >}})|Medium||||58.9%|
+|1877|Minimize Maximum Pair Sum in Array|[Go]({{< relref "/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array.md" >}})|Medium||||79.9%|
+|1984|Minimum Difference Between Highest and Lowest of K Scores|[Go]({{< relref "/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md" >}})|Easy||||54.4%|
+|2021|Brightest Position on Street|[Go]({{< relref "/ChapterFour/2000~2099/2021.Brightest-Position-on-Street.md" >}})|Medium||||62.3%|
+|2022|Convert 1D Array Into 2D Array|[Go]({{< relref "/ChapterFour/2000~2099/2022.Convert-1D-Array-Into-2D-Array.md" >}})|Easy||||59.0%|
+|2037|Minimum Number of Moves to Seat Everyone|[Go]({{< relref "/ChapterFour/2000~2099/2037.Minimum-Number-of-Moves-to-Seat-Everyone.md" >}})|Easy||||82.0%|
+|2043|Simple Bank System|[Go]({{< relref "/ChapterFour/2000~2099/2043.Simple-Bank-System.md" >}})|Medium||||65.3%|
+|2164|Sort Even and Odd Indices Independently|[Go]({{< relref "/ChapterFour/2100~2199/2164.Sort-Even-and-Odd-Indices-Independently.md" >}})|Easy||||65.1%|
+|2166|Design Bitset|[Go]({{< relref "/ChapterFour/2100~2199/2166.Design-Bitset.md" >}})|Medium||||31.7%|
|2170|Minimum Operations to Make the Array Alternating|[Go]({{< relref "/ChapterFour/2100~2199/2170.Minimum-Operations-to-Make-the-Array-Alternating.md" >}})|Medium||||33.2%|
|2171|Removing Minimum Number of Magic Beans|[Go]({{< relref "/ChapterFour/2100~2199/2171.Removing-Minimum-Number-of-Magic-Beans.md" >}})|Medium||||42.0%|
-|2183|Count Array Pairs Divisible by K|[Go]({{< relref "/ChapterFour/2100~2199/2183.Count-Array-Pairs-Divisible-by-K.md" >}})|Hard||||28.3%|
+|2183|Count Array Pairs Divisible by K|[Go]({{< relref "/ChapterFour/2100~2199/2183.Count-Array-Pairs-Divisible-by-K.md" >}})|Hard||||28.4%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+r of Magic Beans|[Go]({{< relref "/ChapterFour/2100~2199/2171.Removing-Minimum-Number-of-Magic-Beans.md" >}})|Medium||||42.0%|
+|2183|Count Array Pairs Divisible by K|[Go]({{< relref "/ChapterFour/2100~2199/2183.Count-Array-Pairs-Divisible-by-K.md" >}})|Hard||||28.4%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+rost.com/leetcode/ChapterTwo/String/">下一页➡️
+
----------------------------------------------
diff --git a/website/content/ChapterTwo/Backtracking.md b/website/content/ChapterTwo/Backtracking.md
index fa9376e58..088597e4a 100644
--- a/website/content/ChapterTwo/Backtracking.md
+++ b/website/content/ChapterTwo/Backtracking.md
@@ -8,16 +8,16 @@ weight: 8
-- 排列问题 Permutations。第 46 题，第 47 题。第 60 题，第 526 题，第 996 题。
-- 组合问题 Combination。第 39 题，第 40 题，第 77 题，第 216 题。
-- 排列和组合杂交问题。第 1079 题。
-- N 皇后终极解法(二进制解法)。第 51 题，第 52 题。
-- 数独问题。第 37 题。
-- 四个方向搜索。第 79 题，第 212 题，第 980 题。
-- 子集合问题。第 78 题，第 90 题。
-- Trie。第 208 题，第 211 题。
-- BFS 优化。第 126 题，第 127 题。
-- DFS 模板。(只是一个例子，不对应任何题)
+- Permutations of permutation questions. Question 46, question 47. Question 60, Question 526, Question 996.
+- Combination question Combination. Question 39, Question 40, Question 77, Question 216.
+- Permutation and combination hybridization problems. Question 1079.
+- N queens ultimate solution (binary solution). Question 51, question 52.
+- Sudoku problems. Question 37.
+- Search in four directions. Question 79, Question 212, Question 980.
+- Subcollection issues. Question 78, question 90.
+- Trie. Question 208, question 211.
+- BFS optimization. Question 126, question 127.
+- DFS templates. (just an example, does not correspond to any question)
```go
func combinationSum2(candidates []int, target int) [][]int {
@@ -38,7 +38,7 @@ func findcombinationSum2(nums []int, target, index int, c []int, res *[][]int) {
return
}
for i := index; i < len(nums); i++ {
- if i > index && nums[i] == nums[i-1] { // 这里是去重的关键逻辑
+ if i > index && nums[i] == nums[i-1] { //Here is the key logic for deduplication
continue
}
if target >= nums[i] {
@@ -49,7 +49,7 @@ func findcombinationSum2(nums []int, target, index int, c []int, res *[][]int) {
}
}
```
-- BFS 模板。(只是一个例子，不对应任何题)
+- BFS template. (just an example, does not correspond to any question)
```go
func updateMatrix_BFS(matrix [][]int) [][]int {
@@ -100,50 +100,53 @@ func updateMatrix_BFS(matrix [][]int) [][]int {
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
-|0017|Letter Combinations of a Phone Number|[Go]({{< relref "/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md" >}})|Medium| O(log n)| O(1)||55.5%|
-|0022|Generate Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0022.Generate-Parentheses.md" >}})|Medium| O(log n)| O(1)||71.8%|
-|0037|Sudoku Solver|[Go]({{< relref "/ChapterFour/0001~0099/0037.Sudoku-Solver.md" >}})|Hard| O(n^2)| O(n^2)|❤️|56.6%|
-|0039|Combination Sum|[Go]({{< relref "/ChapterFour/0001~0099/0039.Combination-Sum.md" >}})|Medium| O(n log n)| O(n)||67.6%|
-|0040|Combination Sum II|[Go]({{< relref "/ChapterFour/0001~0099/0040.Combination-Sum-II.md" >}})|Medium| O(n log n)| O(n)||53.3%|
-|0046|Permutations|[Go]({{< relref "/ChapterFour/0001~0099/0046.Permutations.md" >}})|Medium| O(n)| O(n)|❤️|74.7%|
-|0047|Permutations II|[Go]({{< relref "/ChapterFour/0001~0099/0047.Permutations-II.md" >}})|Medium| O(n^2)| O(n)|❤️|56.7%|
-|0051|N-Queens|[Go]({{< relref "/ChapterFour/0001~0099/0051.N-Queens.md" >}})|Hard| O(n!)| O(n)|❤️|62.9%|
-|0052|N-Queens II|[Go]({{< relref "/ChapterFour/0001~0099/0052.N-Queens-II.md" >}})|Hard| O(n!)| O(n)|❤️|70.9%|
-|0077|Combinations|[Go]({{< relref "/ChapterFour/0001~0099/0077.Combinations.md" >}})|Medium| O(n)| O(n)|❤️|66.0%|
-|0078|Subsets|[Go]({{< relref "/ChapterFour/0001~0099/0078.Subsets.md" >}})|Medium| O(n^2)| O(n)|❤️|73.8%|
-|0079|Word Search|[Go]({{< relref "/ChapterFour/0001~0099/0079.Word-Search.md" >}})|Medium| O(n^2)| O(n^2)|❤️|39.8%|
-|0089|Gray Code|[Go]({{< relref "/ChapterFour/0001~0099/0089.Gray-Code.md" >}})|Medium| O(n)| O(1)||56.4%|
-|0090|Subsets II|[Go]({{< relref "/ChapterFour/0001~0099/0090.Subsets-II.md" >}})|Medium| O(n^2)| O(n)|❤️|55.2%|
-|0093|Restore IP Addresses|[Go]({{< relref "/ChapterFour/0001~0099/0093.Restore-IP-Addresses.md" >}})|Medium| O(n)| O(n)|❤️|43.4%|
-|0095|Unique Binary Search Trees II|[Go]({{< relref "/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md" >}})|Medium||||51.5%|
-|0113|Path Sum II|[Go]({{< relref "/ChapterFour/0100~0199/0113.Path-Sum-II.md" >}})|Medium||||56.6%|
-|0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard| O(n)| O(n^2)|❤️|27.6%|
-|0131|Palindrome Partitioning|[Go]({{< relref "/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md" >}})|Medium| O(n)| O(n^2)|❤️|62.3%|
-|0212|Word Search II|[Go]({{< relref "/ChapterFour/0200~0299/0212.Word-Search-II.md" >}})|Hard| O(n^2)| O(n^2)|❤️|36.9%|
-|0216|Combination Sum III|[Go]({{< relref "/ChapterFour/0200~0299/0216.Combination-Sum-III.md" >}})|Medium| O(n)| O(1)|❤️|67.0%|
-|0257|Binary Tree Paths|[Go]({{< relref "/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md" >}})|Easy||||60.5%|
-|0301|Remove Invalid Parentheses|[Go]({{< relref "/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses.md" >}})|Hard||||47.1%|
-|0306|Additive Number|[Go]({{< relref "/ChapterFour/0300~0399/0306.Additive-Number.md" >}})|Medium| O(n^2)| O(1)|❤️|30.9%|
-|0357|Count Numbers with Unique Digits|[Go]({{< relref "/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md" >}})|Medium| O(1)| O(1)||51.5%|
-|0401|Binary Watch|[Go]({{< relref "/ChapterFour/0400~0499/0401.Binary-Watch.md" >}})|Easy| O(1)| O(1)||51.5%|
-|0473|Matchsticks to Square|[Go]({{< relref "/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md" >}})|Medium||||40.4%|
-|0491|Increasing Subsequences|[Go]({{< relref "/ChapterFour/0400~0499/0491.Increasing-Subsequences.md" >}})|Medium||||52.0%|
-|0494|Target Sum|[Go]({{< relref "/ChapterFour/0400~0499/0494.Target-Sum.md" >}})|Medium||||45.6%|
-|0526|Beautiful Arrangement|[Go]({{< relref "/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md" >}})|Medium| O(n^2)| O(1)|❤️|64.6%|
-|0638|Shopping Offers|[Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}})|Medium||||54.2%|
-|0784|Letter Case Permutation|[Go]({{< relref "/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md" >}})|Medium| O(n)| O(n)||73.4%|
-|0816|Ambiguous Coordinates|[Go]({{< relref "/ChapterFour/0800~0899/0816.Ambiguous-Coordinates.md" >}})|Medium||||56.1%|
-|0842|Split Array into Fibonacci Sequence|[Go]({{< relref "/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md" >}})|Medium| O(n^2)| O(1)|❤️|38.2%|
-|0980|Unique Paths III|[Go]({{< relref "/ChapterFour/0900~0999/0980.Unique-Paths-III.md" >}})|Hard| O(n log n)| O(n)||79.6%|
-|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard| O(n log n)| O(n) ||49.3%|
-|1079|Letter Tile Possibilities|[Go]({{< relref "/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md" >}})|Medium| O(n^2)| O(1)|❤️|76.1%|
+|0017|Letter Combinations of a Phone Number|[Go]({{< relref "/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md" >}})|Medium| O(log n)| O(1)||56.4%|
+|0022|Generate Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0022.Generate-Parentheses.md" >}})|Medium| O(log n)| O(1)||72.4%|
+|0037|Sudoku Solver|[Go]({{< relref "/ChapterFour/0001~0099/0037.Sudoku-Solver.md" >}})|Hard| O(n^2)| O(n^2)|❤️|57.6%|
+|0039|Combination Sum|[Go]({{< relref "/ChapterFour/0001~0099/0039.Combination-Sum.md" >}})|Medium| O(n log n)| O(n)||68.5%|
+|0040|Combination Sum II|[Go]({{< relref "/ChapterFour/0001~0099/0040.Combination-Sum-II.md" >}})|Medium| O(n log n)| O(n)||53.4%|
+|0046|Permutations|[Go]({{< relref "/ChapterFour/0001~0099/0046.Permutations.md" >}})|Medium| O(n)| O(n)|❤️|75.6%|
+|0047|Permutations II|[Go]({{< relref "/ChapterFour/0001~0099/0047.Permutations-II.md" >}})|Medium| O(n^2)| O(n)|❤️|57.3%|
+|0051|N-Queens|[Go]({{< relref "/ChapterFour/0001~0099/0051.N-Queens.md" >}})|Hard| O(n!)| O(n)|❤️|64.0%|
+|0052|N-Queens II|[Go]({{< relref "/ChapterFour/0001~0099/0052.N-Queens-II.md" >}})|Hard| O(n!)| O(n)|❤️|71.5%|
+|0077|Combinations|[Go]({{< relref "/ChapterFour/0001~0099/0077.Combinations.md" >}})|Medium| O(n)| O(n)|❤️|66.9%|
+|0078|Subsets|[Go]({{< relref "/ChapterFour/0001~0099/0078.Subsets.md" >}})|Medium| O(n^2)| O(n)|❤️|74.8%|
+|0079|Word Search|[Go]({{< relref "/ChapterFour/0001~0099/0079.Word-Search.md" >}})|Medium| O(n^2)| O(n^2)|❤️|40.2%|
+|0089|Gray Code|[Go]({{< relref "/ChapterFour/0001~0099/0089.Gray-Code.md" >}})|Medium| O(n)| O(1)||57.1%|
+|0090|Subsets II|[Go]({{< relref "/ChapterFour/0001~0099/0090.Subsets-II.md" >}})|Medium| O(n^2)| O(n)|❤️|55.8%|
+|0093|Restore IP Addresses|[Go]({{< relref "/ChapterFour/0001~0099/0093.Restore-IP-Addresses.md" >}})|Medium| O(n)| O(n)|❤️|47.3%|
+|0095|Unique Binary Search Trees II|[Go]({{< relref "/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md" >}})|Medium||||52.3%|
+|0113|Path Sum II|[Go]({{< relref "/ChapterFour/0100~0199/0113.Path-Sum-II.md" >}})|Medium||||57.0%|
+|0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard| O(n)| O(n^2)|❤️|27.5%|
+|0131|Palindrome Partitioning|[Go]({{< relref "/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md" >}})|Medium| O(n)| O(n^2)|❤️|64.7%|
+|0212|Word Search II|[Go]({{< relref "/ChapterFour/0200~0299/0212.Word-Search-II.md" >}})|Hard| O(n^2)| O(n^2)|❤️|36.5%|
+|0216|Combination Sum III|[Go]({{< relref "/ChapterFour/0200~0299/0216.Combination-Sum-III.md" >}})|Medium| O(n)| O(1)|❤️|67.6%|
+|0257|Binary Tree Paths|[Go]({{< relref "/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md" >}})|Easy||||61.3%|
+|0301|Remove Invalid Parentheses|[Go]({{< relref "/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses.md" >}})|Hard||||47.2%|
+|0306|Additive Number|[Go]({{< relref "/ChapterFour/0300~0399/0306.Additive-Number.md" >}})|Medium| O(n^2)| O(1)|❤️|31.0%|
+|0357|Count Numbers with Unique Digits|[Go]({{< relref "/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md" >}})|Medium| O(1)| O(1)||51.8%|
+|0401|Binary Watch|[Go]({{< relref "/ChapterFour/0400~0499/0401.Binary-Watch.md" >}})|Easy| O(1)| O(1)||52.2%|
+|0473|Matchsticks to Square|[Go]({{< relref "/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md" >}})|Medium||||40.2%|
+|0491|Non-decreasing Subsequences|[Go]({{< relref "/ChapterFour/0400~0499/0491.Non-decreasing-Subsequences.md" >}})|Medium||||60.1%|
+|0494|Target Sum|[Go]({{< relref "/ChapterFour/0400~0499/0494.Target-Sum.md" >}})|Medium||||45.7%|
+|0526|Beautiful Arrangement|[Go]({{< relref "/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md" >}})|Medium| O(n^2)| O(1)|❤️|64.5%|
+|0638|Shopping Offers|[Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}})|Medium||||53.3%|
+|0784|Letter Case Permutation|[Go]({{< relref "/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md" >}})|Medium| O(n)| O(n)||73.8%|
+|0816|Ambiguous Coordinates|[Go]({{< relref "/ChapterFour/0800~0899/0816.Ambiguous-Coordinates.md" >}})|Medium||||56.3%|
+|0842|Split Array into Fibonacci Sequence|[Go]({{< relref "/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md" >}})|Medium| O(n^2)| O(1)|❤️|38.4%|
+|0980|Unique Paths III|[Go]({{< relref "/ChapterFour/0900~0999/0980.Unique-Paths-III.md" >}})|Hard| O(n log n)| O(n)||81.9%|
+|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard| O(n log n)| O(n) ||49.2%|
+|1079|Letter Tile Possibilities|[Go]({{< relref "/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md" >}})|Medium| O(n^2)| O(1)|❤️|76.0%|
|1239|Maximum Length of a Concatenated String with Unique Characters|[Go]({{< relref "/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md" >}})|Medium||||52.2%|
-|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||39.6%|
+|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||38.9%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+-------------|-------------|-------------|
+
----------------------------------------------
diff --git a/website/content/ChapterTwo/Binary_Indexed_Tree.md b/website/content/ChapterTwo/Binary_Indexed_Tree.md
index 3b90c4d32..553847d86 100644
--- a/website/content/ChapterTwo/Binary_Indexed_Tree.md
+++ b/website/content/ChapterTwo/Binary_Indexed_Tree.md
@@ -10,18 +10,21 @@ weight: 19
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
-|0218|The Skyline Problem|[Go]({{< relref "/ChapterFour/0200~0299/0218.The-Skyline-Problem.md" >}})|Hard||||41.5%|
+|0218|The Skyline Problem|[Go]({{< relref "/ChapterFour/0200~0299/0218.The-Skyline-Problem.md" >}})|Hard||||41.8%|
|0307|Range Sum Query - Mutable|[Go]({{< relref "/ChapterFour/0300~0399/0307.Range-Sum-Query-Mutable.md" >}})|Medium||||40.7%|
-|0315|Count of Smaller Numbers After Self|[Go]({{< relref "/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md" >}})|Hard||||42.8%|
+|0315|Count of Smaller Numbers After Self|[Go]({{< relref "/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md" >}})|Hard||||42.6%|
|0327|Count of Range Sum|[Go]({{< relref "/ChapterFour/0300~0399/0327.Count-of-Range-Sum.md" >}})|Hard||||36.0%|
-|0493|Reverse Pairs|[Go]({{< relref "/ChapterFour/0400~0499/0493.Reverse-Pairs.md" >}})|Hard||||30.8%|
-|1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard||||42.0%|
-|1649|Create Sorted Array through Instructions|[Go]({{< relref "/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md" >}})|Hard||||37.2%|
+|0493|Reverse Pairs|[Go]({{< relref "/ChapterFour/0400~0499/0493.Reverse-Pairs.md" >}})|Hard||||30.9%|
+|1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard||||41.7%|
+|1649|Create Sorted Array through Instructions|[Go]({{< relref "/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md" >}})|Hard||||37.3%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+---|-------------|
+---|-------------|
+
----------------------------------------------
diff --git a/website/content/ChapterTwo/Binary_Search.md b/website/content/ChapterTwo/Binary_Search.md
index 3ee2668b8..9ae8d94de 100644
--- a/website/content/ChapterTwo/Binary_Search.md
+++ b/website/content/ChapterTwo/Binary_Search.md
@@ -6,10 +6,10 @@ weight: 11
# Binary Search
-- 二分搜索的经典写法。需要注意的三点：
- 1. 循环退出条件，注意是 low <= high，而不是 low < high。
- 2. mid 的取值，mid := low + (high-low)>>1
- 3. low 和 high 的更新。low = mid + 1，high = mid - 1。
+- The classic way of writing binary search. Three points to note:
+1. Loop exit condition, note that low <= high, not low < high.
+2. The value of mid, mid := low + (high-low)>>1
+3. Update of low and high. low = mid + 1, high = mid -1.
```go
func binarySearchMatrix(nums []int, target int) int {
@@ -28,14 +28,14 @@ func binarySearchMatrix(nums []int, target int) int {
}
```
-- 二分搜索的变种写法。有 4 个基本变种:
- 1. 查找第一个与 target 相等的元素，时间复杂度 O(logn)
- 2. 查找最后一个与 target 相等的元素，时间复杂度 O(logn)
- 3. 查找第一个大于等于 target 的元素，时间复杂度 O(logn)
- 4. 查找最后一个小于等于 target 的元素，时间复杂度 O(logn)
+- A variant of binary search. There are 4 basic variants:
+1. Find the first element equal to target, time complexity O(logn)
+2. Find the last element equal to target, time complexity O(logn)
+3. Find the first element greater than or equal to target, time complexity O(logn)
+4. Find the last element less than or equal to target, time complexity O(logn)
```go
-// 二分查找第一个与 target 相等的元素，时间复杂度 O(logn)
+// Binary search for the first element equal to target, time complexity O(logn)
func searchFirstEqualElement(nums []int, target int) int {
low, high := 0, len(nums)-1
for low <= high {
@@ -45,7 +45,7 @@ func searchFirstEqualElement(nums []int, target int) int {
} else if nums[mid] < target {
low = mid + 1
} else {
- if (mid == 0) || (nums[mid-1] != target) { // 找到第一个与 target 相等的元素
+ if (mid == 0) || (nums[mid-1] != target) { //Find the first element equal to target
return mid
}
high = mid - 1
@@ -54,7 +54,7 @@ func searchFirstEqualElement(nums []int, target int) int {
return -1
}
-// 二分查找最后一个与 target 相等的元素，时间复杂度 O(logn)
+// Binary search for the last element equal to target, time complexity O(logn)
func searchLastEqualElement(nums []int, target int) int {
low, high := 0, len(nums)-1
for low <= high {
@@ -64,7 +64,7 @@ func searchLastEqualElement(nums []int, target int) int {
} else if nums[mid] < target {
low = mid + 1
} else {
- if (mid == len(nums)-1) || (nums[mid+1] != target) { // 找到最后一个与 target 相等的元素
+ if (mid == len(nums)-1) || (nums[mid+1] != target) { // finds the last element equal to target
return mid
}
low = mid + 1
@@ -73,13 +73,13 @@ func searchLastEqualElement(nums []int, target int) int {
return -1
}
-// 二分查找第一个大于等于 target 的元素，时间复杂度 O(logn)
+// Binary search for the first element greater than or equal to target, time complexity O(logn)
func searchFirstGreaterElement(nums []int, target int) int {
low, high := 0, len(nums)-1
for low <= high {
mid := low + ((high - low) >> 1)
if nums[mid] >= target {
- if (mid == 0) || (nums[mid-1] < target) { // 找到第一个大于等于 target 的元素
+ if (mid == 0) || (nums[mid-1] < target) { // finds the first element greater than or equal to target
return mid
}
high = mid - 1
@@ -90,13 +90,13 @@ func searchFirstGreaterElement(nums []int, target int) int {
return -1
}
-// 二分查找最后一个小于等于 target 的元素，时间复杂度 O(logn)
+// Binary search for the last element less than or equal to target, time complexity O(logn)
func searchLastLessElement(nums []int, target int) int {
low, high := 0, len(nums)-1
for low <= high {
mid := low + ((high - low) >> 1)
if nums[mid] <= target {
- if (mid == len(nums)-1) || (nums[mid+1] > target) { // 找到最后一个小于等于 target 的元素
+ if (mid == len(nums)-1) || (nums[mid+1] > target) { // finds the last element less than or equal to target
return mid
}
low = mid + 1
@@ -108,14 +108,14 @@ func searchLastLessElement(nums []int, target int) int {
}
```
-- 在基本有序的数组中用二分搜索。经典解法可以解，变种写法也可以写，常见的题型，在山峰数组中找山峰，在旋转有序数组中找分界点。第 33 题，第 81 题，第 153 题，第 154 题，第 162 题，第 852 题
+- Use binary search in basically sorted arrays. The classic solution can be solved, and the variant writing method can also be written. The common question type is to find the peak in the peak array and find the dividing point in the rotated ordered array. Question 33, Question 81, Question 153, Question 154, Question 162, Question 852
```go
func peakIndexInMountainArray(A []int) int {
low, high := 0, len(A)-1
for low < high {
mid := low + (high-low)>>1
- // 如果 mid 较大，则左侧存在峰值，high = m，如果 mid + 1 较大，则右侧存在峰值，low = mid + 1
+ // If mid is large, there is a peak on the left, high = m, if mid + 1 is large, there is a peak on the right, low = mid + 1
if A[mid] > A[mid+1] {
high = mid
} else {
@@ -126,100 +126,104 @@ func peakIndexInMountainArray(A []int) int {
}
```
-- max-min 最大值最小化问题。求在最小满足条件的情况下的最大值。第 410 题，第 875 题，第 1011 题，第 1283 题。
+- max-min Maximum minimization problem. Find the maximum value if the minimum condition is met. Question 410, Question 875, Question 1011, Question 1283.
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
-|0004|Median of Two Sorted Arrays|[Go]({{< relref "/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md" >}})|Hard||||35.2%|
-|0033|Search in Rotated Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md" >}})|Medium||||38.6%|
-|0034|Find First and Last Position of Element in Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md" >}})|Medium||||41.5%|
-|0035|Search Insert Position|[Go]({{< relref "/ChapterFour/0001~0099/0035.Search-Insert-Position.md" >}})|Easy||||42.0%|
-|0069|Sqrt(x)|[Go]({{< relref "/ChapterFour/0001~0099/0069.Sqrtx.md" >}})|Easy| O(log n)| O(1)||37.0%|
-|0074|Search a 2D Matrix|[Go]({{< relref "/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md" >}})|Medium||||46.8%|
+|0004|Median of Two Sorted Arrays|[Go]({{< relref "/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md" >}})|Hard||||36.1%|
+|0033|Search in Rotated Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md" >}})|Medium||||38.9%|
+|0034|Find First and Last Position of Element in Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md" >}})|Medium||||41.8%|
+|0035|Search Insert Position|[Go]({{< relref "/ChapterFour/0001~0099/0035.Search-Insert-Position.md" >}})|Easy||||43.3%|
+|0069|Sqrt(x)|[Go]({{< relref "/ChapterFour/0001~0099/0069.Sqrtx.md" >}})|Easy| O(log n)| O(1)||37.4%|
+|0074|Search a 2D Matrix|[Go]({{< relref "/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md" >}})|Medium||||47.6%|
|0081|Search in Rotated Sorted Array II|[Go]({{< relref "/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II.md" >}})|Medium||||35.7%|
-|0153|Find Minimum in Rotated Sorted Array|[Go]({{< relref "/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array.md" >}})|Medium||||48.5%|
-|0154|Find Minimum in Rotated Sorted Array II|[Go]({{< relref "/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md" >}})|Hard||||43.4%|
-|0162|Find Peak Element|[Go]({{< relref "/ChapterFour/0100~0199/0162.Find-Peak-Element.md" >}})|Medium||||46.2%|
+|0153|Find Minimum in Rotated Sorted Array|[Go]({{< relref "/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array.md" >}})|Medium||||48.8%|
+|0154|Find Minimum in Rotated Sorted Array II|[Go]({{< relref "/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md" >}})|Hard||||43.5%|
+|0162|Find Peak Element|[Go]({{< relref "/ChapterFour/0100~0199/0162.Find-Peak-Element.md" >}})|Medium||||46.0%|
|0167|Two Sum II - Input Array Is Sorted|[Go]({{< relref "/ChapterFour/0100~0199/0167.Two-Sum-II-Input-Array-Is-Sorted.md" >}})|Medium| O(n)| O(1)||60.0%|
-|0209|Minimum Size Subarray Sum|[Go]({{< relref "/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md" >}})|Medium| O(n)| O(1)||44.4%|
-|0222|Count Complete Tree Nodes|[Go]({{< relref "/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md" >}})|Medium| O(n)| O(1)||57.4%|
-|0240|Search a 2D Matrix II|[Go]({{< relref "/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II.md" >}})|Medium||||50.5%|
-|0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy||||61.5%|
-|0275|H-Index II|[Go]({{< relref "/ChapterFour/0200~0299/0275.H-Index-II.md" >}})|Medium||||37.4%|
-|0278|First Bad Version|[Go]({{< relref "/ChapterFour/0200~0299/0278.First-Bad-Version.md" >}})|Easy||||42.9%|
+|0209|Minimum Size Subarray Sum|[Go]({{< relref "/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md" >}})|Medium| O(n)| O(1)||44.9%|
+|0222|Count Complete Tree Nodes|[Go]({{< relref "/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md" >}})|Medium| O(n)| O(1)||60.4%|
+|0240|Search a 2D Matrix II|[Go]({{< relref "/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II.md" >}})|Medium||||51.0%|
+|0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy||||62.4%|
+|0275|H-Index II|[Go]({{< relref "/ChapterFour/0200~0299/0275.H-Index-II.md" >}})|Medium||||37.5%|
+|0278|First Bad Version|[Go]({{< relref "/ChapterFour/0200~0299/0278.First-Bad-Version.md" >}})|Easy||||43.3%|
|0287|Find the Duplicate Number|[Go]({{< relref "/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md" >}})|Medium| O(n)| O(1)|❤️|59.1%|
-|0300|Longest Increasing Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md" >}})|Medium| O(n log n)| O(n)||51.5%|
-|0315|Count of Smaller Numbers After Self|[Go]({{< relref "/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md" >}})|Hard||||42.8%|
+|0300|Longest Increasing Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md" >}})|Medium| O(n log n)| O(n)||52.1%|
+|0315|Count of Smaller Numbers After Self|[Go]({{< relref "/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md" >}})|Hard||||42.6%|
|0327|Count of Range Sum|[Go]({{< relref "/ChapterFour/0300~0399/0327.Count-of-Range-Sum.md" >}})|Hard||||36.0%|
-|0349|Intersection of Two Arrays|[Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}})|Easy| O(n)| O(n) ||70.2%|
-|0350|Intersection of Two Arrays II|[Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}})|Easy| O(n)| O(n) ||55.5%|
-|0352|Data Stream as Disjoint Intervals|[Go]({{< relref "/ChapterFour/0300~0399/0352.Data-Stream-as-Disjoint-Intervals.md" >}})|Hard||||51.5%|
-|0354|Russian Doll Envelopes|[Go]({{< relref "/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md" >}})|Hard||||38.3%|
+|0349|Intersection of Two Arrays|[Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}})|Easy| O(n)| O(n) ||70.9%|
+|0350|Intersection of Two Arrays II|[Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}})|Easy| O(n)| O(n) ||55.9%|
+|0352|Data Stream as Disjoint Intervals|[Go]({{< relref "/ChapterFour/0300~0399/0352.Data-Stream-as-Disjoint-Intervals.md" >}})|Hard||||59.7%|
+|0354|Russian Doll Envelopes|[Go]({{< relref "/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md" >}})|Hard||||38.0%|
|0367|Valid Perfect Square|[Go]({{< relref "/ChapterFour/0300~0399/0367.Valid-Perfect-Square.md" >}})|Easy||||43.3%|
-|0374|Guess Number Higher or Lower|[Go]({{< relref "/ChapterFour/0300~0399/0374.Guess-Number-Higher-or-Lower.md" >}})|Easy||||50.4%|
-|0378|Kth Smallest Element in a Sorted Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md" >}})|Medium||||61.6%|
-|0400|Nth Digit|[Go]({{< relref "/ChapterFour/0400~0499/0400.Nth-Digit.md" >}})|Medium||||34.0%|
-|0410|Split Array Largest Sum|[Go]({{< relref "/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md" >}})|Hard||||53.2%|
-|0436|Find Right Interval|[Go]({{< relref "/ChapterFour/0400~0499/0436.Find-Right-Interval.md" >}})|Medium||||50.3%|
-|0441|Arranging Coins|[Go]({{< relref "/ChapterFour/0400~0499/0441.Arranging-Coins.md" >}})|Easy||||46.1%|
+|0374|Guess Number Higher or Lower|[Go]({{< relref "/ChapterFour/0300~0399/0374.Guess-Number-Higher-or-Lower.md" >}})|Easy||||51.8%|
+|0378|Kth Smallest Element in a Sorted Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md" >}})|Medium||||61.8%|
+|0400|Nth Digit|[Go]({{< relref "/ChapterFour/0400~0499/0400.Nth-Digit.md" >}})|Medium||||34.1%|
+|0410|Split Array Largest Sum|[Go]({{< relref "/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md" >}})|Hard||||53.5%|
+|0436|Find Right Interval|[Go]({{< relref "/ChapterFour/0400~0499/0436.Find-Right-Interval.md" >}})|Medium||||50.7%|
+|0441|Arranging Coins|[Go]({{< relref "/ChapterFour/0400~0499/0441.Arranging-Coins.md" >}})|Easy||||46.2%|
|0456|132 Pattern|[Go]({{< relref "/ChapterFour/0400~0499/0456.132-Pattern.md" >}})|Medium||||32.4%|
-|0475|Heaters|[Go]({{< relref "/ChapterFour/0400~0499/0475.Heaters.md" >}})|Medium||||36.1%|
-|0483|Smallest Good Base|[Go]({{< relref "/ChapterFour/0400~0499/0483.Smallest-Good-Base.md" >}})|Hard||||38.4%|
-|0493|Reverse Pairs|[Go]({{< relref "/ChapterFour/0400~0499/0493.Reverse-Pairs.md" >}})|Hard||||30.8%|
-|0497|Random Point in Non-overlapping Rectangles|[Go]({{< relref "/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md" >}})|Medium||||39.3%|
+|0475|Heaters|[Go]({{< relref "/ChapterFour/0400~0499/0475.Heaters.md" >}})|Medium||||36.4%|
+|0483|Smallest Good Base|[Go]({{< relref "/ChapterFour/0400~0499/0483.Smallest-Good-Base.md" >}})|Hard||||38.7%|
+|0493|Reverse Pairs|[Go]({{< relref "/ChapterFour/0400~0499/0493.Reverse-Pairs.md" >}})|Hard||||30.9%|
+|0497|Random Point in Non-overlapping Rectangles|[Go]({{< relref "/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md" >}})|Medium||||39.4%|
|0528|Random Pick with Weight|[Go]({{< relref "/ChapterFour/0500~0599/0528.Random-Pick-with-Weight.md" >}})|Medium||||46.1%|
-|0532|K-diff Pairs in an Array|[Go]({{< relref "/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md" >}})|Medium||||40.7%|
-|0540|Single Element in a Sorted Array|[Go]({{< relref "/ChapterFour/0500~0599/0540.Single-Element-in-a-Sorted-Array.md" >}})|Medium||||58.5%|
-|0611|Valid Triangle Number|[Go]({{< relref "/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md" >}})|Medium||||50.4%|
-|0633|Sum of Square Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md" >}})|Medium||||34.6%|
-|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||46.7%|
+|0532|K-diff Pairs in an Array|[Go]({{< relref "/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md" >}})|Medium||||41.1%|
+|0540|Single Element in a Sorted Array|[Go]({{< relref "/ChapterFour/0500~0599/0540.Single-Element-in-a-Sorted-Array.md" >}})|Medium||||59.1%|
+|0611|Valid Triangle Number|[Go]({{< relref "/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md" >}})|Medium||||50.5%|
+|0633|Sum of Square Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md" >}})|Medium||||34.4%|
+|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||46.8%|
|0668|Kth Smallest Number in Multiplication Table|[Go]({{< relref "/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table.md" >}})|Hard||||51.5%|
-|0704|Binary Search|[Go]({{< relref "/ChapterFour/0700~0799/0704.Binary-Search.md" >}})|Easy||||55.1%|
-|0710|Random Pick with Blacklist|[Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}})|Hard| O(n)| O(n) ||33.6%|
-|0718|Maximum Length of Repeated Subarray|[Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}})|Medium||||51.6%|
-|0719|Find K-th Smallest Pair Distance|[Go]({{< relref "/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md" >}})|Hard||||36.3%|
-|0729|My Calendar I|[Go]({{< relref "/ChapterFour/0700~0799/0729.My-Calendar-I.md" >}})|Medium||||57.2%|
-|0732|My Calendar III|[Go]({{< relref "/ChapterFour/0700~0799/0732.My-Calendar-III.md" >}})|Hard||||71.6%|
-|0744|Find Smallest Letter Greater Than Target|[Go]({{< relref "/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target.md" >}})|Easy||||44.6%|
-|0778|Swim in Rising Water|[Go]({{< relref "/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md" >}})|Hard||||59.6%|
-|0786|K-th Smallest Prime Fraction|[Go]({{< relref "/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md" >}})|Medium||||50.7%|
-|0793|Preimage Size of Factorial Zeroes Function|[Go]({{< relref "/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function.md" >}})|Hard||||42.7%|
-|0825|Friends Of Appropriate Ages|[Go]({{< relref "/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages.md" >}})|Medium||||46.4%|
-|0826|Most Profit Assigning Work|[Go]({{< relref "/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md" >}})|Medium||||44.4%|
-|0852|Peak Index in a Mountain Array|[Go]({{< relref "/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array.md" >}})|Medium||||69.5%|
+|0704|Binary Search|[Go]({{< relref "/ChapterFour/0700~0799/0704.Binary-Search.md" >}})|Easy||||55.4%|
+|0710|Random Pick with Blacklist|[Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}})|Hard| O(n)| O(n) ||33.5%|
+|0718|Maximum Length of Repeated Subarray|[Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}})|Medium||||51.3%|
+|0719|Find K-th Smallest Pair Distance|[Go]({{< relref "/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md" >}})|Hard||||36.7%|
+|0729|My Calendar I|[Go]({{< relref "/ChapterFour/0700~0799/0729.My-Calendar-I.md" >}})|Medium||||56.9%|
+|0732|My Calendar III|[Go]({{< relref "/ChapterFour/0700~0799/0732.My-Calendar-III.md" >}})|Hard||||71.5%|
+|0744|Find Smallest Letter Greater Than Target|[Go]({{< relref "/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target.md" >}})|Easy||||45.6%|
+|0778|Swim in Rising Water|[Go]({{< relref "/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md" >}})|Hard||||59.8%|
+|0786|K-th Smallest Prime Fraction|[Go]({{< relref "/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md" >}})|Medium||||51.6%|
+|0793|Preimage Size of Factorial Zeroes Function|[Go]({{< relref "/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function.md" >}})|Hard||||43.2%|
+|0825|Friends Of Appropriate Ages|[Go]({{< relref "/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages.md" >}})|Medium||||46.3%|
+|0826|Most Profit Assigning Work|[Go]({{< relref "/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md" >}})|Medium||||44.8%|
+|0852|Peak Index in a Mountain Array|[Go]({{< relref "/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array.md" >}})|Medium||||69.1%|
|0862|Shortest Subarray with Sum at Least K|[Go]({{< relref "/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K.md" >}})|Hard||||26.1%|
-|0875|Koko Eating Bananas|[Go]({{< relref "/ChapterFour/0800~0899/0875.Koko-Eating-Bananas.md" >}})|Medium||||52.4%|
-|0878|Nth Magical Number|[Go]({{< relref "/ChapterFour/0800~0899/0878.Nth-Magical-Number.md" >}})|Hard||||35.7%|
+|0875|Koko Eating Bananas|[Go]({{< relref "/ChapterFour/0800~0899/0875.Koko-Eating-Bananas.md" >}})|Medium||||52.3%|
+|0878|Nth Magical Number|[Go]({{< relref "/ChapterFour/0800~0899/0878.Nth-Magical-Number.md" >}})|Hard||||35.3%|
|0887|Super Egg Drop|[Go]({{< relref "/ChapterFour/0800~0899/0887.Super-Egg-Drop.md" >}})|Hard||||27.2%|
-|0888|Fair Candy Swap|[Go]({{< relref "/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md" >}})|Easy||||60.5%|
-|0911|Online Election|[Go]({{< relref "/ChapterFour/0900~0999/0911.Online-Election.md" >}})|Medium||||52.0%|
-|0981|Time Based Key-Value Store|[Go]({{< relref "/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md" >}})|Medium||||53.6%|
-|1004|Max Consecutive Ones III|[Go]({{< relref "/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md" >}})|Medium||||63.5%|
-|1011|Capacity To Ship Packages Within D Days|[Go]({{< relref "/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md" >}})|Medium||||64.5%|
-|1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard||||42.0%|
-|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||61.3%|
-|1201|Ugly Number III|[Go]({{< relref "/ChapterFour/1200~1299/1201.Ugly-Number-III.md" >}})|Medium||||28.5%|
-|1208|Get Equal Substrings Within Budget|[Go]({{< relref "/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md" >}})|Medium||||47.6%|
-|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||51.1%|
-|1283|Find the Smallest Divisor Given a Threshold|[Go]({{< relref "/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md" >}})|Medium||||55.3%|
-|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||43.1%|
-|1337|The K Weakest Rows in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md" >}})|Easy||||73.0%|
-|1385|Find the Distance Value Between Two Arrays|[Go]({{< relref "/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md" >}})|Easy||||65.4%|
+|0888|Fair Candy Swap|[Go]({{< relref "/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md" >}})|Easy||||60.7%|
+|0911|Online Election|[Go]({{< relref "/ChapterFour/0900~0999/0911.Online-Election.md" >}})|Medium||||52.2%|
+|0981|Time Based Key-Value Store|[Go]({{< relref "/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md" >}})|Medium||||52.4%|
+|1004|Max Consecutive Ones III|[Go]({{< relref "/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md" >}})|Medium||||63.2%|
+|1011|Capacity To Ship Packages Within D Days|[Go]({{< relref "/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md" >}})|Medium||||67.7%|
+|1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard||||41.7%|
+|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||61.5%|
+|1201|Ugly Number III|[Go]({{< relref "/ChapterFour/1200~1299/1201.Ugly-Number-III.md" >}})|Medium||||28.8%|
+|1208|Get Equal Substrings Within Budget|[Go]({{< relref "/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md" >}})|Medium||||48.5%|
+|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||53.4%|
+|1283|Find the Smallest Divisor Given a Threshold|[Go]({{< relref "/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md" >}})|Medium||||56.0%|
+|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||43.6%|
+|1337|The K Weakest Rows in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md" >}})|Easy||||72.1%|
+|1385|Find the Distance Value Between Two Arrays|[Go]({{< relref "/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md" >}})|Easy||||66.4%|
|1439|Find the Kth Smallest Sum of a Matrix With Sorted Rows|[Go]({{< relref "/ChapterFour/1400~1499/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows.md" >}})|Hard||||61.4%|
-|1482|Minimum Number of Days to Make m Bouquets|[Go]({{< relref "/ChapterFour/1400~1499/1482.Minimum-Number-of-Days-to-Make-m-Bouquets.md" >}})|Medium||||56.5%|
-|1539|Kth Missing Positive Number|[Go]({{< relref "/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md" >}})|Easy||||55.9%|
-|1608|Special Array With X Elements Greater Than or Equal X|[Go]({{< relref "/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md" >}})|Easy||||60.0%|
-|1631|Path With Minimum Effort|[Go]({{< relref "/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md" >}})|Medium||||55.3%|
-|1648|Sell Diminishing-Valued Colored Balls|[Go]({{< relref "/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}})|Medium||||30.5%|
-|1649|Create Sorted Array through Instructions|[Go]({{< relref "/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md" >}})|Hard||||37.2%|
+|1482|Minimum Number of Days to Make m Bouquets|[Go]({{< relref "/ChapterFour/1400~1499/1482.Minimum-Number-of-Days-to-Make-m-Bouquets.md" >}})|Medium||||54.2%|
+|1539|Kth Missing Positive Number|[Go]({{< relref "/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md" >}})|Easy||||58.5%|
+|1608|Special Array With X Elements Greater Than or Equal X|[Go]({{< relref "/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md" >}})|Easy||||60.4%|
+|1631|Path With Minimum Effort|[Go]({{< relref "/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md" >}})|Medium||||55.6%|
+|1648|Sell Diminishing-Valued Colored Balls|[Go]({{< relref "/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}})|Medium||||30.4%|
+|1649|Create Sorted Array through Instructions|[Go]({{< relref "/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md" >}})|Hard||||37.3%|
|1658|Minimum Operations to Reduce X to Zero|[Go]({{< relref "/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md" >}})|Medium||||37.6%|
-|1818|Minimum Absolute Sum Difference|[Go]({{< relref "/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference.md" >}})|Medium||||30.1%|
+|1818|Minimum Absolute Sum Difference|[Go]({{< relref "/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference.md" >}})|Medium||||30.3%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+8.Minimum-Absolute-Sum-Difference.md" >}})|Medium||||30.3%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+----------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
----------------------------------------------
diff --git a/website/content/ChapterTwo/Bit_Manipulation.md b/website/content/ChapterTwo/Bit_Manipulation.md
index 1d1907bbc..2e0478bea 100644
--- a/website/content/ChapterTwo/Bit_Manipulation.md
+++ b/website/content/ChapterTwo/Bit_Manipulation.md
@@ -8,35 +8,34 @@ weight: 15
-- 异或的特性。第 136 题，第 268 题，第 389 题，第 421 题，
+-XOR property. Question 136, Question 268, Question 389, Question 421,
```go
x ^ 0 = x
x ^ 11111……1111 = ~x
x ^ (~x) = 11111……1111
x ^ x = 0
-a ^ b = c => a ^ c = b => b ^ c = a (交换律)
-a ^ b ^ c = a ^ (b ^ c) = (a ^ b）^ c (结合律)
+a ^ b = c => a ^ c = b => b ^ c = a (commutative law)
+a ^ b ^ c = a ^ (b ^ c) = (a ^ b）^ c (associative law)
```
-- 构造特殊 Mask，将特殊位置放 0 或 1。
+-Construct a special Mask, put 0 or 1 in the special position.
```go
-将 x 最右边的 n 位清零， x & ( ~0 << n )
-获取 x 的第 n 位值(0 或者 1)，(x >> n) & 1
-获取 x 的第 n 位的幂值，x & (1 << (n - 1))
-仅将第 n 位置为 1，x | (1 << n)
-仅将第 n 位置为 0，x & (~(1 << n))
-将 x 最高位至第 n 位(含)清零，x & ((1 << n) - 1)
-将第 n 位至第 0 位(含)清零，x & (~((1 << (n + 1)) - 1)）
+Clear the rightmost n bits of x to zero, x & ( ~0 << n )
+Get the nth bit value of x (0 or 1)，(x >> n) & 1
+Get the power of the nth bit of x, x & (1 << (n -1))
+Set only the nth position to 1, x | (1 << n)
+Set only the nth position to 0, x & (~(1 << n))
+Clear the most significant bit of x to the nth bit (inclusive), x & ((1 << n) -1)
+Clear bits n through 0, inclusive, x & (~((1 << (n + 1)) -1))
```
-
-- 有特殊意义的 & 位操作运算。第 260 题，第 201 题，第 318 题，第 371 题，第 397 题，第 461 题，第 693 题，
+- The & bitwise operation has a special meaning. Question 260, Question 201, Question 318, Question 371, Question 397, Question 461, Question 693,
```go
-X & 1 == 1 判断是否是奇数(偶数)
-X & = (X - 1) 将最低位(LSB)的 1 清零
-X & -X 得到最低位(LSB)的 1
+X & 1 == 1 to determine whether it is an odd number (even number)
+X & = (X -1) clears the least significant bit (LSB) of 1
+X & -X get the least significant bit (LSB) of 1
X & ~X = 0
```
@@ -44,70 +43,72 @@ X & ~X = 0
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
-|0029|Divide Two Integers|[Go]({{< relref "/ChapterFour/0001~0099/0029.Divide-Two-Integers.md" >}})|Medium||||17.3%|
-|0067|Add Binary|[Go]({{< relref "/ChapterFour/0001~0099/0067.Add-Binary.md" >}})|Easy||||51.3%|
-|0078|Subsets|[Go]({{< relref "/ChapterFour/0001~0099/0078.Subsets.md" >}})|Medium| O(n^2)| O(n)|❤️|73.8%|
-|0089|Gray Code|[Go]({{< relref "/ChapterFour/0001~0099/0089.Gray-Code.md" >}})|Medium||||56.4%|
-|0090|Subsets II|[Go]({{< relref "/ChapterFour/0001~0099/0090.Subsets-II.md" >}})|Medium||||55.2%|
-|0136|Single Number|[Go]({{< relref "/ChapterFour/0100~0199/0136.Single-Number.md" >}})|Easy| O(n)| O(1)||70.0%|
-|0137|Single Number II|[Go]({{< relref "/ChapterFour/0100~0199/0137.Single-Number-II.md" >}})|Medium| O(n)| O(1)|❤️|57.7%|
-|0187|Repeated DNA Sequences|[Go]({{< relref "/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md" >}})|Medium| O(n)| O(1)||46.1%|
-|0190|Reverse Bits|[Go]({{< relref "/ChapterFour/0100~0199/0190.Reverse-Bits.md" >}})|Easy| O(n)| O(1)|❤️|52.0%|
-|0191|Number of 1 Bits|[Go]({{< relref "/ChapterFour/0100~0199/0191.Number-of-1-Bits.md" >}})|Easy| O(n)| O(1)||64.6%|
-|0201|Bitwise AND of Numbers Range|[Go]({{< relref "/ChapterFour/0200~0299/0201.Bitwise-AND-of-Numbers-Range.md" >}})|Medium| O(n)| O(1)|❤️|42.2%|
-|0231|Power of Two|[Go]({{< relref "/ChapterFour/0200~0299/0231.Power-of-Two.md" >}})|Easy| O(1)| O(1)||45.7%|
-|0260|Single Number III|[Go]({{< relref "/ChapterFour/0200~0299/0260.Single-Number-III.md" >}})|Medium| O(n)| O(1)|❤️|67.4%|
-|0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy| O(n)| O(1)||61.5%|
+|0029|Divide Two Integers|[Go]({{< relref "/ChapterFour/0001~0099/0029.Divide-Two-Integers.md" >}})|Medium||||17.2%|
+|0067|Add Binary|[Go]({{< relref "/ChapterFour/0001~0099/0067.Add-Binary.md" >}})|Easy||||52.4%|
+|0078|Subsets|[Go]({{< relref "/ChapterFour/0001~0099/0078.Subsets.md" >}})|Medium| O(n^2)| O(n)|❤️|74.8%|
+|0089|Gray Code|[Go]({{< relref "/ChapterFour/0001~0099/0089.Gray-Code.md" >}})|Medium||||57.1%|
+|0090|Subsets II|[Go]({{< relref "/ChapterFour/0001~0099/0090.Subsets-II.md" >}})|Medium||||55.8%|
+|0136|Single Number|[Go]({{< relref "/ChapterFour/0100~0199/0136.Single-Number.md" >}})|Easy| O(n)| O(1)||70.6%|
+|0137|Single Number II|[Go]({{< relref "/ChapterFour/0100~0199/0137.Single-Number-II.md" >}})|Medium| O(n)| O(1)|❤️|58.4%|
+|0187|Repeated DNA Sequences|[Go]({{< relref "/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md" >}})|Medium| O(n)| O(1)||46.9%|
+|0190|Reverse Bits|[Go]({{< relref "/ChapterFour/0100~0199/0190.Reverse-Bits.md" >}})|Easy| O(n)| O(1)|❤️|53.8%|
+|0191|Number of 1 Bits|[Go]({{< relref "/ChapterFour/0100~0199/0191.Number-of-1-Bits.md" >}})|Easy| O(n)| O(1)||66.4%|
+|0201|Bitwise AND of Numbers Range|[Go]({{< relref "/ChapterFour/0200~0299/0201.Bitwise-AND-of-Numbers-Range.md" >}})|Medium| O(n)| O(1)|❤️|42.5%|
+|0231|Power of Two|[Go]({{< relref "/ChapterFour/0200~0299/0231.Power-of-Two.md" >}})|Easy| O(1)| O(1)||46.0%|
+|0260|Single Number III|[Go]({{< relref "/ChapterFour/0200~0299/0260.Single-Number-III.md" >}})|Medium| O(n)| O(1)|❤️|67.6%|
+|0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy| O(n)| O(1)||62.4%|
|0287|Find the Duplicate Number|[Go]({{< relref "/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md" >}})|Medium||||59.1%|
-|0318|Maximum Product of Word Lengths|[Go]({{< relref "/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md" >}})|Medium| O(n)| O(1)||60.1%|
-|0338|Counting Bits|[Go]({{< relref "/ChapterFour/0300~0399/0338.Counting-Bits.md" >}})|Easy| O(n)| O(n)||75.2%|
-|0342|Power of Four|[Go]({{< relref "/ChapterFour/0300~0399/0342.Power-of-Four.md" >}})|Easy| O(n)| O(1)||45.6%|
+|0318|Maximum Product of Word Lengths|[Go]({{< relref "/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md" >}})|Medium| O(n)| O(1)||59.9%|
+|0338|Counting Bits|[Go]({{< relref "/ChapterFour/0300~0399/0338.Counting-Bits.md" >}})|Easy| O(n)| O(n)||75.7%|
+|0342|Power of Four|[Go]({{< relref "/ChapterFour/0300~0399/0342.Power-of-Four.md" >}})|Easy| O(n)| O(1)||46.1%|
|0371|Sum of Two Integers|[Go]({{< relref "/ChapterFour/0300~0399/0371.Sum-of-Two-Integers.md" >}})|Medium| O(n)| O(1)||50.7%|
-|0389|Find the Difference|[Go]({{< relref "/ChapterFour/0300~0399/0389.Find-the-Difference.md" >}})|Easy| O(n)| O(1)||60.4%|
-|0393|UTF-8 Validation|[Go]({{< relref "/ChapterFour/0300~0399/0393.UTF-8-Validation.md" >}})|Medium| O(n)| O(1)||45.2%|
-|0397|Integer Replacement|[Go]({{< relref "/ChapterFour/0300~0399/0397.Integer-Replacement.md" >}})|Medium| O(n)| O(1)||35.1%|
-|0401|Binary Watch|[Go]({{< relref "/ChapterFour/0400~0499/0401.Binary-Watch.md" >}})|Easy| O(1)| O(1)||51.5%|
-|0405|Convert a Number to Hexadecimal|[Go]({{< relref "/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md" >}})|Easy| O(n)| O(1)||46.1%|
-|0421|Maximum XOR of Two Numbers in an Array|[Go]({{< relref "/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md" >}})|Medium| O(n)| O(1)|❤️|54.6%|
-|0461|Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0461.Hamming-Distance.md" >}})|Easy| O(n)| O(1)||74.8%|
-|0473|Matchsticks to Square|[Go]({{< relref "/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md" >}})|Medium||||40.4%|
-|0476|Number Complement|[Go]({{< relref "/ChapterFour/0400~0499/0476.Number-Complement.md" >}})|Easy| O(n)| O(1)||67.1%|
-|0477|Total Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md" >}})|Medium| O(n)| O(1)||52.2%|
-|0491|Increasing Subsequences|[Go]({{< relref "/ChapterFour/0400~0499/0491.Increasing-Subsequences.md" >}})|Medium||||52.0%|
-|0526|Beautiful Arrangement|[Go]({{< relref "/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md" >}})|Medium||||64.6%|
-|0638|Shopping Offers|[Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}})|Medium||||54.2%|
-|0645|Set Mismatch|[Go]({{< relref "/ChapterFour/0600~0699/0645.Set-Mismatch.md" >}})|Easy||||43.0%|
-|0693|Binary Number with Alternating Bits|[Go]({{< relref "/ChapterFour/0600~0699/0693.Binary-Number-with-Alternating-Bits.md" >}})|Easy| O(n)| O(1)|❤️|61.3%|
-|0756|Pyramid Transition Matrix|[Go]({{< relref "/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md" >}})|Medium| O(n log n)| O(n)||53.3%|
-|0762|Prime Number of Set Bits in Binary Representation|[Go]({{< relref "/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md" >}})|Easy| O(n)| O(1)||67.7%|
-|0784|Letter Case Permutation|[Go]({{< relref "/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md" >}})|Medium| O(n)| O(1)||73.4%|
-|0810|Chalkboard XOR Game|[Go]({{< relref "/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md" >}})|Hard||||55.1%|
-|0864|Shortest Path to Get All Keys|[Go]({{< relref "/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md" >}})|Hard||||45.4%|
-|0898|Bitwise ORs of Subarrays|[Go]({{< relref "/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md" >}})|Medium| O(n)| O(1)||36.8%|
-|0980|Unique Paths III|[Go]({{< relref "/ChapterFour/0900~0999/0980.Unique-Paths-III.md" >}})|Hard||||79.6%|
-|0995|Minimum Number of K Consecutive Bit Flips|[Go]({{< relref "/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md" >}})|Hard||||51.1%|
-|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard||||49.3%|
-|1009|Complement of Base 10 Integer|[Go]({{< relref "/ChapterFour/1000~1099/1009.Complement-of-Base-10-Integer.md" >}})|Easy||||62.0%|
-|1178|Number of Valid Words for Each Puzzle|[Go]({{< relref "/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md" >}})|Hard||||46.6%|
+|0389|Find the Difference|[Go]({{< relref "/ChapterFour/0300~0399/0389.Find-the-Difference.md" >}})|Easy| O(n)| O(1)||60.0%|
+|0393|UTF-8 Validation|[Go]({{< relref "/ChapterFour/0300~0399/0393.UTF-8-Validation.md" >}})|Medium| O(n)| O(1)||45.1%|
+|0397|Integer Replacement|[Go]({{< relref "/ChapterFour/0300~0399/0397.Integer-Replacement.md" >}})|Medium| O(n)| O(1)||35.2%|
+|0401|Binary Watch|[Go]({{< relref "/ChapterFour/0400~0499/0401.Binary-Watch.md" >}})|Easy| O(1)| O(1)||52.2%|
+|0405|Convert a Number to Hexadecimal|[Go]({{< relref "/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md" >}})|Easy| O(n)| O(1)||46.7%|
+|0421|Maximum XOR of Two Numbers in an Array|[Go]({{< relref "/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md" >}})|Medium| O(n)| O(1)|❤️|54.1%|
+|0461|Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0461.Hamming-Distance.md" >}})|Easy| O(n)| O(1)||75.0%|
+|0473|Matchsticks to Square|[Go]({{< relref "/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md" >}})|Medium||||40.2%|
+|0476|Number Complement|[Go]({{< relref "/ChapterFour/0400~0499/0476.Number-Complement.md" >}})|Easy| O(n)| O(1)||67.3%|
+|0477|Total Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md" >}})|Medium| O(n)| O(1)||52.1%|
+|0491|Non-decreasing Subsequences|[Go]({{< relref "/ChapterFour/0400~0499/0491.Non-decreasing-Subsequences.md" >}})|Medium||||60.1%|
+|0526|Beautiful Arrangement|[Go]({{< relref "/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md" >}})|Medium||||64.5%|
+|0638|Shopping Offers|[Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}})|Medium||||53.3%|
+|0645|Set Mismatch|[Go]({{< relref "/ChapterFour/0600~0699/0645.Set-Mismatch.md" >}})|Easy||||42.8%|
+|0693|Binary Number with Alternating Bits|[Go]({{< relref "/ChapterFour/0600~0699/0693.Binary-Number-with-Alternating-Bits.md" >}})|Easy| O(n)| O(1)|❤️|61.6%|
+|0756|Pyramid Transition Matrix|[Go]({{< relref "/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md" >}})|Medium| O(n log n)| O(n)||52.7%|
+|0762|Prime Number of Set Bits in Binary Representation|[Go]({{< relref "/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md" >}})|Easy| O(n)| O(1)||68.0%|
+|0784|Letter Case Permutation|[Go]({{< relref "/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md" >}})|Medium| O(n)| O(1)||73.8%|
+|0810|Chalkboard XOR Game|[Go]({{< relref "/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md" >}})|Hard||||56.2%|
+|0864|Shortest Path to Get All Keys|[Go]({{< relref "/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md" >}})|Hard||||45.5%|
+|0898|Bitwise ORs of Subarrays|[Go]({{< relref "/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md" >}})|Medium| O(n)| O(1)||37.2%|
+|0980|Unique Paths III|[Go]({{< relref "/ChapterFour/0900~0999/0980.Unique-Paths-III.md" >}})|Hard||||81.9%|
+|0995|Minimum Number of K Consecutive Bit Flips|[Go]({{< relref "/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md" >}})|Hard||||51.2%|
+|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard||||49.2%|
+|1009|Complement of Base 10 Integer|[Go]({{< relref "/ChapterFour/1000~1099/1009.Complement-of-Base-10-Integer.md" >}})|Easy||||61.6%|
+|1178|Number of Valid Words for Each Puzzle|[Go]({{< relref "/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md" >}})|Hard||||46.3%|
|1239|Maximum Length of a Concatenated String with Unique Characters|[Go]({{< relref "/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md" >}})|Medium||||52.2%|
-|1310|XOR Queries of a Subarray|[Go]({{< relref "/ChapterFour/1300~1399/1310.XOR-Queries-of-a-Subarray.md" >}})|Medium||||72.2%|
-|1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go]({{< relref "/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md" >}})|Medium||||75.6%|
-|1461|Check If a String Contains All Binary Codes of Size K|[Go]({{< relref "/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md" >}})|Medium||||56.8%|
-|1486|XOR Operation in an Array|[Go]({{< relref "/ChapterFour/1400~1499/1486.XOR-Operation-in-an-Array.md" >}})|Easy||||84.2%|
-|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||39.6%|
-|1659|Maximize Grid Happiness|[Go]({{< relref "/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md" >}})|Hard||||38.4%|
+|1310|XOR Queries of a Subarray|[Go]({{< relref "/ChapterFour/1300~1399/1310.XOR-Queries-of-a-Subarray.md" >}})|Medium||||72.3%|
+|1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go]({{< relref "/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md" >}})|Medium||||76.0%|
+|1461|Check If a String Contains All Binary Codes of Size K|[Go]({{< relref "/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md" >}})|Medium||||56.6%|
+|1486|XOR Operation in an Array|[Go]({{< relref "/ChapterFour/1400~1499/1486.XOR-Operation-in-an-Array.md" >}})|Easy||||84.6%|
+|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||38.9%|
+|1659|Maximize Grid Happiness|[Go]({{< relref "/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md" >}})|Hard||||38.2%|
|1680|Concatenation of Consecutive Binary Numbers|[Go]({{< relref "/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md" >}})|Medium||||57.0%|
|1681|Minimum Incompatibility|[Go]({{< relref "/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md" >}})|Hard||||37.4%|
-|1684|Count the Number of Consistent Strings|[Go]({{< relref "/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md" >}})|Easy||||81.8%|
-|1720|Decode XORed Array|[Go]({{< relref "/ChapterFour/1700~1799/1720.Decode-XORed-Array.md" >}})|Easy||||86.0%|
-|1734|Decode XORed Permutation|[Go]({{< relref "/ChapterFour/1700~1799/1734.Decode-XORed-Permutation.md" >}})|Medium||||62.3%|
-|1738|Find Kth Largest XOR Coordinate Value|[Go]({{< relref "/ChapterFour/1700~1799/1738.Find-Kth-Largest-XOR-Coordinate-Value.md" >}})|Medium||||61.5%|
-|1763|Longest Nice Substring|[Go]({{< relref "/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md" >}})|Easy||||61.7%|
+|1684|Count the Number of Consistent Strings|[Go]({{< relref "/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md" >}})|Easy||||82.2%|
+|1720|Decode XORed Array|[Go]({{< relref "/ChapterFour/1700~1799/1720.Decode-XORed-Array.md" >}})|Easy||||85.8%|
+|1734|Decode XORed Permutation|[Go]({{< relref "/ChapterFour/1700~1799/1734.Decode-XORed-Permutation.md" >}})|Medium||||63.0%|
+|1738|Find Kth Largest XOR Coordinate Value|[Go]({{< relref "/ChapterFour/1700~1799/1738.Find-Kth-Largest-XOR-Coordinate-Value.md" >}})|Medium||||61.0%|
+|1763|Longest Nice Substring|[Go]({{< relref "/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md" >}})|Easy||||61.6%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+-----|-------| ----------------| ---------------|-------------|-------------|-------------|
+
----------------------------------------------
diff --git a/website/content/ChapterTwo/Breadth_First_Search.md b/website/content/ChapterTwo/Breadth_First_Search.md
index 864a56164..0862f629b 100644
--- a/website/content/ChapterTwo/Breadth_First_Search.md
+++ b/website/content/ChapterTwo/Breadth_First_Search.md
@@ -9,91 +9,94 @@ weight: 10
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
-|0100|Same Tree|[Go]({{< relref "/ChapterFour/0100~0199/0100.Same-Tree.md" >}})|Easy||||56.3%|
-|0101|Symmetric Tree|[Go]({{< relref "/ChapterFour/0100~0199/0101.Symmetric-Tree.md" >}})|Easy| O(n)| O(1)||52.9%|
-|0102|Binary Tree Level Order Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md" >}})|Medium| O(n)| O(1)||63.2%|
-|0103|Binary Tree Zigzag Level Order Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md" >}})|Medium| O(n)| O(n)||55.1%|
-|0104|Maximum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md" >}})|Easy||||73.1%|
-|0107|Binary Tree Level Order Traversal II|[Go]({{< relref "/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md" >}})|Medium| O(n)| O(1)||60.3%|
-|0111|Minimum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||43.5%|
-|0112|Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0112.Path-Sum.md" >}})|Easy||||47.6%|
-|0116|Populating Next Right Pointers in Each Node|[Go]({{< relref "/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md" >}})|Medium||||59.3%|
-|0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard| O(n)| O(n^2)|❤️|27.6%|
-|0127|Word Ladder|[Go]({{< relref "/ChapterFour/0100~0199/0127.Word-Ladder.md" >}})|Hard| O(n)| O(n)||36.6%|
-|0130|Surrounded Regions|[Go]({{< relref "/ChapterFour/0100~0199/0130.Surrounded-Regions.md" >}})|Medium||||35.9%|
-|0199|Binary Tree Right Side View|[Go]({{< relref "/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md" >}})|Medium| O(n)| O(1)||61.2%|
-|0200|Number of Islands|[Go]({{< relref "/ChapterFour/0200~0299/0200.Number-of-Islands.md" >}})|Medium| O(n^2)| O(n^2)||56.2%|
-|0207|Course Schedule|[Go]({{< relref "/ChapterFour/0200~0299/0207.Course-Schedule.md" >}})|Medium| O(n^2)| O(n^2)||45.3%|
-|0210|Course Schedule II|[Go]({{< relref "/ChapterFour/0200~0299/0210.Course-Schedule-II.md" >}})|Medium| O(n^2)| O(n^2)||47.9%|
-|0226|Invert Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md" >}})|Easy||||73.2%|
-|0279|Perfect Squares|[Go]({{< relref "/ChapterFour/0200~0299/0279.Perfect-Squares.md" >}})|Medium||||52.1%|
-|0297|Serialize and Deserialize Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md" >}})|Hard||||54.9%|
-|0301|Remove Invalid Parentheses|[Go]({{< relref "/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses.md" >}})|Hard||||47.1%|
-|0322|Coin Change|[Go]({{< relref "/ChapterFour/0300~0399/0322.Coin-Change.md" >}})|Medium||||41.5%|
-|0329|Longest Increasing Path in a Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md" >}})|Hard||||52.1%|
-|0399|Evaluate Division|[Go]({{< relref "/ChapterFour/0300~0399/0399.Evaluate-Division.md" >}})|Medium||||59.5%|
-|0404|Sum of Left Leaves|[Go]({{< relref "/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md" >}})|Easy||||56.2%|
-|0417|Pacific Atlantic Water Flow|[Go]({{< relref "/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow.md" >}})|Medium||||54.0%|
-|0429|N-ary Tree Level Order Traversal|[Go]({{< relref "/ChapterFour/0400~0499/0429.N-ary-Tree-Level-Order-Traversal.md" >}})|Medium||||70.6%|
-|0433|Minimum Genetic Mutation|[Go]({{< relref "/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md" >}})|Medium||||48.1%|
-|0463|Island Perimeter|[Go]({{< relref "/ChapterFour/0400~0499/0463.Island-Perimeter.md" >}})|Easy||||69.5%|
-|0488|Zuma Game|[Go]({{< relref "/ChapterFour/0400~0499/0488.Zuma-Game.md" >}})|Hard||||34.8%|
-|0513|Find Bottom Left Tree Value|[Go]({{< relref "/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md" >}})|Medium||||66.4%|
+|0100|Same Tree|[Go]({{< relref "/ChapterFour/0100~0199/0100.Same-Tree.md" >}})|Easy||||58.0%|
+|0101|Symmetric Tree|[Go]({{< relref "/ChapterFour/0100~0199/0101.Symmetric-Tree.md" >}})|Easy| O(n)| O(1)||54.2%|
+|0102|Binary Tree Level Order Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md" >}})|Medium| O(n)| O(1)||64.2%|
+|0103|Binary Tree Zigzag Level Order Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md" >}})|Medium| O(n)| O(n)||56.8%|
+|0104|Maximum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md" >}})|Easy||||73.9%|
+|0107|Binary Tree Level Order Traversal II|[Go]({{< relref "/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md" >}})|Medium| O(n)| O(1)||61.0%|
+|0111|Minimum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||44.3%|
+|0112|Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0112.Path-Sum.md" >}})|Easy||||48.2%|
+|0116|Populating Next Right Pointers in Each Node|[Go]({{< relref "/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md" >}})|Medium||||60.3%|
+|0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard| O(n)| O(n^2)|❤️|27.5%|
+|0127|Word Ladder|[Go]({{< relref "/ChapterFour/0100~0199/0127.Word-Ladder.md" >}})|Hard| O(n)| O(n)||37.1%|
+|0130|Surrounded Regions|[Go]({{< relref "/ChapterFour/0100~0199/0130.Surrounded-Regions.md" >}})|Medium||||36.6%|
+|0199|Binary Tree Right Side View|[Go]({{< relref "/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md" >}})|Medium| O(n)| O(1)||61.6%|
+|0200|Number of Islands|[Go]({{< relref "/ChapterFour/0200~0299/0200.Number-of-Islands.md" >}})|Medium| O(n^2)| O(n^2)||56.9%|
+|0207|Course Schedule|[Go]({{< relref "/ChapterFour/0200~0299/0207.Course-Schedule.md" >}})|Medium| O(n^2)| O(n^2)||45.4%|
+|0210|Course Schedule II|[Go]({{< relref "/ChapterFour/0200~0299/0210.Course-Schedule-II.md" >}})|Medium| O(n^2)| O(n^2)||48.4%|
+|0226|Invert Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md" >}})|Easy||||74.6%|
+|0279|Perfect Squares|[Go]({{< relref "/ChapterFour/0200~0299/0279.Perfect-Squares.md" >}})|Medium||||52.6%|
+|0297|Serialize and Deserialize Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md" >}})|Hard||||55.4%|
+|0301|Remove Invalid Parentheses|[Go]({{< relref "/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses.md" >}})|Hard||||47.2%|
+|0322|Coin Change|[Go]({{< relref "/ChapterFour/0300~0399/0322.Coin-Change.md" >}})|Medium||||42.0%|
+|0329|Longest Increasing Path in a Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md" >}})|Hard||||52.4%|
+|0399|Evaluate Division|[Go]({{< relref "/ChapterFour/0300~0399/0399.Evaluate-Division.md" >}})|Medium||||59.6%|
+|0404|Sum of Left Leaves|[Go]({{< relref "/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md" >}})|Easy||||56.7%|
+|0417|Pacific Atlantic Water Flow|[Go]({{< relref "/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow.md" >}})|Medium||||54.4%|
+|0429|N-ary Tree Level Order Traversal|[Go]({{< relref "/ChapterFour/0400~0499/0429.N-ary-Tree-Level-Order-Traversal.md" >}})|Medium||||70.7%|
+|0433|Minimum Genetic Mutation|[Go]({{< relref "/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md" >}})|Medium||||52.3%|
+|0463|Island Perimeter|[Go]({{< relref "/ChapterFour/0400~0499/0463.Island-Perimeter.md" >}})|Easy||||69.7%|
+|0488|Zuma Game|[Go]({{< relref "/ChapterFour/0400~0499/0488.Zuma-Game.md" >}})|Hard||||34.0%|
+|0513|Find Bottom Left Tree Value|[Go]({{< relref "/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md" >}})|Medium||||66.8%|
|0515|Find Largest Value in Each Tree Row|[Go]({{< relref "/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md" >}})|Medium| O(n)| O(n)||64.6%|
-|0529|Minesweeper|[Go]({{< relref "/ChapterFour/0500~0599/0529.Minesweeper.md" >}})|Medium||||65.5%|
-|0530|Minimum Absolute Difference in BST|[Go]({{< relref "/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST.md" >}})|Easy||||56.8%|
-|0542|01 Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0542.01-Matrix.md" >}})|Medium| O(n)| O(1)||44.2%|
-|0547|Number of Provinces|[Go]({{< relref "/ChapterFour/0500~0599/0547.Number-of-Provinces.md" >}})|Medium||||63.3%|
-|0559|Maximum Depth of N-ary Tree|[Go]({{< relref "/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree.md" >}})|Easy||||71.6%|
-|0617|Merge Two Binary Trees|[Go]({{< relref "/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees.md" >}})|Easy||||78.5%|
-|0623|Add One Row to Tree|[Go]({{< relref "/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree.md" >}})|Medium||||59.4%|
-|0637|Average of Levels in Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md" >}})|Easy||||71.6%|
-|0653|Two Sum IV - Input is a BST|[Go]({{< relref "/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md" >}})|Easy||||60.9%|
-|0662|Maximum Width of Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md" >}})|Medium||||40.6%|
-|0684|Redundant Connection|[Go]({{< relref "/ChapterFour/0600~0699/0684.Redundant-Connection.md" >}})|Medium||||62.0%|
+|0529|Minesweeper|[Go]({{< relref "/ChapterFour/0500~0599/0529.Minesweeper.md" >}})|Medium||||65.7%|
+|0530|Minimum Absolute Difference in BST|[Go]({{< relref "/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST.md" >}})|Easy||||57.3%|
+|0542|01 Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0542.01-Matrix.md" >}})|Medium| O(n)| O(1)||44.7%|
+|0547|Number of Provinces|[Go]({{< relref "/ChapterFour/0500~0599/0547.Number-of-Provinces.md" >}})|Medium||||63.7%|
+|0559|Maximum Depth of N-ary Tree|[Go]({{< relref "/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree.md" >}})|Easy||||71.7%|
+|0617|Merge Two Binary Trees|[Go]({{< relref "/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees.md" >}})|Easy||||78.6%|
+|0623|Add One Row to Tree|[Go]({{< relref "/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree.md" >}})|Medium||||59.5%|
+|0637|Average of Levels in Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md" >}})|Easy||||71.8%|
+|0653|Two Sum IV - Input is a BST|[Go]({{< relref "/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md" >}})|Easy||||61.0%|
+|0662|Maximum Width of Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md" >}})|Medium||||40.7%|
+|0684|Redundant Connection|[Go]({{< relref "/ChapterFour/0600~0699/0684.Redundant-Connection.md" >}})|Medium||||62.2%|
|0685|Redundant Connection II|[Go]({{< relref "/ChapterFour/0600~0699/0685.Redundant-Connection-II.md" >}})|Hard||||34.1%|
-|0690|Employee Importance|[Go]({{< relref "/ChapterFour/0600~0699/0690.Employee-Importance.md" >}})|Medium||||65.1%|
-|0695|Max Area of Island|[Go]({{< relref "/ChapterFour/0600~0699/0695.Max-Area-of-Island.md" >}})|Medium||||71.7%|
+|0690|Employee Importance|[Go]({{< relref "/ChapterFour/0600~0699/0690.Employee-Importance.md" >}})|Medium||||65.5%|
+|0695|Max Area of Island|[Go]({{< relref "/ChapterFour/0600~0699/0695.Max-Area-of-Island.md" >}})|Medium||||71.8%|
|0721|Accounts Merge|[Go]({{< relref "/ChapterFour/0700~0799/0721.Accounts-Merge.md" >}})|Medium||||56.3%|
-|0733|Flood Fill|[Go]({{< relref "/ChapterFour/0700~0799/0733.Flood-Fill.md" >}})|Easy||||60.4%|
-|0752|Open the Lock|[Go]({{< relref "/ChapterFour/0700~0799/0752.Open-the-Lock.md" >}})|Medium||||55.5%|
-|0756|Pyramid Transition Matrix|[Go]({{< relref "/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md" >}})|Medium||||53.3%|
-|0765|Couples Holding Hands|[Go]({{< relref "/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md" >}})|Hard||||56.9%|
-|0778|Swim in Rising Water|[Go]({{< relref "/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md" >}})|Hard||||59.6%|
-|0783|Minimum Distance Between BST Nodes|[Go]({{< relref "/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes.md" >}})|Easy||||56.8%|
-|0785|Is Graph Bipartite?|[Go]({{< relref "/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md" >}})|Medium||||52.6%|
-|0802|Find Eventual Safe States|[Go]({{< relref "/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States.md" >}})|Medium||||54.9%|
-|0815|Bus Routes|[Go]({{< relref "/ChapterFour/0800~0899/0815.Bus-Routes.md" >}})|Hard||||45.7%|
-|0839|Similar String Groups|[Go]({{< relref "/ChapterFour/0800~0899/0839.Similar-String-Groups.md" >}})|Hard||||47.6%|
-|0841|Keys and Rooms|[Go]({{< relref "/ChapterFour/0800~0899/0841.Keys-and-Rooms.md" >}})|Medium||||70.1%|
-|0863|All Nodes Distance K in Binary Tree|[Go]({{< relref "/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})|Medium||||62.1%|
-|0864|Shortest Path to Get All Keys|[Go]({{< relref "/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md" >}})|Hard||||45.4%|
-|0909|Snakes and Ladders|[Go]({{< relref "/ChapterFour/0900~0999/0909.Snakes-and-Ladders.md" >}})|Medium||||40.9%|
+|0733|Flood Fill|[Go]({{< relref "/ChapterFour/0700~0799/0733.Flood-Fill.md" >}})|Easy||||61.8%|
+|0752|Open the Lock|[Go]({{< relref "/ChapterFour/0700~0799/0752.Open-the-Lock.md" >}})|Medium||||55.6%|
+|0756|Pyramid Transition Matrix|[Go]({{< relref "/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md" >}})|Medium||||52.7%|
+|0765|Couples Holding Hands|[Go]({{< relref "/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md" >}})|Hard||||56.8%|
+|0778|Swim in Rising Water|[Go]({{< relref "/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md" >}})|Hard||||59.8%|
+|0783|Minimum Distance Between BST Nodes|[Go]({{< relref "/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes.md" >}})|Easy||||59.3%|
+|0785|Is Graph Bipartite?|[Go]({{< relref "/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md" >}})|Medium||||53.1%|
+|0802|Find Eventual Safe States|[Go]({{< relref "/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States.md" >}})|Medium||||56.4%|
+|0815|Bus Routes|[Go]({{< relref "/ChapterFour/0800~0899/0815.Bus-Routes.md" >}})|Hard||||45.6%|
+|0839|Similar String Groups|[Go]({{< relref "/ChapterFour/0800~0899/0839.Similar-String-Groups.md" >}})|Hard||||48.0%|
+|0841|Keys and Rooms|[Go]({{< relref "/ChapterFour/0800~0899/0841.Keys-and-Rooms.md" >}})|Medium||||71.5%|
+|0863|All Nodes Distance K in Binary Tree|[Go]({{< relref "/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})|Medium||||62.3%|
+|0864|Shortest Path to Get All Keys|[Go]({{< relref "/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md" >}})|Hard||||45.5%|
+|0909|Snakes and Ladders|[Go]({{< relref "/ChapterFour/0900~0999/0909.Snakes-and-Ladders.md" >}})|Medium||||45.1%|
|0924|Minimize Malware Spread|[Go]({{< relref "/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md" >}})|Hard||||42.1%|
-|0928|Minimize Malware Spread II|[Go]({{< relref "/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md" >}})|Hard||||42.6%|
-|0958|Check Completeness of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0958.Check-Completeness-of-a-Binary-Tree.md" >}})|Medium||||53.8%|
-|0959|Regions Cut By Slashes|[Go]({{< relref "/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md" >}})|Medium||||69.1%|
-|0987|Vertical Order Traversal of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md" >}})|Hard||||44.6%|
-|0993|Cousins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md" >}})|Easy| O(n)| O(1)||54.1%|
-|1020|Number of Enclaves|[Go]({{< relref "/ChapterFour/1000~1099/1020.Number-of-Enclaves.md" >}})|Medium||||64.8%|
-|1034|Coloring A Border|[Go]({{< relref "/ChapterFour/1000~1099/1034.Coloring-A-Border.md" >}})|Medium||||48.9%|
-|1091|Shortest Path in Binary Matrix|[Go]({{< relref "/ChapterFour/1000~1099/1091.Shortest-Path-in-Binary-Matrix.md" >}})|Medium||||44.5%|
-|1123|Lowest Common Ancestor of Deepest Leaves|[Go]({{< relref "/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}})|Medium||||70.6%|
+|0928|Minimize Malware Spread II|[Go]({{< relref "/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md" >}})|Hard||||42.7%|
+|0958|Check Completeness of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0958.Check-Completeness-of-a-Binary-Tree.md" >}})|Medium||||55.7%|
+|0959|Regions Cut By Slashes|[Go]({{< relref "/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md" >}})|Medium||||69.2%|
+|0987|Vertical Order Traversal of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md" >}})|Hard||||45.0%|
+|0993|Cousins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md" >}})|Easy| O(n)| O(1)||54.6%|
+|1020|Number of Enclaves|[Go]({{< relref "/ChapterFour/1000~1099/1020.Number-of-Enclaves.md" >}})|Medium||||65.5%|
+|1034|Coloring A Border|[Go]({{< relref "/ChapterFour/1000~1099/1034.Coloring-A-Border.md" >}})|Medium||||49.2%|
+|1091|Shortest Path in Binary Matrix|[Go]({{< relref "/ChapterFour/1000~1099/1091.Shortest-Path-in-Binary-Matrix.md" >}})|Medium||||44.6%|
+|1123|Lowest Common Ancestor of Deepest Leaves|[Go]({{< relref "/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}})|Medium||||70.9%|
|1202|Smallest String With Swaps|[Go]({{< relref "/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md" >}})|Medium||||57.6%|
-|1203|Sort Items by Groups Respecting Dependencies|[Go]({{< relref "/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies.md" >}})|Hard||||50.6%|
-|1254|Number of Closed Islands|[Go]({{< relref "/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md" >}})|Medium||||64.2%|
-|1293|Shortest Path in a Grid with Obstacles Elimination|[Go]({{< relref "/ChapterFour/1200~1299/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination.md" >}})|Hard||||43.6%|
-|1302|Deepest Leaves Sum|[Go]({{< relref "/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md" >}})|Medium||||86.9%|
-|1306|Jump Game III|[Go]({{< relref "/ChapterFour/1300~1399/1306.Jump-Game-III.md" >}})|Medium||||63.0%|
-|1319|Number of Operations to Make Network Connected|[Go]({{< relref "/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md" >}})|Medium||||58.3%|
-|1609|Even Odd Tree|[Go]({{< relref "/ChapterFour/1600~1699/1609.Even-Odd-Tree.md" >}})|Medium||||53.7%|
-|1631|Path With Minimum Effort|[Go]({{< relref "/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md" >}})|Medium||||55.3%|
-|1654|Minimum Jumps to Reach Home|[Go]({{< relref "/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md" >}})|Medium||||28.6%|
+|1203|Sort Items by Groups Respecting Dependencies|[Go]({{< relref "/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies.md" >}})|Hard||||51.1%|
+|1254|Number of Closed Islands|[Go]({{< relref "/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md" >}})|Medium||||64.1%|
+|1293|Shortest Path in a Grid with Obstacles Elimination|[Go]({{< relref "/ChapterFour/1200~1299/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination.md" >}})|Hard||||45.4%|
+|1302|Deepest Leaves Sum|[Go]({{< relref "/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md" >}})|Medium||||86.7%|
+|1306|Jump Game III|[Go]({{< relref "/ChapterFour/1300~1399/1306.Jump-Game-III.md" >}})|Medium||||63.5%|
+|1319|Number of Operations to Make Network Connected|[Go]({{< relref "/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md" >}})|Medium||||58.9%|
+|1609|Even Odd Tree|[Go]({{< relref "/ChapterFour/1600~1699/1609.Even-Odd-Tree.md" >}})|Medium||||54.3%|
+|1631|Path With Minimum Effort|[Go]({{< relref "/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md" >}})|Medium||||55.6%|
+|1654|Minimum Jumps to Reach Home|[Go]({{< relref "/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md" >}})|Medium||||29.0%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+----|-------| ----------------| ---------------|-------------|-------------|-------------|
+----|-------| ----------------| ---------------|-------------|-------------|-------------|
+
----------------------------------------------
diff --git a/website/content/ChapterTwo/Depth_First_Search.md b/website/content/ChapterTwo/Depth_First_Search.md
index fdcb1aa30..bd5ea6ea4 100644
--- a/website/content/ChapterTwo/Depth_First_Search.md
+++ b/website/content/ChapterTwo/Depth_First_Search.md
@@ -9,118 +9,121 @@ weight: 9
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
-|0094|Binary Tree Inorder Traversal|[Go]({{< relref "/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md" >}})|Easy||||72.9%|
-|0098|Validate Binary Search Tree|[Go]({{< relref "/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||31.7%|
-|0099|Recover Binary Search Tree|[Go]({{< relref "/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||50.2%|
-|0100|Same Tree|[Go]({{< relref "/ChapterFour/0100~0199/0100.Same-Tree.md" >}})|Easy| O(n)| O(1)||56.3%|
-|0101|Symmetric Tree|[Go]({{< relref "/ChapterFour/0100~0199/0101.Symmetric-Tree.md" >}})|Easy| O(n)| O(1)||52.9%|
-|0104|Maximum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||73.1%|
-|0110|Balanced Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md" >}})|Easy| O(n)| O(1)||48.1%|
-|0111|Minimum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||43.5%|
-|0112|Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0112.Path-Sum.md" >}})|Easy| O(n)| O(1)||47.6%|
-|0113|Path Sum II|[Go]({{< relref "/ChapterFour/0100~0199/0113.Path-Sum-II.md" >}})|Medium| O(n)| O(1)||56.6%|
-|0114|Flatten Binary Tree to Linked List|[Go]({{< relref "/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})|Medium| O(n)| O(1)||61.1%|
-|0116|Populating Next Right Pointers in Each Node|[Go]({{< relref "/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md" >}})|Medium||||59.3%|
-|0124|Binary Tree Maximum Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md" >}})|Hard| O(n)| O(1)||38.4%|
-|0129|Sum Root to Leaf Numbers|[Go]({{< relref "/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md" >}})|Medium| O(n)| O(1)||58.6%|
-|0130|Surrounded Regions|[Go]({{< relref "/ChapterFour/0100~0199/0130.Surrounded-Regions.md" >}})|Medium||||35.9%|
-|0144|Binary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md" >}})|Easy||||64.6%|
-|0145|Binary Tree Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md" >}})|Easy||||66.5%|
-|0199|Binary Tree Right Side View|[Go]({{< relref "/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md" >}})|Medium| O(n)| O(1)||61.2%|
-|0200|Number of Islands|[Go]({{< relref "/ChapterFour/0200~0299/0200.Number-of-Islands.md" >}})|Medium| O(n^2)| O(n^2)||56.2%|
-|0207|Course Schedule|[Go]({{< relref "/ChapterFour/0200~0299/0207.Course-Schedule.md" >}})|Medium| O(n^2)| O(n^2)||45.3%|
-|0210|Course Schedule II|[Go]({{< relref "/ChapterFour/0200~0299/0210.Course-Schedule-II.md" >}})|Medium| O(n^2)| O(n^2)||47.9%|
-|0211|Design Add and Search Words Data Structure|[Go]({{< relref "/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure.md" >}})|Medium||||43.2%|
-|0222|Count Complete Tree Nodes|[Go]({{< relref "/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md" >}})|Medium||||57.4%|
-|0226|Invert Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md" >}})|Easy||||73.2%|
-|0230|Kth Smallest Element in a BST|[Go]({{< relref "/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST.md" >}})|Medium||||69.3%|
-|0235|Lowest Common Ancestor of a Binary Search Tree|[Go]({{< relref "/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md" >}})|Medium||||60.1%|
-|0236|Lowest Common Ancestor of a Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md" >}})|Medium||||57.9%|
-|0257|Binary Tree Paths|[Go]({{< relref "/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md" >}})|Easy| O(n)| O(1)||60.5%|
-|0297|Serialize and Deserialize Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md" >}})|Hard||||54.9%|
-|0329|Longest Increasing Path in a Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md" >}})|Hard||||52.1%|
-|0337|House Robber III|[Go]({{< relref "/ChapterFour/0300~0399/0337.House-Robber-III.md" >}})|Medium||||53.8%|
-|0341|Flatten Nested List Iterator|[Go]({{< relref "/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator.md" >}})|Medium||||61.5%|
-|0385|Mini Parser|[Go]({{< relref "/ChapterFour/0300~0399/0385.Mini-Parser.md" >}})|Medium||||36.5%|
-|0386|Lexicographical Numbers|[Go]({{< relref "/ChapterFour/0300~0399/0386.Lexicographical-Numbers.md" >}})|Medium||||60.5%|
-|0399|Evaluate Division|[Go]({{< relref "/ChapterFour/0300~0399/0399.Evaluate-Division.md" >}})|Medium||||59.5%|
-|0404|Sum of Left Leaves|[Go]({{< relref "/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md" >}})|Easy||||56.2%|
-|0417|Pacific Atlantic Water Flow|[Go]({{< relref "/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow.md" >}})|Medium||||54.0%|
-|0419|Battleships in a Board|[Go]({{< relref "/ChapterFour/0400~0499/0419.Battleships-in-a-Board.md" >}})|Medium||||74.6%|
-|0437|Path Sum III|[Go]({{< relref "/ChapterFour/0400~0499/0437.Path-Sum-III.md" >}})|Medium||||48.8%|
-|0463|Island Perimeter|[Go]({{< relref "/ChapterFour/0400~0499/0463.Island-Perimeter.md" >}})|Easy||||69.5%|
-|0508|Most Frequent Subtree Sum|[Go]({{< relref "/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md" >}})|Medium||||64.3%|
-|0513|Find Bottom Left Tree Value|[Go]({{< relref "/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md" >}})|Medium||||66.4%|
+|0094|Binary Tree Inorder Traversal|[Go]({{< relref "/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md" >}})|Easy||||73.7%|
+|0098|Validate Binary Search Tree|[Go]({{< relref "/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||32.0%|
+|0099|Recover Binary Search Tree|[Go]({{< relref "/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||50.9%|
+|0100|Same Tree|[Go]({{< relref "/ChapterFour/0100~0199/0100.Same-Tree.md" >}})|Easy| O(n)| O(1)||58.0%|
+|0101|Symmetric Tree|[Go]({{< relref "/ChapterFour/0100~0199/0101.Symmetric-Tree.md" >}})|Easy| O(n)| O(1)||54.2%|
+|0104|Maximum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||73.9%|
+|0110|Balanced Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md" >}})|Easy| O(n)| O(1)||48.9%|
+|0111|Minimum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||44.3%|
+|0112|Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0112.Path-Sum.md" >}})|Easy| O(n)| O(1)||48.2%|
+|0113|Path Sum II|[Go]({{< relref "/ChapterFour/0100~0199/0113.Path-Sum-II.md" >}})|Medium| O(n)| O(1)||57.0%|
+|0114|Flatten Binary Tree to Linked List|[Go]({{< relref "/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})|Medium| O(n)| O(1)||61.7%|
+|0116|Populating Next Right Pointers in Each Node|[Go]({{< relref "/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md" >}})|Medium||||60.3%|
+|0124|Binary Tree Maximum Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md" >}})|Hard| O(n)| O(1)||39.2%|
+|0129|Sum Root to Leaf Numbers|[Go]({{< relref "/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md" >}})|Medium| O(n)| O(1)||60.9%|
+|0130|Surrounded Regions|[Go]({{< relref "/ChapterFour/0100~0199/0130.Surrounded-Regions.md" >}})|Medium||||36.6%|
+|0144|Binary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md" >}})|Easy||||66.7%|
+|0145|Binary Tree Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md" >}})|Easy||||67.8%|
+|0199|Binary Tree Right Side View|[Go]({{< relref "/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md" >}})|Medium| O(n)| O(1)||61.6%|
+|0200|Number of Islands|[Go]({{< relref "/ChapterFour/0200~0299/0200.Number-of-Islands.md" >}})|Medium| O(n^2)| O(n^2)||56.9%|
+|0207|Course Schedule|[Go]({{< relref "/ChapterFour/0200~0299/0207.Course-Schedule.md" >}})|Medium| O(n^2)| O(n^2)||45.4%|
+|0210|Course Schedule II|[Go]({{< relref "/ChapterFour/0200~0299/0210.Course-Schedule-II.md" >}})|Medium| O(n^2)| O(n^2)||48.4%|
+|0211|Design Add and Search Words Data Structure|[Go]({{< relref "/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure.md" >}})|Medium||||43.0%|
+|0222|Count Complete Tree Nodes|[Go]({{< relref "/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md" >}})|Medium||||60.4%|
+|0226|Invert Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md" >}})|Easy||||74.6%|
+|0230|Kth Smallest Element in a BST|[Go]({{< relref "/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST.md" >}})|Medium||||70.0%|
+|0235|Lowest Common Ancestor of a Binary Search Tree|[Go]({{< relref "/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md" >}})|Medium||||61.4%|
+|0236|Lowest Common Ancestor of a Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md" >}})|Medium||||58.7%|
+|0257|Binary Tree Paths|[Go]({{< relref "/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md" >}})|Easy| O(n)| O(1)||61.3%|
+|0297|Serialize and Deserialize Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md" >}})|Hard||||55.4%|
+|0329|Longest Increasing Path in a Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md" >}})|Hard||||52.4%|
+|0337|House Robber III|[Go]({{< relref "/ChapterFour/0300~0399/0337.House-Robber-III.md" >}})|Medium||||53.9%|
+|0341|Flatten Nested List Iterator|[Go]({{< relref "/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator.md" >}})|Medium||||61.8%|
+|0385|Mini Parser|[Go]({{< relref "/ChapterFour/0300~0399/0385.Mini-Parser.md" >}})|Medium||||36.9%|
+|0386|Lexicographical Numbers|[Go]({{< relref "/ChapterFour/0300~0399/0386.Lexicographical-Numbers.md" >}})|Medium||||61.5%|
+|0399|Evaluate Division|[Go]({{< relref "/ChapterFour/0300~0399/0399.Evaluate-Division.md" >}})|Medium||||59.6%|
+|0404|Sum of Left Leaves|[Go]({{< relref "/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md" >}})|Easy||||56.7%|
+|0417|Pacific Atlantic Water Flow|[Go]({{< relref "/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow.md" >}})|Medium||||54.4%|
+|0419|Battleships in a Board|[Go]({{< relref "/ChapterFour/0400~0499/0419.Battleships-in-a-Board.md" >}})|Medium||||74.8%|
+|0437|Path Sum III|[Go]({{< relref "/ChapterFour/0400~0499/0437.Path-Sum-III.md" >}})|Medium||||48.1%|
+|0463|Island Perimeter|[Go]({{< relref "/ChapterFour/0400~0499/0463.Island-Perimeter.md" >}})|Easy||||69.7%|
+|0508|Most Frequent Subtree Sum|[Go]({{< relref "/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md" >}})|Medium||||64.8%|
+|0513|Find Bottom Left Tree Value|[Go]({{< relref "/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md" >}})|Medium||||66.8%|
|0515|Find Largest Value in Each Tree Row|[Go]({{< relref "/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md" >}})|Medium| O(n)| O(n)||64.6%|
-|0529|Minesweeper|[Go]({{< relref "/ChapterFour/0500~0599/0529.Minesweeper.md" >}})|Medium||||65.5%|
-|0530|Minimum Absolute Difference in BST|[Go]({{< relref "/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST.md" >}})|Easy||||56.8%|
-|0538|Convert BST to Greater Tree|[Go]({{< relref "/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md" >}})|Medium||||67.3%|
-|0543|Diameter of Binary Tree|[Go]({{< relref "/ChapterFour/0500~0599/0543.Diameter-of-Binary-Tree.md" >}})|Easy||||55.9%|
-|0547|Number of Provinces|[Go]({{< relref "/ChapterFour/0500~0599/0547.Number-of-Provinces.md" >}})|Medium||||63.3%|
-|0559|Maximum Depth of N-ary Tree|[Go]({{< relref "/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree.md" >}})|Easy||||71.6%|
-|0563|Binary Tree Tilt|[Go]({{< relref "/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md" >}})|Easy||||59.4%|
-|0572|Subtree of Another Tree|[Go]({{< relref "/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree.md" >}})|Easy||||46.0%|
-|0589|N-ary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal.md" >}})|Easy||||76.3%|
-|0617|Merge Two Binary Trees|[Go]({{< relref "/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees.md" >}})|Easy||||78.5%|
-|0623|Add One Row to Tree|[Go]({{< relref "/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree.md" >}})|Medium||||59.4%|
-|0637|Average of Levels in Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md" >}})|Easy||||71.6%|
-|0653|Two Sum IV - Input is a BST|[Go]({{< relref "/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md" >}})|Easy||||60.9%|
-|0662|Maximum Width of Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md" >}})|Medium||||40.6%|
-|0669|Trim a Binary Search Tree|[Go]({{< relref "/ChapterFour/0600~0699/0669.Trim-a-Binary-Search-Tree.md" >}})|Medium||||66.3%|
-|0684|Redundant Connection|[Go]({{< relref "/ChapterFour/0600~0699/0684.Redundant-Connection.md" >}})|Medium||||62.0%|
+|0529|Minesweeper|[Go]({{< relref "/ChapterFour/0500~0599/0529.Minesweeper.md" >}})|Medium||||65.7%|
+|0530|Minimum Absolute Difference in BST|[Go]({{< relref "/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST.md" >}})|Easy||||57.3%|
+|0538|Convert BST to Greater Tree|[Go]({{< relref "/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md" >}})|Medium||||67.7%|
+|0543|Diameter of Binary Tree|[Go]({{< relref "/ChapterFour/0500~0599/0543.Diameter-of-Binary-Tree.md" >}})|Easy||||56.7%|
+|0547|Number of Provinces|[Go]({{< relref "/ChapterFour/0500~0599/0547.Number-of-Provinces.md" >}})|Medium||||63.7%|
+|0559|Maximum Depth of N-ary Tree|[Go]({{< relref "/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree.md" >}})|Easy||||71.7%|
+|0563|Binary Tree Tilt|[Go]({{< relref "/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md" >}})|Easy||||59.9%|
+|0572|Subtree of Another Tree|[Go]({{< relref "/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree.md" >}})|Easy||||46.3%|
+|0589|N-ary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal.md" >}})|Easy||||75.9%|
+|0617|Merge Two Binary Trees|[Go]({{< relref "/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees.md" >}})|Easy||||78.6%|
+|0623|Add One Row to Tree|[Go]({{< relref "/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree.md" >}})|Medium||||59.5%|
+|0637|Average of Levels in Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md" >}})|Easy||||71.8%|
+|0653|Two Sum IV - Input is a BST|[Go]({{< relref "/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md" >}})|Easy||||61.0%|
+|0662|Maximum Width of Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md" >}})|Medium||||40.7%|
+|0669|Trim a Binary Search Tree|[Go]({{< relref "/ChapterFour/0600~0699/0669.Trim-a-Binary-Search-Tree.md" >}})|Medium||||66.4%|
+|0684|Redundant Connection|[Go]({{< relref "/ChapterFour/0600~0699/0684.Redundant-Connection.md" >}})|Medium||||62.2%|
|0685|Redundant Connection II|[Go]({{< relref "/ChapterFour/0600~0699/0685.Redundant-Connection-II.md" >}})|Hard||||34.1%|
-|0690|Employee Importance|[Go]({{< relref "/ChapterFour/0600~0699/0690.Employee-Importance.md" >}})|Medium||||65.1%|
-|0695|Max Area of Island|[Go]({{< relref "/ChapterFour/0600~0699/0695.Max-Area-of-Island.md" >}})|Medium||||71.7%|
+|0690|Employee Importance|[Go]({{< relref "/ChapterFour/0600~0699/0690.Employee-Importance.md" >}})|Medium||||65.5%|
+|0695|Max Area of Island|[Go]({{< relref "/ChapterFour/0600~0699/0695.Max-Area-of-Island.md" >}})|Medium||||71.8%|
|0721|Accounts Merge|[Go]({{< relref "/ChapterFour/0700~0799/0721.Accounts-Merge.md" >}})|Medium||||56.3%|
-|0733|Flood Fill|[Go]({{< relref "/ChapterFour/0700~0799/0733.Flood-Fill.md" >}})|Easy||||60.4%|
-|0753|Cracking the Safe|[Go]({{< relref "/ChapterFour/0700~0799/0753.Cracking-the-Safe.md" >}})|Hard||||55.5%|
-|0756|Pyramid Transition Matrix|[Go]({{< relref "/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md" >}})|Medium||||53.3%|
-|0765|Couples Holding Hands|[Go]({{< relref "/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md" >}})|Hard||||56.9%|
-|0778|Swim in Rising Water|[Go]({{< relref "/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md" >}})|Hard||||59.6%|
-|0783|Minimum Distance Between BST Nodes|[Go]({{< relref "/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes.md" >}})|Easy||||56.8%|
-|0785|Is Graph Bipartite?|[Go]({{< relref "/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md" >}})|Medium||||52.6%|
-|0802|Find Eventual Safe States|[Go]({{< relref "/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States.md" >}})|Medium||||54.9%|
-|0834|Sum of Distances in Tree|[Go]({{< relref "/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md" >}})|Hard||||54.2%|
-|0839|Similar String Groups|[Go]({{< relref "/ChapterFour/0800~0899/0839.Similar-String-Groups.md" >}})|Hard||||47.6%|
-|0841|Keys and Rooms|[Go]({{< relref "/ChapterFour/0800~0899/0841.Keys-and-Rooms.md" >}})|Medium||||70.1%|
-|0851|Loud and Rich|[Go]({{< relref "/ChapterFour/0800~0899/0851.Loud-and-Rich.md" >}})|Medium||||58.2%|
-|0863|All Nodes Distance K in Binary Tree|[Go]({{< relref "/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})|Medium||||62.1%|
-|0872|Leaf-Similar Trees|[Go]({{< relref "/ChapterFour/0800~0899/0872.Leaf-Similar-Trees.md" >}})|Easy||||65.2%|
-|0897|Increasing Order Search Tree|[Go]({{< relref "/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md" >}})|Easy||||78.4%|
+|0733|Flood Fill|[Go]({{< relref "/ChapterFour/0700~0799/0733.Flood-Fill.md" >}})|Easy||||61.8%|
+|0753|Cracking the Safe|[Go]({{< relref "/ChapterFour/0700~0799/0753.Cracking-the-Safe.md" >}})|Hard||||55.8%|
+|0756|Pyramid Transition Matrix|[Go]({{< relref "/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md" >}})|Medium||||52.7%|
+|0765|Couples Holding Hands|[Go]({{< relref "/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md" >}})|Hard||||56.8%|
+|0778|Swim in Rising Water|[Go]({{< relref "/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md" >}})|Hard||||59.8%|
+|0783|Minimum Distance Between BST Nodes|[Go]({{< relref "/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes.md" >}})|Easy||||59.3%|
+|0785|Is Graph Bipartite?|[Go]({{< relref "/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md" >}})|Medium||||53.1%|
+|0802|Find Eventual Safe States|[Go]({{< relref "/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States.md" >}})|Medium||||56.4%|
+|0834|Sum of Distances in Tree|[Go]({{< relref "/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md" >}})|Hard||||59.3%|
+|0839|Similar String Groups|[Go]({{< relref "/ChapterFour/0800~0899/0839.Similar-String-Groups.md" >}})|Hard||||48.0%|
+|0841|Keys and Rooms|[Go]({{< relref "/ChapterFour/0800~0899/0841.Keys-and-Rooms.md" >}})|Medium||||71.5%|
+|0851|Loud and Rich|[Go]({{< relref "/ChapterFour/0800~0899/0851.Loud-and-Rich.md" >}})|Medium||||58.4%|
+|0863|All Nodes Distance K in Binary Tree|[Go]({{< relref "/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})|Medium||||62.3%|
+|0872|Leaf-Similar Trees|[Go]({{< relref "/ChapterFour/0800~0899/0872.Leaf-Similar-Trees.md" >}})|Easy||||67.6%|
+|0897|Increasing Order Search Tree|[Go]({{< relref "/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md" >}})|Easy||||78.5%|
|0924|Minimize Malware Spread|[Go]({{< relref "/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md" >}})|Hard||||42.1%|
-|0928|Minimize Malware Spread II|[Go]({{< relref "/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md" >}})|Hard||||42.6%|
-|0938|Range Sum of BST|[Go]({{< relref "/ChapterFour/0900~0999/0938.Range-Sum-of-BST.md" >}})|Easy||||85.3%|
-|0947|Most Stones Removed with Same Row or Column|[Go]({{< relref "/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md" >}})|Medium||||57.1%|
-|0959|Regions Cut By Slashes|[Go]({{< relref "/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md" >}})|Medium||||69.1%|
-|0968|Binary Tree Cameras|[Go]({{< relref "/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md" >}})|Hard||||46.8%|
-|0971|Flip Binary Tree To Match Preorder Traversal|[Go]({{< relref "/ChapterFour/0900~0999/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal.md" >}})|Medium||||49.9%|
-|0979|Distribute Coins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree.md" >}})|Medium||||72.0%|
-|0987|Vertical Order Traversal of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md" >}})|Hard||||44.6%|
-|0993|Cousins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md" >}})|Easy||||54.1%|
-|1020|Number of Enclaves|[Go]({{< relref "/ChapterFour/1000~1099/1020.Number-of-Enclaves.md" >}})|Medium||||64.8%|
-|1022|Sum of Root To Leaf Binary Numbers|[Go]({{< relref "/ChapterFour/1000~1099/1022.Sum-of-Root-To-Leaf-Binary-Numbers.md" >}})|Easy||||73.8%|
-|1026|Maximum Difference Between Node and Ancestor|[Go]({{< relref "/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md" >}})|Medium||||73.4%|
-|1028|Recover a Tree From Preorder Traversal|[Go]({{< relref "/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md" >}})|Hard||||72.8%|
-|1034|Coloring A Border|[Go]({{< relref "/ChapterFour/1000~1099/1034.Coloring-A-Border.md" >}})|Medium||||48.9%|
-|1038|Binary Search Tree to Greater Sum Tree|[Go]({{< relref "/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree.md" >}})|Medium||||85.4%|
+|0928|Minimize Malware Spread II|[Go]({{< relref "/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md" >}})|Hard||||42.7%|
+|0938|Range Sum of BST|[Go]({{< relref "/ChapterFour/0900~0999/0938.Range-Sum-of-BST.md" >}})|Easy||||85.9%|
+|0947|Most Stones Removed with Same Row or Column|[Go]({{< relref "/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md" >}})|Medium||||58.9%|
+|0959|Regions Cut By Slashes|[Go]({{< relref "/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md" >}})|Medium||||69.2%|
+|0968|Binary Tree Cameras|[Go]({{< relref "/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md" >}})|Hard||||46.7%|
+|0971|Flip Binary Tree To Match Preorder Traversal|[Go]({{< relref "/ChapterFour/0900~0999/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal.md" >}})|Medium||||50.1%|
+|0979|Distribute Coins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree.md" >}})|Medium||||72.2%|
+|0987|Vertical Order Traversal of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md" >}})|Hard||||45.0%|
+|0993|Cousins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md" >}})|Easy||||54.6%|
+|1020|Number of Enclaves|[Go]({{< relref "/ChapterFour/1000~1099/1020.Number-of-Enclaves.md" >}})|Medium||||65.5%|
+|1022|Sum of Root To Leaf Binary Numbers|[Go]({{< relref "/ChapterFour/1000~1099/1022.Sum-of-Root-To-Leaf-Binary-Numbers.md" >}})|Easy||||73.6%|
+|1026|Maximum Difference Between Node and Ancestor|[Go]({{< relref "/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md" >}})|Medium||||75.7%|
+|1028|Recover a Tree From Preorder Traversal|[Go]({{< relref "/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md" >}})|Hard||||73.2%|
+|1034|Coloring A Border|[Go]({{< relref "/ChapterFour/1000~1099/1034.Coloring-A-Border.md" >}})|Medium||||49.2%|
+|1038|Binary Search Tree to Greater Sum Tree|[Go]({{< relref "/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree.md" >}})|Medium||||85.5%|
|1110|Delete Nodes And Return Forest|[Go]({{< relref "/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md" >}})|Medium||||69.3%|
-|1123|Lowest Common Ancestor of Deepest Leaves|[Go]({{< relref "/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}})|Medium||||70.6%|
-|1145|Binary Tree Coloring Game|[Go]({{< relref "/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md" >}})|Medium||||51.4%|
+|1123|Lowest Common Ancestor of Deepest Leaves|[Go]({{< relref "/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}})|Medium||||70.9%|
+|1145|Binary Tree Coloring Game|[Go]({{< relref "/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md" >}})|Medium||||51.7%|
|1202|Smallest String With Swaps|[Go]({{< relref "/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md" >}})|Medium||||57.6%|
-|1203|Sort Items by Groups Respecting Dependencies|[Go]({{< relref "/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies.md" >}})|Hard||||50.6%|
-|1254|Number of Closed Islands|[Go]({{< relref "/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md" >}})|Medium||||64.2%|
-|1302|Deepest Leaves Sum|[Go]({{< relref "/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md" >}})|Medium||||86.9%|
+|1203|Sort Items by Groups Respecting Dependencies|[Go]({{< relref "/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies.md" >}})|Hard||||51.1%|
+|1254|Number of Closed Islands|[Go]({{< relref "/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md" >}})|Medium||||64.1%|
+|1302|Deepest Leaves Sum|[Go]({{< relref "/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md" >}})|Medium||||86.7%|
|1305|All Elements in Two Binary Search Trees|[Go]({{< relref "/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees.md" >}})|Medium||||79.8%|
-|1306|Jump Game III|[Go]({{< relref "/ChapterFour/1300~1399/1306.Jump-Game-III.md" >}})|Medium||||63.0%|
-|1319|Number of Operations to Make Network Connected|[Go]({{< relref "/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md" >}})|Medium||||58.3%|
-|1600|Throne Inheritance|[Go]({{< relref "/ChapterFour/1600~1699/1600.Throne-Inheritance.md" >}})|Medium||||63.7%|
-|1631|Path With Minimum Effort|[Go]({{< relref "/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md" >}})|Medium||||55.3%|
-|2096|Step-By-Step Directions From a Binary Tree Node to Another|[Go]({{< relref "/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.md" >}})|Medium||||48.8%|
+|1306|Jump Game III|[Go]({{< relref "/ChapterFour/1300~1399/1306.Jump-Game-III.md" >}})|Medium||||63.5%|
+|1319|Number of Operations to Make Network Connected|[Go]({{< relref "/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md" >}})|Medium||||58.9%|
+|1600|Throne Inheritance|[Go]({{< relref "/ChapterFour/1600~1699/1600.Throne-Inheritance.md" >}})|Medium||||63.6%|
+|1631|Path With Minimum Effort|[Go]({{< relref "/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md" >}})|Medium||||55.6%|
+|2096|Step-By-Step Directions From a Binary Tree Node to Another|[Go]({{< relref "/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.md" >}})|Medium||||48.5%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+-------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+-------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
----------------------------------------------
diff --git a/website/content/ChapterTwo/Dynamic_Programming.md b/website/content/ChapterTwo/Dynamic_Programming.md
index 0920901eb..e79015853 100644
--- a/website/content/ChapterTwo/Dynamic_Programming.md
+++ b/website/content/ChapterTwo/Dynamic_Programming.md
@@ -10,108 +10,111 @@ weight: 7
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
|0005|Longest Palindromic Substring|[Go]({{< relref "/ChapterFour/0001~0099/0005.Longest-Palindromic-Substring.md" >}})|Medium||||32.4%|
-|0022|Generate Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0022.Generate-Parentheses.md" >}})|Medium||||71.7%|
-|0032|Longest Valid Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses.md" >}})|Hard||||32.7%|
-|0042|Trapping Rain Water|[Go]({{< relref "/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md" >}})|Hard||||58.7%|
-|0045|Jump Game II|[Go]({{< relref "/ChapterFour/0001~0099/0045.Jump-Game-II.md" >}})|Medium||||38.5%|
-|0053|Maximum Subarray|[Go]({{< relref "/ChapterFour/0001~0099/0053.Maximum-Subarray.md" >}})|Medium| O(n)| O(n)||50.0%|
-|0055|Jump Game|[Go]({{< relref "/ChapterFour/0001~0099/0055.Jump-Game.md" >}})|Medium||||38.4%|
-|0062|Unique Paths|[Go]({{< relref "/ChapterFour/0001~0099/0062.Unique-Paths.md" >}})|Medium| O(n^2)| O(n^2)||62.2%|
-|0063|Unique Paths II|[Go]({{< relref "/ChapterFour/0001~0099/0063.Unique-Paths-II.md" >}})|Medium| O(n^2)| O(n^2)||39.1%|
-|0064|Minimum Path Sum|[Go]({{< relref "/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md" >}})|Medium| O(n^2)| O(n^2)||60.6%|
-|0070|Climbing Stairs|[Go]({{< relref "/ChapterFour/0001~0099/0070.Climbing-Stairs.md" >}})|Easy| O(n)| O(n)||51.7%|
-|0091|Decode Ways|[Go]({{< relref "/ChapterFour/0001~0099/0091.Decode-Ways.md" >}})|Medium| O(n)| O(n)||32.2%|
-|0095|Unique Binary Search Trees II|[Go]({{< relref "/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md" >}})|Medium||||51.4%|
-|0096|Unique Binary Search Trees|[Go]({{< relref "/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md" >}})|Medium| O(n)| O(n)||59.2%|
-|0097|Interleaving String|[Go]({{< relref "/ChapterFour/0001~0099/0097.Interleaving-String.md" >}})|Medium||||37.1%|
-|0115|Distinct Subsequences|[Go]({{< relref "/ChapterFour/0100~0199/0115.Distinct-Subsequences.md" >}})|Hard||||43.7%|
-|0118|Pascal's Triangle|[Go]({{< relref "/ChapterFour/0100~0199/0118.Pascals-Triangle.md" >}})|Easy||||68.9%|
-|0119|Pascal's Triangle II|[Go]({{< relref "/ChapterFour/0100~0199/0119.Pascals-Triangle-II.md" >}})|Easy||||59.5%|
-|0120|Triangle|[Go]({{< relref "/ChapterFour/0100~0199/0120.Triangle.md" >}})|Medium| O(n^2)| O(n)||53.8%|
-|0121|Best Time to Buy and Sell Stock|[Go]({{< relref "/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}})|Easy| O(n)| O(1)||54.5%|
-|0122|Best Time to Buy and Sell Stock II|[Go]({{< relref "/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II.md" >}})|Medium||||63.2%|
-|0124|Binary Tree Maximum Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md" >}})|Hard||||38.4%|
-|0131|Palindrome Partitioning|[Go]({{< relref "/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md" >}})|Medium||||62.3%|
+|0022|Generate Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0022.Generate-Parentheses.md" >}})|Medium||||72.4%|
+|0032|Longest Valid Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses.md" >}})|Hard||||32.8%|
+|0042|Trapping Rain Water|[Go]({{< relref "/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md" >}})|Hard||||59.2%|
+|0045|Jump Game II|[Go]({{< relref "/ChapterFour/0001~0099/0045.Jump-Game-II.md" >}})|Medium||||39.8%|
+|0053|Maximum Subarray|[Go]({{< relref "/ChapterFour/0001~0099/0053.Maximum-Subarray.md" >}})|Medium| O(n)| O(n)||50.2%|
+|0055|Jump Game|[Go]({{< relref "/ChapterFour/0001~0099/0055.Jump-Game.md" >}})|Medium||||38.9%|
+|0062|Unique Paths|[Go]({{< relref "/ChapterFour/0001~0099/0062.Unique-Paths.md" >}})|Medium| O(n^2)| O(n^2)||62.6%|
+|0063|Unique Paths II|[Go]({{< relref "/ChapterFour/0001~0099/0063.Unique-Paths-II.md" >}})|Medium| O(n^2)| O(n^2)||39.4%|
+|0064|Minimum Path Sum|[Go]({{< relref "/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md" >}})|Medium| O(n^2)| O(n^2)||61.1%|
+|0070|Climbing Stairs|[Go]({{< relref "/ChapterFour/0001~0099/0070.Climbing-Stairs.md" >}})|Easy| O(n)| O(n)||52.2%|
+|0091|Decode Ways|[Go]({{< relref "/ChapterFour/0001~0099/0091.Decode-Ways.md" >}})|Medium| O(n)| O(n)||32.7%|
+|0095|Unique Binary Search Trees II|[Go]({{< relref "/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md" >}})|Medium||||52.3%|
+|0096|Unique Binary Search Trees|[Go]({{< relref "/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md" >}})|Medium| O(n)| O(n)||59.6%|
+|0097|Interleaving String|[Go]({{< relref "/ChapterFour/0001~0099/0097.Interleaving-String.md" >}})|Medium||||37.3%|
+|0115|Distinct Subsequences|[Go]({{< relref "/ChapterFour/0100~0199/0115.Distinct-Subsequences.md" >}})|Hard||||44.4%|
+|0118|Pascal's Triangle|[Go]({{< relref "/ChapterFour/0100~0199/0118.Pascals-Triangle.md" >}})|Easy||||70.6%|
+|0119|Pascal's Triangle II|[Go]({{< relref "/ChapterFour/0100~0199/0119.Pascals-Triangle-II.md" >}})|Easy||||60.6%|
+|0120|Triangle|[Go]({{< relref "/ChapterFour/0100~0199/0120.Triangle.md" >}})|Medium| O(n^2)| O(n)||54.4%|
+|0121|Best Time to Buy and Sell Stock|[Go]({{< relref "/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}})|Easy| O(n)| O(1)||54.3%|
+|0122|Best Time to Buy and Sell Stock II|[Go]({{< relref "/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II.md" >}})|Medium||||63.8%|
+|0124|Binary Tree Maximum Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md" >}})|Hard||||39.2%|
+|0131|Palindrome Partitioning|[Go]({{< relref "/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md" >}})|Medium||||64.7%|
|0152|Maximum Product Subarray|[Go]({{< relref "/ChapterFour/0100~0199/0152.Maximum-Product-Subarray.md" >}})|Medium| O(n)| O(1)||34.9%|
-|0174|Dungeon Game|[Go]({{< relref "/ChapterFour/0100~0199/0174.Dungeon-Game.md" >}})|Hard||||37.2%|
-|0198|House Robber|[Go]({{< relref "/ChapterFour/0100~0199/0198.House-Robber.md" >}})|Medium| O(n)| O(n)||48.6%|
-|0213|House Robber II|[Go]({{< relref "/ChapterFour/0200~0299/0213.House-Robber-II.md" >}})|Medium| O(n)| O(n)||40.6%|
-|0264|Ugly Number II|[Go]({{< relref "/ChapterFour/0200~0299/0264.Ugly-Number-II.md" >}})|Medium||||46.1%|
-|0279|Perfect Squares|[Go]({{< relref "/ChapterFour/0200~0299/0279.Perfect-Squares.md" >}})|Medium||||52.2%|
-|0300|Longest Increasing Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md" >}})|Medium| O(n log n)| O(n)||51.5%|
-|0309|Best Time to Buy and Sell Stock with Cooldown|[Go]({{< relref "/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md" >}})|Medium| O(n)| O(n)||54.4%|
-|0322|Coin Change|[Go]({{< relref "/ChapterFour/0300~0399/0322.Coin-Change.md" >}})|Medium| O(n)| O(n)||41.5%|
-|0329|Longest Increasing Path in a Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md" >}})|Hard||||52.1%|
-|0337|House Robber III|[Go]({{< relref "/ChapterFour/0300~0399/0337.House-Robber-III.md" >}})|Medium||||53.8%|
-|0338|Counting Bits|[Go]({{< relref "/ChapterFour/0300~0399/0338.Counting-Bits.md" >}})|Easy| O(n)| O(n)||75.2%|
-|0343|Integer Break|[Go]({{< relref "/ChapterFour/0300~0399/0343.Integer-Break.md" >}})|Medium| O(n^2)| O(n)||55.3%|
-|0354|Russian Doll Envelopes|[Go]({{< relref "/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md" >}})|Hard||||38.3%|
-|0357|Count Numbers with Unique Digits|[Go]({{< relref "/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md" >}})|Medium| O(1)| O(1)||51.5%|
-|0368|Largest Divisible Subset|[Go]({{< relref "/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md" >}})|Medium||||41.2%|
-|0376|Wiggle Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0376.Wiggle-Subsequence.md" >}})|Medium||||48.2%|
-|0377|Combination Sum IV|[Go]({{< relref "/ChapterFour/0300~0399/0377.Combination-Sum-IV.md" >}})|Medium||||52.1%|
-|0392|Is Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0392.Is-Subsequence.md" >}})|Easy| O(n)| O(1)||49.3%|
-|0396|Rotate Function|[Go]({{< relref "/ChapterFour/0300~0399/0396.Rotate-Function.md" >}})|Medium||||40.3%|
-|0397|Integer Replacement|[Go]({{< relref "/ChapterFour/0300~0399/0397.Integer-Replacement.md" >}})|Medium||||35.1%|
-|0410|Split Array Largest Sum|[Go]({{< relref "/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md" >}})|Hard||||53.2%|
-|0413|Arithmetic Slices|[Go]({{< relref "/ChapterFour/0400~0499/0413.Arithmetic-Slices.md" >}})|Medium||||65.0%|
-|0416|Partition Equal Subset Sum|[Go]({{< relref "/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md" >}})|Medium| O(n^2)| O(n)||46.7%|
-|0435|Non-overlapping Intervals|[Go]({{< relref "/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md" >}})|Medium||||49.8%|
-|0458|Poor Pigs|[Go]({{< relref "/ChapterFour/0400~0499/0458.Poor-Pigs.md" >}})|Hard||||65.0%|
-|0473|Matchsticks to Square|[Go]({{< relref "/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md" >}})|Medium||||40.5%|
+|0174|Dungeon Game|[Go]({{< relref "/ChapterFour/0100~0199/0174.Dungeon-Game.md" >}})|Hard||||37.5%|
+|0198|House Robber|[Go]({{< relref "/ChapterFour/0100~0199/0198.House-Robber.md" >}})|Medium| O(n)| O(n)||49.4%|
+|0213|House Robber II|[Go]({{< relref "/ChapterFour/0200~0299/0213.House-Robber-II.md" >}})|Medium| O(n)| O(n)||41.0%|
+|0264|Ugly Number II|[Go]({{< relref "/ChapterFour/0200~0299/0264.Ugly-Number-II.md" >}})|Medium||||46.2%|
+|0279|Perfect Squares|[Go]({{< relref "/ChapterFour/0200~0299/0279.Perfect-Squares.md" >}})|Medium||||52.6%|
+|0300|Longest Increasing Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md" >}})|Medium| O(n log n)| O(n)||52.1%|
+|0309|Best Time to Buy and Sell Stock with Cooldown|[Go]({{< relref "/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md" >}})|Medium| O(n)| O(n)||56.2%|
+|0322|Coin Change|[Go]({{< relref "/ChapterFour/0300~0399/0322.Coin-Change.md" >}})|Medium| O(n)| O(n)||42.0%|
+|0329|Longest Increasing Path in a Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md" >}})|Hard||||52.4%|
+|0337|House Robber III|[Go]({{< relref "/ChapterFour/0300~0399/0337.House-Robber-III.md" >}})|Medium||||53.9%|
+|0338|Counting Bits|[Go]({{< relref "/ChapterFour/0300~0399/0338.Counting-Bits.md" >}})|Easy| O(n)| O(n)||75.7%|
+|0343|Integer Break|[Go]({{< relref "/ChapterFour/0300~0399/0343.Integer-Break.md" >}})|Medium| O(n^2)| O(n)||56.0%|
+|0354|Russian Doll Envelopes|[Go]({{< relref "/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md" >}})|Hard||||38.0%|
+|0357|Count Numbers with Unique Digits|[Go]({{< relref "/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md" >}})|Medium| O(1)| O(1)||51.8%|
+|0368|Largest Divisible Subset|[Go]({{< relref "/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md" >}})|Medium||||41.5%|
+|0376|Wiggle Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0376.Wiggle-Subsequence.md" >}})|Medium||||48.3%|
+|0377|Combination Sum IV|[Go]({{< relref "/ChapterFour/0300~0399/0377.Combination-Sum-IV.md" >}})|Medium||||52.2%|
+|0392|Is Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0392.Is-Subsequence.md" >}})|Easy| O(n)| O(1)||47.7%|
+|0396|Rotate Function|[Go]({{< relref "/ChapterFour/0300~0399/0396.Rotate-Function.md" >}})|Medium||||41.1%|
+|0397|Integer Replacement|[Go]({{< relref "/ChapterFour/0300~0399/0397.Integer-Replacement.md" >}})|Medium||||35.2%|
+|0410|Split Array Largest Sum|[Go]({{< relref "/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md" >}})|Hard||||53.5%|
+|0413|Arithmetic Slices|[Go]({{< relref "/ChapterFour/0400~0499/0413.Arithmetic-Slices.md" >}})|Medium||||65.1%|
+|0416|Partition Equal Subset Sum|[Go]({{< relref "/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md" >}})|Medium| O(n^2)| O(n)||46.3%|
+|0435|Non-overlapping Intervals|[Go]({{< relref "/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md" >}})|Medium||||50.2%|
+|0458|Poor Pigs|[Go]({{< relref "/ChapterFour/0400~0499/0458.Poor-Pigs.md" >}})|Hard||||63.0%|
+|0473|Matchsticks to Square|[Go]({{< relref "/ChapterFour/0400~0499/0473.Matchsticks-to-Square.md" >}})|Medium||||40.2%|
|0474|Ones and Zeroes|[Go]({{< relref "/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md" >}})|Medium||||46.7%|
-|0488|Zuma Game|[Go]({{< relref "/ChapterFour/0400~0499/0488.Zuma-Game.md" >}})|Hard||||34.9%|
-|0494|Target Sum|[Go]({{< relref "/ChapterFour/0400~0499/0494.Target-Sum.md" >}})|Medium||||45.6%|
-|0509|Fibonacci Number|[Go]({{< relref "/ChapterFour/0500~0599/0509.Fibonacci-Number.md" >}})|Easy||||69.2%|
-|0518|Coin Change II|[Go]({{< relref "/ChapterFour/0500~0599/0518.Coin-Change-II.md" >}})|Medium||||59.7%|
-|0526|Beautiful Arrangement|[Go]({{< relref "/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md" >}})|Medium||||64.6%|
-|0542|01 Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0542.01-Matrix.md" >}})|Medium||||44.1%|
+|0488|Zuma Game|[Go]({{< relref "/ChapterFour/0400~0499/0488.Zuma-Game.md" >}})|Hard||||34.0%|
+|0494|Target Sum|[Go]({{< relref "/ChapterFour/0400~0499/0494.Target-Sum.md" >}})|Medium||||45.7%|
+|0509|Fibonacci Number|[Go]({{< relref "/ChapterFour/0500~0599/0509.Fibonacci-Number.md" >}})|Easy||||69.8%|
+|0518|Coin Change II|[Go]({{< relref "/ChapterFour/0500~0599/0518.Coin-Change-II.md" >}})|Medium||||60.5%|
+|0526|Beautiful Arrangement|[Go]({{< relref "/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md" >}})|Medium||||64.5%|
+|0542|01 Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0542.01-Matrix.md" >}})|Medium||||44.7%|
|0576|Out of Boundary Paths|[Go]({{< relref "/ChapterFour/0500~0599/0576.Out-of-Boundary-Paths.md" >}})|Medium||||44.3%|
-|0583|Delete Operation for Two Strings|[Go]({{< relref "/ChapterFour/0500~0599/0583.Delete-Operation-for-Two-Strings.md" >}})|Medium||||59.2%|
-|0638|Shopping Offers|[Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}})|Medium||||54.3%|
-|0647|Palindromic Substrings|[Go]({{< relref "/ChapterFour/0600~0699/0647.Palindromic-Substrings.md" >}})|Medium||||66.3%|
-|0714|Best Time to Buy and Sell Stock with Transaction Fee|[Go]({{< relref "/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md" >}})|Medium| O(n)| O(1)||64.2%|
-|0718|Maximum Length of Repeated Subarray|[Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}})|Medium||||51.6%|
-|0746|Min Cost Climbing Stairs|[Go]({{< relref "/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md" >}})|Easy| O(n)| O(1)||62.3%|
-|0823|Binary Trees With Factors|[Go]({{< relref "/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors.md" >}})|Medium||||50.0%|
-|0828|Count Unique Characters of All Substrings of a Given String|[Go]({{< relref "/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md" >}})|Hard||||51.5%|
-|0834|Sum of Distances in Tree|[Go]({{< relref "/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md" >}})|Hard||||54.1%|
+|0583|Delete Operation for Two Strings|[Go]({{< relref "/ChapterFour/0500~0599/0583.Delete-Operation-for-Two-Strings.md" >}})|Medium||||59.7%|
+|0638|Shopping Offers|[Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}})|Medium||||53.3%|
+|0647|Palindromic Substrings|[Go]({{< relref "/ChapterFour/0600~0699/0647.Palindromic-Substrings.md" >}})|Medium||||66.8%|
+|0714|Best Time to Buy and Sell Stock with Transaction Fee|[Go]({{< relref "/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md" >}})|Medium| O(n)| O(1)||65.0%|
+|0718|Maximum Length of Repeated Subarray|[Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}})|Medium||||51.3%|
+|0746|Min Cost Climbing Stairs|[Go]({{< relref "/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md" >}})|Easy| O(n)| O(1)||63.1%|
+|0823|Binary Trees With Factors|[Go]({{< relref "/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors.md" >}})|Medium||||49.7%|
+|0828|Count Unique Characters of All Substrings of a Given String|[Go]({{< relref "/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md" >}})|Hard||||51.7%|
+|0834|Sum of Distances in Tree|[Go]({{< relref "/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md" >}})|Hard||||59.3%|
|0838|Push Dominoes|[Go]({{< relref "/ChapterFour/0800~0899/0838.Push-Dominoes.md" >}})|Medium| O(n)| O(n)||57.0%|
-|0845|Longest Mountain in Array|[Go]({{< relref "/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md" >}})|Medium||||40.1%|
+|0845|Longest Mountain in Array|[Go]({{< relref "/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md" >}})|Medium||||40.2%|
|0877|Stone Game|[Go]({{< relref "/ChapterFour/0800~0899/0877.Stone-Game.md" >}})|Medium||||69.7%|
|0887|Super Egg Drop|[Go]({{< relref "/ChapterFour/0800~0899/0887.Super-Egg-Drop.md" >}})|Hard||||27.2%|
-|0898|Bitwise ORs of Subarrays|[Go]({{< relref "/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md" >}})|Medium||||36.8%|
-|0907|Sum of Subarray Minimums|[Go]({{< relref "/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md" >}})|Medium||||34.3%|
-|0918|Maximum Sum Circular Subarray|[Go]({{< relref "/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray.md" >}})|Medium||||38.1%|
-|0920|Number of Music Playlists|[Go]({{< relref "/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md" >}})|Hard||||50.6%|
-|0968|Binary Tree Cameras|[Go]({{< relref "/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md" >}})|Hard||||46.8%|
-|0978|Longest Turbulent Subarray|[Go]({{< relref "/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md" >}})|Medium||||47.4%|
+|0898|Bitwise ORs of Subarrays|[Go]({{< relref "/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md" >}})|Medium||||37.2%|
+|0907|Sum of Subarray Minimums|[Go]({{< relref "/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md" >}})|Medium||||35.8%|
+|0918|Maximum Sum Circular Subarray|[Go]({{< relref "/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray.md" >}})|Medium||||42.9%|
+|0920|Number of Music Playlists|[Go]({{< relref "/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md" >}})|Hard||||50.8%|
+|0968|Binary Tree Cameras|[Go]({{< relref "/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md" >}})|Hard||||46.7%|
+|0978|Longest Turbulent Subarray|[Go]({{< relref "/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md" >}})|Medium||||47.2%|
|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard||||49.2%|
-|1025|Divisor Game|[Go]({{< relref "/ChapterFour/1000~1099/1025.Divisor-Game.md" >}})|Easy| O(1)| O(1)||67.1%|
+|1025|Divisor Game|[Go]({{< relref "/ChapterFour/1000~1099/1025.Divisor-Game.md" >}})|Easy| O(1)| O(1)||67.5%|
|1048|Longest String Chain|[Go]({{< relref "/ChapterFour/1000~1099/1048.Longest-String-Chain.md" >}})|Medium||||59.2%|
-|1049|Last Stone Weight II|[Go]({{< relref "/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md" >}})|Medium||||52.4%|
-|1105|Filling Bookcase Shelves|[Go]({{< relref "/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md" >}})|Medium||||58.9%|
-|1137|N-th Tribonacci Number|[Go]({{< relref "/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number.md" >}})|Easy||||63.3%|
-|1143|Longest Common Subsequence|[Go]({{< relref "/ChapterFour/1100~1199/1143.Longest-Common-Subsequence.md" >}})|Medium||||58.8%|
-|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||51.1%|
-|1463|Cherry Pickup II|[Go]({{< relref "/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md" >}})|Hard||||70.2%|
-|1641|Count Sorted Vowel Strings|[Go]({{< relref "/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md" >}})|Medium||||77.3%|
+|1049|Last Stone Weight II|[Go]({{< relref "/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md" >}})|Medium||||53.1%|
+|1105|Filling Bookcase Shelves|[Go]({{< relref "/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md" >}})|Medium||||59.3%|
+|1137|N-th Tribonacci Number|[Go]({{< relref "/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number.md" >}})|Easy||||63.8%|
+|1143|Longest Common Subsequence|[Go]({{< relref "/ChapterFour/1100~1199/1143.Longest-Common-Subsequence.md" >}})|Medium||||58.4%|
+|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||53.4%|
+|1463|Cherry Pickup II|[Go]({{< relref "/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md" >}})|Hard||||69.7%|
+|1641|Count Sorted Vowel Strings|[Go]({{< relref "/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md" >}})|Medium||||77.4%|
|1646|Get Maximum in Generated Array|[Go]({{< relref "/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md" >}})|Easy||||50.2%|
-|1653|Minimum Deletions to Make String Balanced|[Go]({{< relref "/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md" >}})|Medium||||58.7%|
-|1654|Minimum Jumps to Reach Home|[Go]({{< relref "/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md" >}})|Medium||||28.6%|
-|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||39.7%|
-|1659|Maximize Grid Happiness|[Go]({{< relref "/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md" >}})|Hard||||38.4%|
-|1664|Ways to Make a Fair Array|[Go]({{< relref "/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md" >}})|Medium||||63.6%|
-|1681|Minimum Incompatibility|[Go]({{< relref "/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md" >}})|Hard||||37.3%|
-|1690|Stone Game VII|[Go]({{< relref "/ChapterFour/1600~1699/1690.Stone-Game-VII.md" >}})|Medium||||58.7%|
-|1691|Maximum Height by Stacking Cuboids|[Go]({{< relref "/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids.md" >}})|Hard||||54.2%|
-|1696|Jump Game VI|[Go]({{< relref "/ChapterFour/1600~1699/1696.Jump-Game-VI.md" >}})|Medium||||46.3%|
-|2167|Minimum Time to Remove All Cars Containing Illegal Goods|[Go]({{< relref "/ChapterFour/2100~2199/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods.md" >}})|Hard||||40.1%|
+|1653|Minimum Deletions to Make String Balanced|[Go]({{< relref "/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md" >}})|Medium||||59.1%|
+|1654|Minimum Jumps to Reach Home|[Go]({{< relref "/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md" >}})|Medium||||29.0%|
+|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||38.9%|
+|1659|Maximize Grid Happiness|[Go]({{< relref "/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md" >}})|Hard||||38.2%|
+|1664|Ways to Make a Fair Array|[Go]({{< relref "/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md" >}})|Medium||||63.5%|
+|1681|Minimum Incompatibility|[Go]({{< relref "/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md" >}})|Hard||||37.4%|
+|1690|Stone Game VII|[Go]({{< relref "/ChapterFour/1600~1699/1690.Stone-Game-VII.md" >}})|Medium||||58.2%|
+|1691|Maximum Height by Stacking Cuboids|[Go]({{< relref "/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids.md" >}})|Hard||||54.4%|
+|1696|Jump Game VI|[Go]({{< relref "/ChapterFour/1600~1699/1696.Jump-Game-VI.md" >}})|Medium||||46.1%|
+|2167|Minimum Time to Remove All Cars Containing Illegal Goods|[Go]({{< relref "/ChapterFour/2100~2199/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods.md" >}})|Hard||||40.7%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+----------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+----------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
----------------------------------------------
diff --git a/website/content/ChapterTwo/Hash_Table.md b/website/content/ChapterTwo/Hash_Table.md
index 5d56e3f6f..8d2936a09 100644
--- a/website/content/ChapterTwo/Hash_Table.md
+++ b/website/content/ChapterTwo/Hash_Table.md
@@ -9,169 +9,176 @@ weight: 13
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
-|0001|Two Sum|[Go]({{< relref "/ChapterFour/0001~0099/0001.Two-Sum.md" >}})|Easy| O(n)| O(n)||49.1%|
+|0001|Two Sum|[Go]({{< relref "/ChapterFour/0001~0099/0001.Two-Sum.md" >}})|Easy| O(n)| O(n)||49.6%|
|0003|Longest Substring Without Repeating Characters|[Go]({{< relref "/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md" >}})|Medium| O(n)| O(1)|❤️|33.8%|
-|0012|Integer to Roman|[Go]({{< relref "/ChapterFour/0001~0099/0012.Integer-to-Roman.md" >}})|Medium||||61.4%|
-|0013|Roman to Integer|[Go]({{< relref "/ChapterFour/0001~0099/0013.Roman-to-Integer.md" >}})|Easy||||58.3%|
-|0017|Letter Combinations of a Phone Number|[Go]({{< relref "/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md" >}})|Medium||||55.5%|
-|0030|Substring with Concatenation of All Words|[Go]({{< relref "/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md" >}})|Hard| O(n)| O(n)|❤️|30.9%|
-|0036|Valid Sudoku|[Go]({{< relref "/ChapterFour/0001~0099/0036.Valid-Sudoku.md" >}})|Medium| O(n^2)| O(n^2)||56.8%|
-|0041|First Missing Positive|[Go]({{< relref "/ChapterFour/0001~0099/0041.First-Missing-Positive.md" >}})|Hard||||36.5%|
-|0049|Group Anagrams|[Go]({{< relref "/ChapterFour/0001~0099/0049.Group-Anagrams.md" >}})|Medium| O(n log n)| O(n)||65.9%|
-|0073|Set Matrix Zeroes|[Go]({{< relref "/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md" >}})|Medium||||50.0%|
-|0076|Minimum Window Substring|[Go]({{< relref "/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md" >}})|Hard| O(n)| O(n)|❤️|40.7%|
-|0105|Construct Binary Tree from Preorder and Inorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md" >}})|Medium||||60.7%|
-|0106|Construct Binary Tree from Inorder and Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md" >}})|Medium||||57.4%|
-|0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard||||27.6%|
-|0127|Word Ladder|[Go]({{< relref "/ChapterFour/0100~0199/0127.Word-Ladder.md" >}})|Hard||||36.6%|
-|0128|Longest Consecutive Sequence|[Go]({{< relref "/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md" >}})|Medium||||48.9%|
-|0138|Copy List with Random Pointer|[Go]({{< relref "/ChapterFour/0100~0199/0138.Copy-List-with-Random-Pointer.md" >}})|Medium| O(n)| O(1)||50.4%|
-|0141|Linked List Cycle|[Go]({{< relref "/ChapterFour/0100~0199/0141.Linked-List-Cycle.md" >}})|Easy||||46.9%|
-|0142|Linked List Cycle II|[Go]({{< relref "/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md" >}})|Medium||||46.2%|
-|0146|LRU Cache|[Go]({{< relref "/ChapterFour/0100~0199/0146.LRU-Cache.md" >}})|Medium||||40.5%|
-|0160|Intersection of Two Linked Lists|[Go]({{< relref "/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md" >}})|Easy||||53.1%|
-|0169|Majority Element|[Go]({{< relref "/ChapterFour/0100~0199/0169.Majority-Element.md" >}})|Easy||||63.8%|
-|0187|Repeated DNA Sequences|[Go]({{< relref "/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md" >}})|Medium||||46.1%|
-|0202|Happy Number|[Go]({{< relref "/ChapterFour/0200~0299/0202.Happy-Number.md" >}})|Easy| O(log n)| O(1)||54.3%|
-|0205|Isomorphic Strings|[Go]({{< relref "/ChapterFour/0200~0299/0205.Isomorphic-Strings.md" >}})|Easy| O(log n)| O(n)||42.5%|
-|0208|Implement Trie (Prefix Tree)|[Go]({{< relref "/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree.md" >}})|Medium||||60.8%|
-|0217|Contains Duplicate|[Go]({{< relref "/ChapterFour/0200~0299/0217.Contains-Duplicate.md" >}})|Easy| O(n)| O(n)||61.3%|
-|0219|Contains Duplicate II|[Go]({{< relref "/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md" >}})|Easy| O(n)| O(n)||42.3%|
-|0229|Majority Element II|[Go]({{< relref "/ChapterFour/0200~0299/0229.Majority-Element-II.md" >}})|Medium||||44.0%|
-|0242|Valid Anagram|[Go]({{< relref "/ChapterFour/0200~0299/0242.Valid-Anagram.md" >}})|Easy| O(n)| O(n) ||62.7%|
-|0264|Ugly Number II|[Go]({{< relref "/ChapterFour/0200~0299/0264.Ugly-Number-II.md" >}})|Medium||||46.1%|
-|0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy||||61.5%|
-|0290|Word Pattern|[Go]({{< relref "/ChapterFour/0200~0299/0290.Word-Pattern.md" >}})|Easy| O(n)| O(n) ||40.4%|
-|0299|Bulls and Cows|[Go]({{< relref "/ChapterFour/0200~0299/0299.Bulls-and-Cows.md" >}})|Medium||||48.5%|
-|0347|Top K Frequent Elements|[Go]({{< relref "/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md" >}})|Medium| O(n)| O(n) ||64.8%|
-|0349|Intersection of Two Arrays|[Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}})|Easy| O(n)| O(n) ||70.2%|
-|0350|Intersection of Two Arrays II|[Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}})|Easy| O(n)| O(n) ||55.5%|
-|0383|Ransom Note|[Go]({{< relref "/ChapterFour/0300~0399/0383.Ransom-Note.md" >}})|Easy||||57.6%|
-|0387|First Unique Character in a String|[Go]({{< relref "/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md" >}})|Easy||||58.8%|
-|0389|Find the Difference|[Go]({{< relref "/ChapterFour/0300~0399/0389.Find-the-Difference.md" >}})|Easy||||60.4%|
+|0012|Integer to Roman|[Go]({{< relref "/ChapterFour/0001~0099/0012.Integer-to-Roman.md" >}})|Medium||||61.9%|
+|0013|Roman to Integer|[Go]({{< relref "/ChapterFour/0001~0099/0013.Roman-to-Integer.md" >}})|Easy||||58.4%|
+|0017|Letter Combinations of a Phone Number|[Go]({{< relref "/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md" >}})|Medium||||56.4%|
+|0030|Substring with Concatenation of All Words|[Go]({{< relref "/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md" >}})|Hard| O(n)| O(n)|❤️|31.2%|
+|0036|Valid Sudoku|[Go]({{< relref "/ChapterFour/0001~0099/0036.Valid-Sudoku.md" >}})|Medium| O(n^2)| O(n^2)||58.0%|
+|0037|Sudoku Solver|[Go]({{< relref "/ChapterFour/0001~0099/0037.Sudoku-Solver.md" >}})|Hard| O(n^2)| O(n^2)|❤️|57.6%|
+|0041|First Missing Positive|[Go]({{< relref "/ChapterFour/0001~0099/0041.First-Missing-Positive.md" >}})|Hard||||36.7%|
+|0049|Group Anagrams|[Go]({{< relref "/ChapterFour/0001~0099/0049.Group-Anagrams.md" >}})|Medium| O(n log n)| O(n)||66.7%|
+|0073|Set Matrix Zeroes|[Go]({{< relref "/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md" >}})|Medium||||51.1%|
+|0076|Minimum Window Substring|[Go]({{< relref "/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md" >}})|Hard| O(n)| O(n)|❤️|40.9%|
+|0105|Construct Binary Tree from Preorder and Inorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md" >}})|Medium||||61.4%|
+|0106|Construct Binary Tree from Inorder and Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md" >}})|Medium||||58.1%|
+|0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard||||27.5%|
+|0127|Word Ladder|[Go]({{< relref "/ChapterFour/0100~0199/0127.Word-Ladder.md" >}})|Hard||||37.1%|
+|0128|Longest Consecutive Sequence|[Go]({{< relref "/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md" >}})|Medium||||48.6%|
+|0138|Copy List with Random Pointer|[Go]({{< relref "/ChapterFour/0100~0199/0138.Copy-List-with-Random-Pointer.md" >}})|Medium| O(n)| O(1)||51.3%|
+|0141|Linked List Cycle|[Go]({{< relref "/ChapterFour/0100~0199/0141.Linked-List-Cycle.md" >}})|Easy||||47.4%|
+|0142|Linked List Cycle II|[Go]({{< relref "/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md" >}})|Medium||||48.6%|
+|0146|LRU Cache|[Go]({{< relref "/ChapterFour/0100~0199/0146.LRU-Cache.md" >}})|Medium||||40.6%|
+|0160|Intersection of Two Linked Lists|[Go]({{< relref "/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md" >}})|Easy||||54.2%|
+|0169|Majority Element|[Go]({{< relref "/ChapterFour/0100~0199/0169.Majority-Element.md" >}})|Easy||||63.9%|
+|0187|Repeated DNA Sequences|[Go]({{< relref "/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md" >}})|Medium||||46.9%|
+|0202|Happy Number|[Go]({{< relref "/ChapterFour/0200~0299/0202.Happy-Number.md" >}})|Easy| O(log n)| O(1)||54.8%|
+|0205|Isomorphic Strings|[Go]({{< relref "/ChapterFour/0200~0299/0205.Isomorphic-Strings.md" >}})|Easy| O(log n)| O(n)||42.8%|
+|0208|Implement Trie (Prefix Tree)|[Go]({{< relref "/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree.md" >}})|Medium||||61.7%|
+|0217|Contains Duplicate|[Go]({{< relref "/ChapterFour/0200~0299/0217.Contains-Duplicate.md" >}})|Easy| O(n)| O(n)||61.4%|
+|0219|Contains Duplicate II|[Go]({{< relref "/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md" >}})|Easy| O(n)| O(n)||42.5%|
+|0229|Majority Element II|[Go]({{< relref "/ChapterFour/0200~0299/0229.Majority-Element-II.md" >}})|Medium||||45.0%|
+|0242|Valid Anagram|[Go]({{< relref "/ChapterFour/0200~0299/0242.Valid-Anagram.md" >}})|Easy| O(n)| O(n) ||63.0%|
+|0264|Ugly Number II|[Go]({{< relref "/ChapterFour/0200~0299/0264.Ugly-Number-II.md" >}})|Medium||||46.2%|
+|0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy||||62.4%|
+|0290|Word Pattern|[Go]({{< relref "/ChapterFour/0200~0299/0290.Word-Pattern.md" >}})|Easy| O(n)| O(n) ||41.7%|
+|0299|Bulls and Cows|[Go]({{< relref "/ChapterFour/0200~0299/0299.Bulls-and-Cows.md" >}})|Medium||||49.3%|
+|0347|Top K Frequent Elements|[Go]({{< relref "/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md" >}})|Medium| O(n)| O(n) ||64.3%|
+|0349|Intersection of Two Arrays|[Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}})|Easy| O(n)| O(n) ||70.9%|
+|0350|Intersection of Two Arrays II|[Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}})|Easy| O(n)| O(n) ||55.9%|
+|0383|Ransom Note|[Go]({{< relref "/ChapterFour/0300~0399/0383.Ransom-Note.md" >}})|Easy||||58.2%|
+|0387|First Unique Character in a String|[Go]({{< relref "/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md" >}})|Easy||||59.5%|
+|0389|Find the Difference|[Go]({{< relref "/ChapterFour/0300~0399/0389.Find-the-Difference.md" >}})|Easy||||60.0%|
|0395|Longest Substring with At Least K Repeating Characters|[Go]({{< relref "/ChapterFour/0300~0399/0395.Longest-Substring-with-At-Least-K-Repeating-Characters.md" >}})|Medium||||44.8%|
-|0409|Longest Palindrome|[Go]({{< relref "/ChapterFour/0400~0499/0409.Longest-Palindrome.md" >}})|Easy||||54.6%|
-|0421|Maximum XOR of Two Numbers in an Array|[Go]({{< relref "/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md" >}})|Medium||||54.6%|
+|0409|Longest Palindrome|[Go]({{< relref "/ChapterFour/0400~0499/0409.Longest-Palindrome.md" >}})|Easy||||54.3%|
+|0421|Maximum XOR of Two Numbers in an Array|[Go]({{< relref "/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md" >}})|Medium||||54.1%|
|0423|Reconstruct Original Digits from English|[Go]({{< relref "/ChapterFour/0400~0499/0423.Reconstruct-Original-Digits-from-English.md" >}})|Medium||||51.3%|
-|0424|Longest Repeating Character Replacement|[Go]({{< relref "/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md" >}})|Medium||||51.4%|
-|0433|Minimum Genetic Mutation|[Go]({{< relref "/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md" >}})|Medium||||48.1%|
-|0438|Find All Anagrams in a String|[Go]({{< relref "/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md" >}})|Medium| O(n)| O(1) ||48.9%|
-|0447|Number of Boomerangs|[Go]({{< relref "/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md" >}})|Medium| O(n)| O(1) ||54.6%|
-|0448|Find All Numbers Disappeared in an Array|[Go]({{< relref "/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array.md" >}})|Easy||||59.6%|
-|0451|Sort Characters By Frequency|[Go]({{< relref "/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md" >}})|Medium| O(n log n)| O(1) ||68.6%|
-|0454|4Sum II|[Go]({{< relref "/ChapterFour/0400~0499/0454.4Sum-II.md" >}})|Medium| O(n^2)| O(n) ||57.3%|
-|0457|Circular Array Loop|[Go]({{< relref "/ChapterFour/0400~0499/0457.Circular-Array-Loop.md" >}})|Medium||||32.2%|
-|0460|LFU Cache|[Go]({{< relref "/ChapterFour/0400~0499/0460.LFU-Cache.md" >}})|Hard||||40.3%|
-|0480|Sliding Window Median|[Go]({{< relref "/ChapterFour/0400~0499/0480.Sliding-Window-Median.md" >}})|Hard||||41.4%|
-|0491|Increasing Subsequences|[Go]({{< relref "/ChapterFour/0400~0499/0491.Increasing-Subsequences.md" >}})|Medium||||52.0%|
-|0496|Next Greater Element I|[Go]({{< relref "/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md" >}})|Easy||||71.3%|
-|0500|Keyboard Row|[Go]({{< relref "/ChapterFour/0500~0599/0500.Keyboard-Row.md" >}})|Easy||||69.0%|
-|0508|Most Frequent Subtree Sum|[Go]({{< relref "/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md" >}})|Medium||||64.3%|
-|0519|Random Flip Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0519.Random-Flip-Matrix.md" >}})|Medium||||39.8%|
-|0523|Continuous Subarray Sum|[Go]({{< relref "/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum.md" >}})|Medium||||27.7%|
+|0424|Longest Repeating Character Replacement|[Go]({{< relref "/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md" >}})|Medium||||51.9%|
+|0433|Minimum Genetic Mutation|[Go]({{< relref "/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md" >}})|Medium||||52.3%|
+|0438|Find All Anagrams in a String|[Go]({{< relref "/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md" >}})|Medium| O(n)| O(1) ||50.2%|
+|0447|Number of Boomerangs|[Go]({{< relref "/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md" >}})|Medium| O(n)| O(1) ||54.9%|
+|0448|Find All Numbers Disappeared in an Array|[Go]({{< relref "/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array.md" >}})|Easy||||59.9%|
+|0451|Sort Characters By Frequency|[Go]({{< relref "/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md" >}})|Medium| O(n log n)| O(1) ||70.0%|
+|0454|4Sum II|[Go]({{< relref "/ChapterFour/0400~0499/0454.4Sum-II.md" >}})|Medium| O(n^2)| O(n) ||57.2%|
+|0457|Circular Array Loop|[Go]({{< relref "/ChapterFour/0400~0499/0457.Circular-Array-Loop.md" >}})|Medium||||32.6%|
+|0460|LFU Cache|[Go]({{< relref "/ChapterFour/0400~0499/0460.LFU-Cache.md" >}})|Hard||||43.0%|
+|0480|Sliding Window Median|[Go]({{< relref "/ChapterFour/0400~0499/0480.Sliding-Window-Median.md" >}})|Hard||||41.3%|
+|0491|Non-decreasing Subsequences|[Go]({{< relref "/ChapterFour/0400~0499/0491.Non-decreasing-Subsequences.md" >}})|Medium||||60.1%|
+|0496|Next Greater Element I|[Go]({{< relref "/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md" >}})|Easy||||71.5%|
+|0500|Keyboard Row|[Go]({{< relref "/ChapterFour/0500~0599/0500.Keyboard-Row.md" >}})|Easy||||69.5%|
+|0508|Most Frequent Subtree Sum|[Go]({{< relref "/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md" >}})|Medium||||64.8%|
+|0519|Random Flip Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0519.Random-Flip-Matrix.md" >}})|Medium||||40.0%|
+|0523|Continuous Subarray Sum|[Go]({{< relref "/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum.md" >}})|Medium||||28.5%|
|0525|Contiguous Array|[Go]({{< relref "/ChapterFour/0500~0599/0525.Contiguous-Array.md" >}})|Medium||||46.8%|
-|0532|K-diff Pairs in an Array|[Go]({{< relref "/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md" >}})|Medium||||40.7%|
-|0535|Encode and Decode TinyURL|[Go]({{< relref "/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL.md" >}})|Medium||||85.8%|
-|0554|Brick Wall|[Go]({{< relref "/ChapterFour/0500~0599/0554.Brick-Wall.md" >}})|Medium||||53.1%|
-|0560|Subarray Sum Equals K|[Go]({{< relref "/ChapterFour/0500~0599/0560.Subarray-Sum-Equals-K.md" >}})|Medium||||44.0%|
-|0567|Permutation in String|[Go]({{< relref "/ChapterFour/0500~0599/0567.Permutation-in-String.md" >}})|Medium||||43.8%|
-|0575|Distribute Candies|[Go]({{< relref "/ChapterFour/0500~0599/0575.Distribute-Candies.md" >}})|Easy||||66.1%|
-|0594|Longest Harmonious Subsequence|[Go]({{< relref "/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md" >}})|Easy||||53.1%|
-|0599|Minimum Index Sum of Two Lists|[Go]({{< relref "/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md" >}})|Easy||||52.8%|
+|0532|K-diff Pairs in an Array|[Go]({{< relref "/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md" >}})|Medium||||41.1%|
+|0535|Encode and Decode TinyURL|[Go]({{< relref "/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL.md" >}})|Medium||||85.9%|
+|0554|Brick Wall|[Go]({{< relref "/ChapterFour/0500~0599/0554.Brick-Wall.md" >}})|Medium||||53.5%|
+|0560|Subarray Sum Equals K|[Go]({{< relref "/ChapterFour/0500~0599/0560.Subarray-Sum-Equals-K.md" >}})|Medium||||43.7%|
+|0567|Permutation in String|[Go]({{< relref "/ChapterFour/0500~0599/0567.Permutation-in-String.md" >}})|Medium||||44.4%|
+|0575|Distribute Candies|[Go]({{< relref "/ChapterFour/0500~0599/0575.Distribute-Candies.md" >}})|Easy||||66.4%|
+|0594|Longest Harmonious Subsequence|[Go]({{< relref "/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md" >}})|Easy||||53.5%|
+|0599|Minimum Index Sum of Two Lists|[Go]({{< relref "/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md" >}})|Easy||||53.3%|
|0609|Find Duplicate File in System|[Go]({{< relref "/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System.md" >}})|Medium||||67.8%|
-|0632|Smallest Range Covering Elements from K Lists|[Go]({{< relref "/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}})|Hard||||60.4%|
-|0645|Set Mismatch|[Go]({{< relref "/ChapterFour/0600~0699/0645.Set-Mismatch.md" >}})|Easy||||43.0%|
+|0632|Smallest Range Covering Elements from K Lists|[Go]({{< relref "/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}})|Hard||||60.9%|
+|0645|Set Mismatch|[Go]({{< relref "/ChapterFour/0600~0699/0645.Set-Mismatch.md" >}})|Easy||||42.8%|
|0648|Replace Words|[Go]({{< relref "/ChapterFour/0600~0699/0648.Replace-Words.md" >}})|Medium| O(n)| O(n) ||62.7%|
-|0653|Two Sum IV - Input is a BST|[Go]({{< relref "/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md" >}})|Easy||||60.9%|
+|0653|Two Sum IV - Input is a BST|[Go]({{< relref "/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md" >}})|Easy||||61.0%|
|0676|Implement Magic Dictionary|[Go]({{< relref "/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary.md" >}})|Medium| O(n)| O(n) ||56.9%|
-|0677|Map Sum Pairs|[Go]({{< relref "/ChapterFour/0600~0699/0677.Map-Sum-Pairs.md" >}})|Medium||||57.0%|
-|0690|Employee Importance|[Go]({{< relref "/ChapterFour/0600~0699/0690.Employee-Importance.md" >}})|Medium||||65.1%|
-|0692|Top K Frequent Words|[Go]({{< relref "/ChapterFour/0600~0699/0692.Top-K-Frequent-Words.md" >}})|Medium||||56.8%|
-|0697|Degree of an Array|[Go]({{< relref "/ChapterFour/0600~0699/0697.Degree-of-an-Array.md" >}})|Easy||||55.8%|
-|0705|Design HashSet|[Go]({{< relref "/ChapterFour/0700~0799/0705.Design-HashSet.md" >}})|Easy||||66.0%|
-|0706|Design HashMap|[Go]({{< relref "/ChapterFour/0700~0799/0706.Design-HashMap.md" >}})|Easy||||65.1%|
-|0710|Random Pick with Blacklist|[Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}})|Hard| O(n)| O(n) ||33.6%|
-|0720|Longest Word in Dictionary|[Go]({{< relref "/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md" >}})|Medium| O(n)| O(n) ||51.8%|
-|0726|Number of Atoms|[Go]({{< relref "/ChapterFour/0700~0799/0726.Number-of-Atoms.md" >}})|Hard| O(n)| O(n) |❤️|52.2%|
+|0677|Map Sum Pairs|[Go]({{< relref "/ChapterFour/0600~0699/0677.Map-Sum-Pairs.md" >}})|Medium||||56.8%|
+|0690|Employee Importance|[Go]({{< relref "/ChapterFour/0600~0699/0690.Employee-Importance.md" >}})|Medium||||65.5%|
+|0692|Top K Frequent Words|[Go]({{< relref "/ChapterFour/0600~0699/0692.Top-K-Frequent-Words.md" >}})|Medium||||57.1%|
+|0697|Degree of an Array|[Go]({{< relref "/ChapterFour/0600~0699/0697.Degree-of-an-Array.md" >}})|Easy||||55.9%|
+|0705|Design HashSet|[Go]({{< relref "/ChapterFour/0700~0799/0705.Design-HashSet.md" >}})|Easy||||65.7%|
+|0706|Design HashMap|[Go]({{< relref "/ChapterFour/0700~0799/0706.Design-HashMap.md" >}})|Easy||||64.7%|
+|0710|Random Pick with Blacklist|[Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}})|Hard| O(n)| O(n) ||33.5%|
+|0720|Longest Word in Dictionary|[Go]({{< relref "/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md" >}})|Medium| O(n)| O(n) ||51.9%|
+|0726|Number of Atoms|[Go]({{< relref "/ChapterFour/0700~0799/0726.Number-of-Atoms.md" >}})|Hard| O(n)| O(n) |❤️|52.1%|
|0745|Prefix and Suffix Search|[Go]({{< relref "/ChapterFour/0700~0799/0745.Prefix-and-Suffix-Search.md" >}})|Hard||||41.3%|
|0748|Shortest Completing Word|[Go]({{< relref "/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md" >}})|Easy||||59.2%|
-|0752|Open the Lock|[Go]({{< relref "/ChapterFour/0700~0799/0752.Open-the-Lock.md" >}})|Medium||||55.5%|
+|0752|Open the Lock|[Go]({{< relref "/ChapterFour/0700~0799/0752.Open-the-Lock.md" >}})|Medium||||55.6%|
|0763|Partition Labels|[Go]({{< relref "/ChapterFour/0700~0799/0763.Partition-Labels.md" >}})|Medium||||79.8%|
-|0767|Reorganize String|[Go]({{< relref "/ChapterFour/0700~0799/0767.Reorganize-String.md" >}})|Medium||||52.7%|
-|0771|Jewels and Stones|[Go]({{< relref "/ChapterFour/0700~0799/0771.Jewels-and-Stones.md" >}})|Easy||||88.0%|
-|0781|Rabbits in Forest|[Go]({{< relref "/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md" >}})|Medium||||55.3%|
-|0791|Custom Sort String|[Go]({{< relref "/ChapterFour/0700~0799/0791.Custom-Sort-String.md" >}})|Medium||||69.4%|
-|0792|Number of Matching Subsequences|[Go]({{< relref "/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences.md" >}})|Medium||||51.9%|
-|0811|Subdomain Visit Count|[Go]({{< relref "/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md" >}})|Medium||||75.1%|
-|0815|Bus Routes|[Go]({{< relref "/ChapterFour/0800~0899/0815.Bus-Routes.md" >}})|Hard||||45.7%|
-|0817|Linked List Components|[Go]({{< relref "/ChapterFour/0800~0899/0817.Linked-List-Components.md" >}})|Medium||||58.1%|
-|0819|Most Common Word|[Go]({{< relref "/ChapterFour/0800~0899/0819.Most-Common-Word.md" >}})|Easy||||45.0%|
-|0820|Short Encoding of Words|[Go]({{< relref "/ChapterFour/0800~0899/0820.Short-Encoding-of-Words.md" >}})|Medium||||60.7%|
-|0823|Binary Trees With Factors|[Go]({{< relref "/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors.md" >}})|Medium||||50.0%|
-|0828|Count Unique Characters of All Substrings of a Given String|[Go]({{< relref "/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md" >}})|Hard||||51.6%|
-|0846|Hand of Straights|[Go]({{< relref "/ChapterFour/0800~0899/0846.Hand-of-Straights.md" >}})|Medium||||56.5%|
-|0859|Buddy Strings|[Go]({{< relref "/ChapterFour/0800~0899/0859.Buddy-Strings.md" >}})|Easy||||29.0%|
-|0884|Uncommon Words from Two Sentences|[Go]({{< relref "/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences.md" >}})|Easy||||65.9%|
-|0888|Fair Candy Swap|[Go]({{< relref "/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md" >}})|Easy||||60.5%|
-|0890|Find and Replace Pattern|[Go]({{< relref "/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern.md" >}})|Medium||||77.9%|
-|0895|Maximum Frequency Stack|[Go]({{< relref "/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack.md" >}})|Hard| O(n)| O(n) ||66.8%|
-|0904|Fruit Into Baskets|[Go]({{< relref "/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md" >}})|Medium||||42.6%|
-|0911|Online Election|[Go]({{< relref "/ChapterFour/0900~0999/0911.Online-Election.md" >}})|Medium||||52.0%|
-|0914|X of a Kind in a Deck of Cards|[Go]({{< relref "/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md" >}})|Easy||||32.1%|
-|0916|Word Subsets|[Go]({{< relref "/ChapterFour/0900~0999/0916.Word-Subsets.md" >}})|Medium||||54.1%|
-|0923|3Sum With Multiplicity|[Go]({{< relref "/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md" >}})|Medium||||45.4%|
-|0930|Binary Subarrays With Sum|[Go]({{< relref "/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md" >}})|Medium| O(n)| O(n) |❤️|50.9%|
-|0953|Verifying an Alien Dictionary|[Go]({{< relref "/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md" >}})|Easy||||52.7%|
-|0961|N-Repeated Element in Size 2N Array|[Go]({{< relref "/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md" >}})|Easy||||75.8%|
-|0966|Vowel Spellchecker|[Go]({{< relref "/ChapterFour/0900~0999/0966.Vowel-Spellchecker.md" >}})|Medium||||51.5%|
+|0767|Reorganize String|[Go]({{< relref "/ChapterFour/0700~0799/0767.Reorganize-String.md" >}})|Medium||||52.9%|
+|0771|Jewels and Stones|[Go]({{< relref "/ChapterFour/0700~0799/0771.Jewels-and-Stones.md" >}})|Easy||||88.2%|
+|0781|Rabbits in Forest|[Go]({{< relref "/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md" >}})|Medium||||54.8%|
+|0791|Custom Sort String|[Go]({{< relref "/ChapterFour/0700~0799/0791.Custom-Sort-String.md" >}})|Medium||||69.2%|
+|0792|Number of Matching Subsequences|[Go]({{< relref "/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences.md" >}})|Medium||||51.7%|
+|0811|Subdomain Visit Count|[Go]({{< relref "/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md" >}})|Medium||||75.5%|
+|0815|Bus Routes|[Go]({{< relref "/ChapterFour/0800~0899/0815.Bus-Routes.md" >}})|Hard||||45.6%|
+|0817|Linked List Components|[Go]({{< relref "/ChapterFour/0800~0899/0817.Linked-List-Components.md" >}})|Medium||||57.7%|
+|0819|Most Common Word|[Go]({{< relref "/ChapterFour/0800~0899/0819.Most-Common-Word.md" >}})|Easy||||44.8%|
+|0820|Short Encoding of Words|[Go]({{< relref "/ChapterFour/0800~0899/0820.Short-Encoding-of-Words.md" >}})|Medium||||60.6%|
+|0823|Binary Trees With Factors|[Go]({{< relref "/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors.md" >}})|Medium||||49.7%|
+|0828|Count Unique Characters of All Substrings of a Given String|[Go]({{< relref "/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md" >}})|Hard||||51.7%|
+|0846|Hand of Straights|[Go]({{< relref "/ChapterFour/0800~0899/0846.Hand-of-Straights.md" >}})|Medium||||56.2%|
+|0859|Buddy Strings|[Go]({{< relref "/ChapterFour/0800~0899/0859.Buddy-Strings.md" >}})|Easy||||29.2%|
+|0884|Uncommon Words from Two Sentences|[Go]({{< relref "/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences.md" >}})|Easy||||66.3%|
+|0888|Fair Candy Swap|[Go]({{< relref "/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md" >}})|Easy||||60.7%|
+|0890|Find and Replace Pattern|[Go]({{< relref "/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern.md" >}})|Medium||||77.6%|
+|0895|Maximum Frequency Stack|[Go]({{< relref "/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack.md" >}})|Hard| O(n)| O(n) ||66.6%|
+|0904|Fruit Into Baskets|[Go]({{< relref "/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md" >}})|Medium||||43.7%|
+|0911|Online Election|[Go]({{< relref "/ChapterFour/0900~0999/0911.Online-Election.md" >}})|Medium||||52.2%|
+|0914|X of a Kind in a Deck of Cards|[Go]({{< relref "/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md" >}})|Easy||||31.3%|
+|0916|Word Subsets|[Go]({{< relref "/ChapterFour/0900~0999/0916.Word-Subsets.md" >}})|Medium||||53.7%|
+|0923|3Sum With Multiplicity|[Go]({{< relref "/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md" >}})|Medium||||45.3%|
+|0930|Binary Subarrays With Sum|[Go]({{< relref "/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md" >}})|Medium| O(n)| O(n) |❤️|52.0%|
+|0953|Verifying an Alien Dictionary|[Go]({{< relref "/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md" >}})|Easy||||54.5%|
+|0961|N-Repeated Element in Size 2N Array|[Go]({{< relref "/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md" >}})|Easy||||76.0%|
+|0966|Vowel Spellchecker|[Go]({{< relref "/ChapterFour/0900~0999/0966.Vowel-Spellchecker.md" >}})|Medium||||51.4%|
|0970|Powerful Integers|[Go]({{< relref "/ChapterFour/0900~0999/0970.Powerful-Integers.md" >}})|Medium||||43.6%|
-|0981|Time Based Key-Value Store|[Go]({{< relref "/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md" >}})|Medium||||53.6%|
-|0987|Vertical Order Traversal of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md" >}})|Hard||||44.6%|
-|0992|Subarrays with K Different Integers|[Go]({{< relref "/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md" >}})|Hard| O(n)| O(n) |❤️|54.3%|
-|0997|Find the Town Judge|[Go]({{< relref "/ChapterFour/0900~0999/0997.Find-the-Town-Judge.md" >}})|Easy||||49.4%|
-|1002|Find Common Characters|[Go]({{< relref "/ChapterFour/1000~1099/1002.Find-Common-Characters.md" >}})|Easy||||68.3%|
-|1010|Pairs of Songs With Total Durations Divisible by 60|[Go]({{< relref "/ChapterFour/1000~1099/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60.md" >}})|Medium||||53.0%|
+|0981|Time Based Key-Value Store|[Go]({{< relref "/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md" >}})|Medium||||52.4%|
+|0987|Vertical Order Traversal of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md" >}})|Hard||||45.0%|
+|0992|Subarrays with K Different Integers|[Go]({{< relref "/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md" >}})|Hard| O(n)| O(n) |❤️|54.7%|
+|0997|Find the Town Judge|[Go]({{< relref "/ChapterFour/0900~0999/0997.Find-the-Town-Judge.md" >}})|Easy||||49.6%|
+|1002|Find Common Characters|[Go]({{< relref "/ChapterFour/1000~1099/1002.Find-Common-Characters.md" >}})|Easy||||68.5%|
+|1010|Pairs of Songs With Total Durations Divisible by 60|[Go]({{< relref "/ChapterFour/1000~1099/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60.md" >}})|Medium||||52.8%|
|1048|Longest String Chain|[Go]({{< relref "/ChapterFour/1000~1099/1048.Longest-String-Chain.md" >}})|Medium||||59.2%|
-|1054|Distant Barcodes|[Go]({{< relref "/ChapterFour/1000~1099/1054.Distant-Barcodes.md" >}})|Medium||||45.7%|
-|1074|Number of Submatrices That Sum to Target|[Go]({{< relref "/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md" >}})|Hard||||69.8%|
-|1122|Relative Sort Array|[Go]({{< relref "/ChapterFour/1100~1199/1122.Relative-Sort-Array.md" >}})|Easy||||68.4%|
-|1123|Lowest Common Ancestor of Deepest Leaves|[Go]({{< relref "/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}})|Medium||||70.6%|
-|1128|Number of Equivalent Domino Pairs|[Go]({{< relref "/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md" >}})|Easy||||46.9%|
-|1160|Find Words That Can Be Formed by Characters|[Go]({{< relref "/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md" >}})|Easy||||67.8%|
-|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||61.3%|
-|1171|Remove Zero Sum Consecutive Nodes from Linked List|[Go]({{< relref "/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md" >}})|Medium||||42.9%|
-|1178|Number of Valid Words for Each Puzzle|[Go]({{< relref "/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md" >}})|Hard||||46.6%|
-|1189|Maximum Number of Balloons|[Go]({{< relref "/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md" >}})|Easy||||62.1%|
+|1054|Distant Barcodes|[Go]({{< relref "/ChapterFour/1000~1099/1054.Distant-Barcodes.md" >}})|Medium||||45.8%|
+|1074|Number of Submatrices That Sum to Target|[Go]({{< relref "/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md" >}})|Hard||||69.7%|
+|1079|Letter Tile Possibilities|[Go]({{< relref "/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md" >}})|Medium||||76.0%|
+|1122|Relative Sort Array|[Go]({{< relref "/ChapterFour/1100~1199/1122.Relative-Sort-Array.md" >}})|Easy||||68.6%|
+|1123|Lowest Common Ancestor of Deepest Leaves|[Go]({{< relref "/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}})|Medium||||70.9%|
+|1128|Number of Equivalent Domino Pairs|[Go]({{< relref "/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md" >}})|Easy||||47.1%|
+|1160|Find Words That Can Be Formed by Characters|[Go]({{< relref "/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md" >}})|Easy||||67.5%|
+|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||61.5%|
+|1171|Remove Zero Sum Consecutive Nodes from Linked List|[Go]({{< relref "/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md" >}})|Medium||||43.2%|
+|1178|Number of Valid Words for Each Puzzle|[Go]({{< relref "/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md" >}})|Hard||||46.3%|
+|1189|Maximum Number of Balloons|[Go]({{< relref "/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md" >}})|Easy||||61.1%|
|1202|Smallest String With Swaps|[Go]({{< relref "/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md" >}})|Medium||||57.6%|
-|1207|Unique Number of Occurrences|[Go]({{< relref "/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md" >}})|Easy||||70.9%|
-|1275|Find Winner on a Tic Tac Toe Game|[Go]({{< relref "/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md" >}})|Easy||||54.3%|
-|1296|Divide Array in Sets of K Consecutive Numbers|[Go]({{< relref "/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.md" >}})|Medium||||56.6%|
-|1396|Design Underground System|[Go]({{< relref "/ChapterFour/1300~1399/1396.Design-Underground-System.md" >}})|Medium||||73.7%|
-|1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go]({{< relref "/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md" >}})|Medium||||75.6%|
-|1461|Check If a String Contains All Binary Codes of Size K|[Go]({{< relref "/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md" >}})|Medium||||56.8%|
+|1207|Unique Number of Occurrences|[Go]({{< relref "/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md" >}})|Easy||||73.5%|
+|1275|Find Winner on a Tic Tac Toe Game|[Go]({{< relref "/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md" >}})|Easy||||54.2%|
+|1296|Divide Array in Sets of K Consecutive Numbers|[Go]({{< relref "/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.md" >}})|Medium||||56.5%|
+|1396|Design Underground System|[Go]({{< relref "/ChapterFour/1300~1399/1396.Design-Underground-System.md" >}})|Medium||||73.6%|
+|1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go]({{< relref "/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md" >}})|Medium||||76.0%|
+|1461|Check If a String Contains All Binary Codes of Size K|[Go]({{< relref "/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md" >}})|Medium||||56.6%|
|1512|Number of Good Pairs|[Go]({{< relref "/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md" >}})|Easy||||88.2%|
-|1600|Throne Inheritance|[Go]({{< relref "/ChapterFour/1600~1699/1600.Throne-Inheritance.md" >}})|Medium||||63.7%|
-|1624|Largest Substring Between Two Equal Characters|[Go]({{< relref "/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters.md" >}})|Easy||||59.0%|
-|1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||68.6%|
-|1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||56.1%|
-|1656|Design an Ordered Stream|[Go]({{< relref "/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md" >}})|Easy||||85.4%|
-|1657|Determine if Two Strings Are Close|[Go]({{< relref "/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md" >}})|Medium||||54.2%|
+|1600|Throne Inheritance|[Go]({{< relref "/ChapterFour/1600~1699/1600.Throne-Inheritance.md" >}})|Medium||||63.6%|
+|1624|Largest Substring Between Two Equal Characters|[Go]({{< relref "/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters.md" >}})|Easy||||59.1%|
+|1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||69.5%|
+|1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||56.2%|
+|1647|Minimum Deletions to Make Character Frequencies Unique|[Go]({{< relref "/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md" >}})|Medium||||59.1%|
+|1656|Design an Ordered Stream|[Go]({{< relref "/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md" >}})|Easy||||85.3%|
+|1657|Determine if Two Strings Are Close|[Go]({{< relref "/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md" >}})|Medium||||56.3%|
|1658|Minimum Operations to Reduce X to Zero|[Go]({{< relref "/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md" >}})|Medium||||37.6%|
-|1674|Minimum Moves to Make Array Complementary|[Go]({{< relref "/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary.md" >}})|Medium||||38.5%|
-|1679|Max Number of K-Sum Pairs|[Go]({{< relref "/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md" >}})|Medium||||57.4%|
-|1684|Count the Number of Consistent Strings|[Go]({{< relref "/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md" >}})|Easy||||81.8%|
-|1695|Maximum Erasure Value|[Go]({{< relref "/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md" >}})|Medium||||57.7%|
-|1742|Maximum Number of Balls in a Box|[Go]({{< relref "/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md" >}})|Easy||||73.9%|
-|1748|Sum of Unique Elements|[Go]({{< relref "/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md" >}})|Easy||||75.6%|
-|1763|Longest Nice Substring|[Go]({{< relref "/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md" >}})|Easy||||61.7%|
-|2043|Simple Bank System|[Go]({{< relref "/ChapterFour/2000~2099/2043.Simple-Bank-System.md" >}})|Medium||||65.9%|
-|2166|Design Bitset|[Go]({{< relref "/ChapterFour/2100~2199/2166.Design-Bitset.md" >}})|Medium||||31.3%|
+|1674|Minimum Moves to Make Array Complementary|[Go]({{< relref "/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary.md" >}})|Medium||||38.6%|
+|1679|Max Number of K-Sum Pairs|[Go]({{< relref "/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md" >}})|Medium||||57.3%|
+|1684|Count the Number of Consistent Strings|[Go]({{< relref "/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md" >}})|Easy||||82.2%|
+|1695|Maximum Erasure Value|[Go]({{< relref "/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md" >}})|Medium||||57.6%|
+|1742|Maximum Number of Balls in a Box|[Go]({{< relref "/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md" >}})|Easy||||73.7%|
+|1748|Sum of Unique Elements|[Go]({{< relref "/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md" >}})|Easy||||76.2%|
+|1763|Longest Nice Substring|[Go]({{< relref "/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md" >}})|Easy||||61.6%|
+|2043|Simple Bank System|[Go]({{< relref "/ChapterFour/2000~2099/2043.Simple-Bank-System.md" >}})|Medium||||65.3%|
+|2166|Design Bitset|[Go]({{< relref "/ChapterFour/2100~2199/2166.Design-Bitset.md" >}})|Medium||||31.7%|
|2170|Minimum Operations to Make the Array Alternating|[Go]({{< relref "/ChapterFour/2100~2199/2170.Minimum-Operations-to-Make-the-Array-Alternating.md" >}})|Medium||||33.2%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+dium||||33.2%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+erTwo/Sorting/">下一页➡️
+
----------------------------------------------
diff --git a/website/content/ChapterTwo/Linked_List.md b/website/content/ChapterTwo/Linked_List.md
index 150978dd0..87ae75df4 100644
--- a/website/content/ChapterTwo/Linked_List.md
+++ b/website/content/ChapterTwo/Linked_List.md
@@ -9,69 +9,69 @@ weight: 4
-- 巧妙的构造虚拟头结点。可以使遍历处理逻辑更加统一。
-- 灵活使用递归。构造递归条件，使用递归可以巧妙的解题。不过需要注意有些题目不能使用递归，因为递归深度太深会导致超时和栈溢出。
-- 链表区间逆序。第 92 题。
-- 链表寻找中间节点。第 876 题。链表寻找倒数第 n 个节点。第 19 题。只需要一次遍历就可以得到答案。
-- 合并 K 个有序链表。第 21 题，第 23 题。
-- 链表归类。第 86 题，第 328 题。
-- 链表排序，时间复杂度要求 O(n * log n)，空间复杂度 O(1)。只有一种做法，归并排序，至顶向下归并。第 148 题。
-- 判断链表是否存在环，如果有环，输出环的交叉点的下标；判断 2 个链表是否有交叉点，如果有交叉点，输出交叉点。第 141 题，第 142 题，第 160 题。
+- Clever construction of virtual head nodes. The traversal processing logic can be made more unified.
+- Flexible use of recursion. Construct recursive conditions, and use recursion to solve problems cleverly. However, it should be noted that some topics cannot use recursion, because too deep recursion will cause timeout and stack overflow.
+- The reverse order of the range of the linked list. Question 92.
+- The linked list finds the middle node. Question 876. The linked list finds the nth last node. Question 19. It only takes one traversal to get the answer.
+- Merge K ordered linked lists. Question 21, question 23.
+- Linked list sorting. Question 86, question 328.
+- Linked list sorting requires O(n *log n) time complexity and O(1) space complexity. There is only one method, merge sort, and merge from top to bottom. Question 148.
+- Judging whether there is a ring in the linked list, if there is a ring, output the subscript of the intersection point of the ring; judge whether there is an intersection point in the two linked lists, and output the intersection point if there is an intersection point. Question 141, question 142, question 160.
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
-|0002|Add Two Numbers|[Go]({{< relref "/ChapterFour/0001~0099/0002.Add-Two-Numbers.md" >}})|Medium| O(n)| O(1)||39.7%|
-|0019|Remove Nth Node From End of List|[Go]({{< relref "/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md" >}})|Medium| O(n)| O(1)||39.9%|
-|0021|Merge Two Sorted Lists|[Go]({{< relref "/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists.md" >}})|Easy| O(log n)| O(1)||61.8%|
-|0023|Merge k Sorted Lists|[Go]({{< relref "/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists.md" >}})|Hard| O(log n)| O(1)|❤️|48.3%|
-|0024|Swap Nodes in Pairs|[Go]({{< relref "/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs.md" >}})|Medium| O(n)| O(1)||60.3%|
-|0025|Reverse Nodes in k-Group|[Go]({{< relref "/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group.md" >}})|Hard| O(log n)| O(1)|❤️|53.4%|
-|0061|Rotate List|[Go]({{< relref "/ChapterFour/0001~0099/0061.Rotate-List.md" >}})|Medium| O(n)| O(1)||35.7%|
-|0082|Remove Duplicates from Sorted List II|[Go]({{< relref "/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md" >}})|Medium| O(n)| O(1)||45.4%|
-|0083|Remove Duplicates from Sorted List|[Go]({{< relref "/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List.md" >}})|Easy| O(n)| O(1)||49.8%|
-|0086|Partition List|[Go]({{< relref "/ChapterFour/0001~0099/0086.Partition-List.md" >}})|Medium| O(n)| O(1)|❤️|51.3%|
-|0092|Reverse Linked List II|[Go]({{< relref "/ChapterFour/0001~0099/0092.Reverse-Linked-List-II.md" >}})|Medium| O(n)| O(1)|❤️|45.3%|
-|0109|Convert Sorted List to Binary Search Tree|[Go]({{< relref "/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md" >}})|Medium| O(log n)| O(n)||57.2%|
-|0114|Flatten Binary Tree to Linked List|[Go]({{< relref "/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})|Medium||||61.0%|
-|0116|Populating Next Right Pointers in Each Node|[Go]({{< relref "/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md" >}})|Medium||||59.3%|
-|0138|Copy List with Random Pointer|[Go]({{< relref "/ChapterFour/0100~0199/0138.Copy-List-with-Random-Pointer.md" >}})|Medium||||50.4%|
-|0141|Linked List Cycle|[Go]({{< relref "/ChapterFour/0100~0199/0141.Linked-List-Cycle.md" >}})|Easy| O(n)| O(1)|❤️|46.8%|
-|0142|Linked List Cycle II|[Go]({{< relref "/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md" >}})|Medium| O(n)| O(1)|❤️|46.2%|
-|0143|Reorder List|[Go]({{< relref "/ChapterFour/0100~0199/0143.Reorder-List.md" >}})|Medium| O(n)| O(1)|❤️|50.9%|
-|0146|LRU Cache|[Go]({{< relref "/ChapterFour/0100~0199/0146.LRU-Cache.md" >}})|Medium||||40.5%|
-|0147|Insertion Sort List|[Go]({{< relref "/ChapterFour/0100~0199/0147.Insertion-Sort-List.md" >}})|Medium| O(n)| O(1)|❤️|50.1%|
-|0148|Sort List|[Go]({{< relref "/ChapterFour/0100~0199/0148.Sort-List.md" >}})|Medium| O(n log n)| O(n)|❤️|54.0%|
-|0160|Intersection of Two Linked Lists|[Go]({{< relref "/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md" >}})|Easy| O(n)| O(1)|❤️|53.1%|
-|0203|Remove Linked List Elements|[Go]({{< relref "/ChapterFour/0200~0299/0203.Remove-Linked-List-Elements.md" >}})|Easy| O(n)| O(1)||44.7%|
-|0206|Reverse Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0206.Reverse-Linked-List.md" >}})|Easy| O(n)| O(1)||72.3%|
-|0234|Palindrome Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md" >}})|Easy| O(n)| O(1)||49.4%|
-|0237|Delete Node in a Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List.md" >}})|Medium| O(n)| O(1)||75.1%|
-|0328|Odd Even Linked List|[Go]({{< relref "/ChapterFour/0300~0399/0328.Odd-Even-Linked-List.md" >}})|Medium| O(n)| O(1)||60.2%|
-|0382|Linked List Random Node|[Go]({{< relref "/ChapterFour/0300~0399/0382.Linked-List-Random-Node.md" >}})|Medium||||59.5%|
-|0445|Add Two Numbers II|[Go]({{< relref "/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md" >}})|Medium| O(n)| O(n)||59.4%|
-|0460|LFU Cache|[Go]({{< relref "/ChapterFour/0400~0499/0460.LFU-Cache.md" >}})|Hard||||40.3%|
-|0622|Design Circular Queue|[Go]({{< relref "/ChapterFour/0600~0699/0622.Design-Circular-Queue.md" >}})|Medium||||51.8%|
-|0705|Design HashSet|[Go]({{< relref "/ChapterFour/0700~0799/0705.Design-HashSet.md" >}})|Easy||||66.0%|
-|0706|Design HashMap|[Go]({{< relref "/ChapterFour/0700~0799/0706.Design-HashMap.md" >}})|Easy||||65.1%|
-|0707|Design Linked List|[Go]({{< relref "/ChapterFour/0700~0799/0707.Design-Linked-List.md" >}})|Medium| O(n)| O(1)||27.5%|
+|0002|Add Two Numbers|[Go]({{< relref "/ChapterFour/0001~0099/0002.Add-Two-Numbers.md" >}})|Medium| O(n)| O(1)||40.3%|
+|0019|Remove Nth Node From End of List|[Go]({{< relref "/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md" >}})|Medium| O(n)| O(1)||40.9%|
+|0021|Merge Two Sorted Lists|[Go]({{< relref "/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists.md" >}})|Easy| O(log n)| O(1)||62.4%|
+|0023|Merge k Sorted Lists|[Go]({{< relref "/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists.md" >}})|Hard| O(log n)| O(1)|❤️|49.7%|
+|0024|Swap Nodes in Pairs|[Go]({{< relref "/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs.md" >}})|Medium| O(n)| O(1)||61.2%|
+|0025|Reverse Nodes in k-Group|[Go]({{< relref "/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group.md" >}})|Hard| O(log n)| O(1)|❤️|54.5%|
+|0061|Rotate List|[Go]({{< relref "/ChapterFour/0001~0099/0061.Rotate-List.md" >}})|Medium| O(n)| O(1)||36.0%|
+|0082|Remove Duplicates from Sorted List II|[Go]({{< relref "/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md" >}})|Medium| O(n)| O(1)||45.9%|
+|0083|Remove Duplicates from Sorted List|[Go]({{< relref "/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List.md" >}})|Easy| O(n)| O(1)||50.5%|
+|0086|Partition List|[Go]({{< relref "/ChapterFour/0001~0099/0086.Partition-List.md" >}})|Medium| O(n)| O(1)|❤️|51.9%|
+|0092|Reverse Linked List II|[Go]({{< relref "/ChapterFour/0001~0099/0092.Reverse-Linked-List-II.md" >}})|Medium| O(n)| O(1)|❤️|45.4%|
+|0109|Convert Sorted List to Binary Search Tree|[Go]({{< relref "/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md" >}})|Medium| O(log n)| O(n)||60.1%|
+|0114|Flatten Binary Tree to Linked List|[Go]({{< relref "/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})|Medium||||61.7%|
+|0116|Populating Next Right Pointers in Each Node|[Go]({{< relref "/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md" >}})|Medium||||60.3%|
+|0138|Copy List with Random Pointer|[Go]({{< relref "/ChapterFour/0100~0199/0138.Copy-List-with-Random-Pointer.md" >}})|Medium||||51.3%|
+|0141|Linked List Cycle|[Go]({{< relref "/ChapterFour/0100~0199/0141.Linked-List-Cycle.md" >}})|Easy| O(n)| O(1)|❤️|47.4%|
+|0142|Linked List Cycle II|[Go]({{< relref "/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md" >}})|Medium| O(n)| O(1)|❤️|48.6%|
+|0143|Reorder List|[Go]({{< relref "/ChapterFour/0100~0199/0143.Reorder-List.md" >}})|Medium| O(n)| O(1)|❤️|52.4%|
+|0146|LRU Cache|[Go]({{< relref "/ChapterFour/0100~0199/0146.LRU-Cache.md" >}})|Medium||||40.6%|
+|0147|Insertion Sort List|[Go]({{< relref "/ChapterFour/0100~0199/0147.Insertion-Sort-List.md" >}})|Medium| O(n)| O(1)|❤️|50.9%|
+|0148|Sort List|[Go]({{< relref "/ChapterFour/0100~0199/0148.Sort-List.md" >}})|Medium| O(n log n)| O(n)|❤️|55.0%|
+|0160|Intersection of Two Linked Lists|[Go]({{< relref "/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md" >}})|Easy| O(n)| O(1)|❤️|54.2%|
+|0203|Remove Linked List Elements|[Go]({{< relref "/ChapterFour/0200~0299/0203.Remove-Linked-List-Elements.md" >}})|Easy| O(n)| O(1)||45.8%|
+|0206|Reverse Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0206.Reverse-Linked-List.md" >}})|Easy| O(n)| O(1)||73.4%|
+|0234|Palindrome Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md" >}})|Easy| O(n)| O(1)||50.1%|
+|0237|Delete Node in a Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List.md" >}})|Medium| O(n)| O(1)||75.9%|
+|0328|Odd Even Linked List|[Go]({{< relref "/ChapterFour/0300~0399/0328.Odd-Even-Linked-List.md" >}})|Medium| O(n)| O(1)||61.2%|
+|0382|Linked List Random Node|[Go]({{< relref "/ChapterFour/0300~0399/0382.Linked-List-Random-Node.md" >}})|Medium||||62.8%|
+|0445|Add Two Numbers II|[Go]({{< relref "/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md" >}})|Medium| O(n)| O(n)||59.6%|
+|0460|LFU Cache|[Go]({{< relref "/ChapterFour/0400~0499/0460.LFU-Cache.md" >}})|Hard||||43.0%|
+|0622|Design Circular Queue|[Go]({{< relref "/ChapterFour/0600~0699/0622.Design-Circular-Queue.md" >}})|Medium||||51.6%|
+|0705|Design HashSet|[Go]({{< relref "/ChapterFour/0700~0799/0705.Design-HashSet.md" >}})|Easy||||65.7%|
+|0706|Design HashMap|[Go]({{< relref "/ChapterFour/0700~0799/0706.Design-HashMap.md" >}})|Easy||||64.7%|
+|0707|Design Linked List|[Go]({{< relref "/ChapterFour/0700~0799/0707.Design-Linked-List.md" >}})|Medium| O(n)| O(1)||27.6%|
|0725|Split Linked List in Parts|[Go]({{< relref "/ChapterFour/0700~0799/0725.Split-Linked-List-in-Parts.md" >}})|Medium| O(n)| O(1)||57.2%|
-|0817|Linked List Components|[Go]({{< relref "/ChapterFour/0800~0899/0817.Linked-List-Components.md" >}})|Medium| O(n)| O(1)||58.1%|
-|0876|Middle of the Linked List|[Go]({{< relref "/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List.md" >}})|Easy| O(n)| O(1)|❤️|73.7%|
-|1019|Next Greater Node In Linked List|[Go]({{< relref "/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md" >}})|Medium| O(n)| O(1)||59.8%|
-|1171|Remove Zero Sum Consecutive Nodes from Linked List|[Go]({{< relref "/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md" >}})|Medium||||42.9%|
-|1290|Convert Binary Number in a Linked List to Integer|[Go]({{< relref "/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md" >}})|Easy||||82.6%|
-|1669|Merge In Between Linked Lists|[Go]({{< relref "/ChapterFour/1600~1699/1669.Merge-In-Between-Linked-Lists.md" >}})|Medium||||74.5%|
-|1670|Design Front Middle Back Queue|[Go]({{< relref "/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md" >}})|Medium||||56.4%|
-|1721|Swapping Nodes in a Linked List|[Go]({{< relref "/ChapterFour/1700~1799/1721.Swapping-Nodes-in-a-Linked-List.md" >}})|Medium||||67.8%|
-|2181|Merge Nodes in Between Zeros|[Go]({{< relref "/ChapterFour/2100~2199/2181.Merge-Nodes-in-Between-Zeros.md" >}})|Medium||||86.9%|
+|0817|Linked List Components|[Go]({{< relref "/ChapterFour/0800~0899/0817.Linked-List-Components.md" >}})|Medium| O(n)| O(1)||57.7%|
+|0876|Middle of the Linked List|[Go]({{< relref "/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List.md" >}})|Easy| O(n)| O(1)|❤️|75.5%|
+|1019|Next Greater Node In Linked List|[Go]({{< relref "/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md" >}})|Medium| O(n)| O(1)||59.9%|
+|1171|Remove Zero Sum Consecutive Nodes from Linked List|[Go]({{< relref "/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md" >}})|Medium||||43.2%|
+|1290|Convert Binary Number in a Linked List to Integer|[Go]({{< relref "/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md" >}})|Easy||||82.2%|
+|1669|Merge In Between Linked Lists|[Go]({{< relref "/ChapterFour/1600~1699/1669.Merge-In-Between-Linked-Lists.md" >}})|Medium||||73.8%|
+|1670|Design Front Middle Back Queue|[Go]({{< relref "/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md" >}})|Medium||||57.3%|
+|1721|Swapping Nodes in a Linked List|[Go]({{< relref "/ChapterFour/1700~1799/1721.Swapping-Nodes-in-a-Linked-List.md" >}})|Medium||||67.2%|
+|2181|Merge Nodes in Between Zeros|[Go]({{< relref "/ChapterFour/2100~2199/2181.Merge-Nodes-in-Between-Zeros.md" >}})|Medium||||86.4%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
----------------------------------------------
diff --git a/website/content/ChapterTwo/Math.md b/website/content/ChapterTwo/Math.md
index 19358a538..e08adbb43 100644
--- a/website/content/ChapterTwo/Math.md
+++ b/website/content/ChapterTwo/Math.md
@@ -9,151 +9,155 @@ weight: 12
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
-|0002|Add Two Numbers|[Go]({{< relref "/ChapterFour/0001~0099/0002.Add-Two-Numbers.md" >}})|Medium| O(n)| O(1)||39.7%|
-|0007|Reverse Integer|[Go]({{< relref "/ChapterFour/0001~0099/0007.Reverse-Integer.md" >}})|Medium||||27.2%|
-|0009|Palindrome Number|[Go]({{< relref "/ChapterFour/0001~0099/0009.Palindrome-Number.md" >}})|Easy||||52.8%|
-|0012|Integer to Roman|[Go]({{< relref "/ChapterFour/0001~0099/0012.Integer-to-Roman.md" >}})|Medium||||60.5%|
-|0013|Roman to Integer|[Go]({{< relref "/ChapterFour/0001~0099/0013.Roman-to-Integer.md" >}})|Easy||||58.2%|
-|0029|Divide Two Integers|[Go]({{< relref "/ChapterFour/0001~0099/0029.Divide-Two-Integers.md" >}})|Medium||||17.4%|
-|0043|Multiply Strings|[Go]({{< relref "/ChapterFour/0001~0099/0043.Multiply-Strings.md" >}})|Medium||||38.7%|
-|0048|Rotate Image|[Go]({{< relref "/ChapterFour/0001~0099/0048.Rotate-Image.md" >}})|Medium||||69.8%|
-|0050|Pow(x, n)|[Go]({{< relref "/ChapterFour/0001~0099/0050.Powx-n.md" >}})|Medium| O(log n)| O(1)||32.8%|
-|0060|Permutation Sequence|[Go]({{< relref "/ChapterFour/0001~0099/0060.Permutation-Sequence.md" >}})|Hard| O(n log n)| O(1)||43.7%|
-|0062|Unique Paths|[Go]({{< relref "/ChapterFour/0001~0099/0062.Unique-Paths.md" >}})|Medium||||62.2%|
-|0066|Plus One|[Go]({{< relref "/ChapterFour/0001~0099/0066.Plus-One.md" >}})|Easy||||43.3%|
-|0067|Add Binary|[Go]({{< relref "/ChapterFour/0001~0099/0067.Add-Binary.md" >}})|Easy||||51.3%|
-|0069|Sqrt(x)|[Go]({{< relref "/ChapterFour/0001~0099/0069.Sqrtx.md" >}})|Easy| O(log n)| O(1)||37.0%|
-|0070|Climbing Stairs|[Go]({{< relref "/ChapterFour/0001~0099/0070.Climbing-Stairs.md" >}})|Easy||||51.7%|
-|0089|Gray Code|[Go]({{< relref "/ChapterFour/0001~0099/0089.Gray-Code.md" >}})|Medium||||56.4%|
-|0096|Unique Binary Search Trees|[Go]({{< relref "/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md" >}})|Medium||||59.2%|
-|0150|Evaluate Reverse Polish Notation|[Go]({{< relref "/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md" >}})|Medium||||44.1%|
-|0168|Excel Sheet Column Title|[Go]({{< relref "/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title.md" >}})|Easy||||34.7%|
-|0171|Excel Sheet Column Number|[Go]({{< relref "/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number.md" >}})|Easy||||61.3%|
-|0172|Factorial Trailing Zeroes|[Go]({{< relref "/ChapterFour/0100~0199/0172.Factorial-Trailing-Zeroes.md" >}})|Medium||||41.6%|
-|0189|Rotate Array|[Go]({{< relref "/ChapterFour/0100~0199/0189.Rotate-Array.md" >}})|Medium||||39.2%|
-|0202|Happy Number|[Go]({{< relref "/ChapterFour/0200~0299/0202.Happy-Number.md" >}})|Easy| O(log n)| O(1)||54.3%|
+|0002|Add Two Numbers|[Go]({{< relref "/ChapterFour/0001~0099/0002.Add-Two-Numbers.md" >}})|Medium| O(n)| O(1)||40.3%|
+|0007|Reverse Integer|[Go]({{< relref "/ChapterFour/0001~0099/0007.Reverse-Integer.md" >}})|Medium||||27.4%|
+|0009|Palindrome Number|[Go]({{< relref "/ChapterFour/0001~0099/0009.Palindrome-Number.md" >}})|Easy||||53.5%|
+|0012|Integer to Roman|[Go]({{< relref "/ChapterFour/0001~0099/0012.Integer-to-Roman.md" >}})|Medium||||61.9%|
+|0013|Roman to Integer|[Go]({{< relref "/ChapterFour/0001~0099/0013.Roman-to-Integer.md" >}})|Easy||||58.4%|
+|0029|Divide Two Integers|[Go]({{< relref "/ChapterFour/0001~0099/0029.Divide-Two-Integers.md" >}})|Medium||||17.2%|
+|0043|Multiply Strings|[Go]({{< relref "/ChapterFour/0001~0099/0043.Multiply-Strings.md" >}})|Medium||||39.1%|
+|0048|Rotate Image|[Go]({{< relref "/ChapterFour/0001~0099/0048.Rotate-Image.md" >}})|Medium||||70.9%|
+|0050|Pow(x, n)|[Go]({{< relref "/ChapterFour/0001~0099/0050.Powx-n.md" >}})|Medium| O(log n)| O(1)||33.0%|
+|0060|Permutation Sequence|[Go]({{< relref "/ChapterFour/0001~0099/0060.Permutation-Sequence.md" >}})|Hard| O(n log n)| O(1)||44.3%|
+|0062|Unique Paths|[Go]({{< relref "/ChapterFour/0001~0099/0062.Unique-Paths.md" >}})|Medium||||62.6%|
+|0066|Plus One|[Go]({{< relref "/ChapterFour/0001~0099/0066.Plus-One.md" >}})|Easy||||43.6%|
+|0067|Add Binary|[Go]({{< relref "/ChapterFour/0001~0099/0067.Add-Binary.md" >}})|Easy||||52.4%|
+|0069|Sqrt(x)|[Go]({{< relref "/ChapterFour/0001~0099/0069.Sqrtx.md" >}})|Easy| O(log n)| O(1)||37.4%|
+|0070|Climbing Stairs|[Go]({{< relref "/ChapterFour/0001~0099/0070.Climbing-Stairs.md" >}})|Easy||||52.2%|
+|0089|Gray Code|[Go]({{< relref "/ChapterFour/0001~0099/0089.Gray-Code.md" >}})|Medium||||57.1%|
+|0096|Unique Binary Search Trees|[Go]({{< relref "/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md" >}})|Medium||||59.6%|
+|0150|Evaluate Reverse Polish Notation|[Go]({{< relref "/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md" >}})|Medium||||45.7%|
+|0168|Excel Sheet Column Title|[Go]({{< relref "/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title.md" >}})|Easy||||35.4%|
+|0171|Excel Sheet Column Number|[Go]({{< relref "/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number.md" >}})|Easy||||62.0%|
+|0172|Factorial Trailing Zeroes|[Go]({{< relref "/ChapterFour/0100~0199/0172.Factorial-Trailing-Zeroes.md" >}})|Medium||||42.1%|
+|0189|Rotate Array|[Go]({{< relref "/ChapterFour/0100~0199/0189.Rotate-Array.md" >}})|Medium||||39.4%|
+|0202|Happy Number|[Go]({{< relref "/ChapterFour/0200~0299/0202.Happy-Number.md" >}})|Easy| O(log n)| O(1)||54.8%|
|0204|Count Primes|[Go]({{< relref "/ChapterFour/0200~0299/0204.Count-Primes.md" >}})|Medium||||33.1%|
-|0223|Rectangle Area|[Go]({{< relref "/ChapterFour/0200~0299/0223.Rectangle-Area.md" >}})|Medium||||40.8%|
-|0224|Basic Calculator|[Go]({{< relref "/ChapterFour/0200~0299/0224.Basic-Calculator.md" >}})|Hard| O(n)| O(n)||41.1%|
-|0227|Basic Calculator II|[Go]({{< relref "/ChapterFour/0200~0299/0227.Basic-Calculator-II.md" >}})|Medium||||42.2%|
-|0231|Power of Two|[Go]({{< relref "/ChapterFour/0200~0299/0231.Power-of-Two.md" >}})|Easy| O(1)| O(1)||45.6%|
-|0258|Add Digits|[Go]({{< relref "/ChapterFour/0200~0299/0258.Add-Digits.md" >}})|Easy||||63.3%|
-|0263|Ugly Number|[Go]({{< relref "/ChapterFour/0200~0299/0263.Ugly-Number.md" >}})|Easy| O(log n)| O(1)||41.7%|
-|0264|Ugly Number II|[Go]({{< relref "/ChapterFour/0200~0299/0264.Ugly-Number-II.md" >}})|Medium||||46.1%|
-|0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy||||61.5%|
-|0279|Perfect Squares|[Go]({{< relref "/ChapterFour/0200~0299/0279.Perfect-Squares.md" >}})|Medium||||52.2%|
-|0319|Bulb Switcher|[Go]({{< relref "/ChapterFour/0300~0399/0319.Bulb-Switcher.md" >}})|Medium||||48.0%|
-|0326|Power of Three|[Go]({{< relref "/ChapterFour/0300~0399/0326.Power-of-Three.md" >}})|Easy| O(1)| O(1)||45.2%|
-|0342|Power of Four|[Go]({{< relref "/ChapterFour/0300~0399/0342.Power-of-Four.md" >}})|Easy||||45.6%|
-|0343|Integer Break|[Go]({{< relref "/ChapterFour/0300~0399/0343.Integer-Break.md" >}})|Medium| O(n^2)| O(n)||55.3%|
-|0357|Count Numbers with Unique Digits|[Go]({{< relref "/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md" >}})|Medium| O(1)| O(1)||51.5%|
+|0223|Rectangle Area|[Go]({{< relref "/ChapterFour/0200~0299/0223.Rectangle-Area.md" >}})|Medium||||45.1%|
+|0224|Basic Calculator|[Go]({{< relref "/ChapterFour/0200~0299/0224.Basic-Calculator.md" >}})|Hard| O(n)| O(n)||42.4%|
+|0227|Basic Calculator II|[Go]({{< relref "/ChapterFour/0200~0299/0227.Basic-Calculator-II.md" >}})|Medium||||42.4%|
+|0231|Power of Two|[Go]({{< relref "/ChapterFour/0200~0299/0231.Power-of-Two.md" >}})|Easy| O(1)| O(1)||46.0%|
+|0258|Add Digits|[Go]({{< relref "/ChapterFour/0200~0299/0258.Add-Digits.md" >}})|Easy||||63.9%|
+|0263|Ugly Number|[Go]({{< relref "/ChapterFour/0200~0299/0263.Ugly-Number.md" >}})|Easy| O(log n)| O(1)||42.3%|
+|0264|Ugly Number II|[Go]({{< relref "/ChapterFour/0200~0299/0264.Ugly-Number-II.md" >}})|Medium||||46.2%|
+|0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy||||62.4%|
+|0279|Perfect Squares|[Go]({{< relref "/ChapterFour/0200~0299/0279.Perfect-Squares.md" >}})|Medium||||52.6%|
+|0319|Bulb Switcher|[Go]({{< relref "/ChapterFour/0300~0399/0319.Bulb-Switcher.md" >}})|Medium||||48.3%|
+|0326|Power of Three|[Go]({{< relref "/ChapterFour/0300~0399/0326.Power-of-Three.md" >}})|Easy| O(1)| O(1)||45.5%|
+|0342|Power of Four|[Go]({{< relref "/ChapterFour/0300~0399/0342.Power-of-Four.md" >}})|Easy||||46.1%|
+|0343|Integer Break|[Go]({{< relref "/ChapterFour/0300~0399/0343.Integer-Break.md" >}})|Medium| O(n^2)| O(n)||56.0%|
+|0357|Count Numbers with Unique Digits|[Go]({{< relref "/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md" >}})|Medium| O(1)| O(1)||51.8%|
|0367|Valid Perfect Square|[Go]({{< relref "/ChapterFour/0300~0399/0367.Valid-Perfect-Square.md" >}})|Easy||||43.3%|
-|0368|Largest Divisible Subset|[Go]({{< relref "/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md" >}})|Medium||||41.2%|
+|0368|Largest Divisible Subset|[Go]({{< relref "/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md" >}})|Medium||||41.5%|
|0371|Sum of Two Integers|[Go]({{< relref "/ChapterFour/0300~0399/0371.Sum-of-Two-Integers.md" >}})|Medium||||50.7%|
-|0372|Super Pow|[Go]({{< relref "/ChapterFour/0300~0399/0372.Super-Pow.md" >}})|Medium||||37.2%|
-|0382|Linked List Random Node|[Go]({{< relref "/ChapterFour/0300~0399/0382.Linked-List-Random-Node.md" >}})|Medium||||59.5%|
-|0384|Shuffle an Array|[Go]({{< relref "/ChapterFour/0300~0399/0384.Shuffle-an-Array.md" >}})|Medium||||57.6%|
-|0390|Elimination Game|[Go]({{< relref "/ChapterFour/0300~0399/0390.Elimination-Game.md" >}})|Medium||||46.6%|
-|0396|Rotate Function|[Go]({{< relref "/ChapterFour/0300~0399/0396.Rotate-Function.md" >}})|Medium||||40.3%|
-|0400|Nth Digit|[Go]({{< relref "/ChapterFour/0400~0499/0400.Nth-Digit.md" >}})|Medium||||34.0%|
-|0405|Convert a Number to Hexadecimal|[Go]({{< relref "/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md" >}})|Easy||||46.1%|
-|0412|Fizz Buzz|[Go]({{< relref "/ChapterFour/0400~0499/0412.Fizz-Buzz.md" >}})|Easy||||68.6%|
+|0372|Super Pow|[Go]({{< relref "/ChapterFour/0300~0399/0372.Super-Pow.md" >}})|Medium||||36.4%|
+|0382|Linked List Random Node|[Go]({{< relref "/ChapterFour/0300~0399/0382.Linked-List-Random-Node.md" >}})|Medium||||62.8%|
+|0384|Shuffle an Array|[Go]({{< relref "/ChapterFour/0300~0399/0384.Shuffle-an-Array.md" >}})|Medium||||57.8%|
+|0390|Elimination Game|[Go]({{< relref "/ChapterFour/0300~0399/0390.Elimination-Game.md" >}})|Medium||||46.2%|
+|0396|Rotate Function|[Go]({{< relref "/ChapterFour/0300~0399/0396.Rotate-Function.md" >}})|Medium||||41.1%|
+|0400|Nth Digit|[Go]({{< relref "/ChapterFour/0400~0499/0400.Nth-Digit.md" >}})|Medium||||34.1%|
+|0405|Convert a Number to Hexadecimal|[Go]({{< relref "/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md" >}})|Easy||||46.7%|
+|0412|Fizz Buzz|[Go]({{< relref "/ChapterFour/0400~0499/0412.Fizz-Buzz.md" >}})|Easy||||69.8%|
|0423|Reconstruct Original Digits from English|[Go]({{< relref "/ChapterFour/0400~0499/0423.Reconstruct-Original-Digits-from-English.md" >}})|Medium||||51.3%|
-|0441|Arranging Coins|[Go]({{< relref "/ChapterFour/0400~0499/0441.Arranging-Coins.md" >}})|Easy||||46.0%|
-|0445|Add Two Numbers II|[Go]({{< relref "/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md" >}})|Medium||||59.4%|
-|0447|Number of Boomerangs|[Go]({{< relref "/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md" >}})|Medium||||54.6%|
-|0453|Minimum Moves to Equal Array Elements|[Go]({{< relref "/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements.md" >}})|Medium||||55.6%|
-|0458|Poor Pigs|[Go]({{< relref "/ChapterFour/0400~0499/0458.Poor-Pigs.md" >}})|Hard||||65.0%|
-|0462|Minimum Moves to Equal Array Elements II|[Go]({{< relref "/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II.md" >}})|Medium||||60.1%|
-|0470|Implement Rand10() Using Rand7()|[Go]({{< relref "/ChapterFour/0400~0499/0470.Implement-Rand10-Using-Rand7.md" >}})|Medium||||46.7%|
-|0477|Total Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md" >}})|Medium||||52.2%|
+|0441|Arranging Coins|[Go]({{< relref "/ChapterFour/0400~0499/0441.Arranging-Coins.md" >}})|Easy||||46.2%|
+|0445|Add Two Numbers II|[Go]({{< relref "/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md" >}})|Medium||||59.6%|
+|0447|Number of Boomerangs|[Go]({{< relref "/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md" >}})|Medium||||54.9%|
+|0453|Minimum Moves to Equal Array Elements|[Go]({{< relref "/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements.md" >}})|Medium||||56.0%|
+|0458|Poor Pigs|[Go]({{< relref "/ChapterFour/0400~0499/0458.Poor-Pigs.md" >}})|Hard||||63.0%|
+|0462|Minimum Moves to Equal Array Elements II|[Go]({{< relref "/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II.md" >}})|Medium||||60.0%|
+|0470|Implement Rand10() Using Rand7()|[Go]({{< relref "/ChapterFour/0400~0499/0470.Implement-Rand10-Using-Rand7.md" >}})|Medium||||46.4%|
+|0477|Total Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md" >}})|Medium||||52.1%|
|0478|Generate Random Point in a Circle|[Go]({{< relref "/ChapterFour/0400~0499/0478.Generate-Random-Point-in-a-Circle.md" >}})|Medium||||39.6%|
-|0483|Smallest Good Base|[Go]({{< relref "/ChapterFour/0400~0499/0483.Smallest-Good-Base.md" >}})|Hard||||38.4%|
-|0492|Construct the Rectangle|[Go]({{< relref "/ChapterFour/0400~0499/0492.Construct-the-Rectangle.md" >}})|Easy||||53.6%|
-|0497|Random Point in Non-overlapping Rectangles|[Go]({{< relref "/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md" >}})|Medium||||39.3%|
-|0504|Base 7|[Go]({{< relref "/ChapterFour/0500~0599/0504.Base-7.md" >}})|Easy||||47.9%|
+|0483|Smallest Good Base|[Go]({{< relref "/ChapterFour/0400~0499/0483.Smallest-Good-Base.md" >}})|Hard||||38.7%|
+|0492|Construct the Rectangle|[Go]({{< relref "/ChapterFour/0400~0499/0492.Construct-the-Rectangle.md" >}})|Easy||||54.6%|
+|0497|Random Point in Non-overlapping Rectangles|[Go]({{< relref "/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md" >}})|Medium||||39.4%|
+|0504|Base 7|[Go]({{< relref "/ChapterFour/0500~0599/0504.Base-7.md" >}})|Easy||||48.4%|
|0507|Perfect Number|[Go]({{< relref "/ChapterFour/0500~0599/0507.Perfect-Number.md" >}})|Easy||||37.7%|
-|0509|Fibonacci Number|[Go]({{< relref "/ChapterFour/0500~0599/0509.Fibonacci-Number.md" >}})|Easy||||69.2%|
-|0519|Random Flip Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0519.Random-Flip-Matrix.md" >}})|Medium||||39.6%|
-|0523|Continuous Subarray Sum|[Go]({{< relref "/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum.md" >}})|Medium||||27.7%|
+|0509|Fibonacci Number|[Go]({{< relref "/ChapterFour/0500~0599/0509.Fibonacci-Number.md" >}})|Easy||||69.8%|
+|0519|Random Flip Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0519.Random-Flip-Matrix.md" >}})|Medium||||40.0%|
+|0523|Continuous Subarray Sum|[Go]({{< relref "/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum.md" >}})|Medium||||28.5%|
|0528|Random Pick with Weight|[Go]({{< relref "/ChapterFour/0500~0599/0528.Random-Pick-with-Weight.md" >}})|Medium||||46.1%|
-|0537|Complex Number Multiplication|[Go]({{< relref "/ChapterFour/0500~0599/0537.Complex-Number-Multiplication.md" >}})|Medium||||71.3%|
-|0598|Range Addition II|[Go]({{< relref "/ChapterFour/0500~0599/0598.Range-Addition-II.md" >}})|Easy||||55.0%|
-|0628|Maximum Product of Three Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md" >}})|Easy| O(n)| O(1)||46.4%|
-|0633|Sum of Square Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md" >}})|Medium||||34.7%|
-|0667|Beautiful Arrangement II|[Go]({{< relref "/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II.md" >}})|Medium||||59.7%|
+|0537|Complex Number Multiplication|[Go]({{< relref "/ChapterFour/0500~0599/0537.Complex-Number-Multiplication.md" >}})|Medium||||71.4%|
+|0598|Range Addition II|[Go]({{< relref "/ChapterFour/0500~0599/0598.Range-Addition-II.md" >}})|Easy||||55.3%|
+|0628|Maximum Product of Three Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md" >}})|Easy| O(n)| O(1)||46.0%|
+|0633|Sum of Square Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md" >}})|Medium||||34.4%|
+|0667|Beautiful Arrangement II|[Go]({{< relref "/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II.md" >}})|Medium||||59.8%|
|0668|Kth Smallest Number in Multiplication Table|[Go]({{< relref "/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table.md" >}})|Hard||||51.5%|
-|0710|Random Pick with Blacklist|[Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}})|Hard||||33.6%|
-|0728|Self Dividing Numbers|[Go]({{< relref "/ChapterFour/0700~0799/0728.Self-Dividing-Numbers.md" >}})|Easy||||77.5%|
-|0762|Prime Number of Set Bits in Binary Representation|[Go]({{< relref "/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md" >}})|Easy||||67.6%|
-|0775|Global and Local Inversions|[Go]({{< relref "/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md" >}})|Medium||||43.8%|
-|0781|Rabbits in Forest|[Go]({{< relref "/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md" >}})|Medium||||55.3%|
-|0793|Preimage Size of Factorial Zeroes Function|[Go]({{< relref "/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function.md" >}})|Hard||||42.7%|
-|0810|Chalkboard XOR Game|[Go]({{< relref "/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md" >}})|Hard||||55.1%|
-|0812|Largest Triangle Area|[Go]({{< relref "/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md" >}})|Easy||||60.1%|
-|0836|Rectangle Overlap|[Go]({{< relref "/ChapterFour/0800~0899/0836.Rectangle-Overlap.md" >}})|Easy||||43.3%|
-|0869|Reordered Power of 2|[Go]({{< relref "/ChapterFour/0800~0899/0869.Reordered-Power-of-2.md" >}})|Medium||||64.1%|
+|0710|Random Pick with Blacklist|[Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}})|Hard||||33.5%|
+|0728|Self Dividing Numbers|[Go]({{< relref "/ChapterFour/0700~0799/0728.Self-Dividing-Numbers.md" >}})|Easy||||77.8%|
+|0762|Prime Number of Set Bits in Binary Representation|[Go]({{< relref "/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md" >}})|Easy||||68.0%|
+|0775|Global and Local Inversions|[Go]({{< relref "/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md" >}})|Medium||||43.3%|
+|0781|Rabbits in Forest|[Go]({{< relref "/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md" >}})|Medium||||54.8%|
+|0793|Preimage Size of Factorial Zeroes Function|[Go]({{< relref "/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function.md" >}})|Hard||||43.2%|
+|0810|Chalkboard XOR Game|[Go]({{< relref "/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md" >}})|Hard||||56.2%|
+|0812|Largest Triangle Area|[Go]({{< relref "/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md" >}})|Easy||||59.9%|
+|0836|Rectangle Overlap|[Go]({{< relref "/ChapterFour/0800~0899/0836.Rectangle-Overlap.md" >}})|Easy||||43.9%|
+|0869|Reordered Power of 2|[Go]({{< relref "/ChapterFour/0800~0899/0869.Reordered-Power-of-2.md" >}})|Medium||||63.6%|
|0877|Stone Game|[Go]({{< relref "/ChapterFour/0800~0899/0877.Stone-Game.md" >}})|Medium||||69.7%|
-|0878|Nth Magical Number|[Go]({{< relref "/ChapterFour/0800~0899/0878.Nth-Magical-Number.md" >}})|Hard||||35.7%|
+|0878|Nth Magical Number|[Go]({{< relref "/ChapterFour/0800~0899/0878.Nth-Magical-Number.md" >}})|Hard||||35.3%|
|0887|Super Egg Drop|[Go]({{< relref "/ChapterFour/0800~0899/0887.Super-Egg-Drop.md" >}})|Hard||||27.2%|
-|0891|Sum of Subsequence Widths|[Go]({{< relref "/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md" >}})|Hard| O(n log n)| O(1)||36.4%|
-|0892|Surface Area of 3D Shapes|[Go]({{< relref "/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes.md" >}})|Easy||||63.0%|
-|0910|Smallest Range II|[Go]({{< relref "/ChapterFour/0900~0999/0910.Smallest-Range-II.md" >}})|Medium||||34.4%|
-|0914|X of a Kind in a Deck of Cards|[Go]({{< relref "/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md" >}})|Easy||||32.2%|
-|0920|Number of Music Playlists|[Go]({{< relref "/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md" >}})|Hard||||50.6%|
-|0927|Three Equal Parts|[Go]({{< relref "/ChapterFour/0900~0999/0927.Three-Equal-Parts.md" >}})|Hard||||39.6%|
-|0952|Largest Component Size by Common Factor|[Go]({{< relref "/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md" >}})|Hard||||40.3%|
+|0891|Sum of Subsequence Widths|[Go]({{< relref "/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md" >}})|Hard| O(n log n)| O(1)||36.6%|
+|0892|Surface Area of 3D Shapes|[Go]({{< relref "/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes.md" >}})|Easy||||64.0%|
+|0910|Smallest Range II|[Go]({{< relref "/ChapterFour/0900~0999/0910.Smallest-Range-II.md" >}})|Medium||||35.1%|
+|0914|X of a Kind in a Deck of Cards|[Go]({{< relref "/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md" >}})|Easy||||31.3%|
+|0920|Number of Music Playlists|[Go]({{< relref "/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md" >}})|Hard||||50.8%|
+|0927|Three Equal Parts|[Go]({{< relref "/ChapterFour/0900~0999/0927.Three-Equal-Parts.md" >}})|Hard||||39.5%|
+|0952|Largest Component Size by Common Factor|[Go]({{< relref "/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md" >}})|Hard||||40.1%|
|0970|Powerful Integers|[Go]({{< relref "/ChapterFour/0900~0999/0970.Powerful-Integers.md" >}})|Medium||||43.6%|
-|0973|K Closest Points to Origin|[Go]({{< relref "/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md" >}})|Medium||||65.9%|
-|0976|Largest Perimeter Triangle|[Go]({{< relref "/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md" >}})|Easy| O(n log n)| O(log n) ||54.8%|
-|0989|Add to Array-Form of Integer|[Go]({{< relref "/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md" >}})|Easy||||45.5%|
+|0973|K Closest Points to Origin|[Go]({{< relref "/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md" >}})|Medium||||65.7%|
+|0976|Largest Perimeter Triangle|[Go]({{< relref "/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md" >}})|Easy| O(n log n)| O(log n) ||54.6%|
+|0989|Add to Array-Form of Integer|[Go]({{< relref "/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md" >}})|Easy||||47.1%|
|0991|Broken Calculator|[Go]({{< relref "/ChapterFour/0900~0999/0991.Broken-Calculator.md" >}})|Medium||||54.1%|
|0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard| O(n log n)| O(n) ||49.2%|
-|1006|Clumsy Factorial|[Go]({{< relref "/ChapterFour/1000~1099/1006.Clumsy-Factorial.md" >}})|Medium||||54.7%|
-|1017|Convert to Base -2|[Go]({{< relref "/ChapterFour/1000~1099/1017.Convert-to-Base-2.md" >}})|Medium||||60.9%|
-|1025|Divisor Game|[Go]({{< relref "/ChapterFour/1000~1099/1025.Divisor-Game.md" >}})|Easy| O(1)| O(1)||67.1%|
-|1030|Matrix Cells in Distance Order|[Go]({{< relref "/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md" >}})|Easy||||69.3%|
-|1037|Valid Boomerang|[Go]({{< relref "/ChapterFour/1000~1099/1037.Valid-Boomerang.md" >}})|Easy||||37.5%|
-|1040|Moving Stones Until Consecutive II|[Go]({{< relref "/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md" >}})|Medium||||55.6%|
+|1006|Clumsy Factorial|[Go]({{< relref "/ChapterFour/1000~1099/1006.Clumsy-Factorial.md" >}})|Medium||||55.4%|
+|1017|Convert to Base -2|[Go]({{< relref "/ChapterFour/1000~1099/1017.Convert-to-Base-2.md" >}})|Medium||||60.8%|
+|1025|Divisor Game|[Go]({{< relref "/ChapterFour/1000~1099/1025.Divisor-Game.md" >}})|Easy| O(1)| O(1)||67.5%|
+|1030|Matrix Cells in Distance Order|[Go]({{< relref "/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md" >}})|Easy||||69.6%|
+|1037|Valid Boomerang|[Go]({{< relref "/ChapterFour/1000~1099/1037.Valid-Boomerang.md" >}})|Easy||||37.1%|
+|1040|Moving Stones Until Consecutive II|[Go]({{< relref "/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md" >}})|Medium||||55.8%|
|1073|Adding Two Negabinary Numbers|[Go]({{< relref "/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md" >}})|Medium||||36.4%|
-|1093|Statistics from a Large Sample|[Go]({{< relref "/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md" >}})|Medium||||44.7%|
-|1104|Path In Zigzag Labelled Binary Tree|[Go]({{< relref "/ChapterFour/1100~1199/1104.Path-In-Zigzag-Labelled-Binary-Tree.md" >}})|Medium||||74.9%|
-|1137|N-th Tribonacci Number|[Go]({{< relref "/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number.md" >}})|Easy||||63.3%|
-|1154|Day of the Year|[Go]({{< relref "/ChapterFour/1100~1199/1154.Day-of-the-Year.md" >}})|Easy||||50.3%|
-|1175|Prime Arrangements|[Go]({{< relref "/ChapterFour/1100~1199/1175.Prime-Arrangements.md" >}})|Easy||||53.5%|
-|1185|Day of the Week|[Go]({{< relref "/ChapterFour/1100~1199/1185.Day-of-the-Week.md" >}})|Easy||||57.8%|
-|1201|Ugly Number III|[Go]({{< relref "/ChapterFour/1200~1299/1201.Ugly-Number-III.md" >}})|Medium||||28.5%|
-|1217|Minimum Cost to Move Chips to The Same Position|[Go]({{< relref "/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md" >}})|Easy||||72.2%|
-|1232|Check If It Is a Straight Line|[Go]({{< relref "/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line.md" >}})|Easy||||41.2%|
-|1252|Cells with Odd Values in a Matrix|[Go]({{< relref "/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix.md" >}})|Easy||||78.6%|
+|1093|Statistics from a Large Sample|[Go]({{< relref "/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md" >}})|Medium||||43.6%|
+|1104|Path In Zigzag Labelled Binary Tree|[Go]({{< relref "/ChapterFour/1100~1199/1104.Path-In-Zigzag-Labelled-Binary-Tree.md" >}})|Medium||||75.1%|
+|1137|N-th Tribonacci Number|[Go]({{< relref "/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number.md" >}})|Easy||||63.8%|
+|1154|Day of the Year|[Go]({{< relref "/ChapterFour/1100~1199/1154.Day-of-the-Year.md" >}})|Easy||||49.6%|
+|1175|Prime Arrangements|[Go]({{< relref "/ChapterFour/1100~1199/1175.Prime-Arrangements.md" >}})|Easy||||54.5%|
+|1185|Day of the Week|[Go]({{< relref "/ChapterFour/1100~1199/1185.Day-of-the-Week.md" >}})|Easy||||57.5%|
+|1201|Ugly Number III|[Go]({{< relref "/ChapterFour/1200~1299/1201.Ugly-Number-III.md" >}})|Medium||||28.8%|
+|1217|Minimum Cost to Move Chips to The Same Position|[Go]({{< relref "/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md" >}})|Easy||||71.9%|
+|1232|Check If It Is a Straight Line|[Go]({{< relref "/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line.md" >}})|Easy||||40.4%|
+|1252|Cells with Odd Values in a Matrix|[Go]({{< relref "/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix.md" >}})|Easy||||78.5%|
|1266|Minimum Time Visiting All Points|[Go]({{< relref "/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points.md" >}})|Easy||||79.1%|
|1281|Subtract the Product and Sum of Digits of an Integer|[Go]({{< relref "/ChapterFour/1200~1299/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md" >}})|Easy||||86.7%|
-|1290|Convert Binary Number in a Linked List to Integer|[Go]({{< relref "/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md" >}})|Easy||||82.6%|
-|1304|Find N Unique Integers Sum up to Zero|[Go]({{< relref "/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md" >}})|Easy||||77.1%|
-|1317|Convert Integer to the Sum of Two No-Zero Integers|[Go]({{< relref "/ChapterFour/1300~1399/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md" >}})|Easy||||56.2%|
-|1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go]({{< relref "/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md" >}})|Medium||||75.6%|
-|1486|XOR Operation in an Array|[Go]({{< relref "/ChapterFour/1400~1499/1486.XOR-Operation-in-an-Array.md" >}})|Easy||||84.2%|
+|1290|Convert Binary Number in a Linked List to Integer|[Go]({{< relref "/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md" >}})|Easy||||82.2%|
+|1304|Find N Unique Integers Sum up to Zero|[Go]({{< relref "/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md" >}})|Easy||||77.0%|
+|1317|Convert Integer to the Sum of Two No-Zero Integers|[Go]({{< relref "/ChapterFour/1300~1399/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md" >}})|Easy||||55.5%|
+|1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go]({{< relref "/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md" >}})|Medium||||76.0%|
+|1486|XOR Operation in an Array|[Go]({{< relref "/ChapterFour/1400~1499/1486.XOR-Operation-in-an-Array.md" >}})|Easy||||84.6%|
|1512|Number of Good Pairs|[Go]({{< relref "/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md" >}})|Easy||||88.2%|
-|1518|Water Bottles|[Go]({{< relref "/ChapterFour/1500~1599/1518.Water-Bottles.md" >}})|Easy||||60.3%|
-|1551|Minimum Operations to Make Array Equal|[Go]({{< relref "/ChapterFour/1500~1599/1551.Minimum-Operations-to-Make-Array-Equal.md" >}})|Medium||||81.1%|
-|1573|Number of Ways to Split a String|[Go]({{< relref "/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String.md" >}})|Medium||||32.4%|
-|1648|Sell Diminishing-Valued Colored Balls|[Go]({{< relref "/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}})|Medium||||30.5%|
+|1518|Water Bottles|[Go]({{< relref "/ChapterFour/1500~1599/1518.Water-Bottles.md" >}})|Easy||||60.4%|
+|1551|Minimum Operations to Make Array Equal|[Go]({{< relref "/ChapterFour/1500~1599/1551.Minimum-Operations-to-Make-Array-Equal.md" >}})|Medium||||81.5%|
+|1573|Number of Ways to Split a String|[Go]({{< relref "/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String.md" >}})|Medium||||32.5%|
+|1641|Count Sorted Vowel Strings|[Go]({{< relref "/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md" >}})|Medium||||77.4%|
+|1648|Sell Diminishing-Valued Colored Balls|[Go]({{< relref "/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}})|Medium||||30.4%|
|1680|Concatenation of Consecutive Binary Numbers|[Go]({{< relref "/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md" >}})|Medium||||57.0%|
-|1685|Sum of Absolute Differences in a Sorted Array|[Go]({{< relref "/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md" >}})|Medium||||65.3%|
-|1688|Count of Matches in Tournament|[Go]({{< relref "/ChapterFour/1600~1699/1688.Count-of-Matches-in-Tournament.md" >}})|Easy||||83.1%|
-|1690|Stone Game VII|[Go]({{< relref "/ChapterFour/1600~1699/1690.Stone-Game-VII.md" >}})|Medium||||58.7%|
-|1716|Calculate Money in Leetcode Bank|[Go]({{< relref "/ChapterFour/1700~1799/1716.Calculate-Money-in-Leetcode-Bank.md" >}})|Easy||||65.0%|
-|1742|Maximum Number of Balls in a Box|[Go]({{< relref "/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md" >}})|Easy||||73.9%|
-|2038|Remove Colored Pieces if Both Neighbors are the Same Color|[Go]({{< relref "/ChapterFour/2000~2099/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color.md" >}})|Medium||||58.1%|
-|2165|Smallest Value of the Rearranged Number|[Go]({{< relref "/ChapterFour/2100~2199/2165.Smallest-Value-of-the-Rearranged-Number.md" >}})|Medium||||51.1%|
-|2169|Count Operations to Obtain Zero|[Go]({{< relref "/ChapterFour/2100~2199/2169.Count-Operations-to-Obtain-Zero.md" >}})|Easy||||75.6%|
-|2180|Count Integers With Even Digit Sum|[Go]({{< relref "/ChapterFour/2100~2199/2180.Count-Integers-With-Even-Digit-Sum.md" >}})|Easy||||64.5%|
-|2183|Count Array Pairs Divisible by K|[Go]({{< relref "/ChapterFour/2100~2199/2183.Count-Array-Pairs-Divisible-by-K.md" >}})|Hard||||28.3%|
+|1685|Sum of Absolute Differences in a Sorted Array|[Go]({{< relref "/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md" >}})|Medium||||63.8%|
+|1688|Count of Matches in Tournament|[Go]({{< relref "/ChapterFour/1600~1699/1688.Count-of-Matches-in-Tournament.md" >}})|Easy||||83.2%|
+|1690|Stone Game VII|[Go]({{< relref "/ChapterFour/1600~1699/1690.Stone-Game-VII.md" >}})|Medium||||58.2%|
+|1716|Calculate Money in Leetcode Bank|[Go]({{< relref "/ChapterFour/1700~1799/1716.Calculate-Money-in-Leetcode-Bank.md" >}})|Easy||||66.1%|
+|1742|Maximum Number of Balls in a Box|[Go]({{< relref "/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md" >}})|Easy||||73.7%|
+|2038|Remove Colored Pieces if Both Neighbors are the Same Color|[Go]({{< relref "/ChapterFour/2000~2099/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color.md" >}})|Medium||||58.0%|
+|2165|Smallest Value of the Rearranged Number|[Go]({{< relref "/ChapterFour/2100~2199/2165.Smallest-Value-of-the-Rearranged-Number.md" >}})|Medium||||51.4%|
+|2169|Count Operations to Obtain Zero|[Go]({{< relref "/ChapterFour/2100~2199/2169.Count-Operations-to-Obtain-Zero.md" >}})|Easy||||75.1%|
+|2180|Count Integers With Even Digit Sum|[Go]({{< relref "/ChapterFour/2100~2199/2180.Count-Integers-With-Even-Digit-Sum.md" >}})|Easy||||65.4%|
+|2183|Count Array Pairs Divisible by K|[Go]({{< relref "/ChapterFour/2100~2199/2183.Count-Array-Pairs-Divisible-by-K.md" >}})|Hard||||28.4%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+---------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+----|-------------|
+
----------------------------------------------
diff --git a/website/content/ChapterTwo/Segment_Tree.md b/website/content/ChapterTwo/Segment_Tree.md
index 24524d7a5..a6d6ac3ba 100644
--- a/website/content/ChapterTwo/Segment_Tree.md
+++ b/website/content/ChapterTwo/Segment_Tree.md
@@ -7,53 +7,50 @@ weight: 18
# Segment Tree
-
-- 线段树的经典数组实现写法。将合并两个节点 pushUp 逻辑抽象出来了，可以实现任意操作(常见的操作有：加法，取 max，min 等等)。第 218 题，第 303 题，第 307 题，第 699 题。
-- 计数线段树的经典写法。第 315 题，第 327 题，第 493 题。
-- 线段树的树的实现写法。第 715 题，第 732 题。
-- 区间懒惰更新。第 218 题，第 699 题。
-- 离散化。离散化需要注意一个特殊情况：假如三个区间为 [1,10] [1,4] [6,10]，离散化后 x[1]=1,x[2]=4,x[3]=6,x[4]=10。第一个区间为 [1,4]，第二个区间为 [1,2]，第三个区间为 [3,4]，这样一来，区间一 = 区间二 + 区间三，这和离散前的模型不符，离散前，很明显，区间一 > 区间二 + 区间三。正确的做法是：在相差大于 1 的数间加一个数，例如在上面 1 4 6 10 中间加 5，即可 x[1]=1,x[2]=4,x[3]=5,x[4]=6,x[5]=10。这样处理之后，区间一是 1-5 ，区间二是 1-2 ，区间三是 4-5 。
-- 灵活构建线段树。线段树节点可以存储多条信息，合并两个节点的 pushUp 操作也可以是多样的。第 850 题，第 1157 题。
-
-
-线段树[题型](https://blog.csdn.net/xuechelingxiao/article/details/38313105)从简单到困难:
-
-1. 单点更新:
- [HDU 1166 敌兵布阵](http://acm.hdu.edu.cn/showproblem.php?pid=1166) update:单点增减 query:区间求和
- [HDU 1754 I Hate It](http://acm.hdu.edu.cn/showproblem.php?pid=1754) update:单点替换 query:区间最值
- [HDU 1394 Minimum Inversion Number](http://acm.hdu.edu.cn/showproblem.php?pid=1394) update:单点增减 query:区间求和
- [HDU 2795 Billboard](http://acm.hdu.edu.cn/showproblem.php?pid=2795) query:区间求最大值的位子(直接把update的操作在query里做了)
-2. 区间更新:
- [HDU 1698 Just a Hook](http://acm.hdu.edu.cn/showproblem.php?pid=1698) update:成段替换 (由于只query一次总区间,所以可以直接输出 1 结点的信息)
- [POJ 3468 A Simple Problem with Integers](http://poj.org/problem?id=3468) update:成段增减 query:区间求和
- [POJ 2528 Mayor’s posters](http://poj.org/problem?id=2528) 离散化 + update:成段替换 query:简单hash
- [POJ 3225 Help with Intervals](http://poj.org/problem?id=3225) update:成段替换,区间异或 query:简单hash
-3. 区间合并(这类题目会询问区间中满足条件的连续最长区间,所以PushUp的时候需要对左右儿子的区间进行合并):
- [POJ 3667 Hotel](http://poj.org/problem?id=3667) update:区间替换 query:询问满足条件的最左端点
-4. 扫描线(这类题目需要将一些操作排序,然后从左到右用一根扫描线扫过去最典型的就是矩形面积并,周长并等题):
- [HDU 1542 Atlantis](http://acm.hdu.edu.cn/showproblem.php?pid=1542) update:区间增减 query:直接取根节点的值
- [HDU 1828 Picture](http://acm.hdu.edu.cn/showproblem.php?pid=1828) update:区间增减 query:直接取根节点的值
-
-
+- The classic array implementation of the line segment tree. The pushUp logic of merging two nodes is abstracted, and any operation can be realized (common operations include: addition, max, min, etc.). Question 218, Question 303, Question 307, Question 699.
+- The classic way of counting line segment trees. Question 315, Question 327, Question 493.
+- The implementation of the tree of the line segment tree. Question 715, question 732.
+- Range lazy update. Question 218, question 699.
+- Discretization. Discretization needs to pay attention to a special case: if the three intervals are [1,10] [1,4] [6,10], after discretization x[1]=1,x[2]=4,x[3] =6,x[4]=10. The first interval is [1,4], the second interval is [1,2], and the third interval is [3,4]. In this way, interval one = interval two + interval three, which is the same as before discrete The model does not match. Before the discretization, it is obvious that interval 1 > interval 2 + interval 3. The correct way is: add a number between numbers with a difference greater than 1, for example, add 5 in the middle of 1 4 6 10 above, then x[1]=1, x[2]=4, x[3]=5, x[4]=6,x[5]=10. After this processing, interval one is 1-5, interval two is 1-2, and interval three is 4-5.
+- Flexible construction of segment trees. Line segment tree nodes can store multiple pieces of information, and the pushUp operation for merging two nodes can also be varied. Question 850, question 1157.
+
+
+Line segment tree [question type] (https://blog.csdn.net/xuechelingxiao/article/details/38313105) from simple to difficult:
+
+1. Single point update:
+[HDU 1166 Enemy Soldier Arrangement](http://acm.hdu.edu.cn/showproblem.php?pid=1166) update: single-point increase and decrease query: interval summation
+[HDU 1754 I Hate It](http://acm.hdu.edu.cn/showproblem.php?pid=1754) update: single point replacement query: maximum value of interval
+[HDU 1394 Minimum Inversion Number](http://acm.hdu.edu.cn/showproblem.php?pid=1394) update: single-point increase and decrease query: interval summation
+[HDU 2795 Billboard](http://acm.hdu.edu.cn/showproblem.php?pid=2795) query: find the position of the maximum value in the interval (directly do the update operation in the query)
+2. Interval update:
+[HDU 1698 Just a Hook](http://acm.hdu.edu.cn/showproblem.php?pid=1698) update: segment replacement (since the total interval is only queried once, the information of 1 node can be output directly )
+[POJ 3468 A Simple Problem with Integers](http://poj.org/problem?id=3468) update: Segment increase and decrease query: Interval summation
+[POJ 2528 Mayor’s posters](http://poj.org/problem?id=2528) discretization + update: segment replacement query: simple hash
+[POJ 3225 Help with Intervals](http://poj.org/problem?id=3225) update: segment replacement, interval XOR query: simple hash
+3. Interval merging (this type of question will ask the longest continuous interval that meets the conditions in the interval, so when PushUp needs to merge the intervals of the left and right sons):
+[POJ 3667 Hotel](http://poj.org/problem?id=3667) update: interval replacement query: query the leftmost endpoint that meets the condition
+4. Scanning line (this kind of question needs to sort some operations, and then use a scanning line to scan from left to right. The most typical one is rectangular area union, perimeter length union and other questions):
+[HDU 1542 Atlantis](http://acm.hdu.edu.cn/showproblem.php?pid=1542) update: Interval increase and decrease query: Take the value of the root node directly
+[HDU 1828 Picture](http://acm.hdu.edu.cn/showproblem.php?pid=1828) update: interval increase and decrease query: take the value of the root node directly
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
-|0218|The Skyline Problem|[Go]({{< relref "/ChapterFour/0200~0299/0218.The-Skyline-Problem.md" >}})|Hard| O(n log n)| O(n)|❤️|41.5%|
+|0218|The Skyline Problem|[Go]({{< relref "/ChapterFour/0200~0299/0218.The-Skyline-Problem.md" >}})|Hard| O(n log n)| O(n)|❤️|41.8%|
|0307|Range Sum Query - Mutable|[Go]({{< relref "/ChapterFour/0300~0399/0307.Range-Sum-Query-Mutable.md" >}})|Medium| O(1)| O(n)||40.7%|
-|0315|Count of Smaller Numbers After Self|[Go]({{< relref "/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md" >}})|Hard| O(n log n)| O(n)||42.8%|
+|0315|Count of Smaller Numbers After Self|[Go]({{< relref "/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md" >}})|Hard| O(n log n)| O(n)||42.6%|
|0327|Count of Range Sum|[Go]({{< relref "/ChapterFour/0300~0399/0327.Count-of-Range-Sum.md" >}})|Hard| O(n log n)| O(n)|❤️|36.0%|
-|0493|Reverse Pairs|[Go]({{< relref "/ChapterFour/0400~0499/0493.Reverse-Pairs.md" >}})|Hard| O(n log n)| O(n)||30.8%|
-|0699|Falling Squares|[Go]({{< relref "/ChapterFour/0600~0699/0699.Falling-Squares.md" >}})|Hard| O(n log n)| O(n)|❤️|44.4%|
+|0493|Reverse Pairs|[Go]({{< relref "/ChapterFour/0400~0499/0493.Reverse-Pairs.md" >}})|Hard| O(n log n)| O(n)||30.9%|
+|0699|Falling Squares|[Go]({{< relref "/ChapterFour/0600~0699/0699.Falling-Squares.md" >}})|Hard| O(n log n)| O(n)|❤️|44.5%|
|0715|Range Module|[Go]({{< relref "/ChapterFour/0700~0799/0715.Range-Module.md" >}})|Hard| O(log n)| O(n)|❤️|44.6%|
-|0729|My Calendar I|[Go]({{< relref "/ChapterFour/0700~0799/0729.My-Calendar-I.md" >}})|Medium||||57.2%|
-|0732|My Calendar III|[Go]({{< relref "/ChapterFour/0700~0799/0732.My-Calendar-III.md" >}})|Hard| O(log n)| O(n)|❤️|71.6%|
-|0850|Rectangle Area II|[Go]({{< relref "/ChapterFour/0800~0899/0850.Rectangle-Area-II.md" >}})|Hard| O(n log n)| O(n)|❤️|53.7%|
-|1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard| O(log n)| O(n)|❤️|42.0%|
-|1649|Create Sorted Array through Instructions|[Go]({{< relref "/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md" >}})|Hard||||37.2%|
+|0729|My Calendar I|[Go]({{< relref "/ChapterFour/0700~0799/0729.My-Calendar-I.md" >}})|Medium||||56.9%|
+|0732|My Calendar III|[Go]({{< relref "/ChapterFour/0700~0799/0732.My-Calendar-III.md" >}})|Hard| O(log n)| O(n)|❤️|71.5%|
+|0850|Rectangle Area II|[Go]({{< relref "/ChapterFour/0800~0899/0850.Rectangle-Area-II.md" >}})|Hard| O(n log n)| O(n)|❤️|53.9%|
+|1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard| O(log n)| O(n)|❤️|41.7%|
+|1649|Create Sorted Array through Instructions|[Go]({{< relref "/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md" >}})|Hard||||37.3%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
----------------------------------------------
diff --git a/website/content/ChapterTwo/Sliding_Window.md b/website/content/ChapterTwo/Sliding_Window.md
index 69b687492..e5c377789 100644
--- a/website/content/ChapterTwo/Sliding_Window.md
+++ b/website/content/ChapterTwo/Sliding_Window.md
@@ -8,7 +8,7 @@ weight: 17
-- 双指针滑动窗口的经典写法。右指针不断往右移，移动到不能往右移动为止(具体条件根据题目而定)。当右指针到最右边以后，开始挪动左指针，释放窗口左边界。第 3 题，第 76 题，第 209 题，第 424 题，第 438 题，第 567 题，第 713 题，第 763 题，第 845 题，第 881 题，第 904 题，第 978 题，第 992 题，第 1004 题，第 1040 题，第 1052 题。
+- The classic way of writing a two-pointer sliding window. The right pointer keeps moving to the right until it cannot move to the right (the specific conditions depend on the topic). When the right pointer reaches the far right, start to move the left pointer to release the left boundary of the window. Question 3, Question 76, Question 209, Question 424, Question 438, Question 567, Question 713, Question 763, Question 845, Question 881, Question 904, Question 978, Question 992 Question 1004, Question 1040, Question 1052.
```c
left, right := 0, -1
@@ -24,51 +24,51 @@ weight: 17
result = max(result, right-left+1)
}
```
-- 滑动窗口经典题。第 239 题，第 480 题。
+- Sliding window classic questions. Question 239, question 480.
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
|0003|Longest Substring Without Repeating Characters|[Go]({{< relref "/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md" >}})|Medium| O(n)| O(1)|❤️|33.8%|
-|0030|Substring with Concatenation of All Words|[Go]({{< relref "/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md" >}})|Hard||||30.9%|
-|0076|Minimum Window Substring|[Go]({{< relref "/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md" >}})|Hard| O(n)| O(n)|❤️|40.0%|
-|0187|Repeated DNA Sequences|[Go]({{< relref "/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md" >}})|Medium||||46.1%|
-|0209|Minimum Size Subarray Sum|[Go]({{< relref "/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md" >}})|Medium||||44.4%|
-|0219|Contains Duplicate II|[Go]({{< relref "/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md" >}})|Easy||||40.9%|
-|0220|Contains Duplicate III|[Go]({{< relref "/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md" >}})|Hard||||21.8%|
-|0239|Sliding Window Maximum|[Go]({{< relref "/ChapterFour/0200~0299/0239.Sliding-Window-Maximum.md" >}})|Hard| O(n * k)| O(n)|❤️|46.6%|
+|0030|Substring with Concatenation of All Words|[Go]({{< relref "/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md" >}})|Hard||||31.2%|
+|0076|Minimum Window Substring|[Go]({{< relref "/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md" >}})|Hard| O(n)| O(n)|❤️|40.9%|
+|0187|Repeated DNA Sequences|[Go]({{< relref "/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md" >}})|Medium||||46.9%|
+|0209|Minimum Size Subarray Sum|[Go]({{< relref "/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md" >}})|Medium||||44.9%|
+|0219|Contains Duplicate II|[Go]({{< relref "/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md" >}})|Easy||||42.5%|
+|0220|Contains Duplicate III|[Go]({{< relref "/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md" >}})|Hard||||22.1%|
+|0239|Sliding Window Maximum|[Go]({{< relref "/ChapterFour/0200~0299/0239.Sliding-Window-Maximum.md" >}})|Hard| O(n * k)| O(n)|❤️|46.3%|
|0395|Longest Substring with At Least K Repeating Characters|[Go]({{< relref "/ChapterFour/0300~0399/0395.Longest-Substring-with-At-Least-K-Repeating-Characters.md" >}})|Medium||||44.8%|
-|0424|Longest Repeating Character Replacement|[Go]({{< relref "/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md" >}})|Medium| O(n)| O(1) ||51.4%|
-|0438|Find All Anagrams in a String|[Go]({{< relref "/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md" >}})|Medium||||48.9%|
-|0480|Sliding Window Median|[Go]({{< relref "/ChapterFour/0400~0499/0480.Sliding-Window-Median.md" >}})|Hard| O(n * log k)| O(k)|❤️|41.4%|
-|0567|Permutation in String|[Go]({{< relref "/ChapterFour/0500~0599/0567.Permutation-in-String.md" >}})|Medium| O(n)| O(1)|❤️|43.8%|
-|0632|Smallest Range Covering Elements from K Lists|[Go]({{< relref "/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}})|Hard||||60.4%|
-|0643|Maximum Average Subarray I|[Go]({{< relref "/ChapterFour/0600~0699/0643.Maximum-Average-Subarray-I.md" >}})|Easy||||43.8%|
-|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||46.7%|
-|0713|Subarray Product Less Than K|[Go]({{< relref "/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K.md" >}})|Medium||||45.0%|
-|0718|Maximum Length of Repeated Subarray|[Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}})|Medium||||51.6%|
+|0424|Longest Repeating Character Replacement|[Go]({{< relref "/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md" >}})|Medium| O(n)| O(1) ||51.9%|
+|0438|Find All Anagrams in a String|[Go]({{< relref "/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md" >}})|Medium||||50.2%|
+|0480|Sliding Window Median|[Go]({{< relref "/ChapterFour/0400~0499/0480.Sliding-Window-Median.md" >}})|Hard| O(n * log k)| O(k)|❤️|41.3%|
+|0567|Permutation in String|[Go]({{< relref "/ChapterFour/0500~0599/0567.Permutation-in-String.md" >}})|Medium| O(n)| O(1)|❤️|44.4%|
+|0632|Smallest Range Covering Elements from K Lists|[Go]({{< relref "/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}})|Hard||||60.9%|
+|0643|Maximum Average Subarray I|[Go]({{< relref "/ChapterFour/0600~0699/0643.Maximum-Average-Subarray-I.md" >}})|Easy||||43.7%|
+|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||46.8%|
+|0713|Subarray Product Less Than K|[Go]({{< relref "/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K.md" >}})|Medium||||45.7%|
+|0718|Maximum Length of Repeated Subarray|[Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}})|Medium||||51.3%|
|0862|Shortest Subarray with Sum at Least K|[Go]({{< relref "/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K.md" >}})|Hard||||26.1%|
-|0904|Fruit Into Baskets|[Go]({{< relref "/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md" >}})|Medium||||42.6%|
-|0930|Binary Subarrays With Sum|[Go]({{< relref "/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md" >}})|Medium||||50.9%|
-|0978|Longest Turbulent Subarray|[Go]({{< relref "/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md" >}})|Medium| O(n)| O(1)|❤️|47.4%|
-|0992|Subarrays with K Different Integers|[Go]({{< relref "/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md" >}})|Hard| O(n)| O(n)|❤️|54.3%|
-|0995|Minimum Number of K Consecutive Bit Flips|[Go]({{< relref "/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md" >}})|Hard| O(n)| O(1)|❤️|51.1%|
-|1004|Max Consecutive Ones III|[Go]({{< relref "/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md" >}})|Medium| O(n)| O(1) ||63.5%|
-|1052|Grumpy Bookstore Owner|[Go]({{< relref "/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner.md" >}})|Medium| O(n log n)| O(1) ||57.0%|
-|1208|Get Equal Substrings Within Budget|[Go]({{< relref "/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md" >}})|Medium||||47.6%|
-|1234|Replace the Substring for Balanced String|[Go]({{< relref "/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md" >}})|Medium||||36.8%|
+|0904|Fruit Into Baskets|[Go]({{< relref "/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md" >}})|Medium||||43.7%|
+|0930|Binary Subarrays With Sum|[Go]({{< relref "/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md" >}})|Medium||||52.0%|
+|0978|Longest Turbulent Subarray|[Go]({{< relref "/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md" >}})|Medium| O(n)| O(1)|❤️|47.2%|
+|0992|Subarrays with K Different Integers|[Go]({{< relref "/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md" >}})|Hard| O(n)| O(n)|❤️|54.7%|
+|0995|Minimum Number of K Consecutive Bit Flips|[Go]({{< relref "/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md" >}})|Hard| O(n)| O(1)|❤️|51.2%|
+|1004|Max Consecutive Ones III|[Go]({{< relref "/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md" >}})|Medium| O(n)| O(1) ||63.2%|
+|1052|Grumpy Bookstore Owner|[Go]({{< relref "/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner.md" >}})|Medium| O(n log n)| O(1) ||57.1%|
+|1208|Get Equal Substrings Within Budget|[Go]({{< relref "/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md" >}})|Medium||||48.5%|
+|1234|Replace the Substring for Balanced String|[Go]({{< relref "/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md" >}})|Medium||||37.1%|
|1423|Maximum Points You Can Obtain from Cards|[Go]({{< relref "/ChapterFour/1400~1499/1423.Maximum-Points-You-Can-Obtain-from-Cards.md" >}})|Medium||||52.3%|
-|1438|Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit|[Go]({{< relref "/ChapterFour/1400~1499/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit.md" >}})|Medium||||48.0%|
+|1438|Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit|[Go]({{< relref "/ChapterFour/1400~1499/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit.md" >}})|Medium||||48.3%|
|1658|Minimum Operations to Reduce X to Zero|[Go]({{< relref "/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md" >}})|Medium||||37.6%|
-|1695|Maximum Erasure Value|[Go]({{< relref "/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md" >}})|Medium||||57.7%|
-|1696|Jump Game VI|[Go]({{< relref "/ChapterFour/1600~1699/1696.Jump-Game-VI.md" >}})|Medium||||46.3%|
-|1763|Longest Nice Substring|[Go]({{< relref "/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md" >}})|Easy||||61.7%|
-|1984|Minimum Difference Between Highest and Lowest of K Scores|[Go]({{< relref "/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md" >}})|Easy||||53.5%|
+|1695|Maximum Erasure Value|[Go]({{< relref "/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md" >}})|Medium||||57.6%|
+|1696|Jump Game VI|[Go]({{< relref "/ChapterFour/1600~1699/1696.Jump-Game-VI.md" >}})|Medium||||46.1%|
+|1763|Longest Nice Substring|[Go]({{< relref "/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md" >}})|Easy||||61.6%|
+|1984|Minimum Difference Between Highest and Lowest of K Scores|[Go]({{< relref "/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md" >}})|Easy||||54.4%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
----------------------------------------------
diff --git a/website/content/ChapterTwo/Sorting.md b/website/content/ChapterTwo/Sorting.md
index 92a2b7a27..b73cc3075 100755
--- a/website/content/ChapterTwo/Sorting.md
+++ b/website/content/ChapterTwo/Sorting.md
@@ -8,128 +8,128 @@ weight: 14
-- 深刻的理解多路快排。第 75 题。
-- 链表的排序，插入排序(第 147 题)和归并排序(第 148 题)
-- 桶排序和基数排序。第 164 题。
-- "摆动排序"。第 324 题。
-- 两两不相邻的排序。第 767 题，第 1054 题。
-- "饼子排序"。第 969 题。
-
+- Deep understanding of multi-way quick sort. Question 75.
+- Sorting of linked lists, insertion sort (question 147) and merge sort (question 148)
+- Bucket sort and radix sort. Question 164.
+- "Swing Sort". Question 324.
+- Sorting that is not adjacent to each other. Question 767, question 1054.
+- "Sorting pancakes". Question 969.
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
-|0015|3Sum|[Go]({{< relref "/ChapterFour/0001~0099/0015.3Sum.md" >}})|Medium||||32.2%|
-|0016|3Sum Closest|[Go]({{< relref "/ChapterFour/0001~0099/0016.3Sum-Closest.md" >}})|Medium||||46.2%|
-|0018|4Sum|[Go]({{< relref "/ChapterFour/0001~0099/0018.4Sum.md" >}})|Medium||||36.5%|
-|0049|Group Anagrams|[Go]({{< relref "/ChapterFour/0001~0099/0049.Group-Anagrams.md" >}})|Medium||||65.9%|
-|0056|Merge Intervals|[Go]({{< relref "/ChapterFour/0001~0099/0056.Merge-Intervals.md" >}})|Medium| O(n log n)| O(log n)||45.9%|
-|0075|Sort Colors|[Go]({{< relref "/ChapterFour/0001~0099/0075.Sort-Colors.md" >}})|Medium| O(n)| O(1)|❤️|57.1%|
-|0088|Merge Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md" >}})|Easy||||45.7%|
-|0147|Insertion Sort List|[Go]({{< relref "/ChapterFour/0100~0199/0147.Insertion-Sort-List.md" >}})|Medium| O(n^2)| O(1) |❤️|50.1%|
-|0148|Sort List|[Go]({{< relref "/ChapterFour/0100~0199/0148.Sort-List.md" >}})|Medium|O(n log n)| O(log n)|❤️|54.0%|
-|0164|Maximum Gap|[Go]({{< relref "/ChapterFour/0100~0199/0164.Maximum-Gap.md" >}})|Hard| O(n log n)| O(log n) |❤️|42.6%|
-|0169|Majority Element|[Go]({{< relref "/ChapterFour/0100~0199/0169.Majority-Element.md" >}})|Easy||||63.8%|
-|0179|Largest Number|[Go]({{< relref "/ChapterFour/0100~0199/0179.Largest-Number.md" >}})|Medium| O(n log n)| O(log n) |❤️|33.9%|
-|0215|Kth Largest Element in an Array|[Go]({{< relref "/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array.md" >}})|Medium||||65.7%|
-|0217|Contains Duplicate|[Go]({{< relref "/ChapterFour/0200~0299/0217.Contains-Duplicate.md" >}})|Easy||||61.2%|
-|0220|Contains Duplicate III|[Go]({{< relref "/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md" >}})|Hard| O(n log n)| O(1) |❤️|21.8%|
-|0229|Majority Element II|[Go]({{< relref "/ChapterFour/0200~0299/0229.Majority-Element-II.md" >}})|Medium||||44.0%|
-|0242|Valid Anagram|[Go]({{< relref "/ChapterFour/0200~0299/0242.Valid-Anagram.md" >}})|Easy| O(n)| O(n) ||62.7%|
-|0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy||||61.5%|
-|0274|H-Index|[Go]({{< relref "/ChapterFour/0200~0299/0274.H-Index.md" >}})|Medium| O(n)| O(n) ||38.1%|
-|0324|Wiggle Sort II|[Go]({{< relref "/ChapterFour/0300~0399/0324.Wiggle-Sort-II.md" >}})|Medium| O(n)| O(n)|❤️|32.9%|
-|0347|Top K Frequent Elements|[Go]({{< relref "/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md" >}})|Medium||||64.8%|
-|0349|Intersection of Two Arrays|[Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}})|Easy| O(n)| O(n) ||70.2%|
-|0350|Intersection of Two Arrays II|[Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}})|Easy| O(n)| O(n) ||55.5%|
-|0354|Russian Doll Envelopes|[Go]({{< relref "/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md" >}})|Hard||||38.3%|
-|0368|Largest Divisible Subset|[Go]({{< relref "/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md" >}})|Medium||||41.2%|
-|0378|Kth Smallest Element in a Sorted Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md" >}})|Medium||||61.6%|
-|0389|Find the Difference|[Go]({{< relref "/ChapterFour/0300~0399/0389.Find-the-Difference.md" >}})|Easy||||60.4%|
-|0414|Third Maximum Number|[Go]({{< relref "/ChapterFour/0400~0499/0414.Third-Maximum-Number.md" >}})|Easy||||32.5%|
-|0435|Non-overlapping Intervals|[Go]({{< relref "/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md" >}})|Medium||||49.8%|
-|0436|Find Right Interval|[Go]({{< relref "/ChapterFour/0400~0499/0436.Find-Right-Interval.md" >}})|Medium||||50.3%|
-|0451|Sort Characters By Frequency|[Go]({{< relref "/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md" >}})|Medium||||68.5%|
-|0455|Assign Cookies|[Go]({{< relref "/ChapterFour/0400~0499/0455.Assign-Cookies.md" >}})|Easy||||50.6%|
-|0462|Minimum Moves to Equal Array Elements II|[Go]({{< relref "/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II.md" >}})|Medium||||60.1%|
-|0475|Heaters|[Go]({{< relref "/ChapterFour/0400~0499/0475.Heaters.md" >}})|Medium||||36.0%|
-|0506|Relative Ranks|[Go]({{< relref "/ChapterFour/0500~0599/0506.Relative-Ranks.md" >}})|Easy||||58.8%|
-|0524|Longest Word in Dictionary through Deleting|[Go]({{< relref "/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})|Medium| O(n)| O(1) ||51.2%|
-|0532|K-diff Pairs in an Array|[Go]({{< relref "/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md" >}})|Medium||||40.7%|
-|0561|Array Partition|[Go]({{< relref "/ChapterFour/0500~0599/0561.Array-Partition.md" >}})|Easy||||76.5%|
-|0581|Shortest Unsorted Continuous Subarray|[Go]({{< relref "/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md" >}})|Medium||||36.2%|
-|0594|Longest Harmonious Subsequence|[Go]({{< relref "/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md" >}})|Easy||||53.1%|
-|0611|Valid Triangle Number|[Go]({{< relref "/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md" >}})|Medium||||50.3%|
-|0628|Maximum Product of Three Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md" >}})|Easy||||46.4%|
-|0632|Smallest Range Covering Elements from K Lists|[Go]({{< relref "/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}})|Hard||||60.4%|
-|0645|Set Mismatch|[Go]({{< relref "/ChapterFour/0600~0699/0645.Set-Mismatch.md" >}})|Easy||||41.4%|
-|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||46.7%|
-|0692|Top K Frequent Words|[Go]({{< relref "/ChapterFour/0600~0699/0692.Top-K-Frequent-Words.md" >}})|Medium||||55.2%|
-|0710|Random Pick with Blacklist|[Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}})|Hard| O(n)| O(n) ||33.6%|
-|0719|Find K-th Smallest Pair Distance|[Go]({{< relref "/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md" >}})|Hard||||36.3%|
-|0720|Longest Word in Dictionary|[Go]({{< relref "/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md" >}})|Medium||||51.8%|
-|0726|Number of Atoms|[Go]({{< relref "/ChapterFour/0700~0799/0726.Number-of-Atoms.md" >}})|Hard||||52.2%|
-|0747|Largest Number At Least Twice of Others|[Go]({{< relref "/ChapterFour/0700~0799/0747.Largest-Number-At-Least-Twice-of-Others.md" >}})|Easy||||46.3%|
-|0767|Reorganize String|[Go]({{< relref "/ChapterFour/0700~0799/0767.Reorganize-String.md" >}})|Medium| O(n log n)| O(log n) |❤️|52.7%|
-|0786|K-th Smallest Prime Fraction|[Go]({{< relref "/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md" >}})|Medium||||50.6%|
-|0791|Custom Sort String|[Go]({{< relref "/ChapterFour/0700~0799/0791.Custom-Sort-String.md" >}})|Medium||||69.4%|
-|0792|Number of Matching Subsequences|[Go]({{< relref "/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences.md" >}})|Medium||||51.9%|
+|0015|3Sum|[Go]({{< relref "/ChapterFour/0001~0099/0015.3Sum.md" >}})|Medium||||32.5%|
+|0016|3Sum Closest|[Go]({{< relref "/ChapterFour/0001~0099/0016.3Sum-Closest.md" >}})|Medium||||45.8%|
+|0018|4Sum|[Go]({{< relref "/ChapterFour/0001~0099/0018.4Sum.md" >}})|Medium||||36.0%|
+|0049|Group Anagrams|[Go]({{< relref "/ChapterFour/0001~0099/0049.Group-Anagrams.md" >}})|Medium||||66.7%|
+|0056|Merge Intervals|[Go]({{< relref "/ChapterFour/0001~0099/0056.Merge-Intervals.md" >}})|Medium| O(n log n)| O(log n)||46.2%|
+|0075|Sort Colors|[Go]({{< relref "/ChapterFour/0001~0099/0075.Sort-Colors.md" >}})|Medium| O(n)| O(1)|❤️|58.4%|
+|0088|Merge Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md" >}})|Easy||||46.5%|
+|0147|Insertion Sort List|[Go]({{< relref "/ChapterFour/0100~0199/0147.Insertion-Sort-List.md" >}})|Medium| O(n^2)| O(1) |❤️|50.9%|
+|0148|Sort List|[Go]({{< relref "/ChapterFour/0100~0199/0148.Sort-List.md" >}})|Medium|O(n log n)| O(log n)|❤️|55.0%|
+|0164|Maximum Gap|[Go]({{< relref "/ChapterFour/0100~0199/0164.Maximum-Gap.md" >}})|Hard| O(n log n)| O(log n) |❤️|43.3%|
+|0169|Majority Element|[Go]({{< relref "/ChapterFour/0100~0199/0169.Majority-Element.md" >}})|Easy||||63.9%|
+|0179|Largest Number|[Go]({{< relref "/ChapterFour/0100~0199/0179.Largest-Number.md" >}})|Medium| O(n log n)| O(log n) |❤️|34.5%|
+|0215|Kth Largest Element in an Array|[Go]({{< relref "/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array.md" >}})|Medium||||66.1%|
+|0217|Contains Duplicate|[Go]({{< relref "/ChapterFour/0200~0299/0217.Contains-Duplicate.md" >}})|Easy||||61.4%|
+|0220|Contains Duplicate III|[Go]({{< relref "/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md" >}})|Hard| O(n log n)| O(1) |❤️|22.1%|
+|0229|Majority Element II|[Go]({{< relref "/ChapterFour/0200~0299/0229.Majority-Element-II.md" >}})|Medium||||45.0%|
+|0242|Valid Anagram|[Go]({{< relref "/ChapterFour/0200~0299/0242.Valid-Anagram.md" >}})|Easy| O(n)| O(n) ||63.0%|
+|0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy||||62.4%|
+|0274|H-Index|[Go]({{< relref "/ChapterFour/0200~0299/0274.H-Index.md" >}})|Medium| O(n)| O(n) ||38.3%|
+|0324|Wiggle Sort II|[Go]({{< relref "/ChapterFour/0300~0399/0324.Wiggle-Sort-II.md" >}})|Medium| O(n)| O(n)|❤️|33.3%|
+|0347|Top K Frequent Elements|[Go]({{< relref "/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md" >}})|Medium||||64.3%|
+|0349|Intersection of Two Arrays|[Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}})|Easy| O(n)| O(n) ||70.9%|
+|0350|Intersection of Two Arrays II|[Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}})|Easy| O(n)| O(n) ||55.9%|
+|0354|Russian Doll Envelopes|[Go]({{< relref "/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md" >}})|Hard||||38.0%|
+|0368|Largest Divisible Subset|[Go]({{< relref "/ChapterFour/0300~0399/0368.Largest-Divisible-Subset.md" >}})|Medium||||41.5%|
+|0378|Kth Smallest Element in a Sorted Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md" >}})|Medium||||61.8%|
+|0389|Find the Difference|[Go]({{< relref "/ChapterFour/0300~0399/0389.Find-the-Difference.md" >}})|Easy||||60.0%|
+|0414|Third Maximum Number|[Go]({{< relref "/ChapterFour/0400~0499/0414.Third-Maximum-Number.md" >}})|Easy||||33.1%|
+|0435|Non-overlapping Intervals|[Go]({{< relref "/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md" >}})|Medium||||50.2%|
+|0436|Find Right Interval|[Go]({{< relref "/ChapterFour/0400~0499/0436.Find-Right-Interval.md" >}})|Medium||||50.7%|
+|0451|Sort Characters By Frequency|[Go]({{< relref "/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md" >}})|Medium||||70.0%|
+|0455|Assign Cookies|[Go]({{< relref "/ChapterFour/0400~0499/0455.Assign-Cookies.md" >}})|Easy||||50.0%|
+|0462|Minimum Moves to Equal Array Elements II|[Go]({{< relref "/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II.md" >}})|Medium||||60.0%|
+|0475|Heaters|[Go]({{< relref "/ChapterFour/0400~0499/0475.Heaters.md" >}})|Medium||||36.4%|
+|0506|Relative Ranks|[Go]({{< relref "/ChapterFour/0500~0599/0506.Relative-Ranks.md" >}})|Easy||||60.3%|
+|0524|Longest Word in Dictionary through Deleting|[Go]({{< relref "/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})|Medium| O(n)| O(1) ||51.0%|
+|0532|K-diff Pairs in an Array|[Go]({{< relref "/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md" >}})|Medium||||41.1%|
+|0561|Array Partition|[Go]({{< relref "/ChapterFour/0500~0599/0561.Array-Partition.md" >}})|Easy||||77.1%|
+|0581|Shortest Unsorted Continuous Subarray|[Go]({{< relref "/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md" >}})|Medium||||36.4%|
+|0594|Longest Harmonious Subsequence|[Go]({{< relref "/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md" >}})|Easy||||53.5%|
+|0611|Valid Triangle Number|[Go]({{< relref "/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md" >}})|Medium||||50.5%|
+|0628|Maximum Product of Three Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md" >}})|Easy||||46.0%|
+|0632|Smallest Range Covering Elements from K Lists|[Go]({{< relref "/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}})|Hard||||60.9%|
+|0645|Set Mismatch|[Go]({{< relref "/ChapterFour/0600~0699/0645.Set-Mismatch.md" >}})|Easy||||42.8%|
+|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||46.8%|
+|0692|Top K Frequent Words|[Go]({{< relref "/ChapterFour/0600~0699/0692.Top-K-Frequent-Words.md" >}})|Medium||||57.1%|
+|0710|Random Pick with Blacklist|[Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}})|Hard| O(n)| O(n) ||33.5%|
+|0719|Find K-th Smallest Pair Distance|[Go]({{< relref "/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md" >}})|Hard||||36.7%|
+|0720|Longest Word in Dictionary|[Go]({{< relref "/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md" >}})|Medium||||51.9%|
+|0726|Number of Atoms|[Go]({{< relref "/ChapterFour/0700~0799/0726.Number-of-Atoms.md" >}})|Hard||||52.1%|
+|0747|Largest Number At Least Twice of Others|[Go]({{< relref "/ChapterFour/0700~0799/0747.Largest-Number-At-Least-Twice-of-Others.md" >}})|Easy||||47.0%|
+|0767|Reorganize String|[Go]({{< relref "/ChapterFour/0700~0799/0767.Reorganize-String.md" >}})|Medium| O(n log n)| O(log n) |❤️|52.9%|
+|0786|K-th Smallest Prime Fraction|[Go]({{< relref "/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md" >}})|Medium||||51.6%|
+|0791|Custom Sort String|[Go]({{< relref "/ChapterFour/0700~0799/0791.Custom-Sort-String.md" >}})|Medium||||69.2%|
+|0792|Number of Matching Subsequences|[Go]({{< relref "/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences.md" >}})|Medium||||51.7%|
|0825|Friends Of Appropriate Ages|[Go]({{< relref "/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages.md" >}})|Medium||||46.3%|
-|0826|Most Profit Assigning Work|[Go]({{< relref "/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md" >}})|Medium||||44.3%|
-|0846|Hand of Straights|[Go]({{< relref "/ChapterFour/0800~0899/0846.Hand-of-Straights.md" >}})|Medium||||56.5%|
-|0853|Car Fleet|[Go]({{< relref "/ChapterFour/0800~0899/0853.Car-Fleet.md" >}})|Medium| O(n log n)| O(log n) ||50.0%|
-|0869|Reordered Power of 2|[Go]({{< relref "/ChapterFour/0800~0899/0869.Reordered-Power-of-2.md" >}})|Medium||||64.1%|
-|0870|Advantage Shuffle|[Go]({{< relref "/ChapterFour/0800~0899/0870.Advantage-Shuffle.md" >}})|Medium||||51.6%|
-|0881|Boats to Save People|[Go]({{< relref "/ChapterFour/0800~0899/0881.Boats-to-Save-People.md" >}})|Medium||||52.7%|
-|0888|Fair Candy Swap|[Go]({{< relref "/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md" >}})|Easy||||60.5%|
-|0891|Sum of Subsequence Widths|[Go]({{< relref "/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md" >}})|Hard||||36.4%|
-|0910|Smallest Range II|[Go]({{< relref "/ChapterFour/0900~0999/0910.Smallest-Range-II.md" >}})|Medium||||34.4%|
+|0826|Most Profit Assigning Work|[Go]({{< relref "/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md" >}})|Medium||||44.8%|
+|0846|Hand of Straights|[Go]({{< relref "/ChapterFour/0800~0899/0846.Hand-of-Straights.md" >}})|Medium||||56.2%|
+|0853|Car Fleet|[Go]({{< relref "/ChapterFour/0800~0899/0853.Car-Fleet.md" >}})|Medium| O(n log n)| O(log n) ||50.3%|
+|0869|Reordered Power of 2|[Go]({{< relref "/ChapterFour/0800~0899/0869.Reordered-Power-of-2.md" >}})|Medium||||63.6%|
+|0870|Advantage Shuffle|[Go]({{< relref "/ChapterFour/0800~0899/0870.Advantage-Shuffle.md" >}})|Medium||||51.8%|
+|0881|Boats to Save People|[Go]({{< relref "/ChapterFour/0800~0899/0881.Boats-to-Save-People.md" >}})|Medium||||53.1%|
+|0888|Fair Candy Swap|[Go]({{< relref "/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md" >}})|Easy||||60.7%|
+|0891|Sum of Subsequence Widths|[Go]({{< relref "/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md" >}})|Hard||||36.6%|
+|0910|Smallest Range II|[Go]({{< relref "/ChapterFour/0900~0999/0910.Smallest-Range-II.md" >}})|Medium||||35.1%|
|0922|Sort Array By Parity II|[Go]({{< relref "/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II.md" >}})|Easy| O(n)| O(1) ||70.7%|
-|0923|3Sum With Multiplicity|[Go]({{< relref "/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md" >}})|Medium||||45.4%|
-|0969|Pancake Sorting|[Go]({{< relref "/ChapterFour/0900~0999/0969.Pancake-Sorting.md" >}})|Medium| O(n log n)| O(log n) |❤️|70.0%|
-|0973|K Closest Points to Origin|[Go]({{< relref "/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md" >}})|Medium| O(n log n)| O(log n) ||65.9%|
-|0976|Largest Perimeter Triangle|[Go]({{< relref "/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md" >}})|Easy| O(n log n)| O(log n) ||54.8%|
+|0923|3Sum With Multiplicity|[Go]({{< relref "/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md" >}})|Medium||||45.3%|
+|0969|Pancake Sorting|[Go]({{< relref "/ChapterFour/0900~0999/0969.Pancake-Sorting.md" >}})|Medium| O(n log n)| O(log n) |❤️|70.1%|
+|0973|K Closest Points to Origin|[Go]({{< relref "/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md" >}})|Medium| O(n log n)| O(log n) ||65.7%|
+|0976|Largest Perimeter Triangle|[Go]({{< relref "/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md" >}})|Easy| O(n log n)| O(log n) ||54.6%|
|0977|Squares of a Sorted Array|[Go]({{< relref "/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array.md" >}})|Easy||||71.9%|
-|1005|Maximize Sum Of Array After K Negations|[Go]({{< relref "/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations.md" >}})|Easy||||51.1%|
-|1030|Matrix Cells in Distance Order|[Go]({{< relref "/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md" >}})|Easy| O(n^2)| O(1) ||69.3%|
-|1040|Moving Stones Until Consecutive II|[Go]({{< relref "/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md" >}})|Medium||||55.6%|
-|1051|Height Checker|[Go]({{< relref "/ChapterFour/1000~1099/1051.Height-Checker.md" >}})|Easy||||75.0%|
-|1054|Distant Barcodes|[Go]({{< relref "/ChapterFour/1000~1099/1054.Distant-Barcodes.md" >}})|Medium| O(n log n)| O(log n) |❤️|45.7%|
-|1122|Relative Sort Array|[Go]({{< relref "/ChapterFour/1100~1199/1122.Relative-Sort-Array.md" >}})|Easy||||68.4%|
-|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||61.3%|
-|1200|Minimum Absolute Difference|[Go]({{< relref "/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference.md" >}})|Easy||||69.8%|
-|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||51.1%|
-|1296|Divide Array in Sets of K Consecutive Numbers|[Go]({{< relref "/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.md" >}})|Medium||||56.6%|
-|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||43.1%|
+|1005|Maximize Sum Of Array After K Negations|[Go]({{< relref "/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations.md" >}})|Easy||||50.9%|
+|1030|Matrix Cells in Distance Order|[Go]({{< relref "/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md" >}})|Easy| O(n^2)| O(1) ||69.6%|
+|1040|Moving Stones Until Consecutive II|[Go]({{< relref "/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md" >}})|Medium||||55.8%|
+|1051|Height Checker|[Go]({{< relref "/ChapterFour/1000~1099/1051.Height-Checker.md" >}})|Easy||||75.5%|
+|1054|Distant Barcodes|[Go]({{< relref "/ChapterFour/1000~1099/1054.Distant-Barcodes.md" >}})|Medium| O(n log n)| O(log n) |❤️|45.8%|
+|1122|Relative Sort Array|[Go]({{< relref "/ChapterFour/1100~1199/1122.Relative-Sort-Array.md" >}})|Easy||||68.6%|
+|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||61.5%|
+|1200|Minimum Absolute Difference|[Go]({{< relref "/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference.md" >}})|Easy||||69.6%|
+|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||53.4%|
+|1296|Divide Array in Sets of K Consecutive Numbers|[Go]({{< relref "/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers.md" >}})|Medium||||56.5%|
+|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||43.6%|
|1305|All Elements in Two Binary Search Trees|[Go]({{< relref "/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees.md" >}})|Medium||||79.8%|
-|1329|Sort the Matrix Diagonally|[Go]({{< relref "/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md" >}})|Medium||||83.6%|
-|1337|The K Weakest Rows in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md" >}})|Easy||||73.1%|
-|1383|Maximum Performance of a Team|[Go]({{< relref "/ChapterFour/1300~1399/1383.Maximum-Performance-of-a-Team.md" >}})|Hard||||49.0%|
-|1385|Find the Distance Value Between Two Arrays|[Go]({{< relref "/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md" >}})|Easy||||65.3%|
-|1464|Maximum Product of Two Elements in an Array|[Go]({{< relref "/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md" >}})|Easy||||79.2%|
-|1465|Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts|[Go]({{< relref "/ChapterFour/1400~1499/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts.md" >}})|Medium||||40.8%|
-|1608|Special Array With X Elements Greater Than or Equal X|[Go]({{< relref "/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md" >}})|Easy||||60.0%|
-|1619|Mean of Array After Removing Some Elements|[Go]({{< relref "/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements.md" >}})|Easy||||64.6%|
-|1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||68.6%|
-|1647|Minimum Deletions to Make Character Frequencies Unique|[Go]({{< relref "/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md" >}})|Medium||||59.2%|
-|1648|Sell Diminishing-Valued Colored Balls|[Go]({{< relref "/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}})|Medium||||30.5%|
-|1657|Determine if Two Strings Are Close|[Go]({{< relref "/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md" >}})|Medium||||54.2%|
-|1665|Minimum Initial Energy to Finish Tasks|[Go]({{< relref "/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks.md" >}})|Hard||||56.2%|
-|1679|Max Number of K-Sum Pairs|[Go]({{< relref "/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md" >}})|Medium||||57.4%|
-|1691|Maximum Height by Stacking Cuboids|[Go]({{< relref "/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids.md" >}})|Hard||||54.2%|
-|1710|Maximum Units on a Truck|[Go]({{< relref "/ChapterFour/1700~1799/1710.Maximum-Units-on-a-Truck.md" >}})|Easy||||74.0%|
-|1818|Minimum Absolute Sum Difference|[Go]({{< relref "/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference.md" >}})|Medium||||30.1%|
-|1846|Maximum Element After Decreasing and Rearranging|[Go]({{< relref "/ChapterFour/1800~1899/1846.Maximum-Element-After-Decreasing-and-Rearranging.md" >}})|Medium||||59.1%|
-|1877|Minimize Maximum Pair Sum in Array|[Go]({{< relref "/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array.md" >}})|Medium||||80.4%|
-|1984|Minimum Difference Between Highest and Lowest of K Scores|[Go]({{< relref "/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md" >}})|Easy||||53.5%|
-|2037|Minimum Number of Moves to Seat Everyone|[Go]({{< relref "/ChapterFour/2000~2099/2037.Minimum-Number-of-Moves-to-Seat-Everyone.md" >}})|Easy||||82.2%|
-|2164|Sort Even and Odd Indices Independently|[Go]({{< relref "/ChapterFour/2100~2199/2164.Sort-Even-and-Odd-Indices-Independently.md" >}})|Easy||||66.6%|
-|2165|Smallest Value of the Rearranged Number|[Go]({{< relref "/ChapterFour/2100~2199/2165.Smallest-Value-of-the-Rearranged-Number.md" >}})|Medium||||51.1%|
+|1329|Sort the Matrix Diagonally|[Go]({{< relref "/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md" >}})|Medium||||83.4%|
+|1337|The K Weakest Rows in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md" >}})|Easy||||72.1%|
+|1353|Maximum Number of Events That Can Be Attended|[Go]({{< relref "/ChapterFour/1300~1399/1353.Maximum-Number-of-Events-That-Can-Be-Attended.md" >}})|Medium||||32.6%|
+|1383|Maximum Performance of a Team|[Go]({{< relref "/ChapterFour/1300~1399/1383.Maximum-Performance-of-a-Team.md" >}})|Hard||||48.5%|
+|1385|Find the Distance Value Between Two Arrays|[Go]({{< relref "/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md" >}})|Easy||||66.4%|
+|1464|Maximum Product of Two Elements in an Array|[Go]({{< relref "/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md" >}})|Easy||||79.9%|
+|1465|Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts|[Go]({{< relref "/ChapterFour/1400~1499/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts.md" >}})|Medium||||40.9%|
+|1608|Special Array With X Elements Greater Than or Equal X|[Go]({{< relref "/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md" >}})|Easy||||60.4%|
+|1619|Mean of Array After Removing Some Elements|[Go]({{< relref "/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements.md" >}})|Easy||||65.6%|
+|1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||69.5%|
+|1647|Minimum Deletions to Make Character Frequencies Unique|[Go]({{< relref "/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md" >}})|Medium||||59.1%|
+|1648|Sell Diminishing-Valued Colored Balls|[Go]({{< relref "/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}})|Medium||||30.4%|
+|1657|Determine if Two Strings Are Close|[Go]({{< relref "/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md" >}})|Medium||||56.3%|
+|1665|Minimum Initial Energy to Finish Tasks|[Go]({{< relref "/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks.md" >}})|Hard||||56.3%|
+|1679|Max Number of K-Sum Pairs|[Go]({{< relref "/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md" >}})|Medium||||57.3%|
+|1691|Maximum Height by Stacking Cuboids|[Go]({{< relref "/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids.md" >}})|Hard||||54.4%|
+|1710|Maximum Units on a Truck|[Go]({{< relref "/ChapterFour/1700~1799/1710.Maximum-Units-on-a-Truck.md" >}})|Easy||||73.8%|
+|1818|Minimum Absolute Sum Difference|[Go]({{< relref "/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference.md" >}})|Medium||||30.3%|
+|1846|Maximum Element After Decreasing and Rearranging|[Go]({{< relref "/ChapterFour/1800~1899/1846.Maximum-Element-After-Decreasing-and-Rearranging.md" >}})|Medium||||58.9%|
+|1877|Minimize Maximum Pair Sum in Array|[Go]({{< relref "/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array.md" >}})|Medium||||79.9%|
+|1984|Minimum Difference Between Highest and Lowest of K Scores|[Go]({{< relref "/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.md" >}})|Easy||||54.4%|
+|2037|Minimum Number of Moves to Seat Everyone|[Go]({{< relref "/ChapterFour/2000~2099/2037.Minimum-Number-of-Moves-to-Seat-Everyone.md" >}})|Easy||||82.0%|
+|2164|Sort Even and Odd Indices Independently|[Go]({{< relref "/ChapterFour/2100~2199/2164.Sort-Even-and-Odd-Indices-Independently.md" >}})|Easy||||65.1%|
+|2165|Smallest Value of the Rearranged Number|[Go]({{< relref "/ChapterFour/2100~2199/2165.Smallest-Value-of-the-Rearranged-Number.md" >}})|Medium||||51.4%|
|2171|Removing Minimum Number of Magic Beans|[Go]({{< relref "/ChapterFour/2100~2199/2171.Removing-Minimum-Number-of-Magic-Beans.md" >}})|Medium||||42.0%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
----------------------------------------------
diff --git a/website/content/ChapterTwo/Stack.md b/website/content/ChapterTwo/Stack.md
index 22272f441..b83c6cb3c 100644
--- a/website/content/ChapterTwo/Stack.md
+++ b/website/content/ChapterTwo/Stack.md
@@ -8,77 +8,80 @@ weight: 5
-- 括号匹配问题及类似问题。第 20 题，第 921 题，第 1021 题。
-- 栈的基本 pop 和 push 操作。第 71 题，第 150 题，第 155 题，第 224 题，第 225 题，第 232 题，第 946 题，第 1047 题。
-- 利用栈进行编码问题。第 394 题，第 682 题，第 856 题，第 880 题。
-- **单调栈**。**利用栈维护一个单调递增或者递减的下标数组**。第 84 题，第 456 题，第 496 题，第 503 题，第 739 题，第 901 题，第 907 题，第 1019 题。
+- Bracket matching issues and similar. Question 20, question 921, question 1021.
+- Basic pop and push operations on the stack. Question 71, Question 150, Question 155, Question 224, Question 225, Question 232, Question 946, Question 1047.
+- Coding problems using the stack. Question 394, Question 682, Question 856, Question 880.
+- **Monotonic stack**. **Use the stack to maintain a monotonically increasing or decreasing subscript array**. Question 84, Question 456, Question 496, Question 503, Question 739, Question 901, Question 907, Question 1019.
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
-|0020|Valid Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0020.Valid-Parentheses.md" >}})|Easy| O(log n)| O(1)||40.7%|
-|0032|Longest Valid Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses.md" >}})|Hard||||32.7%|
-|0042|Trapping Rain Water|[Go]({{< relref "/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md" >}})|Hard| O(n)| O(1)|❤️|58.7%|
-|0071|Simplify Path|[Go]({{< relref "/ChapterFour/0001~0099/0071.Simplify-Path.md" >}})|Medium| O(n)| O(n)|❤️|39.2%|
-|0084|Largest Rectangle in Histogram|[Go]({{< relref "/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram.md" >}})|Hard| O(n)| O(n)|❤️|42.1%|
-|0094|Binary Tree Inorder Traversal|[Go]({{< relref "/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md" >}})|Easy| O(n)| O(1)||72.9%|
-|0114|Flatten Binary Tree to Linked List|[Go]({{< relref "/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})|Medium||||61.0%|
-|0143|Reorder List|[Go]({{< relref "/ChapterFour/0100~0199/0143.Reorder-List.md" >}})|Medium||||50.9%|
-|0144|Binary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md" >}})|Easy| O(n)| O(1)||64.5%|
-|0145|Binary Tree Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md" >}})|Easy| O(n)| O(1)||66.5%|
-|0150|Evaluate Reverse Polish Notation|[Go]({{< relref "/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md" >}})|Medium| O(n)| O(1)||44.1%|
-|0155|Min Stack|[Go]({{< relref "/ChapterFour/0100~0199/0155.Min-Stack.md" >}})|Medium| O(n)| O(n)||51.7%|
-|0173|Binary Search Tree Iterator|[Go]({{< relref "/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator.md" >}})|Medium| O(n)| O(1)||69.0%|
-|0224|Basic Calculator|[Go]({{< relref "/ChapterFour/0200~0299/0224.Basic-Calculator.md" >}})|Hard| O(n)| O(n)||41.1%|
-|0225|Implement Stack using Queues|[Go]({{< relref "/ChapterFour/0200~0299/0225.Implement-Stack-using-Queues.md" >}})|Easy| O(n)| O(n)||57.4%|
-|0227|Basic Calculator II|[Go]({{< relref "/ChapterFour/0200~0299/0227.Basic-Calculator-II.md" >}})|Medium||||42.2%|
-|0232|Implement Queue using Stacks|[Go]({{< relref "/ChapterFour/0200~0299/0232.Implement-Queue-using-Stacks.md" >}})|Easy| O(n)| O(n)||61.0%|
-|0234|Palindrome Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md" >}})|Easy||||49.4%|
-|0331|Verify Preorder Serialization of a Binary Tree|[Go]({{< relref "/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md" >}})|Medium| O(n)| O(1)||44.2%|
-|0341|Flatten Nested List Iterator|[Go]({{< relref "/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator.md" >}})|Medium||||61.5%|
-|0385|Mini Parser|[Go]({{< relref "/ChapterFour/0300~0399/0385.Mini-Parser.md" >}})|Medium||||36.5%|
-|0394|Decode String|[Go]({{< relref "/ChapterFour/0300~0399/0394.Decode-String.md" >}})|Medium| O(n)| O(n)||57.5%|
-|0402|Remove K Digits|[Go]({{< relref "/ChapterFour/0400~0499/0402.Remove-K-Digits.md" >}})|Medium| O(n)| O(1)||30.5%|
-|0445|Add Two Numbers II|[Go]({{< relref "/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md" >}})|Medium||||59.4%|
+|0020|Valid Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0020.Valid-Parentheses.md" >}})|Easy| O(log n)| O(1)||40.3%|
+|0032|Longest Valid Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses.md" >}})|Hard||||32.8%|
+|0042|Trapping Rain Water|[Go]({{< relref "/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md" >}})|Hard| O(n)| O(1)|❤️|59.2%|
+|0071|Simplify Path|[Go]({{< relref "/ChapterFour/0001~0099/0071.Simplify-Path.md" >}})|Medium| O(n)| O(n)|❤️|39.3%|
+|0084|Largest Rectangle in Histogram|[Go]({{< relref "/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram.md" >}})|Hard| O(n)| O(n)|❤️|42.5%|
+|0094|Binary Tree Inorder Traversal|[Go]({{< relref "/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md" >}})|Easy| O(n)| O(1)||73.7%|
+|0114|Flatten Binary Tree to Linked List|[Go]({{< relref "/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})|Medium||||61.7%|
+|0143|Reorder List|[Go]({{< relref "/ChapterFour/0100~0199/0143.Reorder-List.md" >}})|Medium||||52.4%|
+|0144|Binary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md" >}})|Easy| O(n)| O(1)||66.7%|
+|0145|Binary Tree Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md" >}})|Easy| O(n)| O(1)||67.8%|
+|0150|Evaluate Reverse Polish Notation|[Go]({{< relref "/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md" >}})|Medium| O(n)| O(1)||45.7%|
+|0155|Min Stack|[Go]({{< relref "/ChapterFour/0100~0199/0155.Min-Stack.md" >}})|Medium| O(n)| O(n)||52.3%|
+|0173|Binary Search Tree Iterator|[Go]({{< relref "/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator.md" >}})|Medium| O(n)| O(1)||69.7%|
+|0224|Basic Calculator|[Go]({{< relref "/ChapterFour/0200~0299/0224.Basic-Calculator.md" >}})|Hard| O(n)| O(n)||42.4%|
+|0225|Implement Stack using Queues|[Go]({{< relref "/ChapterFour/0200~0299/0225.Implement-Stack-using-Queues.md" >}})|Easy| O(n)| O(n)||58.5%|
+|0227|Basic Calculator II|[Go]({{< relref "/ChapterFour/0200~0299/0227.Basic-Calculator-II.md" >}})|Medium||||42.4%|
+|0232|Implement Queue using Stacks|[Go]({{< relref "/ChapterFour/0200~0299/0232.Implement-Queue-using-Stacks.md" >}})|Easy| O(n)| O(n)||63.1%|
+|0234|Palindrome Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md" >}})|Easy||||50.1%|
+|0331|Verify Preorder Serialization of a Binary Tree|[Go]({{< relref "/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md" >}})|Medium| O(n)| O(1)||44.6%|
+|0341|Flatten Nested List Iterator|[Go]({{< relref "/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator.md" >}})|Medium||||61.8%|
+|0385|Mini Parser|[Go]({{< relref "/ChapterFour/0300~0399/0385.Mini-Parser.md" >}})|Medium||||36.9%|
+|0394|Decode String|[Go]({{< relref "/ChapterFour/0300~0399/0394.Decode-String.md" >}})|Medium| O(n)| O(n)||57.8%|
+|0402|Remove K Digits|[Go]({{< relref "/ChapterFour/0400~0499/0402.Remove-K-Digits.md" >}})|Medium| O(n)| O(1)||30.6%|
+|0445|Add Two Numbers II|[Go]({{< relref "/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md" >}})|Medium||||59.6%|
|0456|132 Pattern|[Go]({{< relref "/ChapterFour/0400~0499/0456.132-Pattern.md" >}})|Medium| O(n)| O(n)||32.4%|
-|0496|Next Greater Element I|[Go]({{< relref "/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md" >}})|Easy| O(n)| O(n)||71.3%|
-|0503|Next Greater Element II|[Go]({{< relref "/ChapterFour/0500~0599/0503.Next-Greater-Element-II.md" >}})|Medium| O(n)| O(n)||63.0%|
-|0581|Shortest Unsorted Continuous Subarray|[Go]({{< relref "/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md" >}})|Medium||||36.2%|
-|0589|N-ary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal.md" >}})|Easy||||76.3%|
-|0636|Exclusive Time of Functions|[Go]({{< relref "/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md" >}})|Medium| O(n)| O(n)||61.0%|
-|0682|Baseball Game|[Go]({{< relref "/ChapterFour/0600~0699/0682.Baseball-Game.md" >}})|Easy| O(n)| O(n)||73.6%|
-|0726|Number of Atoms|[Go]({{< relref "/ChapterFour/0700~0799/0726.Number-of-Atoms.md" >}})|Hard| O(n)| O(n) |❤️|52.2%|
+|0496|Next Greater Element I|[Go]({{< relref "/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md" >}})|Easy| O(n)| O(n)||71.5%|
+|0503|Next Greater Element II|[Go]({{< relref "/ChapterFour/0500~0599/0503.Next-Greater-Element-II.md" >}})|Medium| O(n)| O(n)||63.2%|
+|0581|Shortest Unsorted Continuous Subarray|[Go]({{< relref "/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md" >}})|Medium||||36.4%|
+|0589|N-ary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal.md" >}})|Easy||||75.9%|
+|0636|Exclusive Time of Functions|[Go]({{< relref "/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md" >}})|Medium| O(n)| O(n)||61.2%|
+|0682|Baseball Game|[Go]({{< relref "/ChapterFour/0600~0699/0682.Baseball-Game.md" >}})|Easy| O(n)| O(n)||74.2%|
+|0726|Number of Atoms|[Go]({{< relref "/ChapterFour/0700~0799/0726.Number-of-Atoms.md" >}})|Hard| O(n)| O(n) |❤️|52.1%|
|0735|Asteroid Collision|[Go]({{< relref "/ChapterFour/0700~0799/0735.Asteroid-Collision.md" >}})|Medium| O(n)| O(n) ||44.4%|
-|0739|Daily Temperatures|[Go]({{< relref "/ChapterFour/0700~0799/0739.Daily-Temperatures.md" >}})|Medium| O(n)| O(n) ||66.5%|
+|0739|Daily Temperatures|[Go]({{< relref "/ChapterFour/0700~0799/0739.Daily-Temperatures.md" >}})|Medium| O(n)| O(n) ||66.3%|
|0844|Backspace String Compare|[Go]({{< relref "/ChapterFour/0800~0899/0844.Backspace-String-Compare.md" >}})|Easy| O(n)| O(n) ||48.0%|
-|0853|Car Fleet|[Go]({{< relref "/ChapterFour/0800~0899/0853.Car-Fleet.md" >}})|Medium||||50.0%|
-|0856|Score of Parentheses|[Go]({{< relref "/ChapterFour/0800~0899/0856.Score-of-Parentheses.md" >}})|Medium| O(n)| O(n)||65.1%|
+|0853|Car Fleet|[Go]({{< relref "/ChapterFour/0800~0899/0853.Car-Fleet.md" >}})|Medium||||50.3%|
+|0856|Score of Parentheses|[Go]({{< relref "/ChapterFour/0800~0899/0856.Score-of-Parentheses.md" >}})|Medium| O(n)| O(n)||64.8%|
|0880|Decoded String at Index|[Go]({{< relref "/ChapterFour/0800~0899/0880.Decoded-String-at-Index.md" >}})|Medium| O(n)| O(n)||28.3%|
-|0895|Maximum Frequency Stack|[Go]({{< relref "/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack.md" >}})|Hard| O(n)| O(n) ||66.8%|
-|0897|Increasing Order Search Tree|[Go]({{< relref "/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md" >}})|Easy||||78.4%|
-|0901|Online Stock Span|[Go]({{< relref "/ChapterFour/0900~0999/0901.Online-Stock-Span.md" >}})|Medium| O(n)| O(n) ||63.9%|
-|0907|Sum of Subarray Minimums|[Go]({{< relref "/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md" >}})|Medium| O(n)| O(n)|❤️|34.3%|
-|0921|Minimum Add to Make Parentheses Valid|[Go]({{< relref "/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid.md" >}})|Medium| O(n)| O(n)||76.4%|
-|0946|Validate Stack Sequences|[Go]({{< relref "/ChapterFour/0900~0999/0946.Validate-Stack-Sequences.md" >}})|Medium| O(n)| O(n)||67.6%|
+|0895|Maximum Frequency Stack|[Go]({{< relref "/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack.md" >}})|Hard| O(n)| O(n) ||66.6%|
+|0897|Increasing Order Search Tree|[Go]({{< relref "/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md" >}})|Easy||||78.5%|
+|0901|Online Stock Span|[Go]({{< relref "/ChapterFour/0900~0999/0901.Online-Stock-Span.md" >}})|Medium| O(n)| O(n) ||65.2%|
+|0907|Sum of Subarray Minimums|[Go]({{< relref "/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md" >}})|Medium| O(n)| O(n)|❤️|35.8%|
+|0921|Minimum Add to Make Parentheses Valid|[Go]({{< relref "/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid.md" >}})|Medium| O(n)| O(n)||75.8%|
+|0946|Validate Stack Sequences|[Go]({{< relref "/ChapterFour/0900~0999/0946.Validate-Stack-Sequences.md" >}})|Medium| O(n)| O(n)||67.7%|
|1003|Check If Word Is Valid After Substitutions|[Go]({{< relref "/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions.md" >}})|Medium| O(n)| O(1)||58.2%|
-|1006|Clumsy Factorial|[Go]({{< relref "/ChapterFour/1000~1099/1006.Clumsy-Factorial.md" >}})|Medium||||54.7%|
-|1019|Next Greater Node In Linked List|[Go]({{< relref "/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md" >}})|Medium| O(n)| O(1)||59.8%|
-|1021|Remove Outermost Parentheses|[Go]({{< relref "/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses.md" >}})|Easy| O(n)| O(1)||80.1%|
-|1047|Remove All Adjacent Duplicates In String|[Go]({{< relref "/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String.md" >}})|Easy| O(n)| O(1)||70.5%|
-|1111|Maximum Nesting Depth of Two Valid Parentheses Strings|[Go]({{< relref "/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md" >}})|Medium||||73.3%|
+|1006|Clumsy Factorial|[Go]({{< relref "/ChapterFour/1000~1099/1006.Clumsy-Factorial.md" >}})|Medium||||55.4%|
+|1019|Next Greater Node In Linked List|[Go]({{< relref "/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md" >}})|Medium| O(n)| O(1)||59.9%|
+|1021|Remove Outermost Parentheses|[Go]({{< relref "/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses.md" >}})|Easy| O(n)| O(1)||80.6%|
+|1047|Remove All Adjacent Duplicates In String|[Go]({{< relref "/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String.md" >}})|Easy| O(n)| O(1)||69.7%|
+|1111|Maximum Nesting Depth of Two Valid Parentheses Strings|[Go]({{< relref "/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md" >}})|Medium||||73.0%|
|1190|Reverse Substrings Between Each Pair of Parentheses|[Go]({{< relref "/ChapterFour/1100~1199/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses.md" >}})|Medium||||65.9%|
-|1209|Remove All Adjacent Duplicates in String II|[Go]({{< relref "/ChapterFour/1200~1299/1209.Remove-All-Adjacent-Duplicates-in-String-II.md" >}})|Medium||||56.0%|
-|1249|Minimum Remove to Make Valid Parentheses|[Go]({{< relref "/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md" >}})|Medium||||65.6%|
-|1614|Maximum Nesting Depth of the Parentheses|[Go]({{< relref "/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses.md" >}})|Easy||||82.7%|
-|1653|Minimum Deletions to Make String Balanced|[Go]({{< relref "/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md" >}})|Medium||||58.7%|
+|1209|Remove All Adjacent Duplicates in String II|[Go]({{< relref "/ChapterFour/1200~1299/1209.Remove-All-Adjacent-Duplicates-in-String-II.md" >}})|Medium||||56.2%|
+|1249|Minimum Remove to Make Valid Parentheses|[Go]({{< relref "/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md" >}})|Medium||||65.8%|
+|1614|Maximum Nesting Depth of the Parentheses|[Go]({{< relref "/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses.md" >}})|Easy||||82.3%|
+|1653|Minimum Deletions to Make String Balanced|[Go]({{< relref "/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md" >}})|Medium||||59.1%|
|1673|Find the Most Competitive Subsequence|[Go]({{< relref "/ChapterFour/1600~1699/1673.Find-the-Most-Competitive-Subsequence.md" >}})|Medium||||49.3%|
-|1700|Number of Students Unable to Eat Lunch|[Go]({{< relref "/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md" >}})|Easy||||67.7%|
+|1700|Number of Students Unable to Eat Lunch|[Go]({{< relref "/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md" >}})|Easy||||68.6%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+---------------| ---------------|-------------|-------------|-------------|
+-----------|-------------|-------------|
+
----------------------------------------------
diff --git a/website/content/ChapterTwo/String.md b/website/content/ChapterTwo/String.md
index 9ff54f4a1..d8c4af663 100644
--- a/website/content/ChapterTwo/String.md
+++ b/website/content/ChapterTwo/String.md
@@ -11,189 +11,194 @@ weight: 2
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
|0003|Longest Substring Without Repeating Characters|[Go]({{< relref "/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md" >}})|Medium| O(n)| O(1)|❤️|33.8%|
|0005|Longest Palindromic Substring|[Go]({{< relref "/ChapterFour/0001~0099/0005.Longest-Palindromic-Substring.md" >}})|Medium||||32.4%|
-|0006|Zigzag Conversion|[Go]({{< relref "/ChapterFour/0001~0099/0006.Zigzag-Conversion.md" >}})|Medium||||43.0%|
+|0006|Zigzag Conversion|[Go]({{< relref "/ChapterFour/0001~0099/0006.Zigzag-Conversion.md" >}})|Medium||||44.8%|
|0008|String to Integer (atoi)|[Go]({{< relref "/ChapterFour/0001~0099/0008.String-to-Integer-atoi.md" >}})|Medium||||16.6%|
-|0012|Integer to Roman|[Go]({{< relref "/ChapterFour/0001~0099/0012.Integer-to-Roman.md" >}})|Medium||||60.5%|
-|0013|Roman to Integer|[Go]({{< relref "/ChapterFour/0001~0099/0013.Roman-to-Integer.md" >}})|Easy||||58.2%|
-|0014|Longest Common Prefix|[Go]({{< relref "/ChapterFour/0001~0099/0014.Longest-Common-Prefix.md" >}})|Easy||||40.7%|
-|0017|Letter Combinations of a Phone Number|[Go]({{< relref "/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md" >}})|Medium| O(log n)| O(1)||55.5%|
-|0020|Valid Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0020.Valid-Parentheses.md" >}})|Easy| O(log n)| O(1)||40.7%|
-|0022|Generate Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0022.Generate-Parentheses.md" >}})|Medium| O(log n)| O(1)||71.7%|
-|0028|Find the Index of the First Occurrence in a String|[Go]({{< relref "/ChapterFour/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String.md" >}})|Medium| O(n)| O(1)||37.4%|
-|0030|Substring with Concatenation of All Words|[Go]({{< relref "/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md" >}})|Hard| O(n)| O(n)|❤️|30.9%|
-|0032|Longest Valid Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses.md" >}})|Hard||||32.7%|
-|0043|Multiply Strings|[Go]({{< relref "/ChapterFour/0001~0099/0043.Multiply-Strings.md" >}})|Medium||||38.7%|
-|0049|Group Anagrams|[Go]({{< relref "/ChapterFour/0001~0099/0049.Group-Anagrams.md" >}})|Medium| O(n log n)| O(n)||65.9%|
-|0058|Length of Last Word|[Go]({{< relref "/ChapterFour/0001~0099/0058.Length-of-Last-Word.md" >}})|Easy||||40.3%|
-|0065|Valid Number|[Go]({{< relref "/ChapterFour/0001~0099/0065.Valid-Number.md" >}})|Hard||||18.6%|
-|0067|Add Binary|[Go]({{< relref "/ChapterFour/0001~0099/0067.Add-Binary.md" >}})|Easy||||51.3%|
-|0071|Simplify Path|[Go]({{< relref "/ChapterFour/0001~0099/0071.Simplify-Path.md" >}})|Medium| O(n)| O(n)||39.2%|
-|0076|Minimum Window Substring|[Go]({{< relref "/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md" >}})|Hard| O(n)| O(n)|❤️|40.0%|
-|0091|Decode Ways|[Go]({{< relref "/ChapterFour/0001~0099/0091.Decode-Ways.md" >}})|Medium| O(n)| O(n)||32.2%|
-|0093|Restore IP Addresses|[Go]({{< relref "/ChapterFour/0001~0099/0093.Restore-IP-Addresses.md" >}})|Medium| O(n)| O(n)|❤️|43.3%|
-|0097|Interleaving String|[Go]({{< relref "/ChapterFour/0001~0099/0097.Interleaving-String.md" >}})|Medium||||37.1%|
-|0115|Distinct Subsequences|[Go]({{< relref "/ChapterFour/0100~0199/0115.Distinct-Subsequences.md" >}})|Hard||||43.7%|
-|0125|Valid Palindrome|[Go]({{< relref "/ChapterFour/0100~0199/0125.Valid-Palindrome.md" >}})|Easy| O(n)| O(1)||43.5%|
-|0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard| O(n)| O(n^2)|❤️|27.6%|
-|0127|Word Ladder|[Go]({{< relref "/ChapterFour/0100~0199/0127.Word-Ladder.md" >}})|Hard||||36.6%|
-|0131|Palindrome Partitioning|[Go]({{< relref "/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md" >}})|Medium||||62.3%|
-|0151|Reverse Words in a String|[Go]({{< relref "/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md" >}})|Medium||||30.2%|
-|0168|Excel Sheet Column Title|[Go]({{< relref "/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title.md" >}})|Easy||||34.7%|
-|0171|Excel Sheet Column Number|[Go]({{< relref "/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number.md" >}})|Easy||||61.3%|
-|0179|Largest Number|[Go]({{< relref "/ChapterFour/0100~0199/0179.Largest-Number.md" >}})|Medium||||33.9%|
-|0187|Repeated DNA Sequences|[Go]({{< relref "/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md" >}})|Medium||||46.1%|
-|0205|Isomorphic Strings|[Go]({{< relref "/ChapterFour/0200~0299/0205.Isomorphic-Strings.md" >}})|Easy||||42.5%|
-|0208|Implement Trie (Prefix Tree)|[Go]({{< relref "/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree.md" >}})|Medium||||60.7%|
-|0211|Design Add and Search Words Data Structure|[Go]({{< relref "/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure.md" >}})|Medium||||43.2%|
-|0212|Word Search II|[Go]({{< relref "/ChapterFour/0200~0299/0212.Word-Search-II.md" >}})|Hard||||37.0%|
-|0224|Basic Calculator|[Go]({{< relref "/ChapterFour/0200~0299/0224.Basic-Calculator.md" >}})|Hard||||41.1%|
-|0227|Basic Calculator II|[Go]({{< relref "/ChapterFour/0200~0299/0227.Basic-Calculator-II.md" >}})|Medium||||42.2%|
-|0242|Valid Anagram|[Go]({{< relref "/ChapterFour/0200~0299/0242.Valid-Anagram.md" >}})|Easy||||62.7%|
-|0257|Binary Tree Paths|[Go]({{< relref "/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md" >}})|Easy||||60.5%|
-|0290|Word Pattern|[Go]({{< relref "/ChapterFour/0200~0299/0290.Word-Pattern.md" >}})|Easy||||40.4%|
-|0297|Serialize and Deserialize Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md" >}})|Hard||||54.9%|
-|0299|Bulls and Cows|[Go]({{< relref "/ChapterFour/0200~0299/0299.Bulls-and-Cows.md" >}})|Medium||||48.5%|
-|0301|Remove Invalid Parentheses|[Go]({{< relref "/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses.md" >}})|Hard||||47.1%|
-|0306|Additive Number|[Go]({{< relref "/ChapterFour/0300~0399/0306.Additive-Number.md" >}})|Medium||||30.9%|
-|0318|Maximum Product of Word Lengths|[Go]({{< relref "/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md" >}})|Medium||||60.1%|
-|0331|Verify Preorder Serialization of a Binary Tree|[Go]({{< relref "/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md" >}})|Medium||||44.2%|
-|0344|Reverse String|[Go]({{< relref "/ChapterFour/0300~0399/0344.Reverse-String.md" >}})|Easy| O(n)| O(1)||76.1%|
-|0345|Reverse Vowels of a String|[Go]({{< relref "/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md" >}})|Easy| O(n)| O(1)||47.7%|
-|0383|Ransom Note|[Go]({{< relref "/ChapterFour/0300~0399/0383.Ransom-Note.md" >}})|Easy||||57.6%|
-|0385|Mini Parser|[Go]({{< relref "/ChapterFour/0300~0399/0385.Mini-Parser.md" >}})|Medium||||36.5%|
-|0387|First Unique Character in a String|[Go]({{< relref "/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md" >}})|Easy||||58.8%|
-|0389|Find the Difference|[Go]({{< relref "/ChapterFour/0300~0399/0389.Find-the-Difference.md" >}})|Easy||||60.4%|
-|0392|Is Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0392.Is-Subsequence.md" >}})|Easy||||49.3%|
-|0394|Decode String|[Go]({{< relref "/ChapterFour/0300~0399/0394.Decode-String.md" >}})|Medium||||57.5%|
+|0012|Integer to Roman|[Go]({{< relref "/ChapterFour/0001~0099/0012.Integer-to-Roman.md" >}})|Medium||||61.9%|
+|0013|Roman to Integer|[Go]({{< relref "/ChapterFour/0001~0099/0013.Roman-to-Integer.md" >}})|Easy||||58.4%|
+|0014|Longest Common Prefix|[Go]({{< relref "/ChapterFour/0001~0099/0014.Longest-Common-Prefix.md" >}})|Easy||||40.8%|
+|0017|Letter Combinations of a Phone Number|[Go]({{< relref "/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md" >}})|Medium| O(log n)| O(1)||56.4%|
+|0020|Valid Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0020.Valid-Parentheses.md" >}})|Easy| O(log n)| O(1)||40.3%|
+|0022|Generate Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0022.Generate-Parentheses.md" >}})|Medium| O(log n)| O(1)||72.4%|
+|0028|Find the Index of the First Occurrence in a String|[Go]({{< relref "/ChapterFour/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String.md" >}})|Easy| O(n)| O(1)||38.9%|
+|0030|Substring with Concatenation of All Words|[Go]({{< relref "/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md" >}})|Hard| O(n)| O(n)|❤️|31.2%|
+|0032|Longest Valid Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses.md" >}})|Hard||||32.8%|
+|0043|Multiply Strings|[Go]({{< relref "/ChapterFour/0001~0099/0043.Multiply-Strings.md" >}})|Medium||||39.1%|
+|0049|Group Anagrams|[Go]({{< relref "/ChapterFour/0001~0099/0049.Group-Anagrams.md" >}})|Medium| O(n log n)| O(n)||66.7%|
+|0058|Length of Last Word|[Go]({{< relref "/ChapterFour/0001~0099/0058.Length-of-Last-Word.md" >}})|Easy||||42.6%|
+|0065|Valid Number|[Go]({{< relref "/ChapterFour/0001~0099/0065.Valid-Number.md" >}})|Hard||||18.7%|
+|0067|Add Binary|[Go]({{< relref "/ChapterFour/0001~0099/0067.Add-Binary.md" >}})|Easy||||52.4%|
+|0071|Simplify Path|[Go]({{< relref "/ChapterFour/0001~0099/0071.Simplify-Path.md" >}})|Medium| O(n)| O(n)||39.3%|
+|0076|Minimum Window Substring|[Go]({{< relref "/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md" >}})|Hard| O(n)| O(n)|❤️|40.9%|
+|0091|Decode Ways|[Go]({{< relref "/ChapterFour/0001~0099/0091.Decode-Ways.md" >}})|Medium| O(n)| O(n)||32.7%|
+|0093|Restore IP Addresses|[Go]({{< relref "/ChapterFour/0001~0099/0093.Restore-IP-Addresses.md" >}})|Medium| O(n)| O(n)|❤️|47.3%|
+|0097|Interleaving String|[Go]({{< relref "/ChapterFour/0001~0099/0097.Interleaving-String.md" >}})|Medium||||37.3%|
+|0115|Distinct Subsequences|[Go]({{< relref "/ChapterFour/0100~0199/0115.Distinct-Subsequences.md" >}})|Hard||||44.4%|
+|0125|Valid Palindrome|[Go]({{< relref "/ChapterFour/0100~0199/0125.Valid-Palindrome.md" >}})|Easy| O(n)| O(1)||44.3%|
+|0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard| O(n)| O(n^2)|❤️|27.5%|
+|0127|Word Ladder|[Go]({{< relref "/ChapterFour/0100~0199/0127.Word-Ladder.md" >}})|Hard||||37.1%|
+|0131|Palindrome Partitioning|[Go]({{< relref "/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md" >}})|Medium||||64.7%|
+|0151|Reverse Words in a String|[Go]({{< relref "/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md" >}})|Medium||||32.6%|
+|0168|Excel Sheet Column Title|[Go]({{< relref "/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title.md" >}})|Easy||||35.4%|
+|0171|Excel Sheet Column Number|[Go]({{< relref "/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number.md" >}})|Easy||||62.0%|
+|0179|Largest Number|[Go]({{< relref "/ChapterFour/0100~0199/0179.Largest-Number.md" >}})|Medium||||34.5%|
+|0187|Repeated DNA Sequences|[Go]({{< relref "/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md" >}})|Medium||||46.9%|
+|0205|Isomorphic Strings|[Go]({{< relref "/ChapterFour/0200~0299/0205.Isomorphic-Strings.md" >}})|Easy||||42.8%|
+|0208|Implement Trie (Prefix Tree)|[Go]({{< relref "/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree.md" >}})|Medium||||61.7%|
+|0211|Design Add and Search Words Data Structure|[Go]({{< relref "/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure.md" >}})|Medium||||43.0%|
+|0212|Word Search II|[Go]({{< relref "/ChapterFour/0200~0299/0212.Word-Search-II.md" >}})|Hard||||36.5%|
+|0224|Basic Calculator|[Go]({{< relref "/ChapterFour/0200~0299/0224.Basic-Calculator.md" >}})|Hard||||42.4%|
+|0227|Basic Calculator II|[Go]({{< relref "/ChapterFour/0200~0299/0227.Basic-Calculator-II.md" >}})|Medium||||42.4%|
+|0242|Valid Anagram|[Go]({{< relref "/ChapterFour/0200~0299/0242.Valid-Anagram.md" >}})|Easy||||63.0%|
+|0257|Binary Tree Paths|[Go]({{< relref "/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md" >}})|Easy||||61.3%|
+|0290|Word Pattern|[Go]({{< relref "/ChapterFour/0200~0299/0290.Word-Pattern.md" >}})|Easy||||41.7%|
+|0297|Serialize and Deserialize Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md" >}})|Hard||||55.4%|
+|0299|Bulls and Cows|[Go]({{< relref "/ChapterFour/0200~0299/0299.Bulls-and-Cows.md" >}})|Medium||||49.3%|
+|0301|Remove Invalid Parentheses|[Go]({{< relref "/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses.md" >}})|Hard||||47.2%|
+|0306|Additive Number|[Go]({{< relref "/ChapterFour/0300~0399/0306.Additive-Number.md" >}})|Medium||||31.0%|
+|0318|Maximum Product of Word Lengths|[Go]({{< relref "/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md" >}})|Medium||||59.9%|
+|0331|Verify Preorder Serialization of a Binary Tree|[Go]({{< relref "/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md" >}})|Medium||||44.6%|
+|0344|Reverse String|[Go]({{< relref "/ChapterFour/0300~0399/0344.Reverse-String.md" >}})|Easy| O(n)| O(1)||76.7%|
+|0345|Reverse Vowels of a String|[Go]({{< relref "/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md" >}})|Easy| O(n)| O(1)||50.0%|
+|0383|Ransom Note|[Go]({{< relref "/ChapterFour/0300~0399/0383.Ransom-Note.md" >}})|Easy||||58.2%|
+|0385|Mini Parser|[Go]({{< relref "/ChapterFour/0300~0399/0385.Mini-Parser.md" >}})|Medium||||36.9%|
+|0387|First Unique Character in a String|[Go]({{< relref "/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md" >}})|Easy||||59.5%|
+|0389|Find the Difference|[Go]({{< relref "/ChapterFour/0300~0399/0389.Find-the-Difference.md" >}})|Easy||||60.0%|
+|0392|Is Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0392.Is-Subsequence.md" >}})|Easy||||47.7%|
+|0394|Decode String|[Go]({{< relref "/ChapterFour/0300~0399/0394.Decode-String.md" >}})|Medium||||57.8%|
|0395|Longest Substring with At Least K Repeating Characters|[Go]({{< relref "/ChapterFour/0300~0399/0395.Longest-Substring-with-At-Least-K-Repeating-Characters.md" >}})|Medium||||44.8%|
-|0402|Remove K Digits|[Go]({{< relref "/ChapterFour/0400~0499/0402.Remove-K-Digits.md" >}})|Medium||||30.5%|
-|0409|Longest Palindrome|[Go]({{< relref "/ChapterFour/0400~0499/0409.Longest-Palindrome.md" >}})|Easy||||54.6%|
-|0412|Fizz Buzz|[Go]({{< relref "/ChapterFour/0400~0499/0412.Fizz-Buzz.md" >}})|Easy||||68.6%|
+|0402|Remove K Digits|[Go]({{< relref "/ChapterFour/0400~0499/0402.Remove-K-Digits.md" >}})|Medium||||30.6%|
+|0409|Longest Palindrome|[Go]({{< relref "/ChapterFour/0400~0499/0409.Longest-Palindrome.md" >}})|Easy||||54.3%|
+|0412|Fizz Buzz|[Go]({{< relref "/ChapterFour/0400~0499/0412.Fizz-Buzz.md" >}})|Easy||||69.8%|
|0423|Reconstruct Original Digits from English|[Go]({{< relref "/ChapterFour/0400~0499/0423.Reconstruct-Original-Digits-from-English.md" >}})|Medium||||51.3%|
-|0424|Longest Repeating Character Replacement|[Go]({{< relref "/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md" >}})|Medium||||51.4%|
-|0433|Minimum Genetic Mutation|[Go]({{< relref "/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md" >}})|Medium||||48.1%|
-|0434|Number of Segments in a String|[Go]({{< relref "/ChapterFour/0400~0499/0434.Number-of-Segments-in-a-String.md" >}})|Easy||||37.7%|
-|0438|Find All Anagrams in a String|[Go]({{< relref "/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md" >}})|Medium||||48.9%|
-|0451|Sort Characters By Frequency|[Go]({{< relref "/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md" >}})|Medium||||68.5%|
+|0424|Longest Repeating Character Replacement|[Go]({{< relref "/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md" >}})|Medium||||51.9%|
+|0433|Minimum Genetic Mutation|[Go]({{< relref "/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md" >}})|Medium||||52.3%|
+|0434|Number of Segments in a String|[Go]({{< relref "/ChapterFour/0400~0499/0434.Number-of-Segments-in-a-String.md" >}})|Easy||||37.2%|
+|0438|Find All Anagrams in a String|[Go]({{< relref "/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md" >}})|Medium||||50.2%|
+|0451|Sort Characters By Frequency|[Go]({{< relref "/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md" >}})|Medium||||70.0%|
|0474|Ones and Zeroes|[Go]({{< relref "/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md" >}})|Medium||||46.7%|
-|0488|Zuma Game|[Go]({{< relref "/ChapterFour/0400~0499/0488.Zuma-Game.md" >}})|Hard||||34.9%|
-|0500|Keyboard Row|[Go]({{< relref "/ChapterFour/0500~0599/0500.Keyboard-Row.md" >}})|Easy||||69.0%|
-|0520|Detect Capital|[Go]({{< relref "/ChapterFour/0500~0599/0520.Detect-Capital.md" >}})|Easy||||55.6%|
-|0524|Longest Word in Dictionary through Deleting|[Go]({{< relref "/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})|Medium||||51.2%|
-|0535|Encode and Decode TinyURL|[Go]({{< relref "/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL.md" >}})|Medium||||85.7%|
-|0537|Complex Number Multiplication|[Go]({{< relref "/ChapterFour/0500~0599/0537.Complex-Number-Multiplication.md" >}})|Medium||||71.3%|
+|0488|Zuma Game|[Go]({{< relref "/ChapterFour/0400~0499/0488.Zuma-Game.md" >}})|Hard||||34.0%|
+|0500|Keyboard Row|[Go]({{< relref "/ChapterFour/0500~0599/0500.Keyboard-Row.md" >}})|Easy||||69.5%|
+|0520|Detect Capital|[Go]({{< relref "/ChapterFour/0500~0599/0520.Detect-Capital.md" >}})|Easy||||57.0%|
+|0524|Longest Word in Dictionary through Deleting|[Go]({{< relref "/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})|Medium||||51.0%|
+|0535|Encode and Decode TinyURL|[Go]({{< relref "/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL.md" >}})|Medium||||85.9%|
+|0537|Complex Number Multiplication|[Go]({{< relref "/ChapterFour/0500~0599/0537.Complex-Number-Multiplication.md" >}})|Medium||||71.4%|
|0541|Reverse String II|[Go]({{< relref "/ChapterFour/0500~0599/0541.Reverse-String-II.md" >}})|Easy||||50.5%|
-|0551|Student Attendance Record I|[Go]({{< relref "/ChapterFour/0500~0599/0551.Student-Attendance-Record-I.md" >}})|Easy||||48.0%|
-|0557|Reverse Words in a String III|[Go]({{< relref "/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III.md" >}})|Easy||||81.5%|
-|0567|Permutation in String|[Go]({{< relref "/ChapterFour/0500~0599/0567.Permutation-in-String.md" >}})|Medium||||43.8%|
-|0583|Delete Operation for Two Strings|[Go]({{< relref "/ChapterFour/0500~0599/0583.Delete-Operation-for-Two-Strings.md" >}})|Medium||||59.2%|
-|0599|Minimum Index Sum of Two Lists|[Go]({{< relref "/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md" >}})|Easy||||52.7%|
+|0551|Student Attendance Record I|[Go]({{< relref "/ChapterFour/0500~0599/0551.Student-Attendance-Record-I.md" >}})|Easy||||48.2%|
+|0557|Reverse Words in a String III|[Go]({{< relref "/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III.md" >}})|Easy||||81.9%|
+|0567|Permutation in String|[Go]({{< relref "/ChapterFour/0500~0599/0567.Permutation-in-String.md" >}})|Medium||||44.4%|
+|0583|Delete Operation for Two Strings|[Go]({{< relref "/ChapterFour/0500~0599/0583.Delete-Operation-for-Two-Strings.md" >}})|Medium||||59.7%|
+|0599|Minimum Index Sum of Two Lists|[Go]({{< relref "/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md" >}})|Easy||||53.3%|
|0609|Find Duplicate File in System|[Go]({{< relref "/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System.md" >}})|Medium||||67.8%|
-|0647|Palindromic Substrings|[Go]({{< relref "/ChapterFour/0600~0699/0647.Palindromic-Substrings.md" >}})|Medium||||66.3%|
+|0647|Palindromic Substrings|[Go]({{< relref "/ChapterFour/0600~0699/0647.Palindromic-Substrings.md" >}})|Medium||||66.8%|
|0648|Replace Words|[Go]({{< relref "/ChapterFour/0600~0699/0648.Replace-Words.md" >}})|Medium||||62.7%|
|0676|Implement Magic Dictionary|[Go]({{< relref "/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary.md" >}})|Medium||||56.9%|
-|0677|Map Sum Pairs|[Go]({{< relref "/ChapterFour/0600~0699/0677.Map-Sum-Pairs.md" >}})|Medium||||57.0%|
-|0692|Top K Frequent Words|[Go]({{< relref "/ChapterFour/0600~0699/0692.Top-K-Frequent-Words.md" >}})|Medium||||55.2%|
-|0696|Count Binary Substrings|[Go]({{< relref "/ChapterFour/0600~0699/0696.Count-Binary-Substrings.md" >}})|Easy||||65.5%|
-|0709|To Lower Case|[Go]({{< relref "/ChapterFour/0700~0799/0709.To-Lower-Case.md" >}})|Easy||||81.9%|
-|0720|Longest Word in Dictionary|[Go]({{< relref "/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md" >}})|Medium||||51.8%|
+|0677|Map Sum Pairs|[Go]({{< relref "/ChapterFour/0600~0699/0677.Map-Sum-Pairs.md" >}})|Medium||||56.8%|
+|0692|Top K Frequent Words|[Go]({{< relref "/ChapterFour/0600~0699/0692.Top-K-Frequent-Words.md" >}})|Medium||||57.1%|
+|0696|Count Binary Substrings|[Go]({{< relref "/ChapterFour/0600~0699/0696.Count-Binary-Substrings.md" >}})|Easy||||65.6%|
+|0709|To Lower Case|[Go]({{< relref "/ChapterFour/0700~0799/0709.To-Lower-Case.md" >}})|Easy||||82.3%|
+|0720|Longest Word in Dictionary|[Go]({{< relref "/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md" >}})|Medium||||51.9%|
|0721|Accounts Merge|[Go]({{< relref "/ChapterFour/0700~0799/0721.Accounts-Merge.md" >}})|Medium||||56.3%|
-|0726|Number of Atoms|[Go]({{< relref "/ChapterFour/0700~0799/0726.Number-of-Atoms.md" >}})|Hard||||52.2%|
+|0726|Number of Atoms|[Go]({{< relref "/ChapterFour/0700~0799/0726.Number-of-Atoms.md" >}})|Hard||||52.1%|
|0745|Prefix and Suffix Search|[Go]({{< relref "/ChapterFour/0700~0799/0745.Prefix-and-Suffix-Search.md" >}})|Hard||||41.3%|
-|0748|Shortest Completing Word|[Go]({{< relref "/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md" >}})|Easy||||59.1%|
-|0752|Open the Lock|[Go]({{< relref "/ChapterFour/0700~0799/0752.Open-the-Lock.md" >}})|Medium||||55.5%|
+|0748|Shortest Completing Word|[Go]({{< relref "/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md" >}})|Easy||||59.2%|
+|0752|Open the Lock|[Go]({{< relref "/ChapterFour/0700~0799/0752.Open-the-Lock.md" >}})|Medium||||55.6%|
|0763|Partition Labels|[Go]({{< relref "/ChapterFour/0700~0799/0763.Partition-Labels.md" >}})|Medium||||79.8%|
-|0767|Reorganize String|[Go]({{< relref "/ChapterFour/0700~0799/0767.Reorganize-String.md" >}})|Medium| O(n log n)| O(log n) |❤️|52.7%|
-|0771|Jewels and Stones|[Go]({{< relref "/ChapterFour/0700~0799/0771.Jewels-and-Stones.md" >}})|Easy||||88.0%|
-|0784|Letter Case Permutation|[Go]({{< relref "/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md" >}})|Medium||||73.4%|
-|0791|Custom Sort String|[Go]({{< relref "/ChapterFour/0700~0799/0791.Custom-Sort-String.md" >}})|Medium||||69.4%|
-|0792|Number of Matching Subsequences|[Go]({{< relref "/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences.md" >}})|Medium||||51.9%|
-|0794|Valid Tic-Tac-Toe State|[Go]({{< relref "/ChapterFour/0700~0799/0794.Valid-Tic-Tac-Toe-State.md" >}})|Medium||||35.2%|
-|0811|Subdomain Visit Count|[Go]({{< relref "/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md" >}})|Medium||||75.1%|
-|0816|Ambiguous Coordinates|[Go]({{< relref "/ChapterFour/0800~0899/0816.Ambiguous-Coordinates.md" >}})|Medium||||56.0%|
-|0819|Most Common Word|[Go]({{< relref "/ChapterFour/0800~0899/0819.Most-Common-Word.md" >}})|Easy||||45.0%|
-|0820|Short Encoding of Words|[Go]({{< relref "/ChapterFour/0800~0899/0820.Short-Encoding-of-Words.md" >}})|Medium||||60.7%|
+|0767|Reorganize String|[Go]({{< relref "/ChapterFour/0700~0799/0767.Reorganize-String.md" >}})|Medium| O(n log n)| O(log n) |❤️|52.9%|
+|0771|Jewels and Stones|[Go]({{< relref "/ChapterFour/0700~0799/0771.Jewels-and-Stones.md" >}})|Easy||||88.2%|
+|0784|Letter Case Permutation|[Go]({{< relref "/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md" >}})|Medium||||73.8%|
+|0791|Custom Sort String|[Go]({{< relref "/ChapterFour/0700~0799/0791.Custom-Sort-String.md" >}})|Medium||||69.2%|
+|0792|Number of Matching Subsequences|[Go]({{< relref "/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences.md" >}})|Medium||||51.7%|
+|0794|Valid Tic-Tac-Toe State|[Go]({{< relref "/ChapterFour/0700~0799/0794.Valid-Tic-Tac-Toe-State.md" >}})|Medium||||35.1%|
+|0811|Subdomain Visit Count|[Go]({{< relref "/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md" >}})|Medium||||75.5%|
+|0816|Ambiguous Coordinates|[Go]({{< relref "/ChapterFour/0800~0899/0816.Ambiguous-Coordinates.md" >}})|Medium||||56.3%|
+|0819|Most Common Word|[Go]({{< relref "/ChapterFour/0800~0899/0819.Most-Common-Word.md" >}})|Easy||||44.8%|
+|0820|Short Encoding of Words|[Go]({{< relref "/ChapterFour/0800~0899/0820.Short-Encoding-of-Words.md" >}})|Medium||||60.6%|
|0821|Shortest Distance to a Character|[Go]({{< relref "/ChapterFour/0800~0899/0821.Shortest-Distance-to-a-Character.md" >}})|Easy||||71.3%|
-|0828|Count Unique Characters of All Substrings of a Given String|[Go]({{< relref "/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md" >}})|Hard||||51.5%|
-|0830|Positions of Large Groups|[Go]({{< relref "/ChapterFour/0800~0899/0830.Positions-of-Large-Groups.md" >}})|Easy||||51.7%|
+|0828|Count Unique Characters of All Substrings of a Given String|[Go]({{< relref "/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md" >}})|Hard||||51.7%|
+|0830|Positions of Large Groups|[Go]({{< relref "/ChapterFour/0800~0899/0830.Positions-of-Large-Groups.md" >}})|Easy||||51.8%|
|0838|Push Dominoes|[Go]({{< relref "/ChapterFour/0800~0899/0838.Push-Dominoes.md" >}})|Medium||||57.0%|
-|0839|Similar String Groups|[Go]({{< relref "/ChapterFour/0800~0899/0839.Similar-String-Groups.md" >}})|Hard||||47.5%|
-|0842|Split Array into Fibonacci Sequence|[Go]({{< relref "/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md" >}})|Medium| O(n^2)| O(1)|❤️|38.2%|
+|0839|Similar String Groups|[Go]({{< relref "/ChapterFour/0800~0899/0839.Similar-String-Groups.md" >}})|Hard||||48.0%|
+|0842|Split Array into Fibonacci Sequence|[Go]({{< relref "/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md" >}})|Medium| O(n^2)| O(1)|❤️|38.4%|
|0844|Backspace String Compare|[Go]({{< relref "/ChapterFour/0800~0899/0844.Backspace-String-Compare.md" >}})|Easy||||48.0%|
-|0856|Score of Parentheses|[Go]({{< relref "/ChapterFour/0800~0899/0856.Score-of-Parentheses.md" >}})|Medium| O(n)| O(n)||65.1%|
-|0859|Buddy Strings|[Go]({{< relref "/ChapterFour/0800~0899/0859.Buddy-Strings.md" >}})|Easy||||29.0%|
+|0856|Score of Parentheses|[Go]({{< relref "/ChapterFour/0800~0899/0856.Score-of-Parentheses.md" >}})|Medium| O(n)| O(n)||64.8%|
+|0859|Buddy Strings|[Go]({{< relref "/ChapterFour/0800~0899/0859.Buddy-Strings.md" >}})|Easy||||29.2%|
|0880|Decoded String at Index|[Go]({{< relref "/ChapterFour/0800~0899/0880.Decoded-String-at-Index.md" >}})|Medium||||28.3%|
-|0884|Uncommon Words from Two Sentences|[Go]({{< relref "/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences.md" >}})|Easy||||65.9%|
-|0890|Find and Replace Pattern|[Go]({{< relref "/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern.md" >}})|Medium||||77.9%|
-|0916|Word Subsets|[Go]({{< relref "/ChapterFour/0900~0999/0916.Word-Subsets.md" >}})|Medium||||54.1%|
-|0921|Minimum Add to Make Parentheses Valid|[Go]({{< relref "/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid.md" >}})|Medium||||76.4%|
-|0925|Long Pressed Name|[Go]({{< relref "/ChapterFour/0900~0999/0925.Long-Pressed-Name.md" >}})|Easy| O(n)| O(1)||33.8%|
-|0942|DI String Match|[Go]({{< relref "/ChapterFour/0900~0999/0942.DI-String-Match.md" >}})|Easy||||76.6%|
+|0884|Uncommon Words from Two Sentences|[Go]({{< relref "/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences.md" >}})|Easy||||66.3%|
+|0890|Find and Replace Pattern|[Go]({{< relref "/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern.md" >}})|Medium||||77.6%|
+|0916|Word Subsets|[Go]({{< relref "/ChapterFour/0900~0999/0916.Word-Subsets.md" >}})|Medium||||53.7%|
+|0921|Minimum Add to Make Parentheses Valid|[Go]({{< relref "/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid.md" >}})|Medium||||75.8%|
+|0925|Long Pressed Name|[Go]({{< relref "/ChapterFour/0900~0999/0925.Long-Pressed-Name.md" >}})|Easy| O(n)| O(1)||33.2%|
+|0942|DI String Match|[Go]({{< relref "/ChapterFour/0900~0999/0942.DI-String-Match.md" >}})|Easy||||77.3%|
|0949|Largest Time for Given Digits|[Go]({{< relref "/ChapterFour/0900~0999/0949.Largest-Time-for-Given-Digits.md" >}})|Medium||||35.2%|
-|0953|Verifying an Alien Dictionary|[Go]({{< relref "/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md" >}})|Easy||||52.7%|
-|0966|Vowel Spellchecker|[Go]({{< relref "/ChapterFour/0900~0999/0966.Vowel-Spellchecker.md" >}})|Medium||||51.5%|
-|0981|Time Based Key-Value Store|[Go]({{< relref "/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md" >}})|Medium||||53.6%|
-|0984|String Without AAA or BBB|[Go]({{< relref "/ChapterFour/0900~0999/0984.String-Without-AAA-or-BBB.md" >}})|Medium||||42.9%|
-|0990|Satisfiability of Equality Equations|[Go]({{< relref "/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md" >}})|Medium||||50.7%|
-|1002|Find Common Characters|[Go]({{< relref "/ChapterFour/1000~1099/1002.Find-Common-Characters.md" >}})|Easy||||68.3%|
+|0953|Verifying an Alien Dictionary|[Go]({{< relref "/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md" >}})|Easy||||54.5%|
+|0966|Vowel Spellchecker|[Go]({{< relref "/ChapterFour/0900~0999/0966.Vowel-Spellchecker.md" >}})|Medium||||51.4%|
+|0981|Time Based Key-Value Store|[Go]({{< relref "/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md" >}})|Medium||||52.4%|
+|0984|String Without AAA or BBB|[Go]({{< relref "/ChapterFour/0900~0999/0984.String-Without-AAA-or-BBB.md" >}})|Medium||||43.1%|
+|0990|Satisfiability of Equality Equations|[Go]({{< relref "/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md" >}})|Medium||||50.5%|
+|1002|Find Common Characters|[Go]({{< relref "/ChapterFour/1000~1099/1002.Find-Common-Characters.md" >}})|Easy||||68.5%|
|1003|Check If Word Is Valid After Substitutions|[Go]({{< relref "/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions.md" >}})|Medium| O(n)| O(1)||58.2%|
-|1021|Remove Outermost Parentheses|[Go]({{< relref "/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses.md" >}})|Easy||||80.1%|
-|1028|Recover a Tree From Preorder Traversal|[Go]({{< relref "/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md" >}})|Hard||||72.8%|
-|1047|Remove All Adjacent Duplicates In String|[Go]({{< relref "/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String.md" >}})|Easy||||70.5%|
+|1021|Remove Outermost Parentheses|[Go]({{< relref "/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses.md" >}})|Easy||||80.6%|
+|1028|Recover a Tree From Preorder Traversal|[Go]({{< relref "/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md" >}})|Hard||||73.2%|
+|1047|Remove All Adjacent Duplicates In String|[Go]({{< relref "/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String.md" >}})|Easy||||69.7%|
|1048|Longest String Chain|[Go]({{< relref "/ChapterFour/1000~1099/1048.Longest-String-Chain.md" >}})|Medium||||59.2%|
-|1078|Occurrences After Bigram|[Go]({{< relref "/ChapterFour/1000~1099/1078.Occurrences-After-Bigram.md" >}})|Easy||||63.9%|
-|1079|Letter Tile Possibilities|[Go]({{< relref "/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md" >}})|Medium||||76.1%|
-|1108|Defanging an IP Address|[Go]({{< relref "/ChapterFour/1100~1199/1108.Defanging-an-IP-Address.md" >}})|Easy||||89.3%|
-|1111|Maximum Nesting Depth of Two Valid Parentheses Strings|[Go]({{< relref "/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md" >}})|Medium||||73.3%|
-|1143|Longest Common Subsequence|[Go]({{< relref "/ChapterFour/1100~1199/1143.Longest-Common-Subsequence.md" >}})|Medium||||58.8%|
-|1154|Day of the Year|[Go]({{< relref "/ChapterFour/1100~1199/1154.Day-of-the-Year.md" >}})|Easy||||50.3%|
-|1160|Find Words That Can Be Formed by Characters|[Go]({{< relref "/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md" >}})|Easy||||67.8%|
-|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||61.3%|
-|1178|Number of Valid Words for Each Puzzle|[Go]({{< relref "/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md" >}})|Hard||||46.6%|
-|1189|Maximum Number of Balloons|[Go]({{< relref "/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md" >}})|Easy||||62.2%|
+|1078|Occurrences After Bigram|[Go]({{< relref "/ChapterFour/1000~1099/1078.Occurrences-After-Bigram.md" >}})|Easy||||63.6%|
+|1079|Letter Tile Possibilities|[Go]({{< relref "/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md" >}})|Medium||||76.0%|
+|1108|Defanging an IP Address|[Go]({{< relref "/ChapterFour/1100~1199/1108.Defanging-an-IP-Address.md" >}})|Easy||||89.1%|
+|1111|Maximum Nesting Depth of Two Valid Parentheses Strings|[Go]({{< relref "/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md" >}})|Medium||||73.0%|
+|1143|Longest Common Subsequence|[Go]({{< relref "/ChapterFour/1100~1199/1143.Longest-Common-Subsequence.md" >}})|Medium||||58.4%|
+|1154|Day of the Year|[Go]({{< relref "/ChapterFour/1100~1199/1154.Day-of-the-Year.md" >}})|Easy||||49.6%|
+|1160|Find Words That Can Be Formed by Characters|[Go]({{< relref "/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md" >}})|Easy||||67.5%|
+|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||61.5%|
+|1178|Number of Valid Words for Each Puzzle|[Go]({{< relref "/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md" >}})|Hard||||46.3%|
+|1189|Maximum Number of Balloons|[Go]({{< relref "/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md" >}})|Easy||||61.1%|
|1190|Reverse Substrings Between Each Pair of Parentheses|[Go]({{< relref "/ChapterFour/1100~1199/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses.md" >}})|Medium||||65.9%|
-|1202|Smallest String With Swaps|[Go]({{< relref "/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md" >}})|Medium||||57.5%|
-|1208|Get Equal Substrings Within Budget|[Go]({{< relref "/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md" >}})|Medium||||47.6%|
-|1209|Remove All Adjacent Duplicates in String II|[Go]({{< relref "/ChapterFour/1200~1299/1209.Remove-All-Adjacent-Duplicates-in-String-II.md" >}})|Medium||||56.0%|
-|1221|Split a String in Balanced Strings|[Go]({{< relref "/ChapterFour/1200~1299/1221.Split-a-String-in-Balanced-Strings.md" >}})|Easy||||84.7%|
-|1234|Replace the Substring for Balanced String|[Go]({{< relref "/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md" >}})|Medium||||36.8%|
-|1239|Maximum Length of a Concatenated String with Unique Characters|[Go]({{< relref "/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md" >}})|Medium||||50.6%|
-|1249|Minimum Remove to Make Valid Parentheses|[Go]({{< relref "/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md" >}})|Medium||||65.6%|
-|1268|Search Suggestions System|[Go]({{< relref "/ChapterFour/1200~1299/1268.Search-Suggestions-System.md" >}})|Medium||||66.7%|
-|1332|Remove Palindromic Subsequences|[Go]({{< relref "/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences.md" >}})|Easy||||76.1%|
-|1396|Design Underground System|[Go]({{< relref "/ChapterFour/1300~1399/1396.Design-Underground-System.md" >}})|Medium||||73.7%|
-|1446|Consecutive Characters|[Go]({{< relref "/ChapterFour/1400~1499/1446.Consecutive-Characters.md" >}})|Easy||||61.7%|
+|1202|Smallest String With Swaps|[Go]({{< relref "/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md" >}})|Medium||||57.6%|
+|1208|Get Equal Substrings Within Budget|[Go]({{< relref "/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md" >}})|Medium||||48.5%|
+|1209|Remove All Adjacent Duplicates in String II|[Go]({{< relref "/ChapterFour/1200~1299/1209.Remove-All-Adjacent-Duplicates-in-String-II.md" >}})|Medium||||56.2%|
+|1221|Split a String in Balanced Strings|[Go]({{< relref "/ChapterFour/1200~1299/1221.Split-a-String-in-Balanced-Strings.md" >}})|Easy||||85.1%|
+|1234|Replace the Substring for Balanced String|[Go]({{< relref "/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md" >}})|Medium||||37.1%|
+|1239|Maximum Length of a Concatenated String with Unique Characters|[Go]({{< relref "/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.md" >}})|Medium||||52.2%|
+|1249|Minimum Remove to Make Valid Parentheses|[Go]({{< relref "/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md" >}})|Medium||||65.8%|
+|1268|Search Suggestions System|[Go]({{< relref "/ChapterFour/1200~1299/1268.Search-Suggestions-System.md" >}})|Medium||||66.3%|
+|1332|Remove Palindromic Subsequences|[Go]({{< relref "/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences.md" >}})|Easy||||76.2%|
+|1396|Design Underground System|[Go]({{< relref "/ChapterFour/1300~1399/1396.Design-Underground-System.md" >}})|Medium||||73.6%|
+|1446|Consecutive Characters|[Go]({{< relref "/ChapterFour/1400~1499/1446.Consecutive-Characters.md" >}})|Easy||||61.3%|
|1455|Check If a Word Occurs As a Prefix of Any Word in a Sentence|[Go]({{< relref "/ChapterFour/1400~1499/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md" >}})|Easy||||64.2%|
-|1461|Check If a String Contains All Binary Codes of Size K|[Go]({{< relref "/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md" >}})|Medium||||56.8%|
-|1573|Number of Ways to Split a String|[Go]({{< relref "/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String.md" >}})|Medium||||32.4%|
-|1576|Replace All ?'s to Avoid Consecutive Repeating Characters|[Go]({{< relref "/ChapterFour/1500~1599/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters.md" >}})|Easy||||49.2%|
-|1614|Maximum Nesting Depth of the Parentheses|[Go]({{< relref "/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses.md" >}})|Easy||||82.7%|
-|1624|Largest Substring Between Two Equal Characters|[Go]({{< relref "/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters.md" >}})|Easy||||59.0%|
-|1629|Slowest Key|[Go]({{< relref "/ChapterFour/1600~1699/1629.Slowest-Key.md" >}})|Easy||||59.4%|
-|1647|Minimum Deletions to Make Character Frequencies Unique|[Go]({{< relref "/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md" >}})|Medium||||59.2%|
-|1653|Minimum Deletions to Make String Balanced|[Go]({{< relref "/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md" >}})|Medium||||58.7%|
-|1657|Determine if Two Strings Are Close|[Go]({{< relref "/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md" >}})|Medium||||54.2%|
-|1662|Check If Two String Arrays are Equivalent|[Go]({{< relref "/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent.md" >}})|Easy||||81.8%|
-|1663|Smallest String With A Given Numeric Value|[Go]({{< relref "/ChapterFour/1600~1699/1663.Smallest-String-With-A-Given-Numeric-Value.md" >}})|Medium||||67.0%|
-|1668|Maximum Repeating Substring|[Go]({{< relref "/ChapterFour/1600~1699/1668.Maximum-Repeating-Substring.md" >}})|Easy||||39.6%|
-|1678|Goal Parser Interpretation|[Go]({{< relref "/ChapterFour/1600~1699/1678.Goal-Parser-Interpretation.md" >}})|Easy||||86.0%|
-|1684|Count the Number of Consistent Strings|[Go]({{< relref "/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md" >}})|Easy||||81.8%|
-|1689|Partitioning Into Minimum Number Of Deci-Binary Numbers|[Go]({{< relref "/ChapterFour/1600~1699/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.md" >}})|Medium||||89.7%|
-|1694|Reformat Phone Number|[Go]({{< relref "/ChapterFour/1600~1699/1694.Reformat-Phone-Number.md" >}})|Easy||||64.7%|
-|1704|Determine if String Halves Are Alike|[Go]({{< relref "/ChapterFour/1700~1799/1704.Determine-if-String-Halves-Are-Alike.md" >}})|Easy||||77.4%|
-|1736|Latest Time by Replacing Hidden Digits|[Go]({{< relref "/ChapterFour/1700~1799/1736.Latest-Time-by-Replacing-Hidden-Digits.md" >}})|Easy||||42.2%|
+|1461|Check If a String Contains All Binary Codes of Size K|[Go]({{< relref "/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md" >}})|Medium||||56.6%|
+|1573|Number of Ways to Split a String|[Go]({{< relref "/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String.md" >}})|Medium||||32.5%|
+|1576|Replace All ?'s to Avoid Consecutive Repeating Characters|[Go]({{< relref "/ChapterFour/1500~1599/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters.md" >}})|Easy||||48.3%|
+|1614|Maximum Nesting Depth of the Parentheses|[Go]({{< relref "/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses.md" >}})|Easy||||82.3%|
+|1624|Largest Substring Between Two Equal Characters|[Go]({{< relref "/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters.md" >}})|Easy||||59.1%|
+|1629|Slowest Key|[Go]({{< relref "/ChapterFour/1600~1699/1629.Slowest-Key.md" >}})|Easy||||59.2%|
+|1647|Minimum Deletions to Make Character Frequencies Unique|[Go]({{< relref "/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md" >}})|Medium||||59.1%|
+|1653|Minimum Deletions to Make String Balanced|[Go]({{< relref "/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md" >}})|Medium||||59.1%|
+|1657|Determine if Two Strings Are Close|[Go]({{< relref "/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md" >}})|Medium||||56.3%|
+|1662|Check If Two String Arrays are Equivalent|[Go]({{< relref "/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent.md" >}})|Easy||||83.4%|
+|1663|Smallest String With A Given Numeric Value|[Go]({{< relref "/ChapterFour/1600~1699/1663.Smallest-String-With-A-Given-Numeric-Value.md" >}})|Medium||||66.8%|
+|1668|Maximum Repeating Substring|[Go]({{< relref "/ChapterFour/1600~1699/1668.Maximum-Repeating-Substring.md" >}})|Easy||||39.5%|
+|1678|Goal Parser Interpretation|[Go]({{< relref "/ChapterFour/1600~1699/1678.Goal-Parser-Interpretation.md" >}})|Easy||||86.6%|
+|1684|Count the Number of Consistent Strings|[Go]({{< relref "/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md" >}})|Easy||||82.2%|
+|1689|Partitioning Into Minimum Number Of Deci-Binary Numbers|[Go]({{< relref "/ChapterFour/1600~1699/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.md" >}})|Medium||||89.3%|
+|1694|Reformat Phone Number|[Go]({{< relref "/ChapterFour/1600~1699/1694.Reformat-Phone-Number.md" >}})|Easy||||65.0%|
+|1704|Determine if String Halves Are Alike|[Go]({{< relref "/ChapterFour/1700~1799/1704.Determine-if-String-Halves-Are-Alike.md" >}})|Easy||||77.8%|
+|1736|Latest Time by Replacing Hidden Digits|[Go]({{< relref "/ChapterFour/1700~1799/1736.Latest-Time-by-Replacing-Hidden-Digits.md" >}})|Easy||||42.4%|
|1758|Minimum Changes To Make Alternating Binary String|[Go]({{< relref "/ChapterFour/1700~1799/1758.Minimum-Changes-To-Make-Alternating-Binary-String.md" >}})|Easy||||58.3%|
-|1763|Longest Nice Substring|[Go]({{< relref "/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md" >}})|Easy||||61.7%|
-|1816|Truncate Sentence|[Go]({{< relref "/ChapterFour/1800~1899/1816.Truncate-Sentence.md" >}})|Easy||||81.9%|
-|2038|Remove Colored Pieces if Both Neighbors are the Same Color|[Go]({{< relref "/ChapterFour/2000~2099/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color.md" >}})|Medium||||58.1%|
-|2096|Step-By-Step Directions From a Binary Tree Node to Another|[Go]({{< relref "/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.md" >}})|Medium||||48.8%|
-|2167|Minimum Time to Remove All Cars Containing Illegal Goods|[Go]({{< relref "/ChapterFour/2100~2199/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods.md" >}})|Hard||||40.1%|
-|2182|Construct String With Repeat Limit|[Go]({{< relref "/ChapterFour/2100~2199/2182.Construct-String-With-Repeat-Limit.md" >}})|Medium||||51.8%|
+|1763|Longest Nice Substring|[Go]({{< relref "/ChapterFour/1700~1799/1763.Longest-Nice-Substring.md" >}})|Easy||||61.6%|
+|1816|Truncate Sentence|[Go]({{< relref "/ChapterFour/1800~1899/1816.Truncate-Sentence.md" >}})|Easy||||82.9%|
+|2038|Remove Colored Pieces if Both Neighbors are the Same Color|[Go]({{< relref "/ChapterFour/2000~2099/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color.md" >}})|Medium||||58.0%|
+|2096|Step-By-Step Directions From a Binary Tree Node to Another|[Go]({{< relref "/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.md" >}})|Medium||||48.5%|
+|2167|Minimum Time to Remove All Cars Containing Illegal Goods|[Go]({{< relref "/ChapterFour/2100~2199/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods.md" >}})|Hard||||40.7%|
+|2182|Construct String With Repeat Limit|[Go]({{< relref "/ChapterFour/2100~2199/2182.Construct-String-With-Repeat-Limit.md" >}})|Medium||||52.4%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+t-Limit.md" >}})|Medium||||52.4%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+eat-Limit.md" >}})|Medium||||51.8%|
+|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
----------------------------------------------
diff --git a/website/content/ChapterTwo/Tree.md b/website/content/ChapterTwo/Tree.md
index 32d354c79..331dc9bab 100644
--- a/website/content/ChapterTwo/Tree.md
+++ b/website/content/ChapterTwo/Tree.md
@@ -9,95 +9,98 @@ weight: 6
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
-|0094|Binary Tree Inorder Traversal|[Go]({{< relref "/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md" >}})|Easy| O(n)| O(1)||72.9%|
-|0095|Unique Binary Search Trees II|[Go]({{< relref "/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md" >}})|Medium||||51.4%|
-|0096|Unique Binary Search Trees|[Go]({{< relref "/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md" >}})|Medium| O(n^2)| O(n)||59.2%|
-|0098|Validate Binary Search Tree|[Go]({{< relref "/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||31.7%|
-|0099|Recover Binary Search Tree|[Go]({{< relref "/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||50.2%|
-|0100|Same Tree|[Go]({{< relref "/ChapterFour/0100~0199/0100.Same-Tree.md" >}})|Easy| O(n)| O(1)||56.3%|
-|0101|Symmetric Tree|[Go]({{< relref "/ChapterFour/0100~0199/0101.Symmetric-Tree.md" >}})|Easy| O(n)| O(1)||52.8%|
-|0102|Binary Tree Level Order Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md" >}})|Medium| O(n)| O(1)||63.2%|
-|0103|Binary Tree Zigzag Level Order Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md" >}})|Medium| O(n)| O(n)||55.0%|
-|0104|Maximum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||73.0%|
-|0105|Construct Binary Tree from Preorder and Inorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md" >}})|Medium||||60.6%|
-|0106|Construct Binary Tree from Inorder and Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md" >}})|Medium||||57.3%|
-|0107|Binary Tree Level Order Traversal II|[Go]({{< relref "/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md" >}})|Medium| O(n)| O(1)||60.2%|
-|0108|Convert Sorted Array to Binary Search Tree|[Go]({{< relref "/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md" >}})|Easy| O(n)| O(1)||68.9%|
-|0109|Convert Sorted List to Binary Search Tree|[Go]({{< relref "/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md" >}})|Medium||||57.2%|
-|0110|Balanced Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md" >}})|Easy| O(n)| O(1)||48.1%|
-|0111|Minimum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||43.5%|
-|0112|Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0112.Path-Sum.md" >}})|Easy| O(n)| O(1)||47.6%|
-|0113|Path Sum II|[Go]({{< relref "/ChapterFour/0100~0199/0113.Path-Sum-II.md" >}})|Medium| O(n)| O(1)||56.5%|
-|0114|Flatten Binary Tree to Linked List|[Go]({{< relref "/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})|Medium| O(n)| O(1)||61.0%|
-|0116|Populating Next Right Pointers in Each Node|[Go]({{< relref "/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md" >}})|Medium||||59.3%|
-|0124|Binary Tree Maximum Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md" >}})|Hard| O(n)| O(1)||38.4%|
-|0129|Sum Root to Leaf Numbers|[Go]({{< relref "/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md" >}})|Medium| O(n)| O(1)||58.6%|
-|0144|Binary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md" >}})|Easy| O(n)| O(1)||64.5%|
-|0145|Binary Tree Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md" >}})|Easy| O(n)| O(1)||66.5%|
-|0173|Binary Search Tree Iterator|[Go]({{< relref "/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator.md" >}})|Medium| O(n)| O(1)||69.0%|
-|0199|Binary Tree Right Side View|[Go]({{< relref "/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md" >}})|Medium| O(n)| O(1)||61.1%|
-|0222|Count Complete Tree Nodes|[Go]({{< relref "/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md" >}})|Medium| O(n)| O(1)||57.4%|
-|0226|Invert Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md" >}})|Easy| O(n)| O(1)||73.1%|
-|0230|Kth Smallest Element in a BST|[Go]({{< relref "/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST.md" >}})|Medium| O(n)| O(1)||69.2%|
-|0235|Lowest Common Ancestor of a Binary Search Tree|[Go]({{< relref "/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||60.1%|
-|0236|Lowest Common Ancestor of a Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md" >}})|Medium| O(n)| O(1)||57.9%|
-|0257|Binary Tree Paths|[Go]({{< relref "/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md" >}})|Easy| O(n)| O(1)||60.5%|
-|0297|Serialize and Deserialize Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md" >}})|Hard||||54.9%|
-|0331|Verify Preorder Serialization of a Binary Tree|[Go]({{< relref "/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md" >}})|Medium||||44.2%|
-|0337|House Robber III|[Go]({{< relref "/ChapterFour/0300~0399/0337.House-Robber-III.md" >}})|Medium||||53.8%|
-|0341|Flatten Nested List Iterator|[Go]({{< relref "/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator.md" >}})|Medium||||61.5%|
-|0404|Sum of Left Leaves|[Go]({{< relref "/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md" >}})|Easy| O(n)| O(1)||56.2%|
-|0429|N-ary Tree Level Order Traversal|[Go]({{< relref "/ChapterFour/0400~0499/0429.N-ary-Tree-Level-Order-Traversal.md" >}})|Medium||||70.6%|
-|0437|Path Sum III|[Go]({{< relref "/ChapterFour/0400~0499/0437.Path-Sum-III.md" >}})|Medium| O(n)| O(1)||48.8%|
-|0508|Most Frequent Subtree Sum|[Go]({{< relref "/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md" >}})|Medium||||64.2%|
-|0513|Find Bottom Left Tree Value|[Go]({{< relref "/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md" >}})|Medium||||66.3%|
+|0094|Binary Tree Inorder Traversal|[Go]({{< relref "/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md" >}})|Easy| O(n)| O(1)||73.7%|
+|0095|Unique Binary Search Trees II|[Go]({{< relref "/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md" >}})|Medium||||52.3%|
+|0096|Unique Binary Search Trees|[Go]({{< relref "/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md" >}})|Medium| O(n^2)| O(n)||59.6%|
+|0098|Validate Binary Search Tree|[Go]({{< relref "/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||32.0%|
+|0099|Recover Binary Search Tree|[Go]({{< relref "/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||50.9%|
+|0100|Same Tree|[Go]({{< relref "/ChapterFour/0100~0199/0100.Same-Tree.md" >}})|Easy| O(n)| O(1)||58.0%|
+|0101|Symmetric Tree|[Go]({{< relref "/ChapterFour/0100~0199/0101.Symmetric-Tree.md" >}})|Easy| O(n)| O(1)||54.2%|
+|0102|Binary Tree Level Order Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md" >}})|Medium| O(n)| O(1)||64.2%|
+|0103|Binary Tree Zigzag Level Order Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md" >}})|Medium| O(n)| O(n)||56.8%|
+|0104|Maximum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||73.9%|
+|0105|Construct Binary Tree from Preorder and Inorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md" >}})|Medium||||61.4%|
+|0106|Construct Binary Tree from Inorder and Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md" >}})|Medium||||58.1%|
+|0107|Binary Tree Level Order Traversal II|[Go]({{< relref "/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md" >}})|Medium| O(n)| O(1)||61.0%|
+|0108|Convert Sorted Array to Binary Search Tree|[Go]({{< relref "/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md" >}})|Easy| O(n)| O(1)||69.7%|
+|0109|Convert Sorted List to Binary Search Tree|[Go]({{< relref "/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md" >}})|Medium||||60.1%|
+|0110|Balanced Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md" >}})|Easy| O(n)| O(1)||48.9%|
+|0111|Minimum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||44.3%|
+|0112|Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0112.Path-Sum.md" >}})|Easy| O(n)| O(1)||48.2%|
+|0113|Path Sum II|[Go]({{< relref "/ChapterFour/0100~0199/0113.Path-Sum-II.md" >}})|Medium| O(n)| O(1)||57.0%|
+|0114|Flatten Binary Tree to Linked List|[Go]({{< relref "/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})|Medium| O(n)| O(1)||61.7%|
+|0116|Populating Next Right Pointers in Each Node|[Go]({{< relref "/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node.md" >}})|Medium||||60.3%|
+|0124|Binary Tree Maximum Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md" >}})|Hard| O(n)| O(1)||39.2%|
+|0129|Sum Root to Leaf Numbers|[Go]({{< relref "/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md" >}})|Medium| O(n)| O(1)||60.9%|
+|0144|Binary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md" >}})|Easy| O(n)| O(1)||66.7%|
+|0145|Binary Tree Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md" >}})|Easy| O(n)| O(1)||67.8%|
+|0173|Binary Search Tree Iterator|[Go]({{< relref "/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator.md" >}})|Medium| O(n)| O(1)||69.7%|
+|0199|Binary Tree Right Side View|[Go]({{< relref "/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md" >}})|Medium| O(n)| O(1)||61.6%|
+|0222|Count Complete Tree Nodes|[Go]({{< relref "/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md" >}})|Medium| O(n)| O(1)||60.4%|
+|0226|Invert Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md" >}})|Easy| O(n)| O(1)||74.6%|
+|0230|Kth Smallest Element in a BST|[Go]({{< relref "/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST.md" >}})|Medium| O(n)| O(1)||70.0%|
+|0235|Lowest Common Ancestor of a Binary Search Tree|[Go]({{< relref "/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||61.4%|
+|0236|Lowest Common Ancestor of a Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md" >}})|Medium| O(n)| O(1)||58.7%|
+|0257|Binary Tree Paths|[Go]({{< relref "/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md" >}})|Easy| O(n)| O(1)||61.3%|
+|0297|Serialize and Deserialize Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md" >}})|Hard||||55.4%|
+|0331|Verify Preorder Serialization of a Binary Tree|[Go]({{< relref "/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md" >}})|Medium||||44.6%|
+|0337|House Robber III|[Go]({{< relref "/ChapterFour/0300~0399/0337.House-Robber-III.md" >}})|Medium||||53.9%|
+|0341|Flatten Nested List Iterator|[Go]({{< relref "/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator.md" >}})|Medium||||61.8%|
+|0404|Sum of Left Leaves|[Go]({{< relref "/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md" >}})|Easy| O(n)| O(1)||56.7%|
+|0429|N-ary Tree Level Order Traversal|[Go]({{< relref "/ChapterFour/0400~0499/0429.N-ary-Tree-Level-Order-Traversal.md" >}})|Medium||||70.7%|
+|0437|Path Sum III|[Go]({{< relref "/ChapterFour/0400~0499/0437.Path-Sum-III.md" >}})|Medium| O(n)| O(1)||48.1%|
+|0508|Most Frequent Subtree Sum|[Go]({{< relref "/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md" >}})|Medium||||64.8%|
+|0513|Find Bottom Left Tree Value|[Go]({{< relref "/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md" >}})|Medium||||66.8%|
|0515|Find Largest Value in Each Tree Row|[Go]({{< relref "/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md" >}})|Medium| O(n)| O(n)||64.6%|
-|0530|Minimum Absolute Difference in BST|[Go]({{< relref "/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST.md" >}})|Easy||||56.7%|
-|0538|Convert BST to Greater Tree|[Go]({{< relref "/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md" >}})|Medium||||67.3%|
-|0543|Diameter of Binary Tree|[Go]({{< relref "/ChapterFour/0500~0599/0543.Diameter-of-Binary-Tree.md" >}})|Easy||||55.9%|
-|0559|Maximum Depth of N-ary Tree|[Go]({{< relref "/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree.md" >}})|Easy||||71.6%|
-|0563|Binary Tree Tilt|[Go]({{< relref "/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md" >}})|Easy||||59.3%|
-|0572|Subtree of Another Tree|[Go]({{< relref "/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree.md" >}})|Easy||||45.9%|
-|0589|N-ary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal.md" >}})|Easy||||76.3%|
-|0617|Merge Two Binary Trees|[Go]({{< relref "/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees.md" >}})|Easy||||78.5%|
-|0623|Add One Row to Tree|[Go]({{< relref "/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree.md" >}})|Medium||||59.4%|
-|0637|Average of Levels in Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md" >}})|Easy| O(n)| O(n)||71.6%|
-|0653|Two Sum IV - Input is a BST|[Go]({{< relref "/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md" >}})|Easy||||60.9%|
-|0662|Maximum Width of Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md" >}})|Medium||||40.6%|
-|0669|Trim a Binary Search Tree|[Go]({{< relref "/ChapterFour/0600~0699/0669.Trim-a-Binary-Search-Tree.md" >}})|Medium||||66.3%|
-|0700|Search in a Binary Search Tree|[Go]({{< relref "/ChapterFour/0700~0799/0700.Search-in-a-Binary-Search-Tree.md" >}})|Easy||||77.1%|
-|0701|Insert into a Binary Search Tree|[Go]({{< relref "/ChapterFour/0700~0799/0701.Insert-into-a-Binary-Search-Tree.md" >}})|Medium||||74.6%|
+|0530|Minimum Absolute Difference in BST|[Go]({{< relref "/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST.md" >}})|Easy||||57.3%|
+|0538|Convert BST to Greater Tree|[Go]({{< relref "/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md" >}})|Medium||||67.7%|
+|0543|Diameter of Binary Tree|[Go]({{< relref "/ChapterFour/0500~0599/0543.Diameter-of-Binary-Tree.md" >}})|Easy||||56.7%|
+|0559|Maximum Depth of N-ary Tree|[Go]({{< relref "/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree.md" >}})|Easy||||71.7%|
+|0563|Binary Tree Tilt|[Go]({{< relref "/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md" >}})|Easy||||59.9%|
+|0572|Subtree of Another Tree|[Go]({{< relref "/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree.md" >}})|Easy||||46.3%|
+|0589|N-ary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal.md" >}})|Easy||||75.9%|
+|0617|Merge Two Binary Trees|[Go]({{< relref "/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees.md" >}})|Easy||||78.6%|
+|0623|Add One Row to Tree|[Go]({{< relref "/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree.md" >}})|Medium||||59.5%|
+|0637|Average of Levels in Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md" >}})|Easy| O(n)| O(n)||71.8%|
+|0653|Two Sum IV - Input is a BST|[Go]({{< relref "/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md" >}})|Easy||||61.0%|
+|0662|Maximum Width of Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md" >}})|Medium||||40.7%|
+|0669|Trim a Binary Search Tree|[Go]({{< relref "/ChapterFour/0600~0699/0669.Trim-a-Binary-Search-Tree.md" >}})|Medium||||66.4%|
+|0700|Search in a Binary Search Tree|[Go]({{< relref "/ChapterFour/0700~0799/0700.Search-in-a-Binary-Search-Tree.md" >}})|Easy||||77.6%|
+|0701|Insert into a Binary Search Tree|[Go]({{< relref "/ChapterFour/0700~0799/0701.Insert-into-a-Binary-Search-Tree.md" >}})|Medium||||74.3%|
|0703|Kth Largest Element in a Stream|[Go]({{< relref "/ChapterFour/0700~0799/0703.Kth-Largest-Element-in-a-Stream.md" >}})|Easy||||55.5%|
-|0783|Minimum Distance Between BST Nodes|[Go]({{< relref "/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes.md" >}})|Easy||||56.8%|
-|0834|Sum of Distances in Tree|[Go]({{< relref "/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md" >}})|Hard||||54.1%|
-|0863|All Nodes Distance K in Binary Tree|[Go]({{< relref "/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})|Medium||||62.1%|
-|0872|Leaf-Similar Trees|[Go]({{< relref "/ChapterFour/0800~0899/0872.Leaf-Similar-Trees.md" >}})|Easy||||65.2%|
-|0897|Increasing Order Search Tree|[Go]({{< relref "/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md" >}})|Easy||||78.4%|
-|0938|Range Sum of BST|[Go]({{< relref "/ChapterFour/0900~0999/0938.Range-Sum-of-BST.md" >}})|Easy||||85.3%|
-|0958|Check Completeness of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0958.Check-Completeness-of-a-Binary-Tree.md" >}})|Medium||||53.8%|
-|0968|Binary Tree Cameras|[Go]({{< relref "/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md" >}})|Hard||||46.8%|
-|0971|Flip Binary Tree To Match Preorder Traversal|[Go]({{< relref "/ChapterFour/0900~0999/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal.md" >}})|Medium||||49.9%|
-|0979|Distribute Coins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree.md" >}})|Medium||||72.0%|
-|0987|Vertical Order Traversal of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md" >}})|Hard||||44.6%|
-|0993|Cousins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md" >}})|Easy| O(n)| O(1)||54.1%|
-|1022|Sum of Root To Leaf Binary Numbers|[Go]({{< relref "/ChapterFour/1000~1099/1022.Sum-of-Root-To-Leaf-Binary-Numbers.md" >}})|Easy||||73.8%|
-|1026|Maximum Difference Between Node and Ancestor|[Go]({{< relref "/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md" >}})|Medium||||73.4%|
-|1028|Recover a Tree From Preorder Traversal|[Go]({{< relref "/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md" >}})|Hard||||72.8%|
-|1038|Binary Search Tree to Greater Sum Tree|[Go]({{< relref "/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree.md" >}})|Medium||||85.3%|
-|1104|Path In Zigzag Labelled Binary Tree|[Go]({{< relref "/ChapterFour/1100~1199/1104.Path-In-Zigzag-Labelled-Binary-Tree.md" >}})|Medium||||74.9%|
-|1110|Delete Nodes And Return Forest|[Go]({{< relref "/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md" >}})|Medium||||69.4%|
-|1123|Lowest Common Ancestor of Deepest Leaves|[Go]({{< relref "/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}})|Medium||||70.6%|
-|1145|Binary Tree Coloring Game|[Go]({{< relref "/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md" >}})|Medium||||51.4%|
-|1302|Deepest Leaves Sum|[Go]({{< relref "/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md" >}})|Medium||||87.0%|
+|0783|Minimum Distance Between BST Nodes|[Go]({{< relref "/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes.md" >}})|Easy||||59.3%|
+|0834|Sum of Distances in Tree|[Go]({{< relref "/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md" >}})|Hard||||59.3%|
+|0863|All Nodes Distance K in Binary Tree|[Go]({{< relref "/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})|Medium||||62.3%|
+|0872|Leaf-Similar Trees|[Go]({{< relref "/ChapterFour/0800~0899/0872.Leaf-Similar-Trees.md" >}})|Easy||||67.6%|
+|0897|Increasing Order Search Tree|[Go]({{< relref "/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md" >}})|Easy||||78.5%|
+|0938|Range Sum of BST|[Go]({{< relref "/ChapterFour/0900~0999/0938.Range-Sum-of-BST.md" >}})|Easy||||85.9%|
+|0958|Check Completeness of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0958.Check-Completeness-of-a-Binary-Tree.md" >}})|Medium||||55.7%|
+|0968|Binary Tree Cameras|[Go]({{< relref "/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md" >}})|Hard||||46.7%|
+|0971|Flip Binary Tree To Match Preorder Traversal|[Go]({{< relref "/ChapterFour/0900~0999/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal.md" >}})|Medium||||50.1%|
+|0979|Distribute Coins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree.md" >}})|Medium||||72.2%|
+|0987|Vertical Order Traversal of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md" >}})|Hard||||45.0%|
+|0993|Cousins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md" >}})|Easy| O(n)| O(1)||54.6%|
+|1022|Sum of Root To Leaf Binary Numbers|[Go]({{< relref "/ChapterFour/1000~1099/1022.Sum-of-Root-To-Leaf-Binary-Numbers.md" >}})|Easy||||73.6%|
+|1026|Maximum Difference Between Node and Ancestor|[Go]({{< relref "/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md" >}})|Medium||||75.7%|
+|1028|Recover a Tree From Preorder Traversal|[Go]({{< relref "/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md" >}})|Hard||||73.2%|
+|1038|Binary Search Tree to Greater Sum Tree|[Go]({{< relref "/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree.md" >}})|Medium||||85.5%|
+|1104|Path In Zigzag Labelled Binary Tree|[Go]({{< relref "/ChapterFour/1100~1199/1104.Path-In-Zigzag-Labelled-Binary-Tree.md" >}})|Medium||||75.1%|
+|1110|Delete Nodes And Return Forest|[Go]({{< relref "/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md" >}})|Medium||||69.3%|
+|1123|Lowest Common Ancestor of Deepest Leaves|[Go]({{< relref "/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}})|Medium||||70.9%|
+|1145|Binary Tree Coloring Game|[Go]({{< relref "/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md" >}})|Medium||||51.7%|
+|1302|Deepest Leaves Sum|[Go]({{< relref "/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md" >}})|Medium||||86.7%|
|1305|All Elements in Two Binary Search Trees|[Go]({{< relref "/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees.md" >}})|Medium||||79.8%|
|1600|Throne Inheritance|[Go]({{< relref "/ChapterFour/1600~1699/1600.Throne-Inheritance.md" >}})|Medium||||63.6%|
-|1609|Even Odd Tree|[Go]({{< relref "/ChapterFour/1600~1699/1609.Even-Odd-Tree.md" >}})|Medium||||53.6%|
-|2096|Step-By-Step Directions From a Binary Tree Node to Another|[Go]({{< relref "/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.md" >}})|Medium||||48.8%|
+|1609|Even Odd Tree|[Go]({{< relref "/ChapterFour/1600~1699/1609.Even-Odd-Tree.md" >}})|Medium||||54.3%|
+|2096|Step-By-Step Directions From a Binary Tree Node to Another|[Go]({{< relref "/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.md" >}})|Medium||||48.5%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+--------|-------| ----------------| ---------------|-------------|-------------|-------------|
+--------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
----------------------------------------------
diff --git a/website/content/ChapterTwo/Two_Pointers.md b/website/content/ChapterTwo/Two_Pointers.md
index 072e41af3..0ca734610 100644
--- a/website/content/ChapterTwo/Two_Pointers.md
+++ b/website/content/ChapterTwo/Two_Pointers.md
@@ -8,7 +8,7 @@ weight: 3
-- 双指针滑动窗口的经典写法。右指针不断往右移，移动到不能往右移动为止(具体条件根据题目而定)。当右指针到最右边以后，开始挪动左指针，释放窗口左边界。第 3 题，第 76 题，第 209 题，第 424 题，第 438 题，第 567 题，第 713 题，第 763 题，第 845 题，第 881 题，第 904 题，第 978 题，第 992 题，第 1004 题，第 1040 题，第 1052 题。
+- The classic way of writing a two-pointer sliding window. The right pointer keeps moving to the right until it cannot move to the right (the specific conditions depend on the topic). When the right pointer reaches the far right, start to move the left pointer to release the left boundary of the window. Question 3, Question 76, Question 209, Question 424, Question 438, Question 567, Question 713, Question 763, Question 845, Question 881, Question 904, Question 978, Question 992 Question 1004, Question 1040, Question 1052.
```c
left, right := 0, -1
@@ -25,95 +25,97 @@ weight: 3
}
```
-- 快慢指针可以查找重复数字，时间复杂度 O(n)，第 287 题。
-- 替换字母以后，相同字母能出现连续最长的长度。第 424 题。
-- SUM 问题集。第 1 题，第 15 题，第 16 题，第 18 题，第 167 题，第 923 题，第 1074 题。
+- Fast and slow pointers can find repeated numbers, time complexity O(n), question 287.
+- After replacing letters, the same letter can appear for the longest length in a row. Question 424.
+- SUM problem sets. Question 1, Question 15, Question 16, Question 18, Question 167, Question 923, Question 1074.
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
-|0011|Container With Most Water|[Go]({{< relref "/ChapterFour/0001~0099/0011.Container-With-Most-Water.md" >}})|Medium| O(n)| O(1)||54.3%|
-|0015|3Sum|[Go]({{< relref "/ChapterFour/0001~0099/0015.3Sum.md" >}})|Medium| O(n^2)| O(n)|❤️|32.2%|
-|0016|3Sum Closest|[Go]({{< relref "/ChapterFour/0001~0099/0016.3Sum-Closest.md" >}})|Medium| O(n^2)| O(1)|❤️|46.2%|
-|0018|4Sum|[Go]({{< relref "/ChapterFour/0001~0099/0018.4Sum.md" >}})|Medium| O(n^3)| O(n^2)|❤️|36.5%|
-|0019|Remove Nth Node From End of List|[Go]({{< relref "/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md" >}})|Medium| O(n)| O(1)||39.9%|
-|0026|Remove Duplicates from Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md" >}})|Easy| O(n)| O(1)||50.3%|
-|0027|Remove Element|[Go]({{< relref "/ChapterFour/0001~0099/0027.Remove-Element.md" >}})|Easy| O(n)| O(1)||52.0%|
-|0028|Find the Index of the First Occurrence in a String|[Go]({{< relref "/ChapterFour/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String.md" >}})|Medium| O(n)| O(1)||37.4%|
-|0031|Next Permutation|[Go]({{< relref "/ChapterFour/0001~0099/0031.Next-Permutation.md" >}})|Medium||||37.1%|
-|0042|Trapping Rain Water|[Go]({{< relref "/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md" >}})|Hard| O(n)| O(1)|❤️|58.7%|
-|0061|Rotate List|[Go]({{< relref "/ChapterFour/0001~0099/0061.Rotate-List.md" >}})|Medium| O(n)| O(1)||35.7%|
-|0075|Sort Colors|[Go]({{< relref "/ChapterFour/0001~0099/0075.Sort-Colors.md" >}})|Medium| O(n)| O(1)|❤️|57.1%|
-|0080|Remove Duplicates from Sorted Array II|[Go]({{< relref "/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md" >}})|Medium| O(n)| O(1||51.5%|
-|0082|Remove Duplicates from Sorted List II|[Go]({{< relref "/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md" >}})|Medium||||45.4%|
-|0086|Partition List|[Go]({{< relref "/ChapterFour/0001~0099/0086.Partition-List.md" >}})|Medium| O(n)| O(1)|❤️|51.3%|
-|0088|Merge Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md" >}})|Easy| O(n)| O(1)|❤️|45.7%|
-|0125|Valid Palindrome|[Go]({{< relref "/ChapterFour/0100~0199/0125.Valid-Palindrome.md" >}})|Easy| O(n)| O(1)||43.5%|
-|0141|Linked List Cycle|[Go]({{< relref "/ChapterFour/0100~0199/0141.Linked-List-Cycle.md" >}})|Easy| O(n)| O(1)|❤️|46.8%|
-|0142|Linked List Cycle II|[Go]({{< relref "/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md" >}})|Medium| O(n)| O(1)|❤️|46.2%|
-|0143|Reorder List|[Go]({{< relref "/ChapterFour/0100~0199/0143.Reorder-List.md" >}})|Medium||||50.9%|
-|0148|Sort List|[Go]({{< relref "/ChapterFour/0100~0199/0148.Sort-List.md" >}})|Medium||||54.0%|
-|0151|Reverse Words in a String|[Go]({{< relref "/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md" >}})|Medium||||30.2%|
-|0160|Intersection of Two Linked Lists|[Go]({{< relref "/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md" >}})|Easy||||53.1%|
+|0011|Container With Most Water|[Go]({{< relref "/ChapterFour/0001~0099/0011.Container-With-Most-Water.md" >}})|Medium| O(n)| O(1)||54.0%|
+|0015|3Sum|[Go]({{< relref "/ChapterFour/0001~0099/0015.3Sum.md" >}})|Medium| O(n^2)| O(n)|❤️|32.5%|
+|0016|3Sum Closest|[Go]({{< relref "/ChapterFour/0001~0099/0016.3Sum-Closest.md" >}})|Medium| O(n^2)| O(1)|❤️|45.8%|
+|0018|4Sum|[Go]({{< relref "/ChapterFour/0001~0099/0018.4Sum.md" >}})|Medium| O(n^3)| O(n^2)|❤️|36.0%|
+|0019|Remove Nth Node From End of List|[Go]({{< relref "/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md" >}})|Medium| O(n)| O(1)||40.9%|
+|0026|Remove Duplicates from Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md" >}})|Easy| O(n)| O(1)||51.5%|
+|0027|Remove Element|[Go]({{< relref "/ChapterFour/0001~0099/0027.Remove-Element.md" >}})|Easy| O(n)| O(1)||52.9%|
+|0028|Find the Index of the First Occurrence in a String|[Go]({{< relref "/ChapterFour/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String.md" >}})|Easy| O(n)| O(1)||38.9%|
+|0031|Next Permutation|[Go]({{< relref "/ChapterFour/0001~0099/0031.Next-Permutation.md" >}})|Medium||||37.5%|
+|0042|Trapping Rain Water|[Go]({{< relref "/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md" >}})|Hard| O(n)| O(1)|❤️|59.2%|
+|0061|Rotate List|[Go]({{< relref "/ChapterFour/0001~0099/0061.Rotate-List.md" >}})|Medium| O(n)| O(1)||36.0%|
+|0075|Sort Colors|[Go]({{< relref "/ChapterFour/0001~0099/0075.Sort-Colors.md" >}})|Medium| O(n)| O(1)|❤️|58.4%|
+|0080|Remove Duplicates from Sorted Array II|[Go]({{< relref "/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md" >}})|Medium| O(n)| O(1||52.2%|
+|0082|Remove Duplicates from Sorted List II|[Go]({{< relref "/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md" >}})|Medium||||45.9%|
+|0086|Partition List|[Go]({{< relref "/ChapterFour/0001~0099/0086.Partition-List.md" >}})|Medium| O(n)| O(1)|❤️|51.9%|
+|0088|Merge Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md" >}})|Easy| O(n)| O(1)|❤️|46.5%|
+|0125|Valid Palindrome|[Go]({{< relref "/ChapterFour/0100~0199/0125.Valid-Palindrome.md" >}})|Easy| O(n)| O(1)||44.3%|
+|0141|Linked List Cycle|[Go]({{< relref "/ChapterFour/0100~0199/0141.Linked-List-Cycle.md" >}})|Easy| O(n)| O(1)|❤️|47.4%|
+|0142|Linked List Cycle II|[Go]({{< relref "/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md" >}})|Medium| O(n)| O(1)|❤️|48.6%|
+|0143|Reorder List|[Go]({{< relref "/ChapterFour/0100~0199/0143.Reorder-List.md" >}})|Medium||||52.4%|
+|0148|Sort List|[Go]({{< relref "/ChapterFour/0100~0199/0148.Sort-List.md" >}})|Medium||||55.0%|
+|0151|Reverse Words in a String|[Go]({{< relref "/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md" >}})|Medium||||32.6%|
+|0160|Intersection of Two Linked Lists|[Go]({{< relref "/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md" >}})|Easy||||54.2%|
|0167|Two Sum II - Input Array Is Sorted|[Go]({{< relref "/ChapterFour/0100~0199/0167.Two-Sum-II-Input-Array-Is-Sorted.md" >}})|Medium| O(n)| O(1)||60.0%|
-|0189|Rotate Array|[Go]({{< relref "/ChapterFour/0100~0199/0189.Rotate-Array.md" >}})|Medium||||39.2%|
-|0202|Happy Number|[Go]({{< relref "/ChapterFour/0200~0299/0202.Happy-Number.md" >}})|Easy||||54.3%|
-|0234|Palindrome Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md" >}})|Easy| O(n)| O(1)||49.4%|
-|0283|Move Zeroes|[Go]({{< relref "/ChapterFour/0200~0299/0283.Move-Zeroes.md" >}})|Easy| O(n)| O(1)||61.3%|
+|0189|Rotate Array|[Go]({{< relref "/ChapterFour/0100~0199/0189.Rotate-Array.md" >}})|Medium||||39.4%|
+|0202|Happy Number|[Go]({{< relref "/ChapterFour/0200~0299/0202.Happy-Number.md" >}})|Easy||||54.8%|
+|0234|Palindrome Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md" >}})|Easy| O(n)| O(1)||50.1%|
+|0283|Move Zeroes|[Go]({{< relref "/ChapterFour/0200~0299/0283.Move-Zeroes.md" >}})|Easy| O(n)| O(1)||61.4%|
|0287|Find the Duplicate Number|[Go]({{< relref "/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md" >}})|Medium| O(n)| O(1)|❤️|59.1%|
-|0344|Reverse String|[Go]({{< relref "/ChapterFour/0300~0399/0344.Reverse-String.md" >}})|Easy| O(n)| O(1)||76.1%|
-|0345|Reverse Vowels of a String|[Go]({{< relref "/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md" >}})|Easy| O(n)| O(1)||47.7%|
-|0349|Intersection of Two Arrays|[Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}})|Easy| O(n)| O(n) ||70.2%|
-|0350|Intersection of Two Arrays II|[Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}})|Easy| O(n)| O(n) ||55.5%|
-|0392|Is Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0392.Is-Subsequence.md" >}})|Easy||||49.3%|
-|0455|Assign Cookies|[Go]({{< relref "/ChapterFour/0400~0499/0455.Assign-Cookies.md" >}})|Easy||||50.6%|
-|0457|Circular Array Loop|[Go]({{< relref "/ChapterFour/0400~0499/0457.Circular-Array-Loop.md" >}})|Medium||||32.1%|
-|0475|Heaters|[Go]({{< relref "/ChapterFour/0400~0499/0475.Heaters.md" >}})|Medium||||36.0%|
-|0524|Longest Word in Dictionary through Deleting|[Go]({{< relref "/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})|Medium| O(n)| O(1) ||51.2%|
-|0532|K-diff Pairs in an Array|[Go]({{< relref "/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md" >}})|Medium| O(n)| O(n)||40.7%|
+|0344|Reverse String|[Go]({{< relref "/ChapterFour/0300~0399/0344.Reverse-String.md" >}})|Easy| O(n)| O(1)||76.7%|
+|0345|Reverse Vowels of a String|[Go]({{< relref "/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md" >}})|Easy| O(n)| O(1)||50.0%|
+|0349|Intersection of Two Arrays|[Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}})|Easy| O(n)| O(n) ||70.9%|
+|0350|Intersection of Two Arrays II|[Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}})|Easy| O(n)| O(n) ||55.9%|
+|0392|Is Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0392.Is-Subsequence.md" >}})|Easy||||47.7%|
+|0455|Assign Cookies|[Go]({{< relref "/ChapterFour/0400~0499/0455.Assign-Cookies.md" >}})|Easy||||50.0%|
+|0457|Circular Array Loop|[Go]({{< relref "/ChapterFour/0400~0499/0457.Circular-Array-Loop.md" >}})|Medium||||32.6%|
+|0475|Heaters|[Go]({{< relref "/ChapterFour/0400~0499/0475.Heaters.md" >}})|Medium||||36.4%|
+|0524|Longest Word in Dictionary through Deleting|[Go]({{< relref "/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})|Medium| O(n)| O(1) ||51.0%|
+|0532|K-diff Pairs in an Array|[Go]({{< relref "/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md" >}})|Medium| O(n)| O(n)||41.1%|
|0541|Reverse String II|[Go]({{< relref "/ChapterFour/0500~0599/0541.Reverse-String-II.md" >}})|Easy||||50.5%|
-|0557|Reverse Words in a String III|[Go]({{< relref "/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III.md" >}})|Easy||||81.5%|
-|0567|Permutation in String|[Go]({{< relref "/ChapterFour/0500~0599/0567.Permutation-in-String.md" >}})|Medium| O(n)| O(1)|❤️|43.8%|
-|0581|Shortest Unsorted Continuous Subarray|[Go]({{< relref "/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md" >}})|Medium||||36.2%|
-|0611|Valid Triangle Number|[Go]({{< relref "/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md" >}})|Medium||||50.3%|
-|0633|Sum of Square Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md" >}})|Medium||||34.7%|
-|0653|Two Sum IV - Input is a BST|[Go]({{< relref "/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md" >}})|Easy||||60.9%|
-|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||46.7%|
-|0696|Count Binary Substrings|[Go]({{< relref "/ChapterFour/0600~0699/0696.Count-Binary-Substrings.md" >}})|Easy||||65.5%|
-|0719|Find K-th Smallest Pair Distance|[Go]({{< relref "/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md" >}})|Hard||||36.3%|
+|0557|Reverse Words in a String III|[Go]({{< relref "/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III.md" >}})|Easy||||81.9%|
+|0567|Permutation in String|[Go]({{< relref "/ChapterFour/0500~0599/0567.Permutation-in-String.md" >}})|Medium| O(n)| O(1)|❤️|44.4%|
+|0581|Shortest Unsorted Continuous Subarray|[Go]({{< relref "/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray.md" >}})|Medium||||36.4%|
+|0611|Valid Triangle Number|[Go]({{< relref "/ChapterFour/0600~0699/0611.Valid-Triangle-Number.md" >}})|Medium||||50.5%|
+|0633|Sum of Square Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md" >}})|Medium||||34.4%|
+|0653|Two Sum IV - Input is a BST|[Go]({{< relref "/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md" >}})|Easy||||61.0%|
+|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||46.8%|
+|0696|Count Binary Substrings|[Go]({{< relref "/ChapterFour/0600~0699/0696.Count-Binary-Substrings.md" >}})|Easy||||65.6%|
+|0719|Find K-th Smallest Pair Distance|[Go]({{< relref "/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md" >}})|Hard||||36.7%|
|0763|Partition Labels|[Go]({{< relref "/ChapterFour/0700~0799/0763.Partition-Labels.md" >}})|Medium| O(n)| O(1)|❤️|79.8%|
-|0795|Number of Subarrays with Bounded Maximum|[Go]({{< relref "/ChapterFour/0700~0799/0795.Number-of-Subarrays-with-Bounded-Maximum.md" >}})|Medium||||52.7%|
+|0795|Number of Subarrays with Bounded Maximum|[Go]({{< relref "/ChapterFour/0700~0799/0795.Number-of-Subarrays-with-Bounded-Maximum.md" >}})|Medium||||52.8%|
|0821|Shortest Distance to a Character|[Go]({{< relref "/ChapterFour/0800~0899/0821.Shortest-Distance-to-a-Character.md" >}})|Easy||||71.3%|
|0825|Friends Of Appropriate Ages|[Go]({{< relref "/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages.md" >}})|Medium||||46.3%|
-|0826|Most Profit Assigning Work|[Go]({{< relref "/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md" >}})|Medium| O(n log n)| O(n)||44.3%|
-|0832|Flipping an Image|[Go]({{< relref "/ChapterFour/0800~0899/0832.Flipping-an-Image.md" >}})|Easy||||80.3%|
+|0826|Most Profit Assigning Work|[Go]({{< relref "/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md" >}})|Medium| O(n log n)| O(n)||44.8%|
+|0832|Flipping an Image|[Go]({{< relref "/ChapterFour/0800~0899/0832.Flipping-an-Image.md" >}})|Easy||||80.7%|
|0838|Push Dominoes|[Go]({{< relref "/ChapterFour/0800~0899/0838.Push-Dominoes.md" >}})|Medium| O(n)| O(n)||57.0%|
|0844|Backspace String Compare|[Go]({{< relref "/ChapterFour/0800~0899/0844.Backspace-String-Compare.md" >}})|Easy| O(n)| O(n) ||48.0%|
-|0845|Longest Mountain in Array|[Go]({{< relref "/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md" >}})|Medium| O(n)| O(1) ||40.1%|
-|0870|Advantage Shuffle|[Go]({{< relref "/ChapterFour/0800~0899/0870.Advantage-Shuffle.md" >}})|Medium||||51.6%|
-|0876|Middle of the Linked List|[Go]({{< relref "/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List.md" >}})|Easy||||73.7%|
-|0881|Boats to Save People|[Go]({{< relref "/ChapterFour/0800~0899/0881.Boats-to-Save-People.md" >}})|Medium| O(n log n)| O(1) ||52.7%|
+|0845|Longest Mountain in Array|[Go]({{< relref "/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md" >}})|Medium| O(n)| O(1) ||40.2%|
+|0870|Advantage Shuffle|[Go]({{< relref "/ChapterFour/0800~0899/0870.Advantage-Shuffle.md" >}})|Medium||||51.8%|
+|0876|Middle of the Linked List|[Go]({{< relref "/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List.md" >}})|Easy||||75.5%|
+|0881|Boats to Save People|[Go]({{< relref "/ChapterFour/0800~0899/0881.Boats-to-Save-People.md" >}})|Medium| O(n log n)| O(1) ||53.1%|
|0922|Sort Array By Parity II|[Go]({{< relref "/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II.md" >}})|Easy||||70.7%|
-|0923|3Sum With Multiplicity|[Go]({{< relref "/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md" >}})|Medium| O(n^2)| O(n) ||45.4%|
-|0925|Long Pressed Name|[Go]({{< relref "/ChapterFour/0900~0999/0925.Long-Pressed-Name.md" >}})|Easy| O(n)| O(1)||33.8%|
-|0942|DI String Match|[Go]({{< relref "/ChapterFour/0900~0999/0942.DI-String-Match.md" >}})|Easy||||76.6%|
-|0969|Pancake Sorting|[Go]({{< relref "/ChapterFour/0900~0999/0969.Pancake-Sorting.md" >}})|Medium||||70.0%|
+|0923|3Sum With Multiplicity|[Go]({{< relref "/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md" >}})|Medium| O(n^2)| O(n) ||45.3%|
+|0925|Long Pressed Name|[Go]({{< relref "/ChapterFour/0900~0999/0925.Long-Pressed-Name.md" >}})|Easy| O(n)| O(1)||33.2%|
+|0942|DI String Match|[Go]({{< relref "/ChapterFour/0900~0999/0942.DI-String-Match.md" >}})|Easy||||77.3%|
+|0969|Pancake Sorting|[Go]({{< relref "/ChapterFour/0900~0999/0969.Pancake-Sorting.md" >}})|Medium||||70.1%|
|0977|Squares of a Sorted Array|[Go]({{< relref "/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array.md" >}})|Easy| O(n)| O(1)||71.9%|
-|0986|Interval List Intersections|[Go]({{< relref "/ChapterFour/0900~0999/0986.Interval-List-Intersections.md" >}})|Medium| O(n)| O(1)||71.4%|
-|1040|Moving Stones Until Consecutive II|[Go]({{< relref "/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md" >}})|Medium||||55.6%|
+|0986|Interval List Intersections|[Go]({{< relref "/ChapterFour/0900~0999/0986.Interval-List-Intersections.md" >}})|Medium| O(n)| O(1)||71.3%|
+|1040|Moving Stones Until Consecutive II|[Go]({{< relref "/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md" >}})|Medium||||55.8%|
|1048|Longest String Chain|[Go]({{< relref "/ChapterFour/1000~1099/1048.Longest-String-Chain.md" >}})|Medium||||59.2%|
|1089|Duplicate Zeros|[Go]({{< relref "/ChapterFour/1000~1099/1089.Duplicate-Zeros.md" >}})|Easy||||51.5%|
-|1093|Statistics from a Large Sample|[Go]({{< relref "/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md" >}})|Medium| O(n)| O(1) ||44.7%|
-|1332|Remove Palindromic Subsequences|[Go]({{< relref "/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences.md" >}})|Easy||||76.1%|
-|1385|Find the Distance Value Between Two Arrays|[Go]({{< relref "/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md" >}})|Easy||||65.3%|
-|1679|Max Number of K-Sum Pairs|[Go]({{< relref "/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md" >}})|Medium||||57.4%|
-|1721|Swapping Nodes in a Linked List|[Go]({{< relref "/ChapterFour/1700~1799/1721.Swapping-Nodes-in-a-Linked-List.md" >}})|Medium||||67.8%|
-|1877|Minimize Maximum Pair Sum in Array|[Go]({{< relref "/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array.md" >}})|Medium||||80.4%|
+|1332|Remove Palindromic Subsequences|[Go]({{< relref "/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences.md" >}})|Easy||||76.2%|
+|1385|Find the Distance Value Between Two Arrays|[Go]({{< relref "/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md" >}})|Easy||||66.4%|
+|1679|Max Number of K-Sum Pairs|[Go]({{< relref "/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md" >}})|Medium||||57.3%|
+|1721|Swapping Nodes in a Linked List|[Go]({{< relref "/ChapterFour/1700~1799/1721.Swapping-Nodes-in-a-Linked-List.md" >}})|Medium||||67.2%|
+|1877|Minimize Maximum Pair Sum in Array|[Go]({{< relref "/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array.md" >}})|Medium||||79.9%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+-----------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
+
----------------------------------------------
diff --git a/website/content/ChapterTwo/Union_Find.md b/website/content/ChapterTwo/Union_Find.md
index 9c5019e20..8f1df642c 100644
--- a/website/content/ChapterTwo/Union_Find.md
+++ b/website/content/ChapterTwo/Union_Find.md
@@ -7,49 +7,47 @@ weight: 16
# Union Find
-
-- 灵活使用并查集的思想，熟练掌握并查集的[模板]({{< relref "/ChapterThree/UnionFind.md" >}})，模板中有两种并查集的实现方式，一种是路径压缩 + 秩优化的版本，另外一种是计算每个集合中元素的个数 + 最大集合元素个数的版本，这两种版本都有各自使用的地方。能使用第一类并查集模板的题目有：第 128 题，第 130 题，第 547 题，第 684 题，第 721 题，第 765 题，第 778 题，第 839 题，第 924 题，第 928 题，第 947 题，第 952 题，第 959 题，第 990 题。能使用第二类并查集模板的题目有：第 803 题，第 952 题。第 803 题秩优化和统计集合个数这些地方会卡时间，如果不优化，会 TLE。
-- 并查集是一种思想，有些题需要灵活使用这种思想，而不是死套模板，如第 399 题，这一题是 stringUnionFind，利用并查集思想实现的。这里每个节点是基于字符串和 map 的，而不是单纯的用 int 节点编号实现的。
-- 有些题死套模板反而做不出来，比如第 685 题，这一题不能路径压缩和秩优化，因为题目中涉及到有向图，需要知道节点的前驱节点，如果路径压缩了，这一题就没法做了。这一题不需要路径压缩和秩优化。
-- 灵活的抽象题目给的信息，将给定的信息合理的编号，使用并查集解题，并用 map 降低时间复杂度，如第 721 题，第 959 题。
-- 关于地图，砖块，网格的题目，可以新建一个特殊节点，将四周边缘的砖块或者网格都 union() 到这个特殊节点上。第 130 题，第 803 题。
-- 能用并查集的题目，一般也可以用 DFS 和 BFS 解答，只不过时间复杂度会高一点。
-
+- Use the idea of union search flexibly, master the [template]({{< relref "/ChapterThree/UnionFind.md" >}}) of union search, there are two ways to realize union search in the template, one It is the version of path compression + rank optimization, and the other is the version of calculating the number of elements in each set + the maximum number of elements in the set. These two versions have their respective uses. The questions that can use the first type of union search template are: question 128, question 130, question 547, question 684, question 721, question 765, question 778, question 839, question 924, question Question 928, Question 947, Question 952, Question 959, Question 990. The questions that can use the second type of union search template are: question 803 and question 952. Question 803 Rank optimization and the number of statistical collections will be time-consuming. If not optimized, it will be TLE.
+- Union search is an idea, some questions need to use this idea flexibly, instead of a dead set template, such as question 399, this question is stringUnionFind, which is realized by using the idea of union search. Each node here is based on strings and maps, rather than simply using int node numbers.
+- Some questions can’t be done with a dead set template, such as question 685. This question cannot be path compressed and rank optimized, because the question involves a directed graph, and it is necessary to know the predecessor node of the node. If the path is compressed, this question There is no way to do it. This question does not require path compression and rank optimization.
+- The information given by the flexible abstract topic, number the given information reasonably, use and search to solve the problem, and use map to reduce the time complexity, such as the 721st question and the 959th question.
+- Regarding the topic of maps, bricks, and grids, you can create a special node, and union() the bricks or grids around the edges to this special node. Question 130, question 803.
+- Questions that can be used for union search can generally be solved with DFS and BFS, but the time complexity will be higher.
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
|:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
-|0128|Longest Consecutive Sequence|[Go]({{< relref "/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md" >}})|Medium| O(n)| O(n)|❤️|49.0%|
-|0130|Surrounded Regions|[Go]({{< relref "/ChapterFour/0100~0199/0130.Surrounded-Regions.md" >}})|Medium| O(m\*n)| O(m\*n)||35.8%|
-|0200|Number of Islands|[Go]({{< relref "/ChapterFour/0200~0299/0200.Number-of-Islands.md" >}})|Medium| O(m\*n)| O(m\*n)||56.1%|
-|0399|Evaluate Division|[Go]({{< relref "/ChapterFour/0300~0399/0399.Evaluate-Division.md" >}})|Medium| O(n)| O(n)||59.5%|
-|0547|Number of Provinces|[Go]({{< relref "/ChapterFour/0500~0599/0547.Number-of-Provinces.md" >}})|Medium| O(n^2)| O(n)||63.2%|
-|0684|Redundant Connection|[Go]({{< relref "/ChapterFour/0600~0699/0684.Redundant-Connection.md" >}})|Medium| O(n)| O(n)||62.0%|
+|0128|Longest Consecutive Sequence|[Go]({{< relref "/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md" >}})|Medium| O(n)| O(n)|❤️|48.6%|
+|0130|Surrounded Regions|[Go]({{< relref "/ChapterFour/0100~0199/0130.Surrounded-Regions.md" >}})|Medium| O(m\*n)| O(m\*n)||36.6%|
+|0200|Number of Islands|[Go]({{< relref "/ChapterFour/0200~0299/0200.Number-of-Islands.md" >}})|Medium| O(m\*n)| O(m\*n)||56.9%|
+|0399|Evaluate Division|[Go]({{< relref "/ChapterFour/0300~0399/0399.Evaluate-Division.md" >}})|Medium| O(n)| O(n)||59.6%|
+|0547|Number of Provinces|[Go]({{< relref "/ChapterFour/0500~0599/0547.Number-of-Provinces.md" >}})|Medium| O(n^2)| O(n)||63.7%|
+|0684|Redundant Connection|[Go]({{< relref "/ChapterFour/0600~0699/0684.Redundant-Connection.md" >}})|Medium| O(n)| O(n)||62.2%|
|0685|Redundant Connection II|[Go]({{< relref "/ChapterFour/0600~0699/0685.Redundant-Connection-II.md" >}})|Hard| O(n)| O(n)||34.1%|
-|0695|Max Area of Island|[Go]({{< relref "/ChapterFour/0600~0699/0695.Max-Area-of-Island.md" >}})|Medium||||71.6%|
+|0695|Max Area of Island|[Go]({{< relref "/ChapterFour/0600~0699/0695.Max-Area-of-Island.md" >}})|Medium||||71.8%|
|0721|Accounts Merge|[Go]({{< relref "/ChapterFour/0700~0799/0721.Accounts-Merge.md" >}})|Medium| O(n)| O(n)|❤️|56.3%|
-|0765|Couples Holding Hands|[Go]({{< relref "/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md" >}})|Hard| O(n)| O(n)|❤️|56.9%|
-|0778|Swim in Rising Water|[Go]({{< relref "/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md" >}})|Hard| O(n^2)| O(n)|❤️|59.6%|
-|0785|Is Graph Bipartite?|[Go]({{< relref "/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md" >}})|Medium||||52.6%|
+|0765|Couples Holding Hands|[Go]({{< relref "/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md" >}})|Hard| O(n)| O(n)|❤️|56.8%|
+|0778|Swim in Rising Water|[Go]({{< relref "/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md" >}})|Hard| O(n^2)| O(n)|❤️|59.8%|
+|0785|Is Graph Bipartite?|[Go]({{< relref "/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md" >}})|Medium||||53.1%|
|0803|Bricks Falling When Hit|[Go]({{< relref "/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit.md" >}})|Hard| O(n^2)| O(n)|❤️|34.3%|
-|0839|Similar String Groups|[Go]({{< relref "/ChapterFour/0800~0899/0839.Similar-String-Groups.md" >}})|Hard| O(n^2)| O(n)||47.5%|
+|0839|Similar String Groups|[Go]({{< relref "/ChapterFour/0800~0899/0839.Similar-String-Groups.md" >}})|Hard| O(n^2)| O(n)||48.0%|
|0924|Minimize Malware Spread|[Go]({{< relref "/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md" >}})|Hard| O(m\*n)| O(n)||42.1%|
-|0928|Minimize Malware Spread II|[Go]({{< relref "/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md" >}})|Hard| O(m\*n)| O(n)|❤️|42.6%|
-|0947|Most Stones Removed with Same Row or Column|[Go]({{< relref "/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md" >}})|Medium| O(n)| O(n)||57.0%|
-|0952|Largest Component Size by Common Factor|[Go]({{< relref "/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md" >}})|Hard| O(n)| O(n)|❤️|40.3%|
-|0959|Regions Cut By Slashes|[Go]({{< relref "/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md" >}})|Medium| O(n^2)| O(n^2)|❤️|69.1%|
-|0990|Satisfiability of Equality Equations|[Go]({{< relref "/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md" >}})|Medium| O(n)| O(n)||50.7%|
-|1020|Number of Enclaves|[Go]({{< relref "/ChapterFour/1000~1099/1020.Number-of-Enclaves.md" >}})|Medium||||64.8%|
-|1202|Smallest String With Swaps|[Go]({{< relref "/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md" >}})|Medium||||57.5%|
-|1254|Number of Closed Islands|[Go]({{< relref "/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md" >}})|Medium||||64.2%|
-|1319|Number of Operations to Make Network Connected|[Go]({{< relref "/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md" >}})|Medium||||58.3%|
-|1579|Remove Max Number of Edges to Keep Graph Fully Traversable|[Go]({{< relref "/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.md" >}})|Hard||||52.7%|
-|1631|Path With Minimum Effort|[Go]({{< relref "/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md" >}})|Medium||||55.3%|
+|0928|Minimize Malware Spread II|[Go]({{< relref "/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md" >}})|Hard| O(m\*n)| O(n)|❤️|42.7%|
+|0947|Most Stones Removed with Same Row or Column|[Go]({{< relref "/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md" >}})|Medium| O(n)| O(n)||58.9%|
+|0952|Largest Component Size by Common Factor|[Go]({{< relref "/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md" >}})|Hard| O(n)| O(n)|❤️|40.1%|
+|0959|Regions Cut By Slashes|[Go]({{< relref "/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md" >}})|Medium| O(n^2)| O(n^2)|❤️|69.2%|
+|0990|Satisfiability of Equality Equations|[Go]({{< relref "/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md" >}})|Medium| O(n)| O(n)||50.5%|
+|1020|Number of Enclaves|[Go]({{< relref "/ChapterFour/1000~1099/1020.Number-of-Enclaves.md" >}})|Medium||||65.5%|
+|1202|Smallest String With Swaps|[Go]({{< relref "/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md" >}})|Medium||||57.6%|
+|1254|Number of Closed Islands|[Go]({{< relref "/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md" >}})|Medium||||64.1%|
+|1319|Number of Operations to Make Network Connected|[Go]({{< relref "/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md" >}})|Medium||||58.9%|
+|1579|Remove Max Number of Edges to Keep Graph Fully Traversable|[Go]({{< relref "/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.md" >}})|Hard||||53.2%|
+|1631|Path With Minimum Effort|[Go]({{< relref "/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md" >}})|Medium||||55.6%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
----------------------------------------------
diff --git a/website/content/ChapterTwo/_index.md b/website/content/ChapterTwo/_index.md
index 6aa84542e..11f5b00d1 100644
--- a/website/content/ChapterTwo/_index.md
+++ b/website/content/ChapterTwo/_index.md
@@ -1,10 +1,10 @@
---
-title: 第二章 算法专题
+title: Chapter 2 Algorithms Topics
type: docs
weight: 2
---
-# 第二章 算法专题
+# Chapter 2 Algorithm Topics
@@ -13,17 +13,16 @@ weight: 2
-本来天真的认为，把 LeetCode 所有题都完整刷一遍，就可以完整这本书了。经过事实证明，确实是天真了。因为 LeetCode 每天都会增加新题，有时候工作忙了，刷题进度就完全追不上题目更新的速度了。而且以我当前的刷题速度，一年才完成 500+，一年 LeetCode 也会更新 400+ 多题，要起码 5~10 年才能把所有的题目刷完。时间太长了。所以先给自己定了一个小目标，500 题就先把书写出来，总结这个阶段的刷题心得，和大家一起交流。要想把 LeetCode 所有题目都刷完，看来这本书要迭代 5 ~ 10 个版本了(一年迭代一版)。
+I naively thought that if I read all the LeetCode questions completely, I would be able to complete this book. Facts have proved that it is indeed naive. Because LeetCode adds new questions every day, sometimes the work is busy, and the progress of brushing the questions can't keep up with the speed of updating the questions. And with my current speed of brushing questions, I only complete 500+ questions a year, and LeetCode will update 400+ questions a year. It will take at least 5 to 10 years to finish all the questions. It's too long. So first set a small goal for yourself, write out 500 questions first, summarize the experience of brushing the questions at this stage, and communicate with everyone. If you want to finish all the topics of LeetCode, it seems that this book will have to iterate 5 to 10 versions (one version per year).
+Then this chapter sorts out all the topics that have been brushed up. Questions with similar routines are put together. If you want to have a quick interview, in fact, you can do 2 or 3 of the same questions. When you are very proficient in the same type of questions, it is useless to do a few more questions.
-那么这一章就把已经刷完了的专题都整理一遍。有相似套路的题目都放在一起，如果想快速面试的话，其实相同的题目刷 2，3 道就可以了。相同类型的题目非常熟练的情况下，再多刷几道也是做无用功。
+So far, the author thinks that dynamic programming is the most flexible type. There is no template for this type of topic to apply to you, and it is also the elegance of the algorithm. The author thinks it is not an exaggeration to call it the art of algorithms. The author has not finished brushing up the type of dynamic programming, only a part of it, and I am still learning.
-做到目前为止，笔者认为动态规划是最灵活的类型，这类题目没有一个模板可以给你套用，它也是算法之优雅的地方。笔者认为称它为算法的艺术不为过。动态规划这类型，笔者也还没有刷完，只刷了一部分，还在学习中。
-
-那么就分享一下笔者目前刷过的题，和有相似点的题目吧。
+Then let me share the questions that the author has done so far, and the questions with similarities.
----------------------------------------------
diff --git a/website/content/_index.md b/website/content/_index.md
index 50500e868..f2363163e 100644
--- a/website/content/_index.md
+++ b/website/content/_index.md
@@ -3,86 +3,78 @@ title: 序
type: docs
---
-# 序
+# sequence
{{< columns >}}
-## 关于 LeetCode
+## About LeetCode
-说到 LeetCode，作为一个程序员来说，应该不陌生，近几年参加面试都会提到它。国内外的程序员用它刷题主要是为了面试。据历史记载，这个网站 2011 年就成立了，马上就要到自己 10 周年的生日了。每周举行周赛，双周赛，月赛，在有限时间内编码，确实非常能考验人的算法能力。一些大公司赞助冠名的比赛获得前几名除了有奖品，还能直接拿到内推的机会。
+Speaking of LeetCode, as a programmer, you should be familiar with it, and it will be mentioned in interviews in recent years. Programmers at home and abroad use it to brush questions mainly for interviews. According to historical records, this website was established in 2011, and it is about to reach its 10th birthday. Weekly competitions, biweekly competitions, and monthly competitions are held every week, and coding within a limited time is really a test of people's algorithmic ability. In addition to prizes for the top few winners of some big companies sponsoring title competitions, they can also directly get the opportunity to be promoted internally.
<--->
+## What is Cookbook
-## 什么是 Cookbook
-
-直译的话就是烹饪书，教你做各种食谱美食的书。经常看 O'Reilly 技术书的同学对这个名词会很熟悉。一般动手操作，实践类的书都会有这个名字。
+The literal translation is a cookbook, a book that teaches you to make various recipes and delicacies. Students who often read O'Reilly technical books will be familiar with this term. Generally hands-on, practical books will have this name.
{{< /columns >}}
+## Why did you write this open source book
-## 为什么会写这个开源书
-
-笔者刷题刷了一年了，想和大家分享分享一些做题心得，解题方法。想和有相同爱好的人交个朋友，一起交流学习。对于自己来说，写题解也是一种提高。把一道深奥的题目讲给一点都没有头绪的人，并能让他完全听懂，很能锻炼人的表达能力。在讲解中很可能还会遇到听者的一些提问，这些问题可能是自己的知识漏洞，强迫自己去弥补。笔者在公司做过相关的分享，感受很深，双方受益都还不错。
-
-> 另外，在大学期间，笔者做题的时候最讨厌写题解，感觉是浪费时间，用更多的时间去做更多的题。现在不知道算不算是“出来混的，总是要还的”。
-
+The author has been brushing the questions for a year, and I want to share with you some experience in doing the questions and methods of solving the questions. I want to make friends with people who have the same hobbies, and exchange and study together. For myself, writing problem solutions is also an improvement. Telling a esoteric topic to someone who has no idea at all, and allowing him to fully understand it, can exercise people's ability to express. During the explanation, you may also encounter some questions from the listeners. These questions may be your own knowledge loopholes, and you are forced to make up for them. The author has done relevant sharing in the company, and I feel deeply, and both parties benefited.
-## 关于书的封面
+> In addition, when I was in college, I hated writing problem solutions the most when I was doing questions. I felt that it was a waste of time and spent more time doing more questions. Now I don't know if it counts as "you have to pay back if you come out to mess around".
-常看 O'Reilly 动物书的同学一看这个封面就知道是向他们致敬。确实是这个目的。O'Reilly 的封面动物都是稀缺动物，并且画风都是黑白素描风。这些动物都有版权了，所以只能在网上找没有版权的黑白素描风的图片。常见的能找到 40 张这种风格的图片。不过用的人太多了，笔者费劲的找了其他几张这种图片，这张孔雀开屏是其中一张。孔雀开屏的意义是希望大家刷完 LeetCode 以后，提高了自身的算法能力，在人生的舞台上开出自己的“屏”。全书配色也都是绿色，因为这是 AC 的颜色。
+## About the book cover
+Students who often read O'Reilly's animal books know that this cover is a tribute to them. It is indeed for this purpose. O'Reilly's cover animals are all rare animals, and the style of painting is black and white sketch style. These animals are all copyrighted, so I can only find black-and-white sketch-style pictures without copyright on the Internet. It is common to find 40 images in this style. However, there are too many people using it, and the author struggled to find several other pictures of this kind, and this peacock with its tail open is one of them. The meaning of Peacock Open Screen is to hope that after finishing LeetCode, everyone can improve their algorithmic ability and open their own "screen" on the stage of life. The color scheme of the whole book is also green, because this is the color of AC.
-## 关于作者
-笔者是一个刚刚入行一年半的 gopher 新人，还请各位大佬多多指点小弟我。大学参加了 3 年 ACM-ICPC，但是由于资质不高，没有拿到一块金牌。所以在算法方面，我对自己的评价算是新手吧。参加 ACM-ICPC 最大的收获是训练了思维能力，这种能力也会运用到生活中。其次是认识了很多国内很聪明的选手，看到了自己和他们的差距。最后，就是那 200 多页，有些自己都没有完全理解的，打印的密密麻麻的[算法模板](https://github.com/halfrost/leetcode-go/releases/tag/Special)。知识学会了，终身都是自己的，没有学会，那些知识都是身外之物。
+## About the author
+The author is a gopher newcomer who has just been in the industry for a year and a half. Please give me some advice. The university participated in ACM-ICPC for 3 years, but did not get a gold medal due to low qualifications. So in terms of algorithms, I'm a novice in my own evaluation. The biggest gain from participating in ACM-ICPC is to train thinking ability, which will also be used in life. Secondly, I got to know many very smart players in China and saw the gap between myself and them. Finally, there are more than 200 pages, some of which I did not fully understand, and the densely printed [algorithm template](https://github.com/halfrost/leetcode-go/releases/tag/Special). If you learn knowledge, you will own it for life. If you don't learn it, that knowledge is something outside your body.
-笔者从 2019 年 3 月 25 号开始刷题，到 2020 年 3 月 25 号，整整一年的时间。原计划是每天一题。实际上每天有时候不止一题，最终完成了 600+：
+The author started writing questions from March 25, 2019 to March 25, 2020, a whole year. The original plan was one question per day. In fact, there are sometimes more than one question every day, and finally completed 600+:
+> A warm reminder: The author thought that doing one question every day would make the submissions picture all green, but I found out that I was wrong. If you also want to insist and make this picture all green, you must pay attention to the following issues: LeetCode server is in +0 time zone, and this picture is also calculated according to this time zone. In other words, before 8 o'clock in the morning in China, the previous day is counted! It is also because of the time zone that I left these 22 grids blank. For example, there is a hard question that is difficult, and there is a lot of work that day, and it will not be until the next morning when I come home from get off work at night and figure it out. So do another question as the next day's amount. It turns out that these 2 questions are counted as the previous day. Sometimes the author gets up at 6 o'clock in the morning to brush up the questions, and the submission is also the day before.
+>
+> (Of course, these are all in the past, they are not important anymore, they are just some small episodes on the road of struggle)
-> 一个温馨提示：笔者本以为每天做一题，会让这个 submissions 图全绿，但是我发现我错了。如果你也想坚持，让这个图全绿，一定要注意以下的问题：LeetCode 服务器是在 +0 时区的，这个图也是按照这个时区计算的。也就是说，中国每天早上 8 点之前，是算前一天的！也是因为时区的问题，导致我空白了这 22 个格子。比如有一道 Hard 题很难，当天工作也很多，晚上下班回家想出来了就到第二天凌晨了。于是再做一题当做第二天的量。结果会发现这 2 题都算前一天的。有时候笔者早上 6 点起床刷题，提交以后也都是前一天的。
->
-> (当然这些都是过去了，不重要了，全当是奋斗路上的一些小插曲)
-
-2020 年笔者肯定还会继续刷题，因为还没有达到自己的一些目标。可能会朝着 1000 题奋进，也有可能刷到 800 题的时候回头开始二刷，三刷。(不达目的不罢休吧~)
-
-## 关于书中的代码
-
-代码都放在 [github repo](https://github.com/halfrost/leetcode-go/tree/master/leetcode) 中，按题号可以搜索到题目。
-本书题目的代码都已经 beats 100% 了。没有 beats 100% 题解就没有放到本书中了。那些题目笔者会继续优化到 100% 再放进来。
-
-有可能读者会问，为何要追求 beats 100%。笔者认为优化到 beats 100% 才算是把这题做出感觉了。有好几道 Hard 题，笔者都用暴力解法 AC 了，然后只 beats 了 5%。这题就如同没做一样。而且面试中如果给了这样的答案，面试官也不会满意，“还有没有更优解？”。如果通过自己的思考能给出更优解，面试官会更满意一些。
+In 2020, the author will definitely continue to write questions, because some of my goals have not been achieved yet. You may work towards 1000 questions, or you may go back and start doing the second or third time when you reach 800 questions. (Don't give up if you don't reach your goal~)
-LeetCode 统计代码运行时长会有波动的，相同的代码提交 10 次可能就会 beats 100% 了。笔者开始没有发现这个问题，很多题用正确的代码连续交了很多次，一年提交 3400+ 次，导致我的正确率也变的奇高。😢
+## About the code in the book
+The codes are all placed in [github repo](https://github.com/halfrost/leetcode-go/tree/master/leetcode), and the questions can be searched by question number.
+The code for the title of this book has been beats 100%. If there is no beats 100% solution, it will not be included in this book. The author will continue to optimize those topics to 100% before putting them in.
-当然，如果还有其他更优美的解法，也能 beats 100% 的，欢迎提交 PR，笔者和大家一起学习。
+Readers may ask, why pursue beats 100%. The author thinks that optimizing to 100% beats can be regarded as a feeling for this question. There are several Hard questions, and the author used brute force to solve AC, and then only beats 5%. This question is like not doing it. And if such an answer is given during the interview, the interviewer will not be satisfied, "Is there a better solution?". If you can give a better solution through your own thinking, the interviewer will be more satisfied.
-## 目标读者
+LeetCode statistics code runtime will fluctuate, the same code submitted 10 times may beats 100%. The author didn't find this problem at first, and I submitted many questions with the correct code many times in a row, submitting 3400+ times a year, which caused my correct rate to become extremely high. 😢
+Of course, if there are other more elegant solutions that can beat 100%, welcome to submit a PR, and the author will learn with everyone.
-想通过 LeetCode 提高算法能力的编程爱好者。
+## target audience
+Programming enthusiasts who want to improve their algorithmic ability through LeetCode.
-## 编程语言
-本书的算法全部用 Go 语言实现。
+## Programming language
-## 使用说明
+The algorithms in this book are all implemented in Go language.
-- 本电子书的左上角有搜索栏，可以迅速帮你找到你想看的章节和题号。
-- 本电子书每页都接入了 Gitalk，每一页的最下方都有评论框可以评论，如果没有显示出来，请检查自己的网络。
-- 关于题解，笔者建议这样使用：先自己读题，思考如何解题。如果 15 分钟还没有思路，那么先看笔者的解题思路，但是不要看代码。有思路以后自己用代码实现一遍。如果完全不会写，那就看笔者提供的代码，找出自己到底哪里不会写，找出问题记下来，这就是自己要弥补的知识漏洞。如果自己实现出来了，提交以后有错误，自己先 debug。AC 以后没有到 100% 也先自己思考如何优化。如果每道题自己都能优化到 100% 了，那么一段时间以后进步会很大。所以总的来说，实在没思路，看解题思路；实在优化不到 100%，看看代码。
+## Instructions for use
-## 互动与勘误
+-There is a search bar in the upper left corner of this e-book, which can quickly help you find the chapter and question number you want to read.
+-Each page of this e-book is connected to Gitalk, and there is a comment box at the bottom of each page for comments. If it is not displayed, please check your own network.
+-Regarding the problem solution, the author recommends using it in this way: first read the problem by yourself, and think about how to solve the problem. If you don't have an idea in 15 minutes, then look at the author's problem-solving ideas first, but don't look at the code. After you have an idea, you can implement it with code yourself. If you can't write at all, then look at the code provided by the author, find out where you can't write, find out the problem and write it down, this is the knowledge gap that you want to make up for. If you realize it by yourself and there is an error after submission, you should debug it yourself first. Before AC reaches 100% in the future, I will first think about how to optimize it. If each question can be optimized to 100%, then the improvement will be great after a period of time. So in general, if you really have no idea, look at the problem-solving ideas; if you really can’t optimize 100%, look at the code.
-如果书中文章有所遗漏，欢迎点击所在页面下边的 edit 按钮进行评论和互动，感谢您的支持与帮助。
+## Interaction and Errata
+If there are any missing articles in the book, please click the edit button at the bottom of the page to comment and interact. Thank you for your support and help.
-## 最后
+## at last
-一起开始刷题吧~
+Let's start brushing questions together~
-本作品采用 [知识署名-非商业性使用-禁止演绎 （BY-NC-ND） 4.0 国际许可协议](https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.zh-Hans) 进行许可。
+This work adopts [Intellectual Attribution-Non-Commercial Use-No Derivatives (BY-NC-ND) 4.0 International License Agreement](https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.zh-Hans ) for permission.
-题解里面的所有题目版权均归 [LeetCode](https://leetcode.com/) 和 [力扣中国](https://leetcode-cn.com/) 所有
-
\ No newline at end of file
+The copyright of all the questions in the solution is owned by [LeetCode](https://leetcode.com/) and [Leetcode China](https://leetcode-cn.com/)
+the
\ No newline at end of file
-