When you merge two linked lists, there tend to be problems with conflicts between the lists (because they have a specific order to them and you are messing with the order).

The challenge: This is a problem that can be solved in a few lines of code using another math trick.

You hear a lot about some of the crazy interview questionsGooglehas for all their employees.

The challenge: Heres the start to a common trend with Googles interview questions: find an efficient way to solve a problem.

Google is checking if you know the terminology. For example, Finalize has to deal with garbage collection, while Finally refers to a specific kind of error.

There are a ton of ways to attack this problem, and simplifying it by placing limits on it like the square mileage of San Francisco is important when it comes to programs.

The challenge: There are a bunch of ways to solve this problem, and it all depends on what algorithm you choose.

Otherwise, its easy just plug the numbers in, since most languages support arithmetic operations.

Check boundary conditions (meaning single out stocks that typically have big moves) and then efficiently compute the biggest swing.

The challenge: This one is asking you to come up with a way to check a solution arithmetically and quickly with another math trick.

The challenge: A sticky bit is a system administrator term related to settings and permissions.

So they have to answer even harder, more computational and logic-based questions. Wevefound a bunch of interesting ones on , a place where you can rate your interviewing experience, and assembled a list.

This one will ask you to implement a clever math trick.

The challenge: This is a more open-ended question designed to coax the engineer to define parameters.

Weve gone through the list with our tech team to try and create a plain English translation for each problem, too.

You have to check if you can rotate them and check them against existing strings.

Google is looking for the engineer to pick the fastest algorithm.

The challenge: This is a variation of the traveling salesman problem, a famous math problem.

* Copyright © 2018 Insider Inc. All rights reserved. Registration on or use of this site constitutes acceptance of our

For example, strings usually refer to lines of letters, words or something that is meant to be printed and seen. But they can also refer to matrices (a two-dimensional object) and other kinds of objects.

A vertical stack of three evenly spaced horizontal lines.

The challenge: Google will also ask you to solve a bunch of math problems.

You have to draw lines between nodes, but never have a clear path of returning to the original node regardless of where youre starting.

The challenge: This is another problem asking you to implement a clever math trick that youd learn in a discrete math class.

The challenge: Now Google is asking you to make sure you know youre checking the right parts of the problem and ignoring the fluff in order to run algorithms more efficiently.

Its testing you to not only know which tricks to use, but how you implement them as code.

The challenge: This is a question of whether you can bend your knowledge of existing tropes in computing.

15 Mind-Bending Interview Questions That Every Google Engineer Can Answer

The challenge: This is essentially question of whether you can estimate if the problem is solvable in a finite period of time.

You can usually attack a problem with brute force, but it could take forever to solve.

Theyre designed to challenge engineers to think efficiently for problems, not just know how to code each problem.

You have to find an algorithm to quickly eliminate those conflicts.

Google is testing to see if you know some of the finer points of administration not just coding.

Its a math problem thats asking you to stretch your brain, not find a clever trick.

Get the latest Google stock pricehere.

The challenge: This ones a doozie and its asking you to put everything together.

The challenge: The response from our tech team was screw Java. In reality, each term has a very specific meaning.

The challenge: This is the kind of problem a Google interviewer will ask to check what kind of boundary conditions you are setting.

But engineers are also a class of their own, and have to prove that they know how to code as well as Google expects them to if they want to work there.

The only decent approach we could think of is to calculate it by brute force, going through each stock.

Is the language in Assembly? If so, you have to build basic operations from scratch.