Intern Interview Questions in San Jose, CA | Glassdoor
Intern Interview Questions in San Jose, CA

Intern Interview Questions in San Jose, CA

From retail to finance to medicine, every industry needs interns to provide additional support and assistance. Interview questions will vary greatly depending on the industry and role you are looking for. Expect to answer questions about how you work on teams and provide examples of any relevant work experience. To ace your interview, make sure to research the particular position you are applying for.

Top Interview Questions

Sort: RelevancePopular Date

Find the second largest element in a Binary Search Tree

16 Answers

find the right most element. If this is a right node with no children, return its parent. if this is not, return the largest element of its left child.

One addition is the situation where the tree has no right branch (root is largest). In this special case, it does not have a parent. So it's better to keep track of parent and current pointers, if different, the original method by the candidate works well, if the same (which means the root situation), find the largest of its left branch.

if (root == null || (!root.hasRightChild() ) { return null;} else return findSecondGreatest(root, root.getValue()); value findSecondGreatest(Node curr, value oldValue) { if(curr.hasRightChild()) { return (findSecondGreatest( curr.getRightChild(), curr.value)); } else return oldValue; }

how would you find the shortest path between two nodes in a social network?

7 Answers

Find occurrences of a number in sorted array (allow duplicates).

8 Answers

Generate a new array from an array of numbers. Start from the beginning. Put the number of some number first, and then that number. For example, from array 1, 1, 2, 3, 3, 1 You should get 2, 1, 1, 2, 2, 3, 1, 1 Write a program to solve this problem.

7 Answers

Questions related to data structures like "What data structure would you use for a browser's BACK & FORWARD ability"

6 Answers

If integer array used to store big integers (one integer store one digit), implement arithmetic operations.

6 Answers

25 racehorses, no stopwatch. 5 tracks. Figure out the top three fastest horses in the fewest number of races.

11 Answers

Write a function that finds the minimum and maximum values within an unsorted array using divide-and-conquer.

6 Answers

Implement integer division without using / or %. Questions about running time. Can you do it faster?

6 Answers

Output a single linked list in reverse, in linear time and constant space, and recursively

5 Answers
110 of 1,001 Interview Questions