0 to 1 — Object Oriented Programming (OOP) in JavaScript

0 to 1 — Object Oriented Programming (OOP) in JavaScript

May 11, 2023

-

8 min read

In this article, we will explore the basics of OOP in JavaScript, including objects, classes, and inheritance. We will also look at how to u...

Asynchronous JavaScript

Asynchronous JavaScript

Aug 14, 2022

-

13 min read

Beginner friendly guide about Asynchronous JavaScript, covering Callback functions, role of Web APIs, the Promises, callback queue etc....

SSR - SSG - ISR - CSR in Next.js - The Ultimate Guide

SSR - SSG - ISR - CSR in Next.js - The Ultimate Guide

Aug 2, 2022

-

20 min read

Are you a React lover? If you ask me, of course, I am a die-hard fan. In this article, will compare React and Next.js performance, CSR vs SS...

 How JavaScript works under the hood

 How JavaScript works under the hood

Jul 16, 2022

-

22 min read

'In this article, we will learn a little history of JavaScript, How does JavaScript work under the hood? What is the Runtime environment? Wh...

How JavaScript works under the hood (Part 2)

How JavaScript works under the hood (Part 2)

Jul 22, 2022

-

11 min read

In this article, we will be focussing more on the remaining three major components of JavaScript runtime in the context of the browser which...

Implementing Layout Structure in NextJs the right way

Implementing Layout Structure in NextJs the right way

Mar 10, 2022

-

6 min read

When I started coding in NextJs, I really struggled while implementing Layout based architecture. The React model allows us to build UI in a...

Leetcode 0 to 1 - My first problem (Two Sum)

Leetcode 0 to 1 - My first problem (Two Sum)

Jun 1, 2023

-

3 min read

I'm starting a new journey to solve Leetcode problems, and I'll be sharing my progress on my blog. In each post, I'll show my solution to a ...

Leetcode 0 to 1 - Palindrome Number

Leetcode 0 to 1 - Palindrome Number

Jun 6, 2023

-

3 min read

The problem checks if a given integer x is a palindrome. A number is a palindrome if it reads the same backward as forward. For example, 121...

Leetcode 0 to 1 - (945) Minimum Increment to Make Array Unique

Leetcode 0 to 1 - (945) Minimum Increment to Make Array Unique

Jun 14, 2023

In this challenge, we're tackling the "Minimum Increment to Make Array Unique" problem. Given an integer array nums, we need to make every v...