Software engineer intern interview questions shared by candidates
Compute all the intersections of two sets of segments in a line.
Only 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
See Interview Questions for Similar Jobs
- Software Engineer
- Software Engineering Intern
- Software Developer
- Senior Software Engineer
- Software Development Engineer
- Software Engineering
- Data Scientist
- Technology Analyst
- Product Manager