Spaces:
Sleeping
Sleeping
Commit
·
a82cf01
1
Parent(s):
e7adcda
Moved dropdown options to the separate file
Browse files- app.py +1 -5
- options.py +54 -0
app.py
CHANGED
|
@@ -1,11 +1,7 @@
|
|
| 1 |
import gradio as gr
|
| 2 |
|
| 3 |
from llm import end_interview, get_problem, send_request
|
| 4 |
-
|
| 5 |
-
languages_list = ["python", "javascript", "html", "css", "typescript", "dockerfile", "shell", "r", "sql"] # limited by gradio for now
|
| 6 |
-
topics_list = ["Arrays", "Strings", "Linked Lists"]
|
| 7 |
-
models = ["gpt-3.5-turbo"]
|
| 8 |
-
|
| 9 |
|
| 10 |
with gr.Blocks() as demo:
|
| 11 |
gr.Markdown("Your coding interview practice AI assistant!")
|
|
|
|
| 1 |
import gradio as gr
|
| 2 |
|
| 3 |
from llm import end_interview, get_problem, send_request
|
| 4 |
+
from options import languages_list, models, topics_list
|
|
|
|
|
|
|
|
|
|
|
|
|
| 5 |
|
| 6 |
with gr.Blocks() as demo:
|
| 7 |
gr.Markdown("Your coding interview practice AI assistant!")
|
options.py
ADDED
|
@@ -0,0 +1,54 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
languages_list = ["python", "javascript", "html", "css", "typescript", "dockerfile", "shell", "r", "sql"] # limited by gradio for now
|
| 2 |
+
topics_list = [
|
| 3 |
+
"Arrays",
|
| 4 |
+
"Strings",
|
| 5 |
+
"Linked Lists",
|
| 6 |
+
"Hash Tables",
|
| 7 |
+
"Dynamic Programming",
|
| 8 |
+
"Trees",
|
| 9 |
+
"Graphs",
|
| 10 |
+
"Sorting Algorithms",
|
| 11 |
+
"Binary Search",
|
| 12 |
+
"Recursion",
|
| 13 |
+
"Greedy Algorithms",
|
| 14 |
+
"Stack",
|
| 15 |
+
"Queue",
|
| 16 |
+
"Heaps",
|
| 17 |
+
"Depth-First Search (DFS)",
|
| 18 |
+
"Breadth-First Search (BFS)",
|
| 19 |
+
"Backtracking",
|
| 20 |
+
"Bit Manipulation",
|
| 21 |
+
"Binary Search Trees",
|
| 22 |
+
"Tries",
|
| 23 |
+
"Union Find",
|
| 24 |
+
"Geometry",
|
| 25 |
+
"Segment Trees",
|
| 26 |
+
"Game Theory",
|
| 27 |
+
"Topological Sort",
|
| 28 |
+
"Fenwick Tree",
|
| 29 |
+
"Number Theory",
|
| 30 |
+
"Sliding Window",
|
| 31 |
+
"Disjoint Set",
|
| 32 |
+
"Hashing",
|
| 33 |
+
"Probabilities",
|
| 34 |
+
"Combinatorics",
|
| 35 |
+
"Minimax",
|
| 36 |
+
"Two Pointers",
|
| 37 |
+
"Suffix Array",
|
| 38 |
+
"Fast Fourier Transform",
|
| 39 |
+
"Matrix Operations",
|
| 40 |
+
"Eulerian Path",
|
| 41 |
+
"Bellman-Ford Algorithm",
|
| 42 |
+
"Floyd-Warshall Algorithm",
|
| 43 |
+
"Prim's Algorithm",
|
| 44 |
+
"Kruskal's Algorithm",
|
| 45 |
+
"Rabin-Karp Algorithm",
|
| 46 |
+
"Z-algorithm",
|
| 47 |
+
"Manacher's Algorithm",
|
| 48 |
+
"AVL Trees",
|
| 49 |
+
"Red-Black Trees",
|
| 50 |
+
"Splay Trees",
|
| 51 |
+
"Treaps",
|
| 52 |
+
"Computational Geometry",
|
| 53 |
+
]
|
| 54 |
+
models = ["gpt-3.5-turbo"]
|