Easiest solution just understand in seconds beast 100% in T.C.
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```java []\nclass Solution {\n    public void reverse(char[] str,int i,int j){ \n        while(i<j){\n            char temp = str[i]; \n            str[i] = str[j]; \n            str[j] = temp;  \n            i++; \n            j--;\n        }\n    }\n    public String reverseStr(String s, int k) {\n       \n       char[]str = s.toCharArray();  \n       int n = str.length;\n       int i=0; \n       while(i<n){ \n        int j= Math.min(i+k-1 , n-1); \n        reverse(str, i , j); \n        i += 2*k;\n       }  \n       return new String(str); \n    }   \n} \n    \n```
['Java']