Previous Year’s Internship Interview Questions

1. Given large file and some text. Find number of occurrence of given text in that file.
2. What is the difference between interface and polymorphism?
3. Basic difference between C and Java, specifically in terms of compilation and execution.
4. Each node of a linked list is a digit. Last node is unit's digit, second last ten's and so on. Find the
largest number which is also a palindrome using any subset of the nodes of a linked list.
5. Questions based on java collection class(Hashmap, Hashset)
6. Find the largest subtree of a binary tree which is also a binary search tree
7. Algorithmic questions based on topics like Binary search, mapping, dynamic programming.
8. What is the difference between linear and nonlinear data structures?
9. Questions based stack queue data structure.
10. Given tree write in-order traversal.
11. Check if a given binary tree is a binary search tree
12. Painter's Partition Problem
13. Explain Heap Sort.
14.Question to delete an element from queue in different types of queue like normal queue, circular
queue, queue with loop etc.
15. Basic object oriented programming concepts and questions
16. Write code for insertion in a Binary Tree (Not Binary Search Tree).
17. Reverse doubly link list.
18. What’s the difference between C and C++?
19. Given array find the sum of maximum and minimum element.:
20. Given a string find the longest palindromic substring. (not subsequence)
21. What is OS?
22. In a tree suppose every node has it's fun value. You have to select nodes such that some of there fun
values is maximum with a condition that if you select a node then you can not select it's parent node.
23. What is meant by adjacency matrix?
24. What is Machine Learning?
25. MCQs based on time complexity, binary tree, linked list and aptitude
26. What Machine Learning do you see in gmail?
27. Given a tree find the element at deepest node. If there are more than one node then print right most of
them.
28. What’s the difference between interpreter and compiler?
29. A Jeep has in total 5 wheels (having one wheel extra) but each wheel can only be used for 5 km. How
many km can jeep travel optimally?
30. Given a 2D array, print the array element in spiral order.
31. If you pass a float/string as argument to the function which accepts an integer,what would happen? If
an error occurs, at which stage? While compiling or while running?
32. N students are given with rating of any competitive coding site. We have to select 3 students (A, B, C)
such that rating of A should be strictly greater than B and rating of B should be strictly greater than C or
totally opposite of it i.e. rating of A should be strictly lesser than B and rating of B should be strictly lesser
than C. We have to calculate number of ways to do that.
33. number of subsequence of size 3 which is in increasing order or decreasing order.
34. Given an array find out i,j,k such that a[i]<a[j]<a[k] or a[i]>a[j]>a[k] and i<j<k or i>j>k.
35. What’s the need of .obj file if it’s the .exe file you execute?
36. We are given an array of strings arranged alphabetically but according to an alien language. Can you
guess the proper alphabets of alien language alphabetically?
37. Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by
array nums. You are asked to burst all the balloons. If the you burst balloon i you will get nums[left] *
nums[i] * nums[right] coins. Here left and right are adjacent indices of i. After the burst, the left and right
then becomes adjacent.
Find the maximum coins you can collect by bursting the balloons wisely.
(Bubble burst problem)
38. We are given chess board of N * N size and now we have to tell how many squares are possible out
of it of arbitrary size.
39. Difference between Java and C++ in terms of OOPs?
40. Given data of 10 GB. You have limited size let's say 2 GB. How to sort given data.