Print a binary tree level by level
Software Engineering Intern Interview Questions
12,189 software engineering intern interview questions shared by candidates
Write a function in Java that will take a sorted array of ints, possibly with duplicates, and compact the array removing all the duplicate numbers. That is, if the contains the numbers - 1, 3, 7, 7, 8, 9, 9, 9, 10, then when the function returns, the contents should be - 1, 3, 7, 8, 9, 10. Be sure your answer is as efficient as possible. Describe the efficiency of your algorithm using big O notation.
Given a set of points (x,y) and an integer "n", return n number of points which are close to the origin
Given a number n, give me a function that returns the nth fibonacci number. Running time, space complexity, iterative vs. recursive.
How do you find three numbers that sum to 0? (in a list). Now can you do it under O(n^3)?
Find the length of the longest chain of consecutive integers in an unsorted set in linear time.
Given a log of users visit to a site for a day, how would you find returning users given the log visit for another day
Write a program to find the square root of a double.
Given a collection of words, return a collection of anagrams found in the given collection
Got asked two questions: 1 - Return the length of the longest sequence of increasing numbers in an unsorted array 2 - Print out a Binary Tree level by level
Viewing 71 - 80 interview questions