Find Last Visited Integer - Python3 solution
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def lastVisitedIntegers(self, nums: List[int]) -> List[int]:

        seen, ans = [], []
        # iterating the nums
        k = 0
        for i in range(len(nums)):
            if nums[i] == -1:
                k += 1
            else:
                k = 0
            
            if nums[i] == -1:
                consecutiveOnes = k
                if consecutiveOnes <= len(seen):
                    ans.append(seen[k - 1])

                elif k > len(seen):
                    ans.append(-1)
            
            elif nums[i] > 0:
                seen.insert(0, nums[i])
        
        return ans

           

            
            

                


```
['Python3']