easy solution || beats 100%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public void reverse(char[]arr,int i,int j){\n        while(i<j){\n            char temp=arr[i];\n            arr[i]=arr[j];\n            arr[j]=temp;\n\n            i++;\n            j--;\n        }\n    }\n    public String reverseStr(String s, int k) {\n        char[]arr=s.toCharArray();\n        int n=arr.length;\n        int i=0;\n        while(i<n){\n            int j=Math.min(i+k-1,n-1);\n            reverse(arr,i,j);\n            i=i+2*k;\n        }\n        return new String(arr);\n    }\n}\n```
['Java']