My solution to a “Daily Coding Problem” that I received in my mail today. Implement integer exponentiation. That is, implement the pow(x, y) function, where x and y are integers and returns x^y. Do this faster than the naive method of repeated multiplication. For example, pow(2, 10) should return Read more…
My solution to a “Daily Coding Problem” that I received in my mail today. Given a list of elements, find the majority element, which appears more than half the time (> floor(len(lst) / 2.0)). You can assume that such element Read more…
My solution to a “Daily Coding Problem” that I received in my mail today. Given a multiset of integers, return whether it can be partitioned into two subsets whose sums are the same. For example, given the multiset {15, 5, 20, Read more…
My solution to a “Daily Coding Problem” that I received in my mail today. Given a 2-D matrix representing an image, a location of a pixel in the screen and a color C, replace the color of the given pixel and Read more…
My solution to a “Daily Coding Problem” that I received in my mail today. Given a list of numbers L, implement a method sum(i, j) which returns the sum from the sublist L[i:j] (including i, excluding j). For example, given L = [1, 2, 3, 4, 5], sum(1, 3) should Read more…