We have given a anagram string and we have to check whether it can be made palindrome o not. Examples: Input : geeksforgeeks Output :… Read More »
Given two strings s1 and s2, we need to find the minimum number of manipulations required to make two strings anagram without deleting any character.… Read More »
Given a positive number you need to check whether it’s complement and the number are anagrams or not. Examples: Input : a = 4294967295 Output… Read More »
Given two binary trees, we have to check if each of their levels are anagrams of each other or not. Example: Tree 1: Level 0… Read More »
Given two numbers you are required to check whether they are anagrams of each other or not in binary representation. Examples: Input : a =… Read More »
Given two strings of lowercase alphabets and a value k, the task is to find if two strings are K-anagrams of each other or not.… Read More »
Given two strings in lowercase, the task is to make them anagram. The only allowed operation is to remove a character from any string. Find… Read More »
Project idea: The aim of this project is to create a game in python in which the user is presented with an anagram of a… Read More »
Given an array of strings, find all anagram pairs in the given array.
Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat, char txt) that prints all occurrences of pat and its permutations (or… Read More »
Write a function to check whether two given strings are anagram of each other or not.