I’ve been studying algorithms the whole weekend to be prepared for my upcoming interviews (starting tomorrow with Amazon). I was quite shocked that I didn’t hear about very simple things at university, there was a massive lack of information, but through hard studying and a smoking brain, I almost solved this problem. I enjoyed trying all the algorithms and test what complexity theory says about runtime behavior.
I really hope that I prepared the right things in my algorithms tables and did relevant examples (thanks to Google you can find many interview questions on the web). I’ll provide information about my interviews later and some information about my application status.
So stay tuned.





