SDE - 1

Step 1: First I applied brute force and get the element by checking with Index values.
Step 2: Then he asked something better.
Step 3: Then I add all the elements of the array and subtract that from the sum of integer values 1 to N. Where and is the max number

select * from ((select * from Employee 
ORDER BY `sal` DESC limit 3) AS T) 
ORDER BY T.`sal` ASC limit 1;

Efficient Approach: Following are the steps:

Initialize sum = 0 and maxLen = 0.
Create a hash table having (sum, index) tuples.
For i = 0 to n-1, perform the following steps:
Accumulate arr[i] to sum.
If sum == k, update maxLen = i+1.
Check whether sum is present in the hash table or not. If not present, then add it to the hash table as (sum, i) pair.
Check if (sum-k) is present in the hash table or not. If present, then obtain index of (sum-k) from the hash table as index. Now check if maxLen < (i-index), then update maxLen = (i-index).
Return maxLen.

Tip 1 : Try to be honest about why are you leaving.
Tip 2 : I leave the my previous company for technology growth.
Tip 3 : In small organisation you get better opportunities.