To find least common ancestor in a binary search tree
Intern Software Interview Questions
20,198 intern software interview questions shared by candidates
Write a function that returns the depth of a tree.
Design and implement an algorithm to determine if a binary tree is symmetric.
In linux, a folder consists of 10000 files and some files contain US phone numbers. What would you do to display the names of files containing US phone numbers?
Find the maximum subset sum in an array of numbers. Discuss complexity.
Heap Sorting. What data structure do you use to implement it? Time to access and sort. Code it.
Is it possible to sort using linear time a file with lots of numbers that contain duplicates, when there are no limits of resources or space?
3) Given a N*N array where N is even such as 4, 8 and so on . Print the array from the center. a= [1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16] the output should be [6 10 12 7 3 2 1 5 9 13 14 15 16 12 8 4 ] .
You have a building with 100 stories. You also have two glass balls. You can drop the glass balls as many times as you want before they break. How can you find the floor at which they start breaking with the fewest number of drops?
Create a Priority Queue with all methods.
Viewing 241 - 250 interview questions