Intern Software Engineering Interview Questions | Glassdoor

Intern Software Engineering Interview Questions

1,050

Intern software engineering interview questions shared by candidates

Top Interview Questions

Sort: Relevance Popular Date

You have two arrays with N integers in them. Merge those arrays using a recursive algorithm so that the integers in the final array are sorted.

6 Answers

Write an algorithm to insert a new value into a circular sorted linked list.

4 Answers

I was asked two questions. Q 1. You are given two version numbers of a software, like Version 10.3.4 and Version 10.3.41. Write a program to find out which of the version numbers are the latest. If version 1 is latest output -1, if version number 2 is latest output +1 else output 0 if same version. Both the version numbers are taken as string. He also asks to make the program of minimum time complexity as we can. At the end he also asked the difference between an iterative program and one with recurrence and their advantages and disadvantages. Q 2. Given two files with a list of application IDs (or some kind of data) stored in them , write a program to compare the data in the two files and output all the common data found in each. What data structure would you use and why ? Give a minimum time and space complexity algorithm. Why did you choose the particular data Structure or algorithm ?

5 Answers

How can one implement a queue with only a stack implementation?

4 Answers

Implement integer division

4 Answers

Write a function to determine if a string is an integer.

6 Answers

Given an unsorted array, extract the max and min value using the least number of comparison.

4 Answers

Given a string write a function which prints all the subsets of the string. Now make the function to return only unique solutions. For example if they give you "abc" you print out a ab abc ac b bc c Now for the unique solution constraint, if they give you "aba" the output should be: a ab aba b

7 Answers

Given a number n, give me a function that returns the nth fibonacci number. Running time, space complexity, iterative vs. recursive.

5 Answers

Assuming a preexisting list of 100 words, how would you efficiently see if a word received from input is an anagram of any of the 100 words?

4 Answers
3140 of 1,050 Interview Questions