add 3417

Author: fishercoder1534

paginated_contents/algorithms/4th_thousand/README.md

@@ -97,6 +97,7 @@
 | 3438 | [Find Valid Pair of Adjacent Digits in String](https://leetcode.com/problems/find-valid-pair-of-adjacent-digits-in-string/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3438.java) |                                                                               | Easy       |
 | 3432 | [Count Partitions with Even Sum Difference](https://leetcode.com/problems/count-partitions-with-even-sum-difference/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3432.java) |                                                                               | Easy       |
 | 3423 | [Maximum Difference Between Adjacent Elements in a Circular Array](https://leetcode.com/problems/maximum-difference-between-adjacent-elements-in-a-circular-array/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3423.java) |                                                                               | Easy       |
+| 3417 | [Zigzag Grid Traversal With Skip](https://leetcode.com/problems/zigzag-grid-traversal-with-skip/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3417.java) |                                                                               | Easy       |
 | 3411 | [Maximum Subarray With Equal Products](https://leetcode.com/problems/maximum-subarray-with-equal-products/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3411.java) |                                                                               | Easy       |
 | 3407 | [Substring Matching Pattern](https://leetcode.com/problems/substring-matching-pattern/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3407.java) |                                                                               | Easy       |
 | 3402 | [Minimum Operations to Make Columns Strictly Increasing](https://leetcode.com/problems/minimum-operations-to-make-columns-strictly-increasing/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3402.java) |                                                                               | Easy       |

src/main/java/com/fishercoder/solutions/fourththousand/_3417.java

@@ -0,0 +1,39 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _3417 {
+    public static class Solution1 {
+        public List<Integer> zigzagTraversal(int[][] grid) {
+            List<Integer> list = new ArrayList<>();
+            int m = grid.length;
+            int n = grid[0].length;
+            boolean leftToRight = true;
+            int skip = 0;
+            for (int i = 0; i < m; i++) {
+                if (leftToRight) {
+                    for (int j = 0; j < n; j++) {
+                        if (skip == 0) {
+                            list.add(grid[i][j]);
+                            skip++;
+                        } else {
+                            skip--;
+                        }
+                    }
+                } else {
+                    for (int j = n - 1; j >= 0; j--) {
+                        if (skip == 0) {
+                            list.add(grid[i][j]);
+                            skip++;
+                        } else {
+                            skip--;
+                        }
+                    }
+                }
+                leftToRight = !leftToRight;
+            }
+            return list;
+        }
+    }
+}

src/test/java/com/fishercoder/fourththousand/_3417Test.java

@@ -0,0 +1,25 @@
+package com.fishercoder.fourththousand;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions.fourththousand._3417;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import java.util.Arrays;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _3417Test {
+    private _3417.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3417.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(
+                Arrays.asList(2, 1, 2), solution1.zigzagTraversal(CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[2,1],[2,1],[2,1]")));
+    }
+}