1.Trees questions related inorder and preorder
2.Tree construction using inorder and preorder
3 question finding minimum number of steps to form a string of given length n with given character 'A' by coping or pasting
example if n=3;
given 'A'
Then to form 'AAA' in 3 steps
stack based question related finding next greater element

Question

1.Trees questions related inorder and preorder
2.Tree construction using inorder and preorder
3 question finding minimum number  of steps to form a string of given length n with given character 'A' by coping or pasting 
example if n=3;
given  'A'
Then to form 'AAA' in  3 steps
stack based question related finding next greater element

Oracle

Oracle Interview Question

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches