Given an object, create a deep clone of it. This is a common interview question, and we are advised not to use any built-in methods to solve this problem. 🟡 Medium 🧩 Pattern – Objects Drawbacks of other methods structuredClone is the way ✅ The structuredClone() method of the Window… Read More »Deep Clone an Object in JavaScript
🔗LC1 🟢 Easy 🧩 Pattern – Hashtable and Array Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element… Read More »Two Sum – LC1 JS Solution
🔗LC150 🟡 Medium 🧩 Pattern – Stack You are given an array of strings tokens that represents an arithmetic expression in a Reverse Polish Notation. Evaluate the expression. Return an integer that represents the value of the expression. Note that: Example Solution We use a stack to keep track of… Read More »Evaluate Reverse Polish Notation – 150
Transpose or swap the rows and columns of the given matrix – 2D array in JavaScript. Matrix swapping takes place diagonally. 🟢 Easy 🧩 Pattern – Arrays Example JS code to transpose a square matrix Since a square matrix has the same number of rows and columns, we only need… Read More »Transpose a Matrix – JavaScript
For the given string, determine if the open and closed brackets/parentheses are balanced are not, i.e. for every open bracket there must be a closed bracket in the same order. Return true if balanced and false if unbalanced. 🟢 Easy 🧩 Pattern – Stack Example Solution approach This can be… Read More »Check if parentheses are balanced – JS
Binary search is a better searching algorithm that follows the Divide and Conquer method on the condition that we have sorted/ordered data. Binary Search Algorithm We have three variables that drive the search i.e. start, end, and middle. As their name says start will be at the start=0 of the… Read More »Binary Search in JavaScript