coding challenges

189: Rotate Array Given an array and an int k, rotate the array k number of steps to the right. The especial challenge of this problem is to find at least three solutions to it. Fortunately, we’re not required to do it in-place. 1. Rotate the array one step k times. This is the solution…

88. Merge Sorted Array. I think the humbling part is that And then when I get to the solution page, it gives a performance review that like, “Your solution is better than 35% of other solutions, and it’s memory usage is better than 9% of users.” Oof. I guess it’s just a case of keep…