Is it possible to check if an array consisting of n integers(possibly equal) can be split in two equal with sum parts, in O(n^2) time?
created
Apr '12last reply
Apr '12- 1
reply
- 274
views
- 2
users
Suggested Topics
| Topic | Category | Replies | Views | Activity |
|---|---|---|---|---|
| Hosting a competition on SPOJ | Off-topic | 1 | 152 | Apr 9 |
| How do I change my profile picture? | Off-topic | 1 | 18 | 5d |