Software Engineer

You are given a N x M matrix of integers, return the spiral path of the matrix

Example Of Spiral Path

You have been given a grid containing some oranges. Each cell of this grid has one of the three integers values:

Value 0 - representing an empty cell.

Value 1 - representing a fresh orange.

Value 2 - representing a rotten orange.

Every second, any fresh orange that is adjacent(4-directionally) to a rotten orange becomes rotten.

Your task is to find out the minimum time after which no cell has a fresh orange. If it's impossible to rot all the fresh oranges then print -1.

Note:

1. The grid has 0-based indexing.
2. A rotten orange can affect the adjacent oranges 4 directionally i.e. Up, Down, Left, Right.

Indexing

Design pattern

Given a string 'STR', you are supposed to return the length of the longest repeating subsequence such that the two subsequences don’t have the same string character at the same position which means that any ith character in the two subsequences shouldn’t have the same index in the original string.

For example :

In a string “abaacbc”, the length of the longest repeating subsequence is 3 considering the subsequence “abc”. The subsequence “abc” which is present at positions [1,2,5] and [4,6,7] are the longest repeating subsequence in the given string.

LLD for parking lot.