Microsoft Interview Question
- 0of 0 votes
For those who get bored of sorting/hashing/string manipulation problems, here is the geometric one:
Given n lines in the plane (for simplicity assume no 3 lines intersect at one point). Count the total number of triangles in the plane created by these lines. Observe that smaller triangles may be part of larger ones.
Look here for example:- pavel.em December 06, 2011 in United States
h t t p://farm8.staticflickr.com/7021/6465828833_15e7447992_z.jpg
| Report Duplicate | Flag | PURGE
Open Chat in New Window