Anagrams
Given two strings A and B, check if they are anagrams. Two strings are said to be anagrams, if one string can be obtained by rearraging the letters of another.
Examples of anagrams are dog, god, abac, baac, 123, 312 abab, aaba; dab, baad are not anagrams.
Read moreQueue Operations
Write a program to insert and remove the elements in a queue and display the final elements in the queue.
A queue is a particular kind of abstract data type or collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position, known as enqueue, and removal of entities from the front terminal position, known as dequeue.
Read more