Hello geeks,
I came across a problem, please help me to find out solution of it.
Statement: There are N iron rods having some hight, task is to manufacture
two poles having same hight using the available N rods. ( these poles are
used for hoarding), it’s expected that hoarding can be seen from very far.
Condition: two rods can join but we cant cut the rod.because cost of
cutting is very high.
It is not required to use all rods.
If there is no solution return 0.
Constraints: N is : 5<=N<=50
K is length of rod.: 1<=K<=1000
Maximum hight of poles can be 1000.
Ex: N=6
K: 1 3 2 6 4
Sol:
1 3 4 pole1
6 2 Pole2
Thanks
Pankaj
--
Regards,
Pankaj Kumar Joshi
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to algogeeks+unsubscr...@googlegroups.com.
