|
|
|
|
|
by pradeep_m
3244 days ago
|
|
I think the code is written for the case where it fits in memory. For that case, the solution is O(n) in terms of time complexity. From the feedback it seems that they only spoke about the solution where the data doesn't fit in memory. |
|