Amazon Interview Questions and Answers for 3 years Experience

Problem: Write a methods which accepts the start pointer of single linked-list of integers and returns true if it is a palindrome and false otherwise.
Condition: Solve the problem by using constant space only .

Example:
1->2->3->4->5 output: false
1->2->1 output: true
1->1 output: true

Given a Boolean 2D array, where each row is sorted, find the row with the maximum number of 1s

Example:
Input matrix
0 1 1 1
0 0 1 1
1 1 1 1 // this row has maximum 1s
0 0 0 0

Output: 2

For example: 1. C*KS matches COOKS
2. AM?Z?N* matches AMAZONINTERVIEW [Note * in the end]
3. AM?Z*N DOES NOT MATCH AMAZING.