Tip 1 : Should be strong in MS-SQL
Tip 2 : Some Basic about Excel
Tip 3 : Good practice of coding skills
Tip 1 : Have some Good Skills,
Tip 2: Make sure about your initial projects



If more than one such contiguous subarrays exist, consider the subarray having the smallest leftmost index.
For example - if A is [1, 2, 2, 3, 1, 3 ] and k = 2 then the subarrays: [1,2], [2,3], [3,1], [1,3] are the smallest subarrays containing 2 distinct elements. In this case, we will consider the starting and ending index of subarray [1,2] i.e. 0 and 1.
Tip 1 : First I applied the brute force
Tip 2 : Interviewer asked me to reduce the time complexity
Tip 3 : Tried to optimise the code
Go through concepts of DBMS

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?