1) Check Palindrome String
Input: "madam" Output: Palindrome
Compare string with its reverse.
2) Check if Array is Sorted Array
Input: [10,5,4,8,7] Output: Not Sorted
3) Union of Two Arrays Array
A=[2,3,4,5], B=[4,5,6,7] Output: [2,3,4,5,6,7]
4) Reverse in Groups (k=3) Array
Input: [1,2,3,4,5,6,7,8] Output: [3,2,1,6,5,4,8,7]
5) Reduce Array to Single Sum Array
Input: [1,4,5] Output: [10]
6) Rearrange +ve / -ve Array
Input: [1,2,3,-4,-5,4] Output: [1,-4,2,-5,3,4]
7) Merge Sorted Arrays Array
A=[1,3,5], B=[2,4,6] Output: [1,2,3,4,5,6]
8) Move Zeros to End Array
Input: [0,1,0,3,5] Output: [1,3,5,0,0]
9) Second Maximum Array
Input: [17,5,13,2] Output: 13
10) Two Sum Hashing
Input: [5,8,9,10,11,6], target=19 Output: (2,3)