🌱Contribute in Hacktoberfest 2022 by contributing Data Structures and Algorithms Code in any programming language. Create your own issues. ✨Star it 🍴Fork it and Contribute to it <3
I can code the famous Tug Of War problem efficiently. Problem statement - Given a set of n integers, divide the set in two subsets of n/2 sizes each such that the absolute difference of the sum of two subsets is as minimum as possible. Please assign @LakshaySK106
LakshaySK106
commented
1 year ago
I can code the famous Tug Of War problem efficiently. Problem statement - Given a set of n integers, divide the set in two subsets of n/2 sizes each such that the absolute difference of the sum of two subsets is as minimum as possible. Please assign @LakshaySK106