My solution to a “Daily Coding Problem” that I received in my mail today. Given an array of integers, return a new array where each element in the new array is the number of smaller elements to the right of that element in the original input array. For example, given Read more…
As I am building the e-commerce app for the other startup, I ran into a problem where I had to filter an array of objects in an Observable. The problem was not hard and the solution is quite simple and I will share that in this post. RxJS operators I Read more…
My solution to a “Daily Coding Problem” that I received in my mail today. You are given an array of length n + 1 whose elements belong to the set {1, 2, …, n}. By the pigeonhole principle, there must be a duplicate. Find it in linear time and space. Here’s my solution Read more…
My solution to a “Daily Coding Problem” that I received in my mail today. Given a string, determine whether any permutation of it is a palindrome. For example, carrace should return true, since it can be rearranged to form racecar, which is a palindrome. daily should return false, since there’s no rearrangement that can form Read more…
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 1024. Here’s my solution in Typescript. I will be honest, Read more…