1. Given a roman numeral, convert it into its equivalent integer value. (Implicit: If it is not valid, output -1).
2. Given two linked lists which meet at some point, find the intersection point. What is your running time of the algorithm?
3. Given a linked list which consist of numbers, seperate out the even numbers in one linked list and odd numbers in another linked list.
4.Given a String, check whether it is palindrome. The character in the strings may be of one byte or two bytes.
2. Given two linked lists which meet at some point, find the intersection point. What is your running time of the algorithm?
3. Given a linked list which consist of numbers, seperate out the even numbers in one linked list and odd numbers in another linked list.
4.Given a String, check whether it is palindrome. The character in the strings may be of one byte or two bytes.
No comments:
Post a Comment