We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
This is never mentioned in the problem statement and this does nothing to teach people who don't know about inverse functions.
Again, if we are given the output of the functions f(1) f(2)... f(n) and f(1) maps 1 to 3 and f(2) maps 2 to 2 then the inverse functions g(3) and g(2) would map 3 to 1 and 2 to 2 respecvtively. This does not yeild the identity permutation. If this is the intent of the question it's name should change to Identity Permutation not Inverse of a Function...
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Security Function Inverses
You are viewing a single comment's thread. Return to all comments →
This is never mentioned in the problem statement and this does nothing to teach people who don't know about inverse functions.
Again, if we are given the output of the functions f(1) f(2)... f(n) and f(1) maps 1 to 3 and f(2) maps 2 to 2 then the inverse functions g(3) and g(2) would map 3 to 1 and 2 to 2 respecvtively. This does not yeild the identity permutation. If this is the intent of the question it's name should change to Identity Permutation not Inverse of a Function...