#JavaScript

An honest, hype-free look at how a senior frontend engineer actually uses AI: daily tool stack, 4-step workflow sequence, my Gatsby-to-Astro migration story and the 4 costly traps to avoid.

When working with JavaScript, understanding the concepts of scope and context is crucial for writing clean and efficient code. `Scope` determines the accessibility of variables and functions, while `context` refers to the value of the `this` keyword, representing the current object within which a function is executed. In this blog post, we will delve into these concepts, providing real-life examples to illustrate their practical implications.

SolidJS is a blazing-fast framework that dodges virtual DOM manipulation. Let's see how it stacks up against ReactJS, the industry standard, when it comes to flexibility, performance, community and developer productivity..

Infinite scrolling is a popular technique used in web development to provide a seamless user experience by loading content dynamically as the user scrolls down the page. One way to implement infinite scrolling in a React application is by using the IntersectionObserver API, which allows you to detect when an element enters or exits the viewport.

This article is a compilation of all the interviews I went through.

This article is a compilation of all the questions asked during my job hunt in product-based companies.

Creating a new React application requires careful consideration of various factors that will impact its scalability, collaboration and compatibility with your current and future tools and needs. These decisions include the type of app you are building (e.g. Complex web app, static landing site , content heavy blog site or an seo targeted e-commerce app), the level of server engagement, the number of developers working on the app, the reuse of components from other applications and the build and deployment process. These decisions should be made with your end goal in mind and will require a significant amount of effort to ensure the success of the app.

Creating a project from scratch can help you better understand the underlying technologies and tools that are being used in your project. By setting up the project yourself, you will gain a deeper understanding of how the different pieces fit together and how they work, which can be valuable knowledge to have as you develop and maintain your project. It also gives you the opportunity to learn and experiment with new technologies and approaches.

A heap is a special type of tree-based data structure that satisfies the heap property: the value of each node is always greater than or equal to the value of its parent, with the exception of the root node, which has no parent. There are two types of heaps: min heaps and max heaps. In a min heap, the value of each node is always greater than or equal to the value of its parent, while in a max heap, the value of each node is always less than or equal to the value of its parent.

A binary search tree (BST) is a type of binary tree that is used for searching and sorting data. It is called a "search tree" because it can be efficiently used to search for the presence or absence of a particular element in the tree. It is called a "binary" tree because each node has at most two children.

A binary tree is a tree data structure in which each node has at most two children. Binary trees are commonly used to implement search algorithms, such as binary search.

A tree is a non-linear data structure that consists of nodes organized in a hierarchical structure. Each node in a tree has one or more child nodes and is referred to as the parent of its child nodes. The node at the top of the tree is called the root and the nodes without children are called leaf nodes.

An array is a data structure that stores a collection of elements in a contiguous block of memory. It allows us to store and access data efficiently, as elements can be accessed using their index, which is their position in the array.

A linked list is a linear data structure that consists of a sequence of nodes, where each node stores a reference to an object and a reference to the next node in the sequence. The last node in the list typically has a reference to null, indicating the end of the list.

An array is a data structure that stores a collection of elements in a contiguous block of memory. It allows us to store and access data efficiently, as elements can be accessed using their index, which is their position in the array.

Array searching is the process of looking for a specific element or value within an array. There are many different algorithms that can be used to search an array and the choice of which one to use can depend on the size of the array, the type of elements it contains and the desired performance characteristics. Some common array search algorithms include linear search and binary search.

Array sorting is the process of arranging the elements of an array in a specific order, such as ascending or descending order. The order can be based on the value of the elements or on some other criterion such as the length of the elements in the case of strings.

Data structures and algorithms are integral components of software development, as they help to organize and manipulate data in an efficient manner. In this blog post, we will discuss some common data structures and algorithms in Javascript, as well as their time complexity, which refers to the amount of time it takes for an algorithm to complete its task.

In this blog, I am going to show you how to create a simple todo application using vanilla JavaScript and Redux. This is a great way to learn the basics of Redux and how to use it in a practical way.

Redux is a powerful state management tool for JavaScript applications, allowing developers to manage and maintain application state in a predictable and efficient manner. In this blog, we will go over the steps to set up Redux in a vanilla JavaScript application.