Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.
ContestId |
Name |
Phase |
Frozen |
Duration (Seconds) |
Relative Time |
Start Time |
|---|---|---|---|---|---|---|
| 2011 | Kotlin Heroes: Episode 11 | FINISHED | False | 9000 | 4116299 | Sept. 30, 2024, 2:35 p.m. |
Solved$ |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
|---|---|---|---|---|---|---|
| ( 14 ) | I | Stack and Queue | PROGRAMMING | *special data structures divide and conquer |
B''... |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 283797656 | arvindf232 | I | Sept. 30, 2024, 4:50 p.m. | OK | Kotlin 1.7 | TESTS | 73 | 1562 | 143667200 | ||
| 283835964 | Sparkle_Twilight | I | Oct. 1, 2024, 1:34 a.m. | OK | Kotlin 1.9 | TESTS | 73 | 1093 | 84480000 | ||
| 283797452 | arvindf232 | I | Sept. 30, 2024, 4:48 p.m. | OK | Kotlin 1.9 | TESTS | 73 | 1171 | 84480000 |
Back to search problems