SDE - 1

You are given an array ‘arr’. You are supposed to find the length of the longest subarray which does not contain any repeated numbers.

An expression is called the postfix expression if the operator appears in the expression after the operands.

Example :

Infix expression: A + B  *  C - D 

Postfix expression:  A B + C D - *

Given a postfix expression, the task is to evaluate the expression. The answer could be very large, output your answer modulo (10^9+7). Also, use modular division when required.

Note:

1. Operators will only include the basic arithmetic operators like '*', '/', '+', and '-'.

2. The operand can contain multiple digits. 

3. The operators and operands will have space as a separator between them.

4. There won’t be any brackets in the postfix expression.

Design Instagram, users should be able to post images, view others' posts and comment on posts.
The system is expected to be highly scalable and of low latency.

Had to give the complete low-level design of Book My Show including database, classes and API design.

HR discussed how my Interviews went. And then gave me feedback round-wise. And told that I was rejected as I could not meet the bar for low-level design. Hence I have to try again after 6 months