Update README.md

README.md

@@ -6,4 +6,20 @@ language:
 widget:
 - text: "Dijkstra's algorithm is an algorithm for finding the [MASK] paths between nodes in a weighted graph"
   example_title: "Dijkstra"
+- text: "This concludes the [MASK]. Possible options include proof, lemma, claim, theorem, case, or thesis."
+  example_title: "test1"
+- text: "We show this by [MASK]. Possible options include induction, definition, a, lemma, or contradiction."
+  example_title: "test2"
+- text: "By [MASK]'s inequality. Possible options include Jensen, Holder, Young, Minkowski, or Cauchy."
+  example_title: "test3"
+- text: "The [MASK] is definite positive. Possible options include inequality, case, limit, sum, or function."
+  example_title: "test4"
+- text: "* In particular any field is a [MASK]. Possible options include 1, group, f, or field."
+  example_title: "test5"
+- text: "* To determine the shortest distance in a graph, one can use [MASK]'s algorithm. Possible options include Dijkstra, Grover, Tarjan, Newton, or Hamilton."
+  example_title: "test6"
+- text: "* An illustration of the superiority of quantum computer is provided by [MASK]'s algorithm. Possible options include Grover, Shor, Dijkstra, Yao, or Kitaev."
+  example_title: "test7"
+- text: "* One of the ways of avoiding [MASK] is using cross validation, that helps in estimating the error over test set, and in deciding what parameters work best for your model. The possible option for the MASK is 'overfitting.'"
+  example_title: "test8"
 ---