CYBERTROUBLESHOOT

cyber security - technology news - tips and trick - viral tech - new technology launch

Friday, 28 July 2017

10 Difficult Questions Asked In Google Interviews

 10 Difficult Questions Asked In Google Interviews

 10 Difficult Questions Asked In Google Interviews

 

 


We all know about Google. Nothing to say about Google. Google is one of the largest IT company in world as you know. And you also know every IT student want job in google.But do you kow how tuff to take job in google. If you completed all you Technical study but if you go to Google interview he ask question from anywhere not only from technical or programming. Today i am post some question to show  you how hard to take job in Google.


1. Explain what is database to an eight year old kid?

Ans ➤ CLICK HERE

2. What number comes next 10, 9, 60, 90, 70 and 66?
 
Ans➤  CLICK HERE

3. Explain the significance of “dead beef”?

 Ans➤  CLICK HERE

4.  If a car is driving at 100mph down straight road, then what is the speed of each of its wheels at the point where they touch the ground?

 Ans➤  CLICK HERE

5.  A man pushed his car to a hotel and lost his fortune. What happened?

 Ans➤  CLICK HERE

6. A book has N pages, numbered the usual way, from 1 to N. The total number of digits in the page numbers is 1,095. How many pages does the book have?

 Ans➤  CLICK HERE

7.What's the hardest bug you've had to find and fix?

 Ans➤  CLICK HERE

8. A building has 100 floors. One of the floors is the highest floor an egg can be dropped from without If an egg is dropped from above that floor, it will break.

 Ans➤  CLICK HERE

9.  In a country where everyone wants a boy, each family continues having babies till they have a boy. After some time, what is the proportion of boys to girls in the country? (Assuming probability of having a boy or a girl is the same).

 Ans➤  CLICK HERE

10. You are given an array with integers (both positive and negative) in any random order. Find the This is an all-time favorite software interview question. The best way to solve this puzzle is to use Kadane’s algorithm which runs in O(n) time. The idea is to keep scanning through the array and calculating the maximum sub-array that ends at every position. The sub-array will either contain a range of numbers if the array has intermixed positive and negative values, or it will contain the least negative value if the array has only negative values. Here’s some code to illustrate.

 Ans➤  CLICK HERE                                                                                                                              THANKS  

No comments:

Post a Comment