solution-review-problem-challenge-3__pattern-fast-slow-pointers__grokking-the-coding-interview-patterns-for-coding-questions
Topic | Replies | Views | Activity | |
---|---|---|---|---|
How the input ([2, 1, -1, -2]) given in example 3 has no cycle? | 1 | 89 | October 19, 2022 | |
I don't understand this line: next_index = (current_index + arr[current_index]) % len(arr) | 1 | 130 | May 24, 2022 | |
Given Solution has a Bug! | 1 | 269 | December 21, 2021 | |
Is this correctly memoized? | 0 | 199 | March 24, 2021 | |
Slow, fast pointers not really necessary in the O(n) solution | 1 | 321 | March 21, 2021 | |
Alternate solution - do you see an issue with my approach | 1 | 285 | February 19, 2020 |