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
- 244
views
- 2
users
Suggested Topics
| Topic | Category | Replies | Views | Activity |
|---|---|---|---|---|
| How to delete Spoj account? | Off-topic | 2 | 299 | Jun '24 |