Instructor: Katherine Chuang
Brooklyn College
There are two parts to this assignment, each part should be written in their own file. Please try to use the same names.
Implement a function to check if an input is a palindrome. The input could be of any type - character, number, or objects. If the input has different case, for example RACEcar, it should still be considered a palindrome.
A palindrome is same forwards as it is backwards (i.e. 0 -> 1 -> 2 -> 1 -> 0)
Suggested Implementation: Use the Stack interface. You may use any data structure to accomplish the task.
Sample input: ["r", "a", "c", "e", "c", "a", "r"] Assume only numbers or characters
Output: boolean TRUE | FALSE
Merge two sorted lists into one sorted list. Inputs are sorted, you can assume smallest to largest values.
Suggested Implementation: Use the Queue interface. You may use any data structure to accomplish the task.
Sample input: [1,3,5] and [2,4,5,6]
Sample output: [1,2,3,4,5,5,6]
Due date: Wednesday October 30th.
Submission: Please use the Github Classroom link https://classroom.github.com/a/g7GS7vGa
Note there will be no re-submissions or late submissions accepted. I won't have time to grade them.