Assume FLAMES game that tests for relationship has to be implemented using a dynamic structure. The letters in the FLAMES stand for Friends, Love, Affection, Marriage, Enmity and Sister. Initially store the individual letters of the word ‘flames’ in the nodes of the dynamic structure. Given the count of the number of uncommon letters in the two names ‘n’, write a program to delete every nth node in it, till it is left with a si ngle node. If the end of the dynamic structure is reached while counting, resume the counting from the beginning. Display the letter that still remains and the corresponding relationship Eg., If Ajay and Jack are the two names, there are 4 uncommon letters in these. So delete 4th node in the first iteration and for the next iteration start counting from the node following the deleted node.
Assume FLAMES game that tests for relationship has to be implemented
using a dynamic structure. The letters in the FLAMES stand for Friends,
Love, Affection, Marriage, Enmity and Sister. Initially store the individual
letters of the word ‘flames’ in the nodes of the dynamic structure. Given the
count of the number of uncommon letters in the two names ‘n’, write a
program to delete every nth node in it, till it is left with a si ngle node. If the
end of the dynamic structure is reached while counting, resume the counting
from the beginning. Display the letter that still remains and the
corresponding relationship Eg., If Ajay and Jack are the two names, there are
4 uncommon letters in these. So delete 4th node in the first iteration and for
the next iteration start counting from the node following the deleted node.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
