Timeline for "Algorithmic Crush" problem hitting timeout errors
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 11, 2019 at 5:38 | comment | added | Kanahaiya | It's not about presenting my own solution. as mentioned, in the questioning user was not sure whether complexity is O(NM) or not? and what user is doing wrong?. that is the reason I explained about his approach and complexity analysis and then suggested an improved solution. Let me know if my decision was wrong, will take care from next time. | |
| Apr 9, 2019 at 15:55 | comment | added | Toby Speight | The review content of this can be summarized as, "Don't use brute-force." Instead of presenting your own solution, we prefer that you concentrate on critiquing the actual code in the question. | |
| Apr 8, 2019 at 8:26 | history | answered | Kanahaiya | CC BY-SA 4.0 |