add searching in a map tip

Author: ShyrenMore

notes

@@ -157,4 +157,8 @@ sort(engineers.rbegin(), engineers.rend());
 Getting binary representation of dec in string format: one-liner
 string binaryRep = bitset<8>(decimalNo).to_string();
 
-When a graph problem involves finding a shortest path, BFS should be used over DFS. This is because with BFS, all nodes at distance x from start will be visited before any node at distance x + 1 will be visited. Once we find the target (end), we know that we found it in the shortest number of steps possible
+When a graph problem involves finding a shortest path, BFS should be used over DFS. This is because with BFS, all nodes at distance x from start will be visited before any node at distance x + 1 will be visited. Once we find the target (end), we know that we found it in the shortest number of steps possible
+
+For finding if a key is present in map mp 
+Please use mp.count(key) instead of 
+mp.find(key) == mp.end()