Hello All,Those who want to learn ternary search tree .Can learn from this.Hope it would be useful

http://igoro.com/archive/efficient-auto-complete-with-a-ternary-search-tree/

I need help in this problem.Can any one explain.Thanks in advance.

Given an array of n numbers and a number k. You have to write a program to find the number of subarrays with xor less than k.

Examples:

Input: arr[] = {8, 9, 10, 11, 12}, k=3 Output: 4 Sub-arrays [1:3], [2:3], [2:5], [4:5] have xor values 2, 1, 0, 1 respectively.

Input: arr[] = {12, 4, 6, 8, 21}, k=8 Output: 4

Hello All,Those who wants to solve some good problems covering all the aspects can go to this. https://problemclassifier.appspot.com/

Given a sorted array of positive integers, rearrange the array alternately i.e first element should be the maximum value, second minimum value, third-second max, fourth-second min and so on.

Examples:

Input : arr[] = {1, 2, 3, 4, 5, 6, 7} Output : arr[] = {7, 1, 6, 2, 5, 3, 4}

Input : arr[] = {1, 2, 3, 4, 5, 6} Output : arr[] = {6, 1, 5, 2, 4, 3}

I am unable to solve the problem linear time.Please help me.

Given a sequence of n integers, you have to find out the non-decreasing subsequence of length k with minimum sum. If no sequence exists output -1.

Examples:

Input : [58 12 11 12 82 30 20 77 16 86], k = 3 Output : 39 {11 + 12 + 16}

Input : [58 12 11 12 82 30 20 77 16 86], k = 4 Output : 120 {11 + 12 + 20 + 77}

Input : [58 12 11 12 82 30 20 77 16 86], k = 5 Output : 206

Hello Everyone-I am not able to get the solution of this problem ( http://codeforces.net/problemset/problem/835/C ). If any one can explain the solution of this problem.Thanks in advance.