1.Find the possible permutation of the given string 2. Remove 3 from the given input (Number) and input should be taken from the user 3. Check whether the given string is Anagram without using map DATA structure

Question

Accepted Answer

Answering questions related to string permutations, removing numbers, and checking for anagrams without using map data structure.

To find permutations of a string, use recursion to swap characters at each position.
To remove a specific character (e.g. '3') from a string, iterate through the string and build a new string without the character.
To check for anagrams without using a map data structure, sort both strings and compare character by character.

Asked in Futurense Technologies

1.Find the possible permutation of the given string 2. Remove 3 from the given input (Number) and input should be taken from the user 3. Check whether the given string is Anagram without using map DATA structure

Interview Questions Asked to Software Engineer at Other Companies

Top Skill-Based Questions for Futurense Technologies Software Engineer