Today was not an ordinary day for me; it began with the need to take an unexpected sick day. The morning unfolded with urgency as I planned to drop off my child, but fate had a different story in store. Around 9:30 AM, near Hopefarm in Whitefield, my day took a dramatic turn. As I attempted to overtake a car on the right, an elderly man crossing the road appeared in my path....

Jump Game Peak and Valley approach. Jump game is a medium level leetcode problem which is very interesting yet brainy. Once you understand the problem correctly then the answer is obvious. The probelm goes like this according to leetcode. You are given an integer array nums. You are initially positioned at the array’sfirst index, and each element in the array represents your maximum jump length at that position. Return true_ if you can reach the last index, or false otherwise_....

Skewed workloads and Relieving Hot Spots Imagine you have a library with books categorized by their first letter (A-Z). This is like partitioning data based on a key (like the first letter of a book title). Problem: One letter (say, “X”) becomes super popular (a celebrity author!). Everyone wants to read “X” books, causing a “hot spot” (overcrowding) in the “X” section. Hashing doesn’t fix it: Even if you assign different “buckets” based on a hash of the title, all “X” books still end up in the “X” bucket....

Ah, the early days of wrangling massive data tables! I vividly remember the struggle – slow queries, performance bottlenecks, and the ever-growing cloud bill. It was an uphill battle until we unearthed the magic bullet: database partitioning. Talk about a revelation! This newfound approach not only eradicated performance issues but also slashed computational costs. But the story doesn’t end there. My exploration revealed a treasure trove of partitioning techniques, each unlocking unique advantages....

Introduction A colleague recommended Martin Kleppmann’s “Designing Data-Intensive Applications” to me. Initially, I found the beginning somewhat tedious and opted for a non-linear approach, selecting topics of interest at random rather than reading from start to finish as one might with a novel. This strategy seemed fitting given the book’s comprehensive coverage of software system design, akin to an engineering bible. Today, I’ve chosen to delve into the concept of Event Sourcing....

Objective The goal is to create a class capable of handling browser history operations efficiently. This includes: Initializing the browser with a specified homepage. Navigating to new URLs (visiting pages). Enabling backward and forward navigation through the history. Key Components Constructor: Initializes the browser with a homepage. Visit(URL): Navigates to a new URL and updates the current position in the history. Back(steps): Moves back a specified number of steps in history and returns the current URL....

On the early morning of February 1st, I decided to tackle a problem from the Striver’s SDE sheet. I came across an intriguing challenge titled “Set Matrix Zeroes”. Here’s how I approached it: Initially, I attempted a brute force method. The usual strategy of iterating through a matrix and setting rows and columns to zero has a drawback: it can lead to the loss of the matrix’s original state, potentially zeroing out the entire matrix, which isn’t the desired outcome....

KEEP ONE HAND DISTANCE!

Cycle travelled all the way from Bangalore to Kannan devan hills, Idukki. ;) A wonderful journey of last 3 years has come to an end. Moved out of MBRDI / DTICI ( Daimler Trucks Innovation Center India)

I like to fork interesting github repositories and experiment with it. Those who do this actively might have faced the problem of upstream sync, where we need to sync our repository with the upstream repository. Imagine you forked a repository contains some articles which are being updated everyday, you will like them to have it synced everyday. I do ;) Github introduced a feature called fetch upstream this year to solve this issue....