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....

You can make a great software but you have to choose 2 out of this above 3. There is no way to get around!

class Node: def \_\_init\_\_(self, data): self.data=data self.nextNode=None class LinkedLIst: def \_\_init\_\_(self): self.head = None self.numberOFNodes=0 \# Here we get o(1) constant running time complexity for insertion. def insert\_start(self,data): self.numberOFNodes=self.numberOFNodes+1 new\_node = Node(data) if not self.head: self.head=new\_node else: new\_node.nextNode=self.head self.head = new\_node #Linear running time o(n) def insert\_end(self,data): self.numberOFNodes=self.numberOFNodes+1 new\_node=Node(data) actual\_node=self.head while actual\_node.nextNode is not None: actual\_node=actual\_node.nextNode actual\_node.nextNode=new\_node def size\_of\_list(self): actual\_node = self.head while actual\_node is not None: print(actual\_node) actual\_node=actual\_node.nextNode def traverse(self): actual\_node=self....

I had worked on spring framework extensively throughout my career. The one thing which I am always try to implement in any Spring project I work on is Custom annotation. Its a fancy stuff but useful in many ways. Say you have numerous micro services (Duplicate code bases which will f*** you up) running on your cluster, the best and first thing you do is - Build a common library to push all your model classes, so called util package of your organization :p and the fancy stuffs ....

When comes to any programming language what i check first is how to write a unit test on it. “Coding is not difficult- Bill Gates” So what is difficult? I would say testing is difficult. Here is a basic example on how to test a small piece of python code. The above snippet is a basic recursive program which will return the factorial of a number. Lets see how we can write a basic test case for this....