You can use an hashmap to store each pointer as you move through. Although a better approach would be use the hare and tortoise algorithm since that gives O(N) time complexity and O(1) space complexity.