SDE - 1

You are given a 'N' * 'N' maze with a rat placed at 'MAZE[0][0]'. Find and print all paths that rat can follow to reach its destination i.e. 'MAZE['N' - 1]['N' - 1]'. Rat can move in any direc­tion ( left, right, up and down).

Value of every cell in the 'MAZE' can either be 0 or 1. Cells with value 0 are blocked means the rat can­not enter into those cells and those with value 1 are open.

You are given an unsorted array/list 'ARR' of 'N' integers. Your task is to return the length of the longest consecutive sequence.

The consecutive sequence is in the form ['NUM', 'NUM' + 1, 'NUM' + 2, ..., 'NUM' + L] where 'NUM' is the starting integer of the sequence and 'L' + 1 is the length of the sequence.

Note:

If there are any duplicates in the given array we will count only one of them in the consecutive sequence.

For example-

For the given 'ARR' [9,5,4,9,10,10,6].

Output = 3
The longest consecutive sequence is [4,5,6].

Follow Up:

Can you solve this in O(N) time and O(N) space complexity?

The interview covered CSS, JavaScript topics like closures, promises, and React.js. The interviewer, who seemed genuinely understanding, tailored questions based on my resume. It felt like a casual yet thorough assessment of my skills, creating a positive and collaborative atmosphere.

This interview mainly delved into personal aspects. 

They asked about my hobbies, strengths, weaknesses, and where I see myself in five years. 

They were also interested in my knowledge about the company and why I'm interested in choosing them over other companies.

The CTO went through my resume and had a chat with me about it. After that, he asked me some questions about user authorization tokens, like how long they last, etc. We also talked about user authorization and authentication in an application.