That's the most fun part about programming. Especially about interviews. Recently I had a really fun interview, with about 2 problems to be solved.
1. Given a multidimensional array , find the minimal path sum.
2. Given a list or group of X & Y co-ordinates, find the closest pair , meaning the set of pairs(X,Y) co-ordinates , which have the minimal distance between them.
The fun part was that, I managed to code them in C# / VS.net 2015 and cleared it. Here's the wonderful code for it in my public git-hub profile:
https://github.com/srimani75/ProblemSolving
Thanks for sharing.
ReplyDeleteOnline training