solves reverse string ii

Author: anishLearnsToCode

README.md

@@ -142,7 +142,7 @@
 | 530 | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | Easy | [![Java](assets/java.png)](src/MinimumAbsoluteDifferenceInBST.java) [![Python](assets/python.png)](python/minimum_absolute_difference_in_bst.py) |
 | 532 | [K - Diff Pairs in Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | Easy | [![Java](assets/java.png)](src/KDiffPairsInAnArray.java) [![Python](assets/python.png)](python/k_dif_pairs_in_an_array.py) |
 | 538 | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree) | Easy | [![Java](assets/java.png)](src/ConvertBSTToGreaterTree.java) [![Python](assets/python.png)](python/convert_bst_to_greater_tree.py) |
-| 541 | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | Easy | |
+| 541 | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | Easy | [![Java](assets/java.png)](srcReverseStringII.java/) [![Python](assets/python.png)](python/reverse_string_ii.py) |
 | 543 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | Easy | |
 | 551 | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i) | Easy | |
 | 557 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | Easy | |

python/reverse_string_ii.py

@@ -0,0 +1,15 @@
+class Solution:
+    def reverseStr(self, s: str, k: int) -> str:
+        result = ''
+        index = 0
+        while index < len(s):
+            reverse_len = min(k, len(s) - index)
+            for i in range(index + reverse_len - 1, index - 1, -1):
+                result += s[i]
+            index += k
+            for i in range(index, index + k):
+                if i >= len(s):
+                    break
+                result += s[i]
+            index += k
+        return result

src/ReverseStringII.java

@@ -0,0 +1,16 @@
+public class ReverseStringII {
+    public String reverseStr(String s, int k) {
+        StringBuilder result = new StringBuilder();
+        for (int index = 0 ; index < s.length() ; ) {
+            for (int j = 0, reverseLength = Math.min(k, s.length() - index); j < reverseLength ; j++) {
+                result.append(s.charAt(index + reverseLength - j - 1));
+            }
+            index += k;
+            for (int j = 0 ; j < k && index + j < s.length() ; j++) {
+                result.append(s.charAt(index + j));
+            }
+            index += k;
+        }
+        return result.toString();
+    }
+}