comment fixes.

Author: aghoussaini

strings/duval.cpp

@@ -10,16 +10,16 @@
  * that can be obtained by rotating a string. For example, the rotation
  * equivalence class of "abc" is {"abc", "bca", "cab"}. The lexicographically
  * smallest string in this class is "abc".
- * Duval's algorithm works by finding the lexicographically smallest Lyndon word
- * in a string. It does this by iterating over the string and finding the
+ *
+ * Duval's algorithm works by iterating over the string and finding the
  * smallest rotation of the string that is a Lyndon word. This is done by
  * comparing the string with its suffixes and finding the smallest suffix that
  * is lexicographically smaller than the string. This suffix is then added to
  * the result and the process is repeated with the remaining string.
  * The algorithm has a time complexity of O(n) where n is the length of the
  * string.
  *
- * @note While Lyndon word are described in the context of strings,
+ * @note While Lyndon words are described in the context of strings,
  * Duval's algorithm can be used to find the lexicographically smallest cyclic
  * shift of any sequence of comparable elements.
  *