My solution to a “Daily Coding Problem” that I received in my mail today. A fixed point in an array is an element whose value is equal to its index. Given a sorted array of distinct elements, return a fixed point, if one exists. Otherwise, return False. For example, given [-6, 0, Read more
My latest browser game is done, I have deployed it to a temporary website and will share the link to it soon. Anyway, while building it, I came across this little problem where I was trying to partition arrays. As usual, there’s more than one way to solve the problem. Read more
This week I thought I should have a go at building something with plain old Javascript. I mean, I have been using Angular for the last few years so I thought, ahh well, why not? It’s good to revisit some basics especially just how awesome Javascript is with some of Read more
I was working on an update for one of my Hybrid apps on the Google Play Store when I came across a little problem. It was when I was trying to add a speech recognition component to the app. It had something to do with zones in Angular and in 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 (Angular). Obvservable as in one of the RxJS operators. The problem was not hard and the solution is quite simple and I 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 array indices. For example, given [4, 1, 3, 5, 6] and index 0, Read more
My solution to a “Daily Coding Problem” that I received in my mail today. You’re given a string consisting solely of (, ), and *. * can represent either a (, ), or an empty string. Determine whether the parentheses are balanced. For example, (()* and (*) are balanced. )*( is not balanced. Here’s my solution in Typescript, oneFortyTwo(str: string): boolean { if(str Read more
