Reverse array in groups in hindi c++ solution | GeeksforGeeks | technical society
Given an array arr[] of positive integers of size N. Reverse every sub-array group of size K.
Note: If at any instance, there are no more subarrays of size greater than or equal to K, then reverse the last subarray (irrespective of its size). You shouldn't return any array, modify the given array in-place.
Example 1:
Input:
N = 5, K = 3
arr[] = {1,2,3,4,5}
Output: 3 2 1 5 4
Explanation: First group consists of elements
1, 2, 3. Second group consists of 4,5.
Example 2:
Input:
N = 4, K = 3
arr[] = {5,6,8,9}
Output: 8 6 5 9
Your Task:
You don't need to read input or print anything. The task is to complete the function reverseInGroups() which takes the array, N and K as input parameters and modifies the array in-place.
Expected Time Complexity: O(N)
Expected Auxiliary Space: O(1)
Constraints:
1 ≤ N, K ≤ 107
1 ≤ A[i] ≤ 1018
tags used:-
reverse array in groups
reverse array in groups solution
reverse array in groups hindi
reverse array in groups geeksforgeeks
reverse array in groups geeksforgeeks java
reverse array in groups in java
reverse array in groups leetcode
reverse array in groups o(n)
reverse array in groups leetcode java
reverse array in groups gfg
reverse array in groups java
reverse array in groups practice problem
reverse array in groups problem
reverse array in groups gfg java
