100-days-of-leetcode

https://leetcode.com/problems/unique-paths-ii/

class Solution {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        
        int m = obstacleGrid.length;
        int n = obstacleGrid[0].length;
        int[][]…

https://leetcode.com/problems/01-matrix/

class Solution {
    public int[][] updateMatrix(int[][] matrix) {
        
        if(matrix == null 
           || matrix.length == 0 
           || matrix[0].length == 0)…

https://leetcode.com/problems/palindromic-substrings/

Solution 1

class Solution {
    public int countSubstrings(String s) {
        
        int n = s.length();
        int ans = n…

https://leetcode.com/problems/longest-common-subsequence/

class Solution {
   public int longestCommonSubsequence(String text1, String text2) {
        int n = text1.length();
        int m =…

https://leetcode.com/problems/last-stone-weight/

class Solution {
    public int lastStoneWeight(int[] stones) {
        if(stones == null 
           || stones.length == 0) return 0;
        PriorityQueue<Integer> pq…

https://leetcode.com/problems/minimum-falling-path-sum-ii/

class Solution {
    public int minFallingPathSum(int[][] arr) {
        if (arr == null 
            || arr.length == 0 
            ||…