Problem: Given the strings “A” and “B” consisting of lowercase alphabet characters, return the number of subsequences of “A” that are equal to “B”. Mod the result by 10**9 + 7.

Let us consider an example to understand the problem better,

Problem : You are given N cities represented as integers and a list of one-way roads that connects one city to another. Return whether you can reach one city from any city.

Let us consider an example to understand the problem better,

Problem: Given a list of integers, arr. Consider a tree where arr represents the values of its leaves in an inorder traversal. All internal nodes have 2 children each and their value is equal to the product of the largest leaf value of its left subtree and the largest leaf value of its right subtree. Find the tree with the minimum sum of its values and return the sum.

Let us consider the following example to get a clearer idea of this problem,

Problem : Given a two-dimensional matrix of integers containing 1s and 0s, return the total number of square submatrices with all 1s.

Let us consider the following example to get a clearer idea of this problem,

In our previous blog, we already started with the introduction to one of the problems that we are going to discuss. We will try to discuss further about the topics involved.

Let us revisit the problem statement,

Problem #1: Given two strings A and B, find the minimum edit distance between the two strings. Edit distance is defined using: (a) Deleting a character, (b) Inserting a character, (c) Replacing a character.

Let us consider the following example to get a clearer idea of this problem,

In our previous blog, we already started with the introduction to one of the problems that we are going to discuss. We will try to discuss further about the topics involved.

Let us revisit the problem statement,

Problem #1: Given a binary tree, return the largest sum of any simple path between any two nodes.

This problem can be contemplated as an extension to finding the diameter of a binary tree problem.

Let us consider an example to understand what we are actually seeking,

In our previous blog, we already started with the introduction to one of the problems that we are going to discuss. We will try to discuss further about the topics involved.

Let us revisit the problem statement,

Problem #1: Given a list of integers depicting the costs and an integer K. We are currently at the first index and want to reach the last index. The cost of using index “i” is it’s respective cost and in each move we can either jump [1…K] indices at once. Return the minimum cost to reach the last index.

The example given below helps us visualise the problem,

In our previous blog, we already started with the introduction to one of the problems that we are going to discuss. We will try to discuss further about the topics involved.

Let us revisit the problem statement,

Problem #1: Given an N * M integers matrix, return the length of the longest increasing path in the matrix. It is allowed to move left, right, up or down from a cell but we may not move diagonally or outside the bounds of the matrix.

This is a pretty standard problem and involves some interesting “good-to-know” concepts and hence we felt like discussing it here.