Technical Questions, prepare for data structures and algorithms
University Software Interview Questions
1,069 university software interview questions shared by candidates
Process simulation based on data structure
Graph Question, Dijkstra Algorithm Graph Question, MST and DSU DP Question, Optimal path
1. Intrduction 2. Med-hard questions 3. Resume grind
Determine if a car can complete a route around a circular path with gas stations along the way. This is represented by a directed graph that is a simple circle where the edges are weighted by their distance and the nodes are the gas stations with a certain number of miles that you can add to your tank at each. The car may start at any point on the circle. Do this as efficiently as possible.
String Manipulation questions
Phone: 1. Find the first occurrence of a character that appears in the string more than once. 2. Shortest unique prefix
Array and String manipulations.
Implement an interface.
- Find indices of elements for 2-sum, 3-sum, and 4-sum all in optimal time. 2-sum is easy, but 3-sum and 4-sum should be O(n^2) which is tricky because you need to find indices, not just the elements and there can be duplicate elements. Still don't understand solution to this day - Connect next pointers of all leaf nodes in binary tree. Tricky part is you must do it without extra space so you can't create a queue. I solved using a queue at first and thought solving without extra space was just a followup but I got rejected so seems like you have to do optimal space or else you'll get no hire.
Viewing 471 - 480 interview questions