Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Multi-factor authentication (MFA) is a security procedure that needed users to respond to requests to test their identities before they can access networks or other online software. MFA can use knowledge, control of physical elements, or geographic or network areas to prove integrity.Multi-factor authentication is a layered method to protecting information and applications where a system needed a user to present a set of two or more credentials to test a user’s identity for login.MFA operates by requiring more verification data is known as “authentication factors. It can ensure that digital users are who they say they are. These elements ... Read More
MFA is an authentication feature which enables the user to access a specific application, account or website only after supporting two or more verification evidences. In another words, it is an approach to ensure that the person attempting to log into an account is truly the owner of that account.Multi-factor authentication is generally known for supporting an additional defense and creating it more complex for an unauthorized person to access a network or database. It can implementing a strong MFA solution instantly secures information and IT resources against identity theft, account spoofing and phishing.There are various methods of Multi-factor authorization ... Read More
Suppose we have two numbers c and d. Amal has two numbers a and b initially both are zero. Amal wants to perform some operation on them. Before performing each operation, some positive integer k is picked, which is then used to perform one of the following operations −add number k to both a and b, oradd number k to a and subtract k from b, oradd number k to b and subtract k from a.We have to find the minimum number of operations needed to make a and b equal to c and d respectively. If not possible, return ... Read More
Suppose we have a string S with n digits. A number with exactly 11 digits is a telephone number if it starts with '8'. In one operation, we can remove one digit from S. We have to check whether we can make the string a valid phone number or not.So, if the input is like S = "5818005553985", then the output will be True, because we can make the string "8005553985" with 11 characters and first digit is 8.StepsTo solve this, we will follow these steps −m := size of S insert '8' at the end of S if if location of 8
Suppose we have an array A with n elements and another list of queries Q with q queries. each Query[i] contains a pair (x, k). When we process a query, for x: decrease the value of A[x] by 1. For k, print kth largest element. Initially all elements in A is either 0 or 1.So, if the input is like A = [1, 1, 0, 1, 0]; Q = [[2, 3], [1, 2], [2, 3], [2, 1], [2, 5]], then the output will be [1, 1, 1, 0]StepsTo solve this, we will follow these steps −n := size of A ... Read More
Suppose we have two numbers l and r. There is a shop and we want to sell some food container with 'a' number of foods with a discount, and some customer wants to buy x foods. The customer following a greedy strategy −He buys floor of (x/a) packs with discountThen wants to buy remaining (x mod a) foods one by one.But the customer is greedy, so if he wants to buy (x mod a) foods one by one and it happens that (x mod a) ≥ a/2, so he decides to buy the whole pack of a foods. A customer ... Read More
Suppose we have an array A with n elements and another number k. There are n piles of candies. The ith pile has A[i] number of candies. We can perform the operation on two indices i and j (i != j), then add another A[i] number of candies to A[i] (A[i] will not be reduced). We can perform this operation any number of times, but unfortunately if some pile contains strictly more than k candies we cannot perform the operation anymore. We have to find the maximum number of times we can perform this operation.So, if the input is like ... Read More
Suppose we have a string S of length . Consider there are n numbers and they are arranged in a circle. We do not know the values of these numbers but if S[i] = 'E' it indicates ith and (i+1)th numbers are same, but if that is 'N' then they are different. From S we have to check whether we can recreate the sequence or not.So, if the input is like S = "ENNEENE", then the output will be True, because we can assign values like [15, 15, 4, 20, 20, 20, 15].StepsTo solve this, we will follow these steps ... Read More
Suppose we have two arrays A and B of size n, and another number x. We have to check whether we can rearrange the elements in B, so that A[i] + B[1]
Suppose we have a number n. We have to find two composite integers (non-prime) a and b, such that a - b = n.So, if the input is like n = 512, then the output will be 4608 and 4096StepsTo solve this, we will follow these steps −print 10*n and 9*n.ExampleLet us see the following implementation to get better understanding −#include using namespace std; void solve(int n){ cout