class Solution { public int uniquePathsWithObstacles(int[][] obstacleGrid) { int m = obstacleGrid.length; int n = obstacleGrid[0].length; int[][]…
class Solution { public int[][] updateMatrix(int[][] matrix) { if(matrix == null || matrix.length == 0 || matrix[0].length == 0)…
Solution 1
class Solution { public int countSubstrings(String s) { int n = s.length(); int ans = n…
class Solution { public int longestCommonSubsequence(String text1, String text2) { int n = text1.length(); int m =…
class Solution { public int lastStoneWeight(int[] stones) { if(stones == null || stones.length == 0) return 0; PriorityQueue<Integer> pq…
class Solution { public int minFallingPathSum(int[][] arr) { if (arr == null || arr.length == 0 ||…
class MinFallingPathSum{ public int minFallingPathSumMethod(int[][] A) { if(A == null || A.length == 0 || A[0].length == 0) return…