Introduction
It is much more fun to work on easy level algorithm compared to hard level algorithm. The problem statement is easy to read and there are so many good ideas out there.
Study notes
8:30 PM
189 - Rotate array - O(N) time O(1) space - reverse the array in place, reverse three times.
198 - House robber, dynamic programming idea is so helpful. The link is here.
10:20 PM
I have checked those algorithms and read some solutions:
206, 217, 219, 225, 226, 231, 232, 237, 242, 243, 246, 257, 258,
No comments:
Post a Comment