Practice 30 Google Software Developer interview questions covering algorithms, system design, and coding challenges.
Question 2 of 30
How to Answer
Example Answer
Community Answers

William Swansen has worked in the employment assistance realm since 2007. He is an author, job search strategist, and career advisor who helps individuals worldwide and in various professions to find their ideal careers.
You will find that Java is used with many applications, on many different platforms, and a multitude of languages as well. If you're in software development and haven't learned to program in Java, I suggest you learn it as soon as possible. It is becoming a core technology for web development and development in general. It has many capabilities that other programming tools don't have, and that's why it's been a favorite for many developers and companies such as Google. Everyone in IT has their own way of approaching a complex problem and finding a solution. In this case, we're talking about finding duplicate numbers in an array in Java. Luckily, Java is a go-to for most developers trying to solve this problem. An interviewer might phrase this question differently, but this is the easiest to understand. When you hear the words Sorted or Binary search, they are looking for you to explain what inner and outer loops mean or parsing items inside an array. Be prepared for those questions as well.

William Swansen has worked in the employment assistance realm since 2007. He is an author, job search strategist, and career advisor who helps individuals worldwide and in various professions to find their ideal careers.
"Problem-solving has always been a strength of mine. I take them on intending to find a solution to a problem in the shortest time possible. I was working on a Java development project that required using Binary Search and Sorting. I started by adding a duplicate list of elements inserted back into an array. I also used two pointers to solve this, one to compare an element and its closest neighbor to maintain a distinct element. Another method that I tried was by parsing all the items inside of an array containing 'n' to give me O(n). This way, we get an array of the n1 element with integers between 1 and 4, which means there will be at least one duplicate as a result."

Interview Coach
Jaymie
A real coach, not AI. I read every answer myself and write back with personalized feedback.
Typically responds within 24 hours.
0 - Character Count
Prepare with questions that reflect Google's rigorous technical interview process.
Get StartedJump to Question

Written by William Swansen
30 Questions & Answers • Google

By William

By William