Make Array Equal Last Updated : 12 Jan, 2024 Summarize Comments Improve Suggest changes Share Like Article Like Report You are given an array A[ ] of N integers. In one operation pick any subarray A[l....r]let x be the least positive integer present in this subarrayIf x exists then update A[i] = A[i] % x (l ≤ i ≤ r)You can perform the above operation at most 10 times. Find a way to make every array element the same after completing all the operations. Examples: Input: N = 6, A[] = {2, 2, 2, 3, 3, 3}Output: 1 34 6Explanation: After the first operation A = {0, 0, 0, 3, 3, 3}After the 2nd operation A = {0, 0, 0, 0, 0, 0} Input: N = 2, A[] = {1, 6}Output: 1 2Explanation: Only one operation is efficient. Approach: Follow the below idea to solve the problem. To make all array elements equal is always optimal to choose 1 to N subarray, as atmost 10 operation are allowed. Below are the steps involved: Initialize a 2D vector ans of size 10.Iterate upto 10 times:Add {1, N} in ans.Return ans vector.Below is the implementation of the code: C++ // C++ Implementation #include <bits/stdc++.h> #include <iostream> using namespace std; // Function to calculate subaaray starting and ending // points vector<vector<int> > solve(int N, vector<int> A) { // Intialising a ans array of 40 size vector<vector<int> > ans(10); // Assinging values for (int i = 0; i < 10; i++) { ans[i] = { 1, N }; } // Return ans return ans; } // Driver code int main() { int N = 6; vector<int> A = { 2, 2, 2, 3, 3, 3 }; // Function call vector<vector<int> > arr = solve(N, A); // Prin the output for (auto a : arr) { cout << a[0] << " " << a[1] << endl; } return 0; } Java import java.util.*; public class GFG { static List<List<Integer> > solve(int N, List<Integer> A) { // Initializing an ans list of size 10 List<List<Integer> > ans = new ArrayList<>(10); // Assigning values for (int i = 0; i < 10; i++) { ans.add(List.of(1, N)); } // Return ans return ans; } // Driver code public static void main(String[] args) { int N = 6; List<Integer> A = List.of(2, 2, 2, 3, 3, 3); // Function call List<List<Integer> > arr = solve(N, A); // Print the output for (List<Integer> a : arr) { System.out.println(a.get(0) + " " + a.get(1)); } } } Python3 def GFG(N, A): # Initializing an ans array of the size 10 ans = [[1, N] for _ in range(10)] # Return ans return ans # Driver code def main(): N = 6 A = [2, 2, 2, 3, 3, 3] # Function call arr = GFG(N, A) # Print the output for a in arr: print(f"{a[0]} {a[1]}") if __name__ == "__main__": main() C# using System; using System.Collections.Generic; class GFG { static List<List<int>> Solve(int N, List<int> A) { // Initializing an ans list of the 40 size List<List<int>> ans = new List<List<int>>(10); // Assigning values for (int i = 0; i < 10; i++) { ans.Add(new List<int> { 1, N }); } // Return ans return ans; } // Driver code public static void Main(string[] args) { int N = 6; List<int> A = new List<int> { 2, 2, 2, 3, 3, 3 }; // Function call List<List<int>> arr = Solve(N, A); // Print the output foreach (var a in arr) { Console.WriteLine($"{a[0]} {a[1]}"); } } } JavaScript function GFG(N, A) { // Initializing an ans array of the size 10 let ans = Array.from({ length: 10 }, () => []); // Assigning values for (let i = 0; i < 10; i++) { ans[i] = [1, N]; } // Return ans return ans; } // Driver code function main() { let N = 6; let A = [2, 2, 2, 3, 3, 3]; // Function call let arr = GFG(N, A); // Print the output for (let a of arr) { console.log(a[0] + " " + a[1]); } } main(); Output1 6 1 6 1 6 1 6 1 6 1 6 1 6 1 6 1 6 1 6Complexity Analysis: Time Complexity: O(1)Auxiliary Space: O(1) Comment More infoAdvertise with us Next Article Make Array Equal Anonymous Improve Article Tags : Geeks Premier League DSA Arrays Greedy Algorithms Geeks Premier League 2023 +1 More Practice Tags : Arrays Similar Reads DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read Non-linear Components In electrical circuits, Non-linear Components are electronic devices that need an external power source to operate actively. Non-Linear Components are those that are changed with respect to the voltage and current. Elements that do not follow ohm's law are called Non-linear Components. Non-linear Co 11 min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 14 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T 9 min read Array Data Structure Guide In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous 4 min read Like