OA: 3 algrithm problems easy, middle, middle hard cannot get feedback and get strong tests during assessment, and when it is done you will also cannot know any results. In addition, you will fail if not get all 3 problems accepted
Questions d'entretien [1]
Question 1
Given a sequence A of length n (n<=100000), get the pair (i,j) such that |i-j|>1 and minimize A[i]+A[j]
