Higher Order Component with Functional Component đź’ˇ A pattern where a function takes a component as an argument and returns a new component. A higher-order component (HOC) is an advanced technique in React for reusing component logic. HOCs are not part of the React API, per se. They are a pattern that emerges from React’s […]
Read More →React JS Interview Questions & Answers âś” What is NPX? The npx stands for Node Package Execute and is included with npm. If you install npm above version 5.2.0, npx will be installed as well. It’s a npm package runner that allows you to run any package from the npm registry without having to install […]
Read More →Cyber Security Fundamental Questions & Answers What is a brute force attack? A brute force attack, or exhaustive search, is a cryptographic hack that uses trial-and-error to guess possible combinations for passwords used for logins, encryption keys, or hidden web pages. What is password spraying? Password spraying is a type of brute force attack. In […]
Read More →Application & Web Security Interview Questions âś” What is the meaning of 256-bit encryption? To transmit electronic documents or data over the internet, we use encryption algorithms and when encryption uses a key of 256-bit length, that is called 246-bit encryption. âś” What is the Cipher suite? Cipher Suite is a set of algorithms that […]
Read More →Top Scrum Master and Agile Question & Answers âś” What is the User story INVEST Model in Agile? A good user story should be: Independent (of all others)Negotiable (not a specific contract for features)Valuable (or vertical)Estimable (to a good approximation)Small (so as to fit within an iteration)Testable (in principle, even if there isn’t a test […]
Read More →Trapping Rain Water Leetcode This question is taken by LeetCode. You can find question detail by the below link. Let’s write an optimized solution to this problem. https://leetcode.com/problems/trapping-rain-water/ Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Example 1: Input: height = […]
Read More →Array Representation of Binary Tree đź’ˇ What is Full Binary Tree? A full binary tree is also known as a proper binary tree or a 2-tree is a tree in which every node other than the leaves has two children. If height of the tree is h then the maximum number of nodes – 2^(h+1) […]
Read More →Graphs in Data Structure Graphs are really just collections of nodes and edges. In the graph, these nodes are often called vertices or vertex for singular, and the connection is often called an edge. The important thing is here that these nodes can have multiple connections to multiple different nodes. This is one of the […]
Read More →Traversing 2 D array đź’ˇ First Understand JavaScript multidimensional array JavaScript does not provide the multidimensional array natively. However, We create a multidimensional array by defining an array of elements, where each element also contains an array. đź’ˇ Create 2 D Array in JavaScript đź’ˇ Let’s See 3-D array Structure – each element of the array is a two-dimensional array. BFS & DFS đź’ˇ What is BFS? BFS stands for Breadth-First Search. It is also known as level order traversal.BFS algorithm uses a queue data structure to track […]
Read More →Time Complexity & Calculations Time complexity measures the time taken to run each statement of code in an algorithm. Space and Time complexity can define the effectiveness of an algorithm. đź’ˇ Time complexity depends on the number of inputs passed to that algorithm. And, there is a relation between the input data size (n) and […]
Read More →