Input : Map : 1 -> 4, 2 -> 6, 4 -> 6 Check1 : 5, Check2 : 4 Output : 5 : Not present, 4 : Present
C++ implementation :
5: Not Present 4: Present
This article is contributed by Rohit Thapliyal. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Check if the given string of words can be formed from words present in the dictionary
- Elements present in first array and not in second using STL in C++
- Count of words that are present in all the given sentences
- Count of elements of an array present in every row of NxM matrix
- Understanding ShellExecute function and it's application to open a list of URLs present in a file using C++ code
- Find the character in first string that is present at minimum index in second string
- Most frequent word in first String which is not present in second String
- NaN in C++ - What is it and how to check for it?
- Check mirror in n-ary tree
- Check if a given graph is Bipartite using DFS
- Check if two trees are Mirror
- Check whether two strings are anagrams of each other using unordered_map in C++
- Program to check if an Array is Palindrome or not using STL in C++
- Check if the given permutation is a valid DFS of graph
- Quick way to check if all the characters of a string are same