Merge branch 'master' into feat/manacher-algorithm-implementation

Author: siriak

Algorithms.Tests/Graph/KosarajuTests.cs

@@ -29,7 +29,7 @@ public void GetRepresentativesTest()
         graph.AddEdge(vertex5, vertex4, 1);
         graph.AddEdge(vertex5, vertex6, 1);
 
-        // Run the agorithm and obtain the representative vertex of the SCC to which each vertex belongs.
+        // Run the algorithm and obtain the representative vertex of the SCC to which each vertex belongs.
         Dictionary<Vertex<int>, Vertex<int>> result = Kosaraju<int>.GetRepresentatives(graph);
 
         // Check every Vertex belongs to a SCC

Algorithms/Crypto/Paddings/Pkcs7Padding.cs

@@ -74,7 +74,7 @@ public int AddPadding(byte[] input, int inputOffset)
     /// <summary>
     /// Removes the PKCS7 padding from the given input data.
     /// </summary>
-    /// <param name="input">The input data with PKCS7 padding. Must not be null and must have a vaild length and padding.</param>
+    /// <param name="input">The input data with PKCS7 padding. Must not be null and must have a valid length and padding.</param>
     /// <returns>The input data without the padding as a new byte array.</returns>
     /// <exception cref="ArgumentException">
     /// Thrown if the input data is null, has an invalid length, or has an invalid padding.

Algorithms/Numeric/Pseudoinverse/PseudoInverse.cs

@@ -6,7 +6,7 @@ namespace Algorithms.Numeric.Pseudoinverse;
 ///     The Moore–Penrose pseudo-inverse A+ of a matrix A,
 ///     is a general way to find the solution to the following system of linear equations:
 ///     ~b = A ~y. ~b e R^m; ~y e R^n; A e Rm×n.
-///     There are varios methods for construction the pseudo-inverse.
+///     There are various methods for construction the pseudo-inverse.
 ///     This one is based on Singular Value Decomposition (SVD).
 /// </summary>
 public static class PseudoInverse

DataStructures/AVLTree/AVLTree.cs

@@ -360,7 +360,7 @@ private AvlTreeNode<TKey> Add(AvlTreeNode<TKey> node, TKey key)
             throw new ArgumentException($"""Key "{key}" already exists in AVL tree.""");
         }
 
-        // Check all of the new node's ancestors for inbalance and perform
+        // Check all of the new node's ancestors for imbalance and perform
         // necessary rotations
         node.UpdateBalanceFactor();