Problem of the day
Tip 1 : Prepare data structures and algorithms thoroughly and practice atleast 2 to 3 questions daily for 4-5 months consistently.
Tip 2 : Have few good projects in your resume and also prepare your core subjects like Operating System, DBMS.
Tip 3 : Before interview do a little research about the company.
Tip 1 : Mention at least 2 good projects.
Tip 2 : You should be able to defend whatever you have put on your resume so don't mention anything false.
The coding test was conducted on Hackerrank platform. The test was in the evening. There were two coding questions of easy difficulty. The test was proctored, our webcam was on but not the mic. Also we were not allowed to switch tabs.
About 360 students sat in this round out which 15 were shortlisted for the next interview round.
This was a very easy question as I just had to traverse both the array and maintain a count variable and a variable to store last maximum equal element encountered which I initialized to a very small number (like INT_MIN in C++) . Now while traversing whenever you encounter equal elements which are greater than last maximum equal elements then increment count by 1. In the end just print count.<...
Step 1 : Create a map and store count of each unique element in the array.
Step 2 : Maintain a count variable to store the number of unique pairs of elements whose sum is K.
Step 3 : Traverse the array. Let the array be called arr and arr[i] is current element in array while traversing. If value arr[i] and K-arr[i] in map is greater than 0 then increment count and make value of arr[i] and...