SDE - 2

You are given a 2-D matrix ‘mat’, consisting of ’N’ rows and ‘M’ columns. The element at the i-th row and j-th column is ‘mat[i][j]’.

From mat[i][j], you can move to mat[i+1][j] if mat[i+1][j] > mat[i][j], or to mat[i][j+1] if mat[i][j+1] > mat[i][j].

Your task is to find and output the longest path length if you start from (0,0) i.e from mat[0][0] and end at any possible cell (i, j) i.e at mat[i][j].

Note :

Consider 0 based indexing.

Design Data structure like Queue in which you have to get the middle element in  O(1),  then update that value and do some modification and add back to the Queue in O(1) and the rearrangement happens. 

Probability Questions, Some OOPS Question with the Advance concept in java, and Some SQL queries

Given an integer array(ARR) of size N, the following operations need to be performed:

update(l, r, val) : Add (val + i) to arr[l + i] where, 0 <= i <= r - l.

rangeSum(l, r): return the sum of all elements in the array from index l to r, i.e., the sum of array arr[l...r].

Two type of queries denote these operations:

Type 1: for update(l, r, val) operation.
Type 2: for rangeSum(l, r) operation.

Note: (1 based indexing) for the queries.

What is the probability of getting a sum of 22 or more when four dice are thrown?

Fifteen people sit around a circular table. What are odds against two particular people sitting together?

Discussion over-
Checked my Github profile and asked lots of questions on projects.
Microservices, Acid Compliance properties, Messaging Queues, Kubernetes, and Docker
Designing Pizza Delivery System

You are given a pattern in the form of a string and a collection of words. Your task is to determine if the pattern string and the collection of words have the same order.

Note :

The strings are non-empty.

The strings only contain lowercase English letters.