# In this category of Google Interview Questions for Software Engineer, you will see most practical questions, sometime before throwing data-structure questions, they ask a light question and after a full time, they ask for your profile and luck based on it. From the bottom, they also question on the basis of Google Interview Questions for Software Engineer.

Google Interview Questions, Internships, Careers, Hiring Process, Rules

# Google Interview Questions for Software Engineer

1.  Imagine you have a closet full of shirts. It’s very hard to find a shirt. So what can you do to organize your shirts for easy retrieval?
2. How would you test each one?
3. How many degrees are there in the angle between the hour and minute hands of a clock when the time is a quarter past three?
4. Write a function f(a, b) which takes two character string arguments and returns a string containing only the characters found in both strings in the order of a. Write a version which is order N-squared and one which is the order.
5. Design a class library for writing card games.
You need to check that your friend, Bob, has your correct phone number, but you cannot ask him directly. You must write a question on a card which and give it to Eve who will take the card to Bob and return the answer to you. What must you write on the card, besides the question, to ensure Bob can encode the message so that Eve cannot read your phone number?
6. Why are manhole covers round?
7. Given a function which produces a random integer in the range 1 to 5, write a function which produces a random integer in the range 1 to 7.
8.  What is the difference between a mutex and a semaphore? Which one would you use to protect access to an increment operation?
9.  Suppose you have an NxN matrix of positive and negative integers. Write some code that finds the sub-matrix with the maximum sum of its elements
10.  A man pushed his car to a hotel and lost his fortune. What happened?
11.  Explain the significance of dead beef.
12.  Write a C program which measures the speed of a context switch on a UNIX/Linux system.
13.  Describe the algorithm for a depth-first graph traversal.
14.  What method would you use to look up a word in a dictionary?
15. In Java, what is the difference between final, finally, and finalize?
16. Given that you have one string of length N and M small strings of length L. How do you efficiently find the occurrence of each small string in the larger one?
17.  How are cookies passed in the HTTP protocol?
18.  Design the SQL database tables for a car rental database.
19. Find or determine nonexistence of a number in a sorted list of N numbers where the numbers range over M, M>> N and N large enough to span multiple disks. The algorithm to beat O(log n) bonus points for constant time algorithm.
20.  Write a regular expression which matches an email address.
21. Given a set of coin denominators, find the minimum number of coins to give a certain amount of change.
22.  You are given a source to an application which is crashing when run. After running it 1 time in a debugger, you find it never crashes in the same place. The application is single threaded and uses only the C standard library. What could programming errors be causing this crash?
23.  How do you find out the fifth maximum element in a Binary Search Tree in an efficient manner? Note: You should not use any extra space. i.e sorting Binary Search Tree and storing the results in an array and listing out the fifth element.
24. Explain how congestion control works in the TCP protocol.
25. What is multithreaded programming? What is a deadlock? Write a function (with helper functions if needed) called to Excel that takes an excel column value (A, B, C, D, AA, AB, AC, AAA..) and returns a corresponding integer value (A=1, B=2, AA=26..).
26.  You have a stream of infinite queries (ie: real-time Google search queries that people are entering). Describe how you would go about finding a good estimate of 1 sample from this never ending set of data and then write code for it.
27.  Tree search algorithms. Write BFS and DFS code, explain runtime and space requirements. Modify the code to handle trees with weighted edges and loops with BFS and DFS, make the code print out a path to the goal state.
28. You are given a small sorted list of numbers, and a very very long sorted list of numbers so long that it had to be put on a disk in different blocks. How would you find those short list numbers in the bigger one?
29. You are given a list of numbers. When you reach the end of the list you will come back to the beginning of the list (a circular list). Write the most efficient algorithm to find the minimum # in this list. Find any given # in the list. The numbers in the list are always increasing but you dont know where the circular list begins, ie: 38, 4, 55, 89, 6, 13, 2, 23, 36.
30.  Describe the data structure that is used to manage memory. (stack)
31. What’s the difference between local and global variables?
32. If you have 1 million integers, how would you sort them efficiently? (modify a specific sorting algorithm to solve this)
33. Given That One of the strings is very very long, and the other one could be of various sizes. Windowing will result in O(N+M) solution but could it be better? Maybe NlogM or even better?
34.  In Java, what is the difference between static, final, and const? (if you don’t know Java they will ask something similar for C or C++).
35.  Talk about your class projects or work projects (pick something easy) then describe how you could make them more efficient (in terms of algorithms).
36. Write some code to reverse a string.
Implement division (without using the divide operator, obviously).
37. Write some code to find all permutations of the letters in a particular string.
38. You have eight balls all of the same sizes. 7 of them weigh the same, and one of them weighs slightly more. How can you find the ball that is heavier by using a balance and only two weighings?
39.  What is the C-language command for opening a connection with a foreign host over the internet?
40. Design and describe a system/application that will most efficiently produce a report of the top 1 million Google search requests. These are the particulars: 1). You are given 12 servers to work with. They are all dual-processor machines with 4Gb of RAM, 4×4 GB hard drives and networked together. (Basically, nothing more than high-end PCS) 2). The log data has already been cleaned for you. It consists of 1 Billion log lines, broken down into 12 32 GB files of 4 -byte search terms per line. 3). You can use the only custom written applications or available free open-source software.
41.  There is an array A[N] of N numbers. You have to compose an array Output[N] such that Output[i] will be equal to the multiplication of all the elements of A[N] except A[i]. For example Output[ ] will be multiplication of A to A[N-1] and Output will be multiplication of A[ ] and from A to A[N-1]. Solve it without division operator and in O(n).
42.  Given two sequences of items, find the items whose absolute number increases or decreases the most when comparing one sequence with the other by reading the sequence only once.
43. There is a linked list of numbers of length N. N is very large and you dont know N. You have to write a function that will return k random numbers from the list. Numbers should be completely random. Hint: 1. Use random function and() (returns a number between and 1) and iron() (return either or 1) 2. It should be done in O(n).
44. Given a file of 4 billion 32-bit integers, how to find one that appears at least twice?
45.  You are given a game of Tic Tac Toe. You have to write a function in which you pass the whole game and the name of a player. The function will return whether the player has won the game or not. First, you to decide which data structure you will use for the game. You need to tell the algorithm first and then need to write the code. Note: Some position may be blank in the game? So your data structure should consider this condition also.
46.  You are given an array [a1 To an] and we have to construct another array [b1 To bn] where bi = a1*a2**an/ai. you are allowed to use only constant space and the time complexity is O(n). No divisions are allowed.
47. How do you put a Binary Search Tree in an array in an efficient manner?  Hint: If the node is stored at the ith position and its children are at 2i and 2i+1(I mean level order wise) It’s not the most efficient way.
48.  Given a Data Structure having first n integers and next n chars. A = i1 i2 i3  iN c1 c2 c3  CN.Write an in-place algorithm to rearrange the elements of the array ass A = i1 c1 i2 c2  in CN.
49.  How many lines can be drawn in a 2D plane such that they are equidistant from 3 non-collinear points? Let’s say you have to construct Google maps from scratch and guide a person standing on
50.  Gateway of India (Mumbai) to India Gate(Delhi). How do you do the same?
51. Implement put/get methods of a fixed size cache with LRU replacement algorithm.
52.  Given a binary tree, programmatically you need to prove it is a binary search tree.
53.  Suppose you have given N companies, and we want to eventually merge them into one big company. How many ways are there to merge?
54. Write a program for displaying the ten most frequent words in a file such that your program should be efficient in all complexity measures.
55.  Design a stack. We want to push, pop, and also, retrieve the minimum element in constant time.
56. Given an array, i) find the longest continuous increasing subsequence. ii) find the longest increasing subsequence.
57. Suppose we have N companies, and we want to eventually merge them into one big company.
58.  How many ways are there to merge?
59.  Write a function to find the middle node of a single link list.
60.  Given two binary trees, write a compare function to check if they are equal or not. Being equal means that they have the same value and the same structure.
61.  You are given with three sorted arrays ( in ascending order), you are required to find a triplet ( one element from each array) such that distance is minimum.
62. Distance is defined like this : If a[i], b[j] and c[k] are three elements then distance=max(abs(a[i]-b[j]), abs(a[i]-c[k]), abs(b[j]-c[k]) Please give a solution in O(n) time complexity
63.  How does C++ deal with constructors and deconstructors of a class and its child class?
64.  Write a function that flips the bits inside a byte (either in C++ or Java). Write an algorithm that takes a list of n-words, and an integer m, and retrieves the mth most frequent word in that list.
65.  What’s 2 to the power of 64?
66. Given that you have one string of length N and M small strings of length L. How do you efficiently find the occurrence of each small string in the larger one?
67. How do you find out the fifth maximum element in a Binary Search Tree in an efficient manner?
68.  Suppose we have N companies, and we want to eventually merge them into one big company.
69.  How many ways are there to merge?
There is a linked list of millions of node and you do not know the length of it. Write a function which will return a random number from the list.
70.  You need to check that your friend, Bob, has your correct phone number, but you cannot ask him directly. You must write a question on a card which and give it to Eve who will take the card to Bob and return the answer to you. What must you write on the card, besides the question, to ensure Bob can encode the message so that Eve cannot read your phone number?
71. What is the size of the C structure below on a 32-bit system? On a 64-bit?
struct foo {
char a; char* b; };
72. How long would it take to sort 1 trillion numbers? Come up with a good estimate.
Order the functions in order of their asymptotic performance: 1) 2^n 2) n^1 3) n! 4) n^n
There are some data represented by(x,y,z). Now we want to find the Kth least data. We say (x1, y1, z1) > (x2, y2, z2) when value(x1, y1, z1) > value(x2, y2, z2) where value(x,y,z) = (2^x)*(3^y)*(5^z). Now we can not get it by calculating value(x,y,z) or through other indirect calculations as lg(value(x,y,z)). How to solve it?
73. Design a 2D dungeon crawling game. It must allow for various items in the maze walls, objects, and computer-controlled characters. (The focus was on the class structures, and how to optimize the experience for the user as s/he travels through the dungeon.)
74. Given an array whose elements are sorted, return the index of the first occurrence of a specific integer. Do this in sub-linear time. I.e. do not just go through each element searching that element.
75.  Given two linked lists, return the intersection of the two lists: i.e. return a list containing only the elements that occur in both of the input lists.
76.  What’s the difference between a hash table and a hashmap?
77.  If a person dials a sequence of numbers on the telephone, what possible words/strings can be formed from the letters associated with those numbers?
78.  How would you reverse the image on an n by n matrix where each pixel is represented by a bit?
79. Create a fast cached storage mechanism that, given a limitation on the amount of cache memory, will ensure that only the least recently used items are discarded when the cache memory is reached when inserting a new item. It supports 2 functions: String get(Tt) and void put(String k, T t).
80. Create a cost model that allows Google to make purchasing decisions to compare the cost of purchasing more RAM memory for their servers vs. buying more disk space.
81.  Design an algorithm to play a game of Frogger and then code the solution. The object of the game is to direct a frog to avoid cars while crossing a busy road. You may represent a road lane via an array. Generalize the solution for an N-lane road.
82. What sort would you use if you had a large data set on disk and a small amount of ram to work with?
83.  What sort would you use if you required tight max time bounds and wanted highly regular performance?
84.  How would you store 1 million phone numbers?