Tip 1 : Prepare all Topics from Coding Ninjas of Course Competitive Programming. Also I practiced atleast one question everyday from sites like Leetcode,Interviewbit and also took part in Codeforces Contest.
Tip 2 : Do Competitive Programming regularly.
Tip 1 : Keep your resume up to date and mention 2-3 good level projects which will give a good impression to the interviewer .
Tip 2 : Don't put false things on the resume.
This round was conducted on Google Meet with 2 interviewers present.
The time was around 2 PM to 3 PM.
The interviewers were friendly and helped if I got stuck.
DP problem
We use two data structures to implement an LRU Cache.
Queue is implemented using a doubly-linked list. The maximum size of the queue will be equal to the total number of frames available (cache size). The most recently used pages will be near the front end and the least recently used pages will be near the rear end.
A Hash with the page number as key and the address of the corre...
The round was held on Google meet face to face with only HR present.
HR explained me about the team, etc, made me feel comfortable.
HR was friendly and asked almost standard questions.
Who is your role model?
What is your expectation from this job?
Tip 1 : Maintain a positive attitude in all Interviews be it tech or HR.
Tip 2 : Develop team spirit and have some team work experience ( like ICPC times)
Tip 3 : Don't take HR round for granted, Prepare for this round beforehand.
#include <iostream> #include <vector>
int binarySearch(const std::vector<int>& arr, int target) { int left = 0; int right = arr.size() - 1;
while (left <= right) { int mid = left + (right - left) / 2;
if (arr[mid] == target) { return mid; // Found the target, return its index } else if (arr[mid] < target) { ...
Ok