Introduction As I mentioned in my previous blogs, I have started learning Go and Kubernetes operators. What I realized about my softwaren engineering journey is that I love building tools and utilities and tinkering with systems. It’s so fun to just change something , tweek things a little bit, and may be build something interesting in the process. This is far better athan learning DSA or watching stupid system design videos on youtube....
Introduction Got a chance to read this post from percona last night, it’s very basic thing if you worked on postgres for long [https://www.percona.com/blog/postgresql-internals-for-newbies-a-guide-to-data-storage-part-one/] it sparked some curiosity. The idea of how Postgres stores data in row store and some other dbs stores in columnar store is really interesting. This makes me think that we should always think in the perspective of choosing the right data storage rather than choosing the right database for a particular use case....
Go Lang Notes I’ve started learning Go lang very recently. For a long time java develoeper, introduction to various tricky concepts of Go lang is fun. When ever I learn something new, I will try to dig into some philosophical aspects of the language and write them down here. For example, why go lang doesnt have inheritance, why its somehow forces you to choose composition over inheritance. Why go lang has interfaces but no classes....
Introduction When you deep dive into how tls works and the underline algorithms, we will understand how much of a security issue it has from a security point of view. When I was studing of OLD Tls flow it became very obvious to me that how much of a security issue it has. In this blog post I will try to explain how tls works and what are the security issues with it....
Solid Principles “Complexity is the enemy of execution.” — Tony Robbins(From a youtube short) Most of the times complexity in code, or complex explanation of a simple problem leads to failure in the longterm. If you can't keep things simple, or explain things simply, either you have not understood it fully or you are trying to make an impression of being smart. At times I used to act like I know something which I dont have a clue about....
Introduction B-Trees are a facinating inventions in computing. They are some special kind of binary tree. But with very concrete rules. I have watched small video and now i am in the b-tree rabbit hole. I’ts nice last time i’ve been in a rabbit hole like this was when i was learning about prime numbers and how they used in cryptography, well thats a blog post for another day. So The btree data structure in simple terms is a tree which has multiple values in single node, and children nodes can be more than 2....
The Stock Ticker Service Design I got pissed off by seeing system design interview videos on this. So I thought why not write a blog post about it. Why i got pissed off? I have watched a video on youtube about this. This dude introduces a time series database infront of a stock ticker service. I mean come on, this is not a time series database, this is a stock ticker service....
Problem Given an array of strings strs, group the anagrams together. You can return the answer in any order. Example 1: Input: strs = [“eat”,“tea”,“tan”,“ate”,“nat”,“bat”] Output: [[“bat”],[“nat”,“tan”],[“ate”,“eat”,“tea”]] Explanation: There is no string in strs that can be rearranged to form “bat”. The strings “nat” and “tan” are anagrams as they can be rearranged to form each other. The strings “ate”, “eat”, and “tea” are anagrams as they can be rearranged to form each other....
Problem Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place such that each unique element appears at most twice. The relative order of the elements should be kept the same. Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result....
Problem Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number of elements in nums which are not equal to val. Consider the number of elements in nums which are not equal to val be k, to get accepted, you need to do the following things: Change the array nums such that the first k elements of nums contain the elements which are not equal to val....