the union of two sets A and B is the set of all the elements which are either in A, or in B, or in both A and B. To get the union of two arrays

Given a binary tree, print it vertically. Perform vertical traversal of a binary tree. Given a binary tree, perform vertical traversal of it. In vertical traversal, we print nodes of a binary tree in vertical order

Write a program to find the intersection of Two given Arrays. The utility function takes two arrays and returns the intersection array.

Given a string, find the first non-repeating character in it. Write a program to find first non-repeating char on it using the hash table.

Linear probing is a scheme in computer programming for resolving hash collisions of values of hash functions by sequentially searching the hash table for a free location.

Hash table uses key and value for storing the elements. If the key has duplicate value, it may lead to hashing Collision. Separate Chaining is one of name collision solution. It is a scheme which each position in the hash table has a list to handle collisions.