Skip to content

Commit 2600738

Browse files
rajput-hemantrajput-hemant
committed
feat: added docs powered by vitepress
Signed-off-by: rajput-hemant <[email protected]>
1 parent 2f306ec commit 2600738

File tree

78 files changed

+8418
-2
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

78 files changed

+8418
-2
lines changed

‎.gitignore

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
/.vscode
22
/dont-push
3+
/node_modules
34
/out
45
**/bin
5-
**/__pycache__
6-
*.json
6+
**/__pycache__

‎docs/.vitepress/Sidebar.js

+367
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,367 @@
1+
export default Sidebar = [
2+
{
3+
text: "0001-0100",
4+
collapsible: true,
5+
collapsed: true,
6+
items: [
7+
{
8+
text: "001 - Two Sum.md",
9+
link: "/solution/0001-0100/001 - Two Sum.md",
10+
},
11+
{
12+
text: "002 - Add Two Numbers.md",
13+
link: "/solution/0001-0100/002 - Add Two Numbers.md",
14+
},
15+
{
16+
text: "004 - Median of Two Sorted Arrays.md",
17+
link: "/solution/0001-0100/004 - Median of Two Sorted Arrays.md",
18+
},
19+
{
20+
text: "007 - Reverse Integer.md",
21+
link: "/solution/0001-0100/007 - Reverse Integer.md",
22+
},
23+
{
24+
text: "009 - Palindrome Number.md",
25+
link: "/solution/0001-0100/009 - Palindrome Number.md",
26+
},
27+
{
28+
text: "024 - Swap Nodes in Pairs.md",
29+
link: "/solution/0001-0100/024 - Swap Nodes in Pairs.md",
30+
},
31+
{
32+
text: "026 - Remove Duplicates from Sorted Array.md",
33+
link: "/solution/0001-0100/026 - Remove Duplicates from Sorted Array.md",
34+
},
35+
{
36+
text: "027 - Remove Element.md",
37+
link: "/solution/0001-0100/027 - Remove Element.md",
38+
},
39+
{
40+
text: "037 - Sudoku Solver.md",
41+
link: "/solution/0001-0100/037 - Sudoku Solver.md",
42+
},
43+
{
44+
text: "051 - N-Queens.md",
45+
link: "/solution/0001-0100/051 - N-Queens.md",
46+
},
47+
{
48+
text: "055 - Jump Game.md",
49+
link: "/solution/0001-0100/055 - Jump Game.md",
50+
},
51+
{
52+
text: "058 - Length of Last Word.md",
53+
link: "/solution/0001-0100/058 - Length of Last Word.md",
54+
},
55+
{
56+
text: "061 - Rotate List .md",
57+
link: "/solution/0001-0100/061 - Rotate List .md",
58+
},
59+
{
60+
text: "070 - Climbing Stairs.md",
61+
link: "/solution/0001-0100/070 - Climbing Stairs.md",
62+
},
63+
{
64+
text: "072 - Edit Distance.md",
65+
link: "/solution/0001-0100/072 - Edit Distance.md",
66+
},
67+
{
68+
text: "075 - Sort Colors.md",
69+
link: "/solution/0001-0100/075 - Sort Colors.md",
70+
},
71+
{
72+
text: "094 - Binary Tree Inorder Traversal.md",
73+
link: "/solution/0001-0100/094 - Binary Tree Inorder Traversal.md",
74+
},
75+
{
76+
text: "098 - Validate Binary Search Tree.md",
77+
link: "/solution/0001-0100/098 - Validate Binary Search Tree.md",
78+
},
79+
{
80+
text: "100 - Same Tree.md",
81+
link: "/solution/0001-0100/100 - Same Tree.md",
82+
},
83+
],
84+
},
85+
{
86+
text: "0101-0200",
87+
collapsible: true,
88+
collapsed: true,
89+
items: [
90+
{
91+
text: "103 - Binary Tree Zigzag Level Order Traversal.md",
92+
link: "/solution/0101-0200/103 - Binary Tree Zigzag Level Order Traversal.md",
93+
},
94+
{
95+
text: "104 - Maximum Depth of Binary Tree.md",
96+
link: "/solution/0101-0200/104 - Maximum Depth of Binary Tree.md",
97+
},
98+
{
99+
text: "110 - Balanced Binary Tree.md",
100+
link: "/solution/0101-0200/110 - Balanced Binary Tree.md",
101+
},
102+
{
103+
text: "111 - Minimum Depth of Binary Tree.md",
104+
link: "/solution/0101-0200/111 - Minimum Depth of Binary Tree.md",
105+
},
106+
{
107+
text: "122 - Best Time to Buy and Sell Stock II.md",
108+
link: "/solution/0101-0200/122 - Best Time to Buy and Sell Stock II.md",
109+
},
110+
{
111+
text: "144 - Binary Tree Preorder Traversal.md",
112+
link: "/solution/0101-0200/144 - Binary Tree Preorder Traversal.md",
113+
},
114+
{
115+
text: "145 - Binary Tree Postorder Traversal.md",
116+
link: "/solution/0101-0200/145 - Binary Tree Postorder Traversal.md",
117+
},
118+
{
119+
text: "172 - Factorial Trailing Zeroes.md",
120+
link: "/solution/0101-0200/172 - Factorial Trailing Zeroes.md",
121+
},
122+
{
123+
text: "191 - Number of 1 Bits.md",
124+
link: "/solution/0101-0200/191 - Number of 1 Bits.md",
125+
},
126+
{
127+
text: "199 - Binary Tree Right Side View.md",
128+
link: "/solution/0101-0200/199 - Binary Tree Right Side View.md",
129+
},
130+
],
131+
},
132+
{
133+
text: "0201-0300",
134+
collapsible: true,
135+
collapsed: true,
136+
items: [
137+
{
138+
text: "206 - Reverse Linked List.md",
139+
link: "/solution/0201-0300/206 - Reverse Linked List.md",
140+
},
141+
{
142+
text: "222 - Count Complete Tree Nodes.md",
143+
link: "/solution/0201-0300/222 - Count Complete Tree Nodes.md",
144+
},
145+
{
146+
text: "230 - Kth Smallest Element in a BST.md",
147+
link: "/solution/0201-0300/230 - Kth Smallest Element in a BST.md",
148+
},
149+
{
150+
text: "231 - Power of Two.md",
151+
link: "/solution/0201-0300/231 - Power of Two.md",
152+
},
153+
{
154+
text: "278 - First Bad Version.md",
155+
link: "/solution/0201-0300/278 - First Bad Version.md",
156+
},
157+
{
158+
text: "283 - Move Zeroes.md",
159+
link: "/solution/0201-0300/283 - Move Zeroes.md",
160+
},
161+
{
162+
text: "300 - Longest Increasing Subsequence.md",
163+
link: "/solution/0201-0300/300 - Longest Increasing Subsequence.md",
164+
},
165+
],
166+
},
167+
{
168+
text: "0301-0400",
169+
collapsible: true,
170+
collapsed: true,
171+
items: [
172+
{
173+
text: "322 - Coin Change.md",
174+
link: "/solution/0301-0400/322 - Coin Change.md",
175+
},
176+
{
177+
text: "337 - House Robber III.md",
178+
link: "/solution/0301-0400/337 - House Robber III.md",
179+
},
180+
{
181+
text: "344 - Reverse String.md",
182+
link: "/solution/0301-0400/344 - Reverse String.md",
183+
},
184+
{
185+
text: "367 - Valid Perfect Square.md",
186+
link: "/solution/0301-0400/367 - Valid Perfect Square.md",
187+
},
188+
{
189+
text: "369 - Plus One Linked List.md",
190+
link: "/solution/0301-0400/369 - Plus One Linked List.md",
191+
},
192+
{
193+
text: "389 - Find the Difference.md",
194+
link: "/solution/0301-0400/389 - Find the Difference.md",
195+
},
196+
],
197+
},
198+
{
199+
text: "0401-0500",
200+
collapsible: true,
201+
collapsed: true,
202+
items: [
203+
{
204+
text: "442 - Find All Duplicates in an Array.md",
205+
link: "/solution/0401-0500/442 - Find All Duplicates in an Array.md",
206+
},
207+
{
208+
text: "445 - Add Two Numbers II.md",
209+
link: "/solution/0401-0500/445 - Add Two Numbers II.md",
210+
},
211+
],
212+
},
213+
{
214+
text: "0501-0600",
215+
collapsible: true,
216+
collapsed: true,
217+
items: [
218+
{
219+
text: "506 - Relative Ranks.md",
220+
link: "/solution/0501-0600/506 - Relative Ranks.md",
221+
},
222+
{
223+
text: "509 - Fibonacci Number.md",
224+
link: "/solution/0501-0600/509 - Fibonacci Number.md",
225+
},
226+
{
227+
text: "516 - Longest Palindromic Subsequence.md",
228+
link: "/solution/0501-0600/516 - Longest Palindromic Subsequence.md",
229+
},
230+
{
231+
text: "518 - Coin Change 2.md",
232+
link: "/solution/0501-0600/518 - Coin Change 2.md",
233+
},
234+
{
235+
text: "541 - Reverse String II.md",
236+
link: "/solution/0501-0600/541 - Reverse String II.md",
237+
},
238+
{
239+
text: "543 - Diameter of Binary Tree.md",
240+
link: "/solution/0501-0600/543 - Diameter of Binary Tree.md",
241+
},
242+
],
243+
},
244+
{
245+
text: "0601-0700",
246+
collapsible: true,
247+
collapsed: true,
248+
items: [
249+
{
250+
text: "653 - Two Sum IV - Input is a BST.md",
251+
link: "/solution/0601-0700/653 - Two Sum IV - Input is a BST.md",
252+
},
253+
],
254+
},
255+
{
256+
text: "0701-0800",
257+
collapsible: true,
258+
collapsed: true,
259+
items: [
260+
{
261+
text: "704 - Binary Search.md",
262+
link: "/solution/0701-0800/704 - Binary Search.md",
263+
},
264+
{
265+
text: "771 - Jewels and Stones.md",
266+
link: "/solution/0701-0800/771 - Jewels and Stones.md",
267+
},
268+
],
269+
},
270+
{
271+
text: "0801-0900",
272+
collapsible: true,
273+
collapsed: true,
274+
items: [
275+
{
276+
text: "876 - Middle of the Linked List.md",
277+
link: "/solution/0801-0900/876 - Middle of the Linked List.md",
278+
},
279+
{
280+
text: "888 - Fair Candy Swap.md",
281+
link: "/solution/0801-0900/888 - Fair Candy Swap.md",
282+
},
283+
],
284+
},
285+
{
286+
text: "1001-1100",
287+
collapsible: true,
288+
collapsed: true,
289+
items: [
290+
{
291+
text: "1047 - Remove All Adjacent Duplicates In String.md",
292+
link: "/solution/1001-1100/1047 - Remove All Adjacent Duplicates In String.md",
293+
},
294+
{
295+
text: "1092 - Shortest Common Supersequence.md",
296+
link: "/solution/1001-1100/1092 - Shortest Common Supersequence.md",
297+
},
298+
],
299+
},
300+
{
301+
text: "1101-1200",
302+
collapsible: true,
303+
collapsed: true,
304+
items: [
305+
{
306+
text: "1143 - Longest Common Subsequence.md",
307+
link: "/solution/1101-1200/1143 - Longest Common Subsequence.md",
308+
},
309+
],
310+
},
311+
{
312+
text: "1201-1300",
313+
collapsible: true,
314+
collapsed: true,
315+
items: [
316+
{
317+
text: "1232 - Check If It Is a Straight Line.md",
318+
link: "/solution/1201-1300/1232 - Check If It Is a Straight Line.md",
319+
},
320+
],
321+
},
322+
{
323+
text: "1401-1500",
324+
collapsible: true,
325+
collapsed: true,
326+
items: [
327+
{
328+
text: "1461 - Check If a String Contains All Binary Codes of Size K.md",
329+
link: "/solution/1401-1500/1461 - Check If a String Contains All Binary Codes of Size K.md",
330+
},
331+
{
332+
text: "1480 - Running Sum of 1d Array.md",
333+
link: "/solution/1401-1500/1480 - Running Sum of 1d Array.md",
334+
},
335+
{
336+
text: "1491 - Average Salary Excluding the Minimum and Maximum Salary.md",
337+
link: "/solution/1401-1500/1491 - Average Salary Excluding the Minimum and Maximum Salary.md",
338+
},
339+
{
340+
text: "1498 - Number of Subsequences That Satisfy the Given Sum Condition.md",
341+
link: "/solution/1401-1500/1498 - Number of Subsequences That Satisfy the Given Sum Condition.md",
342+
},
343+
],
344+
},
345+
{
346+
text: "1501-1600",
347+
collapsible: true,
348+
collapsed: true,
349+
items: [
350+
{
351+
text: "1537 - Get the Maximum Score.md",
352+
link: "/solution/1501-1600/1537 - Get the Maximum Score.md",
353+
},
354+
],
355+
},
356+
{
357+
text: "2201-2300",
358+
collapsible: true,
359+
collapsed: true,
360+
items: [
361+
{
362+
text: "2236 - Root Equals Sum of Children.md",
363+
link: "/solution/2201-2300/2236 - Root Equals Sum of Children.md",
364+
},
365+
],
366+
},
367+
]

0 commit comments

Comments
 (0)