Software engineer Interview Questions in Pittsburgh, PA | Glassdoor

Find jobs for software engineer

Software engineer Interview Questions in Pittsburgh, PA

Software engineers write programs to design and develop computer software. Interviews are highly technical, so come ready to work through coding problems and math brainteasers. The specific questions you are asked will depend on what type of programming position you are looking for. Try researching a specific software discipline such as web development, application development, or system development.

Top Interview Questions

Sort: RelevancePopular Date

Design an algorithm, which can record the largest number in an ever-upgrading sequence.

5 Answers

Depending on the size of the sequence, how about: 1. If the sequence is small, just scan the sequence and return the largest number 2. If the sequence is large, use a max-heap (implemented as priority_queue in C++STL for example). After each element add, add the element also to the end of the heap and do 'max-HEAPIFY' on that node to maintain the max-heap property. After each element removal, move the last element of the heap to the removed node and do 'max-heapify" on that node also maintain the max-heap property. The largest number of the whole sequence is always the first/top element. 3. If the sequence is large, can also use a set (RB tree, std::set) to store all the elements, return the max element from the set. I suspect #2 is what they expect, but just to make a point, if the sequence is really small, #1 can be better although it is dumb,

since its only trying to find the largest one, why not just sort the seqence?

Why sort the sequence? Just keep track of the largest number and compare it to the next one.

Experience working on technical projects as part of a team

4 Answers

Linked list memory management: deleting a node from the middle of a list was easy. Next question - how to delete a node from the end of a list. Was too tired to think and realize this was a trick question.

5 Answers

We have m slots for ads and n ads, each ads will have different revenue on differnet slot, design an algorithm to find out the best fit (find m ads in n ads and order them so that they can make max money, white board coding) .

3 Answers

OOP coding in swift and java

3 Answers

For a two-dimensional array of arbitrary size (not guaranteed to be square) containing binary values, find the total number of rectangles defined by four corners and parallel to the array's dimensions.

3 Answers

1. Binary Tree level order traversal 2. Given a string and a pattern '.' Matches any single character. '*' Matches zero or more of the preceding element.), find the first substring matching this pattern.

4 Answers

What is priority inversion?

2 Answers

Implement a data structure which can implement add, delete and random delete in O(1) time complexity.

2 Answers

implement binary tree.

2 Answers