├── 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 zigzagTraversal(int[][] grid) { 3 | List 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 | --------------------------------------------------------------------------------