#424: description update

Author: vetalapo

c-sharp/Problems/sliding-window/LongestRepeatingCharacterReplacement.cs

@@ -5,14 +5,14 @@
  * You are given a string s and an integer k.
  * You can choose any character of the string and change it to any other uppercase English character.
  * You can perform this operation at most k times.
- * 
+ *
  * Return the length of the longest substring containing the same letter you can get after performing the above operations.
  *
  * Example 1: 
  *   Input: s = "ABAB", k = 2
  *   Output: 4
  *   Explanation: Replace the two 'A's with two 'B's or vice versa.
- * 
+ *
  * Example 2:
  *   Input: s = "AABABBA", k = 1
  *   Output: 4
@@ -22,7 +22,7 @@
  *     There may exists other ways to achieve this answer too.
  *
  * Constraints: 
- *   • 1 <= s.length <= 105
+ *   • 1 <= s.length <= 10^5
  *   • s consists of only uppercase English letters.
  *   • 0 <= k <= s.length
  **