Interview PrepWhy I think HackerRank is not good for tech interview preparationHackerRank might be good if you would like to take part in coding contest. But not if you are preparing to tech interview.Mar 12, 2017Mar 12, 2017
Interview PrepDynamic programming: coin changeDynamic programming might seem like something advanced and complicated. In fact produces efficient solutions it’s just another approachMar 12, 2017Mar 12, 2017
Interview PrepFind the unique number in array where all numbers except one have duplicateSolution to this problem is elegant and efficient but it’s unlikely to come up with it if you don’t know about it.Mar 12, 2017Mar 12, 2017
Interview PrepN-th Fibonacci numberA classical problem that is used to explain recursion. Recursive solution though is highly inefficient.Mar 12, 2017Mar 12, 2017
Interview PrepDetermine if number is primeIf you are asked to determine if number is prime — try everything odd (3, 5, 7…) up to sqrt(n).Mar 12, 2017Mar 12, 2017
Interview PrepBFS: breadth-first-searchBFS is an algorithm to find the shortest path from node A to node B. It’s implemented using Queue where you put all nodes you are about to…Mar 12, 2017Mar 12, 2017
Interview PrepBinary searchBinary search is an efficient algorithm to find element in sorted array. It is simple, but one step aside and it’ll end up in an endless…Mar 12, 2017Mar 12, 2017
Interview PrepMerge sortIt’s a good exercise to implement basic algorithms such as binary search, heap, binary search tree, quick sort, merge sort…Mar 12, 2017Mar 12, 2017
Interview PrepRotate arrayFirst problem in “Cracking the Coding interview” tutorial on HackerRank is to rotate array to the left.Mar 12, 2017Mar 12, 2017
Interview PrepWhy I think LeetCode is not a great tool for tech interview preparationWhat a lot of my friends were doing was solving algorithmic problems on leetcode or a similar site. I’ve done that in the past (and I…Mar 12, 2017Mar 12, 2017