Given an integer array of n integers, find sum of bit differences in all pairs that can be formed from array elements. Bit difference of a pair (x, y) is count of different bits at same positions in binary representations of x and y.
There are n-pairs and therefore 2n people. everyone has one unique number ranging from 1 to 2n. All these 2n persons are arranged in random fashion in an Array of size 2n. We are also given who is partner of whom.
The solution will be evaluated on following parameters. Object Oriented Design aspects of the solution. Overall coding practices.
Even if we were to search around the world, it would be a truly difficult job to find someone like Divanshu. As a Computer Science Graduate of IIIT – Allahabad, he successfully bagged job offers from an astounding three companies – all being some of the best
Though I didn’t clear google but I want to share my Google interview experience , so it can help other’s . Please find my interview experience below:
“I will never forget the day I received my offer letter. Its a dream come true.” Landing a job in Arista Networks would ideally be a dream opportunity for many but for Krunal Patel from BITS Pilani – Goa it was just the beginning.
Anudeep Nekkanti embodies the old adage – there is no substitute for talent. The 21-year-old coder from Samalkot (a small town near Vishkhapatnam) has landed an offer from Google, Zurich.
About myself : I was contacted on Linkedin by a google recruiter. I have 4 years of experience.
There is a myth that only grads with high CGPA land in high paying dream companies. Despite his average grades, Romal with his extraordinary coding talent and determination succeeded in getting a job offer from Google.
MCQ Questions: 20 (+4, -1) Subjective Question: 1
My Google Interview Experience, [Hope this is helpful] I am AnandhaKumar .P – 2012 IT pass out from College Of Engineering Guindy, Anna University.