Hashing is the process of taking the input string of any length and turning it into cryptographic fixed output. Hashing is not an “encryption” we can’t retrieve the original data by decrypting the hash, it’s a one-way cryptographic function. Properties that a cryptographic hash function needs to have in order to be considered secure: Computationally Efficient: The hash… Read More »
Given an array A[ ] of N segments find any point common to maximum number of segments and also find the number of segments which it is common to. The segments are in the form [L, R]. Examples: Input: N = 3, A[ ] = {{2, 4}, {-1, 3}, {-5, 1}} Output: Point 0 is common to 2… Read More »
Given two strings string1 and string2, the task is to find the smallest substring in string1 containing all characters of string2. Examples : Input: string = “Cplusplus is the best”, pattern = “pp” Output: Smallest window is : plusp Explanation: “plusp” contains all the characters of pattern. Input: string = “Cplusplus”, pattern = “Cpp” Output: Smallest window is… Read More »
