Timeline for Hacker Rank: Array left rotation
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 5, 2019 at 8:30 | comment | added | Peter Taylor | @Astrinus, if I wanted answers to those questions I'd have posted them as comments on the question. As I see it, one of the things a code review should do is challenge OP to think about whether they've fully understood the spec, and whether they can update the code if the spec (or their understanding of it) changes. | |
| Mar 5, 2019 at 8:12 | comment | added | Astrinus |
The constraints say that 1 <= d <= n, so yes, we have guarantees about d.
|
|
| Mar 4, 2019 at 13:01 | comment | added | Peter Taylor | @jcaron, it's OP's responsibility to ask only about their own code. The help centre is quite explicit that any aspect of the code posted is fair game for feedback and criticism. | |
| Mar 4, 2019 at 11:50 | comment | added | jcaron | Most of the I/O code is provided as part of the challenge. The only thing OP has to provide is the code inside the rotLeft function, which should return the rotated array. | |
| Mar 4, 2019 at 8:43 | history | answered | Peter Taylor | CC BY-SA 4.0 |