A company wishes to make their order placing processore secure. REVERSE OTP code asked in WIPRO feb 2022

-

 A company wishes to make their order placing processore secure. To do this they will provide the customer an OTP to ensure that the order is not being placed by a robot. The OTP is calculated as the reversal of the order amount. Write an algorithm to find the OTP, calculated as the reversal of the order amount.




Comments

Post a Comment

Popular posts from this blog

EV Minimize Array Cost asked in Infosys- march 2022 (available in c++ only)

-
                                                             EV_Minimize Array Cost connect with me on Facebook Twitter Instagram Github Youtube len(arr)-1 Σ(arri-arri-1)² i=1 len(arr) is the size of the array. Insert any integer at any location of the array such that the cost of the array is minimized. Find the minimum possible cost of the array after inserting exactly one element. Example a= [1, 3, 5, 2, 10] The cost of the array before insertion =(1-37+(3-57+(5-2)²+(2-102²= 81. Two of many scenarios are shown below. 1. Insert 4 between 3 and 5, cost of array = (1-37+(3-47+(4-57+(5-2)²+(2 107²2² = 79. 2. Insert 6 between 2 and 10, cost of array =(1-37+(3-5)+(5-27²+(2-67² + (6 107² = 49. It can be proven that 49 is the minimum cost possib...
Read more

Complete Binary tree(CBT) and Almost Complete Binary tree(ACBT): Total nodes and formulae :

-
Connect with me on Instagram         Twitter             LinkedIn              my website                facebook          Whatsapp                gmail   Important  about CBT(complete binary tree) & ACBT(Almost complete binary tree) let : k = level of tree, n = total nodes, ^ is power  total nodes in CBT : 2 (k-1)    total nodes n : n =  2 (k) – 1 in kth level CBT :                                     leaf nodes  : (n/2) + 1 ;                                  non leaf nodes : (n/2) ; in CBT i k level , n nodes then :                ...
Read more

PERFECT SQUARE asked by MountainBlue

-
                                                              Perfect Square                                                         Problem Statement You're given an array A of size N, the task is to remove all the elements from the array except perfect squares of any integer and print the updated ay For example, if the given array is 9 12 16. Here, 9 and 16 are the perfect square of numbers 3 and 4 respectively. After removing others from the the t  Input Format: The input consists of two lines:  The first line contains an integer N denoting the size of an array A. The second line contains N integers separated by space denoting elements of the array A. The input will be read from ...
Read more