Published inJavaScript in Plain English·PinnedJavaScript Array for Interviews: filter, map, reduce and isArrayArray’s built-in Cheatsheet — As a JavaScript developer, we often want to manipulate or extract different data from the Array, JavaScript provides various built-in functions to ease our task by built-in functions. These functions can help us to improve our code structure and answer the interview questions related to Array in a simpler way. We will look into the following Array Functions: …JavaScript4 min readJavaScript4 min read
PinnedComplete Guide To Start With CSS Flexbox: Website LayoutCSS flexbox is the pattern/ way to structure the elements of webpage. This page tell you the basics of Flexbox’s properties. Introduction: To work with flex we have to understand there are two types of element: Parent: The element which is marked display: flex Child: The direct elements inside the Parent…Flexbox2 min readFlexbox2 min read
Published inStackademic·Aug 8Demystifying State Management in React: A Comprehensive Comparison of Redux and Context APIIntroduction: Managing state efficiently is a crucial aspect of building robust and maintainable React applications. Redux and the Context API are two popular solutions, each with its unique set of features and advantages. …React4 min readReact4 min read
Nov 20, 2022Top 4 DSA topics and questions which helped to achieve 300% hike.In this post I will be discussing about top 4 topics which helped me to improve my coding skills and which finally got me a job with 300% hike. Little about my background I completed my B.Tech with Electronics and Communication as major in 2021. After that I joined a IT based company as…Interview2 min readInterview2 min read
Apr 15, 2022Meta / Amazon / Google / Microsoft| Trim a Binary Search Tree | LeetCode-669: Medium | JavaScript ImplementationWe will be seeing the solution to the LeetCode problem 669 in JavaScript. I hope you will find it useful. Problem Statement: Given the root of a binary search tree and the lowest and highest boundaries as low and high, trim the tree so that all its elements lies in [low…Leetcode1 min readLeetcode1 min read
Mar 27, 2022Meta / Amazon / Google / Microsoft| Single Number III | LeetCode-260: Medium | JavaScript ImplementationWe will be seeing the solution to the LeetCode problem 260 in JavaScript. I hope you will find it useful. Problem Statement: Given an integer array nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once…JavaScript1 min readJavaScript1 min read
Mar 15, 2022Meta / Amazon / Google / Microsoft| Product of Array Except Self | LeetCode-238: Medium | JavaScript ImplementationWe will be seeing the solution to the LeetCode problem 238 in JavaScript. I hope you will find it useful. Problem Statement: Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. The product of…Leetcode1 min readLeetcode1 min read
Mar 15, 2022Meta / Amazon / Google / Microsoft| Longest Substring Without Repeating Characters | LeetCode-3: Medium | JavaScript ImplementationWe will be seeing the solution to the LeetCode problem 3 in JavaScript. I hope you will find it useful. Problem Statement: Given a string s, find the length of the longest substring without repeating characters. Link to Problem: https://leetcode.com/problems/longest-substring-without-repeating-characters JavaScript Implementation: var lengthOfLongestSubstring = function(s) { let length = s.length if(s==""){ return 0}; let hashMap = {}; let start = 0; let sub_sequnce_now = 0; let max_sub_sequnce_now = 0; for(let i = 0;i<length;i++){ if(hashMap[s[i]] != null && (start<=hashMap[s[i]])){ sub_sequnce_now = sub_sequnce_now-(hashMap[s[i]] - start); start = hashMap[s[i]]+1 hashMap[s[i]] = i; }else{ hashMap[s[i]] = i; sub_sequnce_now=sub_sequnce_now+1; if(max_sub_sequnce_now<sub_sequnce_now){ max_sub_sequnce_now = sub_sequnce_now } } } return max_sub_sequnce_now };Leetcode1 min readLeetcode1 min read
Feb 26, 2022Meta / Amazon / Google / Microsoft Interview Question: 36. Valid Sudoku | LeetCode-36: Medium | JavaScript ImplementationWe will be seeing the solution to the LeetCode problem 36 in JavaScript. I hope you will find it useful. Problem Statement: Determine if a 9 x 9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules: Each row must contain the…Leetcode2 min readLeetcode2 min read
Feb 11, 2022Meta / Amazon / Google / Microsoft Interview Question: Wildcard Matching Solution | LeetCode-44: Hard | JavaScript ImplementationWe will be seeing the solution to the LeetCode problem 44 in JavaScript. I hope you will find it useful. Problem Statement: Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for ‘?’ and ‘*’ where: ‘?’ Matches any single character. ‘*’ Matches any sequence…Dynamic Programming2 min readDynamic Programming2 min read
