Nowadays, you don’t have to implement your sorting algorithms e.g. quicksort, selection sort, insertion sort etc by yourself. Most programming languages provide the functions/library to do the sorting efficiently, …
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearrange it as the lowest possible order …
There is a fence with n posts, each post can be painted with one of the k colors. You have to paint all the posts such that no more …
The Bitcoin hard-forked this Month (1 Aug 2017), which is the biggest great news in the bitcoin world. The fork is the operation for process to duplicate the code …
This is the technical phone interview question from Google. Google has offices in London but the call was from Google Switzerland (+41). The interview lasts for 45 minutes. Given …
