CareerCup

You are given N unique numbers a1<a2<a3<...an. Find out the count of all possible binary search tress that can be constructed using these numbers.
for example with 3 elements 1,2,3 there are 5 possible BST and for 1,2,3,4 there are 14 bst

Determine the absolute value of an integer without branching ( i.e. without using any if else statement etc)

Determine efficiently if an integer is a power of 2 without using any branching or loop.

Find the maximum and minimum of two integers without use branching (i.e. without using any conditional statements like if if else etc)

You are given n numbers x1,x2,x3,...,x(n-1) and x(n) and you can only do addition and subtraction operation with numbers, in how many ways can we get x1 S x2 S x3 S ..S x(n-1) = x(n) where S is from set +-
example X = {1,2,3,4,5,1}
possible solution 1+2-3-4+5
1-2+3+4-5

Given a binary tree, you have to convert it into a doubly linked list (inplace i.e you cannot use extra memory)

You are given a binary tree ( a general binary tree ) and not binary search tree, you have to find the node which is the lowest common ancestor of both these nodes. Can we perform better if it is a binary search tree?

Given two char arrays X="ZTANBMBLAUCY " and Y ="GABVCBKLAMNC", write an algorithm to find the longest subsequence that is present in both of them.
In the above case the common subsequence is "ABBAC".
Also describe the time complexity of your algorithm.

Given a set of positive integers S = { a1,a2,a3,...,an} find two subsets s1 and s2 of A such that S2 = S - S1 and difference of | sum(S1) - sum(S2) | is minimum.
For example if we have a set S={12,4,7,1,6,3,3 }then S1= {12,6} and S2={ 4,7,1,3,3} such that sum(S1) - sum(S2) = 0 . It is not necessary that two subsets will always have the same sum.