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…
My solution to a “Daily Coding Problem” that I received in my mail today. Given a binary tree where all nodes are either 0 or 1, prune the tree so that subtrees containing all 0s are removed. For example, given the following tree: 0 Read more…
My solution to a “Daily Coding Problem” that I received in my mail today. Given the head of a singly linked list, swap every two nodes and return its head. For example, given 1 -> 2 -> 3 -> 4, return 2 Read more…
My solution to a “Daily Coding Problem” that I received in my mail today. Given an array of numbers and an index i, return the index of the nearest larger number of the number at index i, where distance is measured in Read more…