Fibonacci Numbers - Iteratively and Recursively
Intern Software Interview Questions
20,198 intern software interview questions shared by candidates
Find the center of graph(vertex, that is connected with every other vertex, but edges are directed to the center of graph).
Deep copy of a linked list, with an extra pointer to a random node.
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.
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.
Design a system to store large numbers and a function to add them.
Fibonacci: recursive and iterative.
Find the length of a C-string, given a pointer to the first character.
Given a 2D array, find the sum of all the elements in the array. O(n^2) solution is too slow, find ways to optimize (ended up adding a second parameter 2D array).
About the details, and interviewer will communicate with you when you are typing.
Viewing 231 - 240 interview questions