// Input Requirement - // Size, the List and the Squeezing Factor. // Output - // Sum of the list after Squeezing Operation. // Number of lines - 79 (Excluding Comments) /* [M💙 Challenge] Number Squeezer 🤜🔢🤛 -- By Zephyr Koo Monday Blue 💙 Challenge Series #12 Let's have some exercises this week! This time we will squeeze a number list from both directions until we get a single integer sum. 💼 TASK Write a program to accept a number list and display the output for each iteration of the squeezing operation with following conditions:- ✔️ The outermost integers from left and right will be squeezed and sum together after each iteration ✔️ When the number list have less than 4 elements, the next iteration will produce a single sum and the process stops. 🔧 TEST CASE [ 1 ] ➡ 1 [ 1, 2 ] ➡ 3 [ 1, 2, 3 ] ➡ 6 [ 1, 2, 3, 4] ➡ 3, 7 10 [ 1, 2, 3, 4, 5 ] ➡ 3, 3, 9 15 [ 1, 2, 3, 4, 5, 6 ] ➡ 3, 3, 4, 11 6, 15 21 [ 1, 2, 3, 4, 5, 6, 7 ] ➡ 3, 3, 4, 5, 13 6, 4, 18 28 ➕ EXTRA Accept an additional integer which determines the squeeze factor that indicate the numbers to be compressed for each iteration. The examples shown above have a squeeze factor of 2. Besides, it's easy to observe that the iteration will stop if the number list consists of less than {2 × squeeze factor} numbers. ❤ BONUS Clear-cut and optimized approach is encouraged. Happy Coding!!! 😁💻 */ #include #include using namespace std; // >> Operator overload for lists - Input template istream& operator>>(istream& is,list& l) { for(T &i:l) is>>i; return is; } // << Operator overload for lists - Output template ostream& operator<<(ostream& os,list l) { int ctr = 0; cout<<"[ "; for(T i:l) { os< T Squeeze(list ls, int sqf) ///Recursive function to squeeze a list { static int ct = 1; if(sqf==1) // If we have a squeeze counter of one. { T sum = 0; for(int i : ls) sum+=i; return sum; } else if(ls.size()=sqf) // Squeeze operation A, Front Squeeze. { sum = 0; for(int i=0;i=sqf) // Squeeze operation B, Back Squeeze. { sum = 0; for(int i=0;i>n; list arr(n); int sqf; cin>>arr; cout<>sqf; cout<<"\nFinal Sum after Squeezing - " <

Challenge - List Squeezer