Welcome to k34a - my digital home 🏠

This home has no walls, and I often delve into topics like coding, business, politics, relegion, sports, and any other thing that is of interest.

RSS Feed: Subscribe to this blog using RSS aggregators.
Reach out to me at k34a[at]live[dot]in if you have any questions or suggestions.

In short: Around 30,000 thoughts cross our minds every day. And there is a 50% chance for each of them to be correct. This website is a small subset of those random thoughts. Each article has been born from a few such thoughts.

How do you actually raise funds for your non-profit

One common problem that most non-profits face is that they are not getting enough funds or donations to work on their cause. They have tried fundraisers, social media and everything else, but somehow the donations are not coming in. If this sounds home, then this article is for you. In this article, I will discuss some strategies that I have successfully tried and tested, and which you may also consider to deal with your current situation....

Given a sorted array, create a complete binary search tree (BST)

This is one of my personal favorites. Got this question in some online coding test for a SDE position. Complete binary search tree A complete binary search tree is a tree in which all levels (except possibly the last one) are completely filled, and all the leaf nodes are as far left as possible. Here is an example of a complete binary search tree. So, here is the question You are given a sorted array....