For the First programming question, I had used a self-made class for Linked List and a stack to compute the palindrome result. Use the Linked list to store and then copy everything into the stack you can do this together when you read the input then just traverse through the linked list from starting and check whether the stack has the same character while performing the pop operation if any of the characters do not match it means it is not a palindrome For the second question, I had used a simple Dictionary to count the occurrence of characters in both the inputs, you can use one or two dictionaries to calculate the anagram. With dictionaries, you can count the characters of each input into respective dictionaries, and later on, you can count if the characters are equal and the occurrences are also equal. If you use a single dictionary then you can count the number of characters and its count if the characters count is even for respective then the given two inputs are anagram.