How O(n) is possible for this Google Kickstart 2019 Round C problem Wiggle Walk?

Правка en1, от serhatgiydiren, 2020-03-26 14:30:05

Hi community. Is there anyone can make comment about the O(n) time complexity approach for the following problem? In the problem analysis part, author talks about it (There is also a O(N) solution to this problem using hash tables. It is left as an exercise to the reader.) but does not give thee details. I appreciate if you help about the matter. Thank you.

Wiggle Walk

Теги #googlekickstart, 2019 round c, wiggle walk

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский serhatgiydiren 2020-03-26 20:14:41 5 Tiny change: 'e who can make comment a' -> 'e who can comment a'
en2 Английский serhatgiydiren 2020-03-26 14:30:38 4 Tiny change: 're anyone can make ' -> 're anyone who can make '
en1 Английский serhatgiydiren 2020-03-26 14:30:05 553 Initial revision (published)