Given a number N, the task is to print all duplicate digits of that number in sorted order. Examples: Input: 123412989 Output : 3 4 8 Explanation : The unique digits are 3 4 8 Input : 9832213789 Output: 1 7 Approach: The idea is to use The idea is to use Hashing to store the frequency of… Read More »
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 »
LRU cache implementation: Here we have two methods get and set which are defined as follows: get(x) : If the key x exists in the cache, returns its value and update reference position in the list. Else returns -1. set(x,y) : Inserts the value if the key x is not already present. If the cache reaches its capacity… Read More »
Given an integer k and array of length N find the min no of move to make all the elements divisible by k. In one move you can go one of the below operation. 1. For any index i we can do a[i] = a[i] + p 2. p = p + 1 The value of p starts… 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 an array arr[] and the two elements x and y, the task is to find which element(x or y) has highest occurrence in the array. If the occurrences are the same, then return the smaller element. Examples: Input: arr[] = {1, 1, 2, 2, 3, 3, 4, 4, 4, 4, 5}; x = 4, y = 5;… Read More »
Given an integer array arr[] and an integer K (greater than 0), the task is to count the subarray whose elements sum up to a multiple of K, else print -1. A number x is a multiple of K if there exists an integer y such that x = y*k. Remember 0 is also a multiple of K.… Read More »
Given two lowercase alphabet strings s and t return whether you can create a 1-to-1 mapping for each letter in s to another letter (could be the same letter) such that s could be mapped to t, with the ordering of characters preserved. Input: s = “coco”, t = “kaka” Output: True Explanation: We can create this mapping:… Read More »
You are given a m*n row wise sorted matrix. The task is to find the common element in all rows of given matrix. Examples: Input : mat[3][4]={{1,3,5,6}, {3,4,7,8}, {1,2,3,4}} Output: 3 Input : mat[4][4]={{2,3,4,5}, {1,2,3,6}, {2,3,5,6}, {1,2,3,4}} Output: 2 3 Approaches: A simple solution for this problem is to use Hasing. Create hash array of size n .… Read More »
Given a vector vec, and a integer K the task is to count the number of elements such that it occurs only once in the vector and with the number Kth times less and more is not present in the vector. For example: if 9 is present in the vector and K=3 then, 6 and 12 should not… Read More »
