The Google online challenge 2020 for new graduate 2021 was held on August 22. It was a 60-minute online test having 2 questions to code.
The exam was conducted on HackerEarth. But first, your resume should be shortlisted for the exam then they will send you link & passkey with the time span of 5 hr
i.e(mine scheduled between 3 p.m to 8 p.m) but the duration of the exam was 1 Hour only
First Question: Size of the smallest subset with maximum Bitwise XOR in a 2-D matrix & return the smallest subset
In Case of multi answer return the smallest subset
Time complexity O(n^2);
Second Question: Given an unsorted array, you have to delete an element such that after deletion every subset of the array having min & max element in increasing order(a similar approach like window sliding )
Time complexity O(n^2)
and so on..
In this, Some corner case must be kept in mind while solving the question
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses
are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out - check it out now!