irongit

A Neovim plugin enabling you to solve LeetCode problems.

98 lines1.8 KBLua
1local config = require("leetcode.config")
2
3local arguments = {}
4
5local topics = {
6 "dynamic-programming",
7 "math",
8 "hash-table",
9 "string",
10 "array",
11 "biconnected-component",
12 "eulerian-circuit",
13 "radix-sort",
14 "rejection-sampling",
15 "strongly-connected-component",
16 "reservoir-sampling",
17 "minimum-spanning-tree",
18 "counting-sort",
19 "line-sweep",
20 "shell",
21 "suffix-array",
22 "bucket-sort",
23 "quickselect",
24 "concurrency",
25 "doubly-linked-list",
26 "probability-and-statistics",
27 "iterator",
28 "merge-sort",
29 "monotonic-queue",
30 "randomized",
31 "string-matching",
32 "data-stream",
33 "rolling-hash",
34 "brainteaser",
35 "interactive",
36 "combinatorics",
37 "shortest-path",
38 "hash-function",
39 "topological-sort",
40 "binary-indexed-tree",
41 "game-theory",
42 "geometry",
43 "segment-tree",
44 "memoization",
45 "binary-search-tree",
46 "divide-and-conquer",
47 "number-theory",
48 "bitmask",
49 "queue",
50 "recursion",
51 "trie",
52 "monotonic-stack",
53 "enumeration",
54 "sliding-window",
55 "union-find",
56 "linked-list",
57 "backtracking",
58 "counting",
59 "design",
60 "simulation",
61 "heap-priority-queue",
62 "two-pointers",
63 "database",
64 "sorting",
65 "greedy",
66 "breadth-first-search",
67 "depth-first-search",
68 "bit-manipulation",
69 "binary-tree",
70 "matrix",
71 "tree",
72 "graph",
73 "prefix-sum",
74 "stack",
75 "ordered-set",
76 "binary-search",
77}
78
79arguments.list = {
80 difficulty = { "easy", "medium", "hard" },
81 status = { "ac", "notac", "todo" },
82}
83
84arguments.random = {
85 difficulty = { "easy", "medium", "hard" },
86 status = { "ac", "notac", "todo" },
87 tags = topics,
88}
89
90arguments.session_change = {
91 name = config.sessions.names,
92}
93
94arguments.session_create = {
95 name = {},
96}
97
98return arguments