Tip 1 : Be confident.
Tip 2 : Be consistent in your practise for DSA.
Tip 1 : Be honest about yourself
Tip 2 : Cover all of your talents and achievements
The round was held in morning hours and it was strictly proctored.



We will first sort the given array. Then we will start traversing the array using two variables, say ‘i’ and ‘j,’ using a nested loop, where j will be used to fix the maximum element, and i will be used to fix the minimum element and check if arr[j] - arr[i] <= K.



The approach is to simply try to solve each query independently. We will start at the given cell and count the number of 1s in it and one by one count the number of 1s in each square whose center is that cell. As soon as this count becomes greater than ‘K’ we stop and return the length of the previous square because the required square is allowed to have not more than ‘K’ 1s.
In this round, I was asked 1 coding question followed by some questions from OOPS



Each pair should be sorted i.e the first value should be less than or equals to the second value.
Return the list of pairs sorted in non-decreasing order of their first value. In case if two pairs have the same first value, the pair with a smaller second value should come first.
Difference b/w Overloading and Overriding
Give some real-life examples of classes and objects
What are the different types of constructors in C++?
What is Polymorphism?
In this round, I was basically asked questions from Software Engineering and Cloud Technology
What is the SDLC process?
Why do we use cloud technology?
What are Virtual Machines?
What are the different software development models that you know?
I feel this round was a basically a conversational round, and I let the conversation go freely and confidently and that helped to clear this round.
What did you learn from the pandemic?
What do you expect from DB?
Where do you see yourself in five years?
Tip 1 : Be very honest about your answers and own them.
Tip 2 : Stand firm about your ideas and values.

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