add 2899

Author: fishercoder1534

paginated_contents/algorithms/3rd_thousand/README.md

@@ -6,6 +6,7 @@
 | 2965 | [Find Missing and Repeated Values](https://leetcode.com/problems/find-missing-and-repeated-values/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2965.java)                                       |                                      | Easy                                     |
 | 2942 | [Find Words Containing Character](https://leetcode.com/problems/find-words-containing-character/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2942.java)                                       |                                      | Easy                                     |
 | 2937 | [Make Three Strings Equal](https://leetcode.com/problems/make-three-strings-equal/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2937.java)                                       |                                      | Easy                                     |
+| 2899 | [Last Visited Integers](https://leetcode.com/problems/last-visited-integers/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2899.java)                                       |                                      | Easy                                     |
 | 2894 | [Divisible and Non-divisible Sums Difference](https://leetcode.com/problems/divisible-and-non-divisible-sums-difference/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2894.java)                                       |                                      | Easy                                     |
 | 2873 | [Maximum Value of an Ordered Triplet I](https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-i/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2873.java)                                       |                                      | Easy                                     |
 | 2869 | [Minimum Operations to Collect Elements](https://leetcode.com/problems/minimum-operations-to-collect-elements/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2869.java)                                       |                                      | Easy                                     |

src/main/java/com/fishercoder/solutions/thirdthousand/_2899.java

@@ -0,0 +1,28 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _2899 {
+    public static class Solution1 {
+        public List<Integer> lastVisitedIntegers(int[] nums) {
+            List<Integer> ans = new ArrayList<>();
+            List<Integer> seen = new ArrayList<>();
+            int k = 1;
+            for (int num : nums) {
+                if (num != -1) {
+                    seen.add(num);
+                    k = 1;
+                } else {
+                    if (k <= seen.size()) {
+                        ans.add(seen.get(seen.size() - k));
+                    } else {
+                        ans.add(-1);
+                    }
+                    k++;
+                }
+            }
+            return ans;
+        }
+    }
+}