Codeforces Round 890 (Div. 2) || E1. PermuTree (easy version) Solution || Mayur Ray
Problem : https://codeforces.com/contest/1856/problem/E1
Solution : https://codeforces.com/contest/1856/submission/217344622
Reference Problem : Partition a set into two subsets such that the difference of subset sums is minimum - https://www.geeksforgeeks.org/partition-a-set-into-two-subsets-such-that-the-difference-of-subset-sums-is-minimum/
We highly recommend you to go through the question once, try to solve it by yourself and in case you get stuck revert back to this video for detailed explanation and solution to the problem.
Welcome to NIT Agartala’s Developers & Coders Club channel. Do subscribe our channel to get more such updates and also like the video if you find it helpful. Also comment down below sharing your thoughts, all constructive criticisms are welcomed.
Happy Coding!
