1. Write a program to find the next sequence of palindrome for the given number. For example if sequence is 956, the next immediate pallendrome is 999.
2. Find the 3rd largest element in the distinct array.
3. Program to group 0's and 1's for the given array. Only one traversal is allowed.
Input array : [00100111]
Output array :[00001111]
4. Anagram program.
5. unable to recall.
6. Test cases for web application form.
7.Test case for API
F2F:
Oops , BST, program approach, sorting techniques, concentrate more on configuration (Maven , Jenkis, TestNG).
Can we run testNG using Maven?
Tree questions : preorder, postorder and inorder.