Tug Of War, is a Backtracking related problem and in this post we will see how we can solve this challenge in C++

Given an array .We have to separate the array elements into two groups such that the difference of the sum of the two groups is minimum Following solution tries every cmb ,just like the pmt quest

Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @susantabiswas