Question1 – N strings of equal length and a single integer K is given, In one operation we can select two strings out of N (say A and B) and swap(A[i], B[i]). We have to answer whether we can make at least K strings equal or not by performing any number of operations. Question2 – Given n coordinate (x, y) of points on 2D plane and Q queries. Each query contains an integer r, the task is to count the number of points lying inside or on the circumference of the circle having radius r and centered at the origin.

Round 1:- 1.) Recover Binary Search tree. 2.)Minimum number of platforms. Round 2:- 1.)Sort a K-unsorted array. 2.)Total sum of minimum and maximum of all subarrays of an array. Round 3:- Projects Discussion and some HR questions.