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

```a[1,1]^a[1,2]
a[2,1]^a[2,2]
a[1,1]^a[1,2] a[2,1]^a[2,2];```

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)

Eg:

```arr[]={2,3,4,5,1,6,7};
delete(1)
after deletion
(2,3)
(2,3,4)
(2,3,4,5)
and so on..```

In this, Some corner case must be kept in mind while solving the question

Write your Interview Experience or mail it to contribute@geeksforgeeks.org

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :
Practice Tags :

1

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.