LEARN -> PRACTICE -> GET HIRED
This video explains the chaining collision resolution technique in hashmap.Chaining allows to keep the elements with same hash value using a linked list.I have explained everything related to chaining in details using examples. I have also explained the method to Read full
This video explains a very important programming interview problem which is to find the top k frequent elements in a given array.This problem is based on heap and hashmap.I have shown all the required concepts by showing the intuition using Read full
CLONE GRAPH is a very important and interesting programming interview problem which is to create a clone for the given graph.This is a typical recursion programming interview problem which can be solved using DFS/BFS.I have explained how to solve this Read full