Update 2SAT.md

sumitrawat10 · web-flow · commit 44c507ea63e1 · 2023-09-23T22:18:18.000+05:30
Just a typo
diff --git a/src/graph/2SAT.md b/src/graph/2SAT.md
@@ -14,7 +14,7 @@ Find an assignment of $a, b, c$ such that the following formula is true:
 
 $$(a \lor \lnot b) \land (\lnot a \lor b) \land (\lnot a \lor \lnot b) \land (a \lor \lnot c)$$
 
-SAT is NP-complete, there is no known efficient solution known for it.
+SAT is NP-complete, there is no known efficient solution for it.
 However 2SAT can be solved efficiently in $O(n + m)$ where $n$ is the number of variables and $m$ is the number of clauses.
 
 ## Algorithm:
