Software Engineering Intern Interview Questions in Dublin, Ireland | Glassdoor

# Software Engineering Intern Interview Questions in Dublin, Ireland

14

Software engineering intern interview questions shared by candidates

## Top Interview Questions

Sort: RelevancePopular Date

Feb 9, 2011
 Compute all the intersections of two sets of segments in a line.2 AnswersOnly implemented the naive solution O(M x N) time, should have implemented a line sweeping algorithm.int line1[line size] int line2[line size] int overlap[line size] for each segment in set1 for i = segment start to segment end line1[i]++ for each segment in set2 for i = segment start to segment end line2[i]++ for i = 1 to line size if line1[i] and line2[i] overlap[i] = 1

Feb 9, 2011
 Given a set of cities, each with a given population, select randomly a city with a probability that is proportional to the population.2 AnswersGave a naive O(1) time O(population) space solution, then created a python generator that implemented what is requested in O(n_cities) worst-case time.int size = 0 int city_range[] initialization for each city i city_range[i] = size size += population[i] selection generate random integer r ranging from 0 to size for i = 0 to n_cities if city_range[i] <= r and r < city_range[i] + population[i] return city i

### Intern Software Development Engineer In Test at Microsoft was asked...

Jul 12, 2012
 How would you test a pen?1 AnswerThey use this type of question to test your creativity when in comes to coming up with numerous test cases.

Feb 9, 2011
 Suppose you have a set objects, identified by a unique name. How do you store them so that you can retrieve them easily?1 AnswerHash tables. Definition, hash function, Universal hashing, examples of hashing functions, hash table load factor. Some hashing implementations (python dict, java hashmap)

Feb 9, 2011
 What is the output of the Linux uptime command? What is the meaning of load average? How is the load average affected by SMP?1 Answerup time for the node, number of users, load factor (then he asked what is the load factor - something related to the number of processes that go from ready queue to schedulation in a given unit of time)

Feb 9, 2011
 How do you process a set of log files if you don't have enough memory to do it?1 AnswerI don't remember the exact question, it was a task that could be solved with a unix pipe, maybe identify the number of user agents in a log file (like cat *.log | sort | uniq | grep something | wc -l), then he asked how to do it if you don't have enough time. I tried to describe the implementation using map-reduce.

### Software Development Engineer I Intern at Amazon was asked...

Oct 3, 2015
 Are objects and classes the same , and if not , how are they different? 1 AnswerObjects are instances of classes. (was my main point).

### Software Development Engineer I Intern at Amazon was asked...

Oct 3, 2015
 Given an array of integers [1,2,3,4]. and target t = 5. Come up with a solution that will print out all the unique pairs in the array that are equal t.3 AnswersFound this very hard, but the interviewer gave subtle hints, and I eventually came up with the idea of using a nested for loop. But I was not completely correct as I had set the inner incrementer to j = 0 instead of j = i+1 .array a=new array(); foreach(int i in a) { if(i==t) { console.writeline(i.toString()); } } //c# code,i am not sure if this is what they whantedpublic class CalculateTuple { /** * @param args */ public static void main(final String[] args) { final int arr[] = { 1, 2, 3, 4 }; final int sum = 5; solution(arr, sum, false); } /** * find possible tuple for provided sum * * @param input * input array * @param expectedSum * expected sum value for the tuple * @param isCommutative * true : (1,2) != (2,1) will give you both tuple
* false : (1,2) == (2,1) are same and give you only (1,2) */ public static void solution(final int input[], final int expectedSum, final boolean isCommutative) { final Map indexedArray = new HashMap(); final Map uniquePair = new HashMap(); final int length = input.length; for (int i = 0; i < length; i++) { indexedArray.put(input[i], i); } int count = 0; for (int i = 0; i < length; i++) { final Integer integer = indexedArray.get(expectedSum - input[i]); if (integer != null && integer != i) { if (isCommutative || (null == uniquePair.get("(" + i + "," + integer + ")") && null == uniquePair.get("(" + integer + "," + i + ")"))) { System.out.println("(" + i + "," + integer + ")"); uniquePair.put("(" + i + "," + integer + ")", "(" + i + "," + integer + ")"); count++; } } } System.out.println("Found " + count); } }

### Front Desk at Planet Fitness was asked...

Jun 17, 2016
 Scenario QuestionsBe the first to answer this question

### Software Engineer, Intern at AOL was asked...

Dec 18, 2013
 What technologies have you read about recently that you find interesting..... I stumbled through this answer, as I was not prepared for it. Be the first to answer this question
110 of 14 Interview Questions

More