Microsoft Interview experience | Set 93 (4 Yrs Experienced for IDC)
1. Find square root of number without using sqrt function
2. Given a directed graph. Construct another graph from given graph such that if path exists from vertices A to vertices B and from B to C, then path from A to C and from C to A also should exists.
3. Write function which takes array of elements A and array of elements B and outputs (A-B)U(B-A).
4. Implement hashmap on your own. Write good hashing function for string.
Last round on some design questions.
If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above