Let’s consider that we need to convert a base 4 number to base 8 number. Base 4 digits: 0 1 2 3 Base 8 digits: 0 1 2 3 4 5 6 7 We should build a chart to map all digits in base 8 to its equivalent number in base 4. That will come … Read more
So I assume that you know what context switching is. Suppose you are running an OS in a dual core processor. And at some point, your application is running four threads. Operating system kernel needs to divide the CPU time among them. You are running four threads in two cores after all. This is the … Read more
Just last week I solved this problem. In my Windows 10 laptop sound was fine. I was able to hear people in video chat. Even Microsoft Edge which is built-in browser for Windows was also working fine. But I was not getting any sound from Google Chrome. There can be various issues. But if there … Read more
Google crawler should be able to index your blog posts eventually. You don’t have to submit it. But it is recommended to submit your blogspot blog sitemap to Google Search Console. It might help you get your posts or pages indexed in Google quicker. For this, you don’t need any custom sitemap for Blogger blog. … Read more
If you are on Windows & already using NotePad++, you can use it as an offline JSON validator tool. Just install this plugin. Now you can validate & view JSON text in tree structure inside the text editor. It might not give you fancy UI like some of the online JSON formatters do, but it … Read more
If you are familiar with thread dump or at least looked at it couple of times, probably you would have noticed WAITING & WAITING (parking) states. So what’s the difference? In Java, we have Objects.wait() and Unsafe.park() methods. Both of them will suspend the running thread & put it in waiting state. But these two … Read more
Suppose we need to find if some text contains a pattern or any of its anagrams. I will explain how you can do it in O(n) time. Let’s consider the example below: Text: cedaabd Pattern: abad Here are all possible 4-letter anagrams of abad: aabd aadb abad abda adab adba baad bada bdaa daab daba … Read more
I will keep this post short. There are tons of resources where you can find JavaScript and it’s event loop architecture. I am here to clarify few things. Let’s take an example from this resource. It fairly explains the event loop & the event queue used by JavaScript engine. But the question is what happens … Read more
Here I am just trying to explain KMP algorithm in plain english. I will also explain worst time complexity & why it is O(m + n). We will take two examples, one with no repeatable character in the pattern & another with repeatable characters in the pattern. Pattern With Repeatable Characters: Text: aaaabaabab Pattern: aaaaa … Read more
In this post, I will try to explain Rabin-Karp algorithm & its worst time complexity. Rabin-Karp algorithm is based on hash matching. Let’s take an example. Text: aadabcPattern: abc Let’s create a table as below & represent each letter with some arbitrary number. We will use it to calculate hash. a b c … Read more