├── Climbing Stairs.txt
├── Unique path.txt
└── Zigzag Grid Traversal With Skip.txt


/Climbing Stairs.txt:
--------------------------------------------------------------------------------
 1 | class Solution {
 2 |     public int climbStairs(int n) {
 3 |         if(n==0 || n==1 || n==2) return n;
 4 |         int[] dp=new int[n+1];
 5 |         Arrays.fill(dp,-1);
 6 |         dp[0]=1;
 7 |         dp[1]=1;
 8 |         for(int i=2;i<n+1;i++){
 9 |             dp[i]=dp[i-1]+dp[i-2];
10 |         }
11 |         return dp[n];
12 |     }
13 | }
14 | 


--------------------------------------------------------------------------------
/Unique path.txt:
--------------------------------------------------------------------------------
 1 | class Solution {
 2 |     public int uniquePaths(int m, int n) {
 3 |         int dp[][]=new int[m][n];
 4 |         for(int[] row:dp)
 5 |         Arrays.fill(row,1);
 6 |         for(int i=1;i<m;i++){
 7 |             for(int j=1;j<n;j++){
 8 |                 dp[i][j]=dp[i][j-1]+dp[i-1][j];
 9 |             }
10 |         }
11 |        return dp[m-1][n-1]; 
12 |     }
13 | }
14 | 


--------------------------------------------------------------------------------
/Zigzag Grid Traversal With Skip.txt:
--------------------------------------------------------------------------------
 1 | class Solution {
 2 |     public List<Integer> zigzagTraversal(int[][] grid) {
 3 |         List<Integer> lst = new ArrayList<>();
 4 |         for (int i = 0; i < grid.length; i++) {
 5 |             if (i % 2 == 0) {
 6 |                 for (int j = 0; j < grid[0].length; j += 2) {
 7 |                     lst.add(grid[i][j]);
 8 |                 }
 9 |             } else {
10 |                 for (int k = grid[0].length - 1; k >= 0; k--) {
11 |                     if (k % 2 != 0)
12 |                         lst.add(grid[i][k]);
13 |                 }
14 |             }
15 | 
16 |         }
17 |         return lst;
18 |     }
19 | }
20 | 


--------------------------------------------------------------------------------