fix: typos correction in documentation across multiple modules

packages/linalg/README.md

@@ -10,4 +10,4 @@ The dot product or scalar product is an algebraic operation that takes two equal
 
 ## [Kronecker product](./src/kron.cairo)
 
-The Kronecker product is an an algebraic operation that takes two equal-length sequences of numbers and returns an array of numbers([see also](https://numpy.org/doc/stable/reference/generated/numpy.kron.html)).
+The Kronecker product is an algebraic operation that takes two equal-length sequences of numbers and returns an array of numbers([see also](https://numpy.org/doc/stable/reference/generated/numpy.kron.html)).

packages/math/README.md

@@ -2,7 +2,7 @@
 
 ## [Fast Root](./src/fast_root.cairo)
 
-The fast root algorithm uses Newton-Raphson method to calculate a arbitrary root of a given number (e.g., square root, cubic root, etc.). The algorithm is used to find the roots of a polynomial equation, which has applications in various areas of mathematics, including algebra, calculus, and number theory. The fast root algorithm is also used in computer science, as it can be used to solve problems involving the roots of a polynomial equation.
+The fast root algorithm uses Newton-Raphson method to calculate an arbitrary root of a given number (e.g., square root, cubic root, etc.). The algorithm is used to find the roots of a polynomial equation, which has applications in various areas of mathematics, including algebra, calculus, and number theory. The fast root algorithm is also used in computer science, as it can be used to solve problems involving the roots of a polynomial equation.
 
 ## [Is Power Of Two](./src/is_power_of_two.cairo)
 

packages/searching/README.md

@@ -16,4 +16,4 @@ Dijkstra's algorithm is a graph search algorithm that finds the shortest path fr
 
 ## [Levenshtein distance](./src/levenshtein_distance.cairo)
 
-The Levenshtein distance is a string metric for measuring the difference between two sequences. It is the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one string into the other. This version of the algorithm optmizes the space complexity. Time complexity: O(nm). Space complexity: O(n),
+The Levenshtein distance is a string metric for measuring the difference between two sequences. It is the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one string into the other. This version of the algorithm optimizes the space complexity. Time complexity: O(nm). Space complexity: O(n),