any assistance?

3. Develop an algorithm that uses a stack and a queue to determine if a String is a strict palindrome, which is a String that reads exactly the same forwards and backwards. The algorithm should make only ONE pass over the String with a loop, and then the algorithm should compare stack and queue contents to see if we have a strict palindrome. Be sure the running time of your algorithm is O(n). You don't need to implement this as a program if you don't want to-simply writing the code with pencil and paper is sufficient for this problem. /* 3 points