General

In my recent job switch, the interviewer asked me to build a Dynamic Chat App with Randomized Replies using ReactJS. Requirements that the interviewer shared: Generating Random message: Let’s take an array of messages, based on a random number let’s pick the message from the array. Below is an implementation. Let’s create the main component […]

In my recent job switch, the interviewer asked me to create an Accordion Component. This is one of the most basic Machine coding questions that you might face in your interviews. Understanding the Accordion Component: At its core, an accordion component is a collapsible container that reveals its content upon user interaction, typically a click. This […]

In my recent job switch, the interviewer asked me to implement Nested Comments and reply functionality in ReactJS. Creating an interactive comment and reply functionality for a website can significantly enhance user engagement and provide a better user experience. In this interview article, we will explore how to implement a comment system where each comment […]

Understanding prototypes is essential for mastering JavaScript, as they form the backbone of inheritance and object-oriented programming in this language. In this article, we will delve into the concept of prototypes, how they work, and how we can use them to our advantage. What is a Prototype? In JavaScript, every object has a hidden property […]

Infinite scroll is a popular pattern for displaying large lists of data. It allows users to scroll through data without experiencing the performance issues that can occur when loading all data at once. In this Interview article, we’ll explore how to implement an infinite scrolling list using React Native’s FlatList component. We’ll fetch data from […]

The interview lasted around 1 hour, Questions that were asked in ZebPay were of medium level. In the one-hour timeframe, the interviewer asked 2 questions one was on Javascript, and the other question was on ReactJS. Question 1 on ReactJS: The interviewer shared me the below image and asked me to create a Blink Clink […]

Pre-order traversal is one of the fundamental methods for traversing a binary tree. In this traversal method, the nodes are recursively visited in this order: Pre-order traversal is particularly useful when you want to create a copy of a tree or need to prefix the expression of a binary tree. Problem Statement Given the root […]

Level Order Traversal, also known as Breadth-First Search (BFS) for trees, is a method of traversing a binary tree level by level. This means we visit every node on a level before moving to the next level. It is a fundamental tree traversal algorithm that is widely used in various applications such as serialization/deserialization of […]

The “Number of Islands” problem is a classic question often asked in coding interviews. It tests your understanding of depth-first search (DFS) and breadth-first search (BFS) algorithms and your ability to work with 2D arrays. In this article, we will explore different approaches to solving this problem using JavaScript. Problem Statement Given a 2D grid […]

Reversing the order of words in a string is a common problem that can be encountered in coding interviews. Problem Statement Given a string, reverse the order of words. Each word is separated by spaces, and you need to ensure that the reversed words are also separated by a single space. Example Approach 1: Using […]