The technical question was: You're given an array of strings. Sort it so that the result returns an array of an array of strings sorted into its anagrams. (e.g. input: ["aa", "ad", "da"], output: [ ["aa"], ["ad", "da"] ]
Engineer Intern Interview Questions
18,167 engineer intern interview questions shared by candidates
Deep copy of a linked list, with an extra pointer to a random node.
Using only two pointers how can you tell if a linked-list cycles?
Find the center of graph(vertex, that is connected with every other vertex, but edges are directed to the center of graph).
A professor wants to see if two students have cheated when writing a paper. Design a function : hasCheated(String s1,String s2, int N) that evaluates to true if two strings have a common substring of length N. Additional question after implementation. Assume you don't have the possibility of using String.contains() and String.substring(). How would you implement this. Questions about complexity of my solution. Overall a very friendly interviewer, was saying "Good" the entire time, but no idea if he wanted to keep me focused or if it was really good.
Fibonacci: recursive and iterative.
Fibonacci Numbers - Iteratively and Recursively
Questions asked included (only) printing the nodes of a linked list in reverse, finding the longest palindrome in a given string, finding maximum subarray sum (similar to Kadane's Algorithm) with the constraint that two numbers in the array that form the max sum cannot be next to each other.
Find the length of a C-string, given a pointer to the first character.
Find the maximum subset sum in an array of numbers. Discuss complexity.
Viewing 181 - 190 interview questions