-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathqueries.js
162 lines (157 loc) · 2.61 KB
/
queries.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
export const questionOfTheDay = `query questionOfToday {
activeDailyCodingChallengeQuestion {
date
userStatus
link
question {
acRate
difficulty
freqBar
frontendQuestionId: questionFrontendId
isFavor
paidOnly: isPaidOnly
status
title
titleSlug
hasVideoSolution
hasSolution
topicTags {
name
id
slug
}
}
}
}`;
export const dailyCodingQuestions = `
query dailyCodingQuestionRecords($year: Int!, $month: Int!) {
dailyCodingChallengeV2(year: $year, month: $month) {
challenges {
date
userStatus
link
question {
questionFrontendId
title
titleSlug
}
}
weeklyChallenges {
date
userStatus
link
question {
questionFrontendId
title
titleSlug
}
}
}
}`;
//
export const leetcodeProblemTags = [
"Array",
"String",
"Hash Table",
"Dynamic Programming",
"Math",
"Sorting",
"Greedy",
"Depth-First Search",
"Binary Search",
"Database",
"Breadth-First Search",
"Tree",
"Matrix",
"Two Pointers",
"Bit Manipulation",
"Binary Tree",
"Heap (Priority Queue)",
"Stack",
"Prefix Sum",
"Graph",
"Simulation",
"Design",
"Counting",
"Sliding Window",
"Backtracking",
"Union Find",
"Linked List",
"Enumeration",
"Ordered Set",
"Monotonic Stack",
"Trie",
"Divide and Conquer",
"Recursion",
"Number Theory",
"Bitmask",
"Queue",
"Binary Search Tree",
"Segment Tree",
"Memoization",
"Binary Indexed Tree",
"Geometry",
"Topological Sort",
"Game Theory",
"Hash Function",
"Combinatorics",
"Shortest Path",
"Interactive",
"String Matching",
"Data Stream",
"Rolling Hash",
"Brainteaser",
"Randomized",
"Monotonic Queue",
"Merge Sort",
"Iterator",
"Concurrency",
"Doubly-Linked List",
"Probability and Statistics",
"Quickselect",
"Bucket Sort",
"Suffix Array",
"Minimum Spanning Tree",
"Counting Sort",
"Shell",
"Line Sweep",
"Reservoir Sampling",
"Strongly Connected Component",
"Eulerian Circuit",
"Radix Sort",
"Rejection Sampling",
"Biconnected Component",
"Collapse"
];
/* To filter by tag the filter in this query should be (using array as an example):
{"tags": ["array"]}
*/
export const problemListByCategory = `
query problemsetQuestionList($categorySlug: String, $limit: Int, $skip: Int, $filters: QuestionListFilterInput) {
problemsetQuestionList: questionList(
categorySlug: $categorySlug
limit: $limit
skip: $skip
filters: $filters
) {
total: totalNum
questions: data {
acRate
difficulty
freqBar
frontendQuestionId: questionFrontendId
isFavor
isPaidOnly
status
title
titleSlug
topicTags {
name
id
slug
}
hasSolution
hasVideoSolution
}
}
}`;