additionalknowledge

Best Time to Buy and Sell Stock II #122 Leetcode Problem #Leetcodeseries

Problem name: Best Time to Buy and Sell Stock II Problem statement: Say you have an array prices for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock…

Symmetric Tree #101 Leetcode Problem #Leetcodeseries

Problem name: Symmetric trees Problem statement: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \ 3 4 4 3 But the following [1,2,2,null,3,null,3] is not: 1 / \ 2 2 \ \ 3 3…

Decode ways #91 Leetcode Problem #Leetcodeseries

Problem name: Decode ways Problem statement: A message containing letters from A-Z can be encoded into numbers using the following mapping: ‘A’ -> “1” ‘B’ -> “2” … ‘Z’ -> “26” To decode an encoded message, all the digits must be mapped back into letters using the reverse of the mapping above (there may be multiple ways). For example, “111” can have each…

Maximum Subarray #53 Leetcode Problem #Leetcodeseries

Problem name: Maximum subarray Problem statement: Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Follow up: If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle. Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: [4,-1,2,1]…

Container With Most Water #11 Leetcode Problem #Leetcodeseries

Problem name: Container With Most Water Problem statement: Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water. Notice that…

Two Sum #1 Leetcode Problem #Leetcodeseries

Problem name: Two Sum Problem statement: 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 twice. You can return the answer in any order. Example 1: Input: nums = [2,7,11,15], target…

Deploy React app on GITHUB pages

Hosting apps/websites on internet is an important part when it comes to show casing your work or may be deploying your app for a small scale work. Github provides hosting for the websites for free using Github pages where anyone can deploy the webpages. Coming on to the todays topic : Hosting react app on…

React Fragments: All you need to know

<p class="has-drop-cap" value="<amp-fit-text layout="fixed-height" min-font-size="6" max-font-size="72" height="80">A fragment is a common pattern in React which is used to return multiple elements. A fragment is a common pattern in React which is used to return multiple elements. Since in react we have to group jsx under a some parent. Fragments let us group a list of…

CSS: Middle element takes space with ellipsis

We all are good with flex boxes and all. Lets have a case when we have a box of width something say; 300px, now adding 3 div inside this such that the middle text can be very long. So for this we will be using ellipsis as text-overflow. So, taking all this in mind. Lets…

React Loadable

React Loadable is used for Splitting the Code by Components and Routes. HOW? Code splitting is a technique which is being used with modern web app development that allows to load chunks of code only when needed. These days we are creating more complex web apps. Challenge these days is not about the designs or style. Target…